A minimum-energy path-preserving topology-control algorithm

Authors:
Li Li;J. Y. Halpern
Affiliations:
Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA;-
Venue:
IEEE Transactions on Wireless Communications
Year:
2004

Citing 0
Cited 8

Trajectory knowledge for improving topology control in mobile ad-hoc networks

CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
A shortest-path-based topology control algorithm in wireless multihop networks

ACM SIGCOMM Computer Communication Review
Mobility-aware topology control in mobile ad hoc networks

Computer Communications
MPTC --- A Minimum-Energy Path-Preserving Topology Control Algorithm for Wireless Sensor Networks

MMNS '07 Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services
Distributed fault-tolerant topology control in wireless multi-hop networks

Wireless Networks
A combinational perspective in stimulating cooperation in mobile ad hoc networks

Journal of Computer Science and Technology
A fault-tolerant and minimum-energy path-preserving topology control algorithm for wireless multi-hop networks

CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Modeling and analysis of bi-connected minimum energypath preserving graphs for wireless multi-hop networks

Proceedings of the 2nd ACM annual international workshop on Mission-oriented wireless sensor networking

Quantified Score

Hi-index	0.01

Visualization

Abstract

The topology of a wireless multihop network can be controlled by varying the transmission power at each node. It is not energy efficient to use the communication network Gmax where every node transmits with maximum power. For energy efficient operations, it is desirable to have a subnetwork that preserves a minimum-energy path between every pair of nodes (where a minimum-energy path is one that allows messages to be transmitted with a minimum use of energy). We first identify conditions that are necessary and sufficient for a subnetwork G of Gmax to preserve this property. Using this characterization, we then propose an efficient topology-control algorithm that, given a communication network Gmax, computes a subnetwork G that it preserves at least one minimum-energy path between every pair of nodes. We also propose an energy-efficient reconfiguration protocol that maintains this minimum-energy path property as the network topology changes dynamically. We demonstrate the performance improvements of our algorithm over other existing topology-control algorithms through simulation.