Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks

This paper studies the problem of data gathering in hierarchical wireless ad hoc networks. In this scenario, a set of wireless devices generates messages which are addressed to the base station. As not all nodes can reach the base station through a direct transmission, messages are relayed by other devices in a multi-hop fashion. We consider data gathering without aggregation, i.e. all the generated messages are required to reach the base station -- this is in contrast to the well studied problem of data gathering with aggregation, which appears to be significantly simpler. The above scheme may have poor performance in wireless networks with hierarchical architecture. The devices in the layer closest to the base station form a bottleneck in terms of energy consumption as they experience a very high volume of forward requests. Eventually, these nodes will be the first to run out of their battery charges which will cause connectivity losses. In this paper we focus on prolonging the network lifetime of hierarchical networks through efficient balancing of forward requests, which is NP-hard. We develop an approximation scheme which produces a data gathering tree with network lifetime which is at most k times less than the optimal one, where k is the number of hierarchical layers. Our results are analytically proved and validated through simulations.

[1]  Ibrahim Korpeoglu,et al.  Power efficient data gathering and aggregation in wireless sensor networks , 2003, SGMD.

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

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

[4]  Victor O. K. Li.  Vertex-linked infrastructure for ad hoc networks , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[5]  Wendi B. Heinzelman,et al.  Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks , 2002, Wirel. Networks.

[6]  Xiaoyan Hong,et al.  Hierarchical routing for multi-layer ad-hoc wireless networks with UAVs , 2000, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155).

[7]  Mimoza Durresi,et al.  Heterogeneous Multi Domain Network Architecture for Military Communications , 2009, 2009 International Conference on Complex, Intelligent and Software Intensive Systems.

[8]  Jeffrey Stanford,et al.  Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation , 2006, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06).

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

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

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

[12]  Hanan Shpungin,et al.  Optimizing performance of ad-hoc networks under energy and scheduling constraints , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[13]  Alex Delis,et al.  Processing Event-Monitoring Queries in Sensor Networks , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[14]  Catherine Rosenberg,et al.  Homogeneous vs heterogeneous clustered sensor networks: a comparative study , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[15]  Jiannong Cao,et al.  An Efficient Algorithm for Constructing Maximum lifetime Tree for Data Gathering Without Aggregation in Wireless Sensor Networks , 2010, 2010 Proceedings IEEE INFOCOM.

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

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

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

[19]  Rajmohan Rajaraman,et al.  (Almost) Tight bounds and existence theorems for single-commodity confluent flows , 2007, JACM.

[20]  Mariusz A. Fecko,et al.  Combinatorial designs in multiple faults localization for battlefield networks , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[21]  Hanan Shpungin,et al.  On construction of minimum energy k-fault resistant topologies , 2009, Ad Hoc Networks.

[22]  Anfeng Liu,et al.  An Energy-Balanced Data Gathering Algorithm for Linear Wireless Sensor Networks , 2010, Int. J. Wirel. Inf. Networks.

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

[24]  Haibo Zhang,et al.  Reliable and Real-Time Data Gathering in Multi-hop Linear Wireless Sensor Networks , 2006, WASA.

[25]  K Ramanan,et al.  Data Gathering Algorithms for Wireless Sensor Networks: A Survey , 2010 .

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