Minimum-Energy Mobile Wireless Networks Revisited

TL;DR

This paper introduces a new, computationally simpler protocol for constructing energy-efficient subnetworks in wireless networks, ensuring minimum-energy paths between all connected node pairs, with demonstrated performance improvements via simulation.

Contribution

The paper presents a novel protocol that computes energy-efficient subnetworks more simply than previous methods, maintaining minimum-energy paths.

Findings

The new protocol is computationally simpler than previous methods.

Simulation results show improved energy efficiency in the subnetworks.

The protocol guarantees minimum-energy paths for all connected node pairs.

Abstract

We propose a protocol that, given a communication network, computes a subnetwork such that, for every pair $(u,v)$ of nodes connected in the original network, there is a minimum-energy path between $u$ and $v$ in the subnetwork (where a minimum-energy path is one that allows messages to be transmitted with a minimum use of energy). The network computed by our protocol is in general a subnetwork of the one computed by the protocol given in [13]. Moreover, our protocol is computationally simpler. We demonstrate the performance improvements obtained by using the subnetwork computed by our protocol through simulation.