Novel Algorithms for the Network Lifetime Problem in Wireless Settings

A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, non-replenishable battery charge. The battery charge is then reduced after each transmission, depending on the transmission distance. One of the major problems in wireless network design is to route network traffic efficiently so as to maximize the network lifetime, i.e., the number of successful transmissions. This problem is known to be NP-Hard for a variety of network operations. In this paper we are interested in two fundamental types of transmissions, broadcast and data gathering. We provide polynomial time approximation algorithms, with guaranteed performance bounds, for the maximum lifetime problem under two communication models, omnidirectional and unidirectional antennas. We also consider an extended variant of the maximum lifetime problem, which simultaneously satisfies additional constraints, such as bounded hop-diameter and degree of the routing tree, and minimizing the total energy used in a single transmission.

[1]  W. Rabiner,et al.  Design considerations for distributed microsensor systems , 1999, Proceedings of the IEEE 1999 Custom Integrated Circuits Conference (Cat. No.99CH36327).

[2]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Yuanyuan Zhang,et al.  Reliable Key Establishment Scheme Exploiting Unidirectional Links in Wireless Sensor Networks , 2008, 2008 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing.

[4]  Madhav V. Marathe,et al.  Topology Control Problems under Symmetric and Asymmetric Power Thresholds , 2003, ADHOC-NOW.

[5]  J. J. Garcia-Luna-Aceves,et al.  Channel access scheduling in Ad Hoc networks with unidirectional links , 2001, DIALM '01.

[6]  Sartaj Sahni,et al.  Maximum Lifetime Broadcasting in Wireless Networks , 2005, IEEE Trans. Computers.

[7]  Michael Segal,et al.  Fast algorithm for multicast and data gathering in wireless networks , 2008, Inf. Process. Lett..

[8]  Ariel Orda,et al.  Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas , 2005, MobiHoc '05.

[9]  Paul J.M. Havinga,et al.  A Lightweight Medium Access Protocol (LMAC) for Wireless Sensor Networks: Reducing Preamble Transmissions and Transceiver State Switches , 2004 .

[10]  Christoph Ambühl,et al.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005, ICALP.

[11]  Jeffrey Stanford,et al.  Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation , 2006, SNPD.

[12]  Tamer A. ElBatt,et al.  Joint scheduling and power control for wireless ad hoc networks , 2002, IEEE Transactions on Wireless Communications.

[13]  Hanan Shpungin,et al.  Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks , 2010, Ad Hoc Sens. Wirel. Networks.

[14]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[15]  Mario Gerla,et al.  On demand multicast routing with unidirectional links , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[16]  Klara Nahrstedt,et al.  Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks , 2005, Mob. Networks Appl..

[17]  Bing-Hong Liu,et al.  Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks , 2008, IEEE/ACM Transactions on Networking.

[18]  Christoph Amb.  An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks , 2005 .

[19]  Gruia Calinescu,et al.  Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.

[20]  B. R. Badrinath,et al.  On the node-scheduling approach to topology control in ad hoc networks , 2005, MobiHoc '05.

[21]  Weifa Liang,et al.  Online Data Gathering for Maximizing Network Lifetime in Sensor Networks , 2007, IEEE Transactions on Mobile Computing.

[22]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[23]  Saswati Sarkar,et al.  A framework for optimal battery management for wireless nodes , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[24]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[25]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[26]  Hanan Shpungin,et al.  Low Energy Construction of Fault Tolerant Topologies in Wireless Networks , 2007, DIALM-POMC.

[27]  Kaveh Pahlavan,et al.  Wireless Information Networks , 1995 .

[28]  Radha Poovendran,et al.  Maximizing Network Lifetime of Broadcasting Over Wireless Stationary Ad Hoc Networks , 2005, Mob. Networks Appl..

[29]  Anthony Ephremides,et al.  Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks , 2001, Mob. Networks Appl..

[30]  Daniel Mossé,et al.  Providing a bidirectional abstraction for unidirectional ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[31]  Konstantinos Kalpakis,et al.  Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks , 2003, Comput. Networks.

[32]  Nikhil Bansal,et al.  Additive Guarantees for Degree-Bounded Directed Network Design , 2009, SIAM J. Comput..

[33]  Wen-Tsuen Chen,et al.  The strongly connecting problem on multihop packet radio networks , 1989, IEEE Trans. Commun..

[34]  Katia Obraczka,et al.  Energy-efficient collision-free medium access control for wireless sensor networks , 2003, SenSys '03.

[35]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[36]  Hans-Jürgen Bandelt,et al.  Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities , 1995, SIAM J. Discret. Math..

[37]  Deborah Estrin,et al.  Modelling Data-Centric Routing in Wireless Sensor Networks , 2002 .