Minimum-energy mobile wireless networks revisited

By Erran L. Li, Joseph Y. Halpern. ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2001

485 citations recorded by the source corpus.

We propose a protocol that, given a communication network, computes a subnetwork such that, for every pair (u, /spl upsi/) of nodes connected in the original network, there is a a minimum-energy path between u and /spl upsi/ 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 by Rodoplu and Meng (see IEEE J. Selected Areas in Communications, vol.17, no.8, p.1333-44, 1999). Moreover, our protocol is computationally simpler. We demonstrate the performance improvements obtained by using the subnetwork computed by our protocol through simulation.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/4ea0f6b23556af80b3c0a6593ef4799238beb341

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

A node scheduling scheme for energy conservation in large wireless sensor networks (2003, methodology): “The subnetwork is computed distributedly at each node using local neighbor location information [16-17] or directional information [18].”
A Survey on Energy-Efficient Routing Techniques with QoS Assurances for Wireless Multimedia Sensor Networks (2012, methodology): “Minimum Energy Communication Network (MECN) [37] and its variant Small MECN (SMECN) [38] are localized algorithms that aim to compute a network with minimum energy.”
Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy (2004, background): “The graph structure was reduced in [LHBWW, LH ].”
A survey on routing protocols for wireless sensor networks (2005, methodology): “Some of the protocols discussed here are designed primarily for mobile ad hoc networks and consider the mobility of nodes during the de-sign [38–40].”
A cone-based distributed topology-control algorithm for wireless multi-hop networks (2005, methodology): “As in [13] (where a similar function is used, in the context of a different algorithm), in this paper, we do not investigate how to choose the initial power , nor do we investigate how to increase the power at each step.”
Wireless sensor networks: a survey (2002, background): “It is often assumed that each sensor node will have a global positioning system (GPS) unit that has at least 5 m accuracy [48].”
A coverage-preserving node scheduling scheme for large wireless sensor networks (2002, methodology): “[ 16-18 ] produces a minimum-energy communication subnetwork by adjusting transmission power.”
A Survey on Distributed Topology Control Techniques for Extending the Lifetime of Battery Powered Wireless Sensor Networks (2013, background): “• The number of nodes that remain connected to the base station: The survival rate of the network is evaluated based on the number of nodes remaining connected to the base station [40].”
Cross-Layer Design for Lifetime Maximization in Interference-Limited Wireless Sensor Networks (2006, methodology): “Hence, we can conserve transmission energy by using multihop routing [1], [2].”
Routing Protocols in Wireless Sensor Networks - A Survey (2010, methodology): “Small Minimum-Energy Communication Network (SMECN): SMECN [27] is a routing protocol proposed to improve MECN, in which a minimal graph is characterized with regard to the minimum energy property.”
Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks (2002, background): “Li and Halpern [11] improve upon the protocol of [14] by proposing another protocol; given a network G, the new protocol creates a subnetwork G0 such that whenever there is a path between a pair of nodes in G, there is a minimum-energy path between them in G0.”
Classical and swarm intelligence based routing protocols for wireless sensor networks: A survey and comparison (2012, methodology): “MECN assumes that at every point in time, every node can transmit to any node in the network, which is not always possible.”
Mobile ad hoc networking: imperatives and challenges (2003, background): “Similarly to proactive routing algorithms [162,227] try to find”