Cooperative data collection in ad hoc networks

This paper studies the problem of data gathering in multi-hop wireless ad hoc networks. In this scenario, a set of wireless devices constantly sample their surroundings and initiate report messages addressed to the base station. The messages are forwarded in a multi-hop fashion, where the wireless devices act both as senders and relays. We consider data gathering without aggregation, i.e. the nodes are required to forward all the messages initiated by other nodes (in addition to their own) to the base station. This is in contrast to the well studied problem of data gathering with aggregation, which is significantly simpler. As some nodes experience a larger load of forward requests, these nodes will have their battery charges depleted much faster than the other nodes—which can rapidly break the connectivity of the network. We focus on maximizing the network lifetime through efficient balancing of the consumed transmission energy. We show that the problem is NP-hard for two network types and develop various approximation schemes. Our results are validated through extensive simulations.

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

[2]  Rong-Jyue Fang,et al.  A power-efficient data gathering scheme on grid sensor networks , 2008, ICSE 2012.

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

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

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

[6]  Piet Van Mieghem,et al.  Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model , 2006, Mob. Networks Appl..

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

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

[9]  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).

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

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

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

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

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

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

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

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

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

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

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

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

[22]  Eytan Modiano,et al.  Minimizing transmission energy in sensor networks via trajectory control , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

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

[24]  Ingrid Moerman,et al.  An overview of mobile ad hoc networks: applications and challenges , 2004 .

[25]  Nicolas Nisse,et al.  Fast Data Gathering in Radio Grid Networks , 2009 .

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

[27]  Arvind Krishnamurthy,et al.  Parameterized Hierarchical Layer Topology Construction for Wireless Networks , 2007, 2007 Second International Conference on Systems and Networks Communications (ICSNC 2007).

[28]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

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

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

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

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

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

[34]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

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

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

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

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

[39]  Lili Zhang,et al.  Interference Distribution in the Nakagami FadingWireless CDMA Ad Hoc Networks with Multi-Code Multi-Packet Transmission (MCMPT) , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.