Improved Approximation Bounds for Maximum Lifetime Problems in Wireless Ad-Hoc Network

A wireless ad-hoc network consists of a number of wireless devices (nodes), that communicate with each other within the network using their built-in radio transceivers. The nodes are in general battery-powered, thus their lifetime is limited. Therefore, algorithms for maximizing the network lifetime are of great interest. In this paper we consider the Rooted Maximum Network Lifetime (RMNL) problems: given a network N and a node r, the objective is to find a maximum-size collection of routing trees rooted at the node r for a specified communication pattern. The number of such trees represents the total number of communication rounds executed before the first node in the network dies due to battery depletion. We consider two communication patterns, broadcast and convergecast. We follow the approach used by Nutov and Segal in [15], who developed polynomial time approximation algorithms with constant approximation ratios for the broadcast and convergecast RMNL problems. Our analysis of their algorithms leads to better approximation ratios than the ratios derived in [15]. In particular, we show a 1/7 approximation ratio for the multiple topology convergecast RMNL problem, improving the previous ratio of 1/31.

[1]  Sandeep K. S. Gupta,et al.  Maximizing Multicast Lifetime in Wireless Ad Hoc Networks , 2006 .

[2]  Michael Segal,et al.  Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks , 2009, ALGOSENSORS.

[3]  Hwa-Chun Lin,et al.  Constructing Maximum-Lifetime Data Gathering Trees in Sensor Networks with Data Aggregation , 2010, 2010 IEEE International Conference on Communications.

[4]  Joongseok Park,et al.  Maximum lifetime broadcasting in wireless networks , 2005, IEEE Transactions on Computers.

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

[6]  Zeev Nutov.  Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows , 2008, DIALM-POMC '08.

[7]  Debmalya Panigrahi,et al.  Fast edge splitting and Edmonds' arborescence construction for unweighted graphs , 2008, SODA '08.

[8]  Harold N. Gabow,et al.  Packing algorithms for arborescences (and spanning trees) in capacitated graphs , 1995, Math. Program..

[9]  Radha Poovendran,et al.  Maximizing static network lifetime of wireless broadcast ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

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

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

[12]  Zeev Nutov,et al.  Approximating directed weighted-degree constrained networks , 2008, Theor. Comput. Sci..

[13]  Martin Fürer,et al.  Approximating the Minimum-Degree Steiner Tree to within One of Optimal , 1994, J. Algorithms.

[14]  Roy D. Yates,et al.  Cooperative multicast for maximum network lifetime , 2005 .

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

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

[17]  Ness B. Shroff,et al.  On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  Sandeep K. S. Gupta,et al.  WSN19-1: Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks , 2006, IEEE Globecom 2006.

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

[20]  Hanan Shpungin,et al.  Novel algorithms for the network lifetime problem in wireless settings , 2008, Wirel. Networks.