Data Gathering Schedule for Minimal Aggregation Time in Wireless Sensor Networks

Data aggregation promises a new paradigm for gathering data via collaboration among wireless sensors deployed over a large geographical region. Many real-time applications impose stringent delay requirements and ask for time-efficient schedules of data gathering in which data sensed at sensors are aggregated at intermediate sensors along the way towards the data sink. The Minimal Aggregation Time (MAT) problem is to find the schedule that routes data appropriately and has the shortest time for all requested data to be aggregated and sent to the data sink. In this article we consider the MAT problem with collision-free transmission where a sensor can not receive any data if more than one sensors within its transmission range send data at the same time. We first prove that the MAT problem is NP-hard even if all sensors are deployed on a grid. We then propose a (Δ −1)-approximation algorithms for the MAT problem, where Δ is the maximum number of sensors within the transmission range of any sensor. By exploiting the geometric nature of wireless sensor networks, we obtain some better theoretical results for some special cases. We also simulate the proposed algorithm. The numerical results show that our algorithm has much better performance in practice than the theoretically proved guarantees and outperforms other existing algorithms.

[1]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[2]  Sandeep K. S. Gupta,et al.  On tree-based convergecasting in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[3]  Tomasz Imielinski,et al.  DataSpace: querying and monitoring deeply networked collections in physical space , 2000, IEEE Wirel. Commun..

[4]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[5]  Rajiv Gandhi,et al.  Minimizing broadcast latency and redundancy in ad hoc networks , 2003, MobiHoc '03.

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

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

[8]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[9]  Rajive L. Bagrodia,et al.  Detailed models for sensor network simulations and their impact on network performance , 2004, MSWiM '04.

[10]  Samir Khuller,et al.  Balancing Minimum Spanning and Shortest Path Trees , 1993, SODA.

[11]  Dariusz R. Kowalski,et al.  Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks , 2005, Second Annual Conference on Wireless On-demand Network Systems and Services.

[12]  Giuseppe Liotta,et al.  Spirality of Orthogonal Representations and Optimal Drawings of Series-Parallel Graphs and 3-Planar Graphs (Extended Abstract) , 1993, WADS.

[13]  R. Ravi,et al.  Rapid rumor ramification: approximating the minimum broadcast time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[14]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[15]  Samir Khuller,et al.  Balancing minimum spanning and shortest path trees , 1993, SODA '93.

[16]  Goos Kant,et al.  A better heuristic for orthogonal graph drawings , 1998, Comput. Geom..

[17]  Xiaohua Jia,et al.  Energy efficient routing and scheduling for real-time data aggregation in WSNs , 2006, Comput. Commun..

[18]  Sudipto Guha,et al.  Message Multicasting in Heterogeneous Networks , 2000, SIAM J. Comput..

[19]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .