Optimizing performance of ad-hoc networks under energy and scheduling constraints

This paper studies the construction of power-efficient data gathering tree for wireless ad hoc networks. Because of their high communication cost and limited capacity, a fundamental requirement in such networks is designing energy efficient data-gathering algorithms to ensure long network survivability. Two possible models for the data gathering problem are explored: scheduling model and the energy model. In the scheduling model the goal is to minimize the makespan of the most congested node, while in the energy model the goal is to maximize the lifetime of the network. We present a number of provable approximation algorithms and show inapproximation bounds for various versions of data-gathering problem.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Abdellah Chehri,et al.  Security Monitoring Using Wireless Sensor Networks , 2007, Fifth Annual Conference on Communication Networks and Services Research (CNSR '07).

[3]  Tzung-Shi Chen,et al.  Gathering-Load-Balanced Tree Protocol for Wireless Sensor Networks , 2006, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC'06).

[4]  Sampath Rangarajan,et al.  On exploiting diversity and spatial reuse in relay-enabled wireless networks , 2008, MobiHoc '08.

[5]  David E. Culler,et al.  Taming the underlying challenges of reliable multihop routing in sensor networks , 2003, SenSys '03.

[6]  Zhi Ang Eu.  Routing and Relay Node Placement in Wireless Sensor Networks Powered by Ambient Energy Harvesting , 2008 .

[7]  Konstantinos Kalpakis,et al.  MAXIMUM LIFETIME DATA GATHERING AND AGGREGATION IN WIRELESS SENSOR NETWORKS , 2002 .

[8]  Divyakant Agrawal,et al.  Power aware routing for sensor databases , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Hung-Yu Wei,et al.  Two-hop-relay architecture for next-generation WWAN/WLAN integration , 2004, IEEE Wireless Communications.

[10]  Hanan Shpungin,et al.  Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks , 2009, INFOCOM 2009.

[11]  Rajmohan Rajaraman,et al.  (Almost) tight bounds and existence theorems for confluent flows , 2004, STOC '04.

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

[13]  S. Panichpapiboon,et al.  Sensor networks with random versus uniform topology: MAC and interference considerations , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).

[14]  Johannes Gehrke,et al.  Query Processing in Sensor Networks , 2003, CIDR.

[15]  Richard Han,et al.  A node-centric load balancing algorithm for wireless sensor networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

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

[17]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[18]  Ramesh Govindan,et al.  Monitoring civil structures with a wireless sensor network , 2006, IEEE Internet Computing.

[19]  Weiwei Sun,et al.  A Coverage-Based Maximum Lifetime Data Gathering Algorithm in Sensor Networks , 2006, 7th International Conference on Mobile Data Management (MDM'06).

[20]  Hwee Pink Tan,et al.  Routing and Relay Node Placement in Wireless Sensor Networks Powered by Ambient Energy Harvesting , 2009, 2009 IEEE Wireless Communications and Networking Conference.

[21]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..

[22]  Martin Gairing,et al.  A faster combinatorial approximation algorithm for scheduling unrelated parallel machines , 2007, Theor. Comput. Sci..

[23]  J. Storer.  An Introduction to Data Structures and Algorithms , 2002, Birkhäuser Boston.

[24]  Robert E. Tarjan,et al.  A faster deterministic maximum flow algorithm , 1992, SODA '92.

[25]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[26]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[27]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[28]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[29]  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.

[30]  Ivona Bezáková,et al.  Allocating indivisible goods , 2005, SECO.