Abstract
Data gathering is a critical operation in wireless sensor networks for extracting useful information from the operating environment. In this paper, we study the problem of data gathering in multi-hop linear sensor networks. We employ a simple model based on random channel access scheme to tackle the high degree of channel contention and high probability of packet collision induced by bursty traffic. In our model, each node optimally attempts a transmission, and our goal is to tune the attempt probability for each sensor node with the objective to minimize the data gathering duration on condition that each link can provide guaranteed per-hop packet delivery reliability. We formulate this problem as an optimization problem and propose a distributed solution which relies on only two hop neighbors information. Based on this model, a simple and scalable protocol RADG (Random Access Data Gathering) is designed. Simulation results show that our algorithm has fast convergence speed. Moreover, RADG is robust to link error in essence and particularly suitable to monitor environments with high degree of interference.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D., Anderson, J.: Wireless Sensor Networks for Habitat Monitoring. In: Proceedings of WSNA 2002 (2002)
Lubrin, E., Lawrence, E., Navarro, K.F.: Wireless Remote Healthcare Monitoring with Motes. In: Proceedings of ICMB 2005 (2005)
Chevrollier, N., Golmie, N.: On the Use of Wireless Network Technologies in Healthcare Environments. In: IEEE Workshop on Applications and Services in Wireless Networks (2005)
Mechitov, K., Sundresh, S.: Cooperative Tracking with Binary-Detection Sensor Networks. In: Proceedings of ACM Sensys 2003 (2003)
Zhang, H., Arora, A., et al.: Reliable Bursty Convergecast in Wireless Sensor Networks. In: Proceedings of MobiHoc 2005 (2005)
Choudhury, R.R., Chakravarty, A., Ueda, T.: Implicit MAC Acknowledgment: An Improvement to 802.11. In: IEEE/ACM Wireless Telecommunications Symposium (2005)
Yin, H., Liu, H.: Distributed rate adaptive packet access (DRAPA) for multicell wireless networks. IEEE Trans. Wireless Commun 3(2), 432–441 (2004)
Sarker, J.H., Halme, S.J.: Auto-controlled algorithm for slotted AlOHA. IEEE Proc. Commun. 150(1) (2003)
Karnik, A., Kumar, A.: Distributed Optimal Self-Organisation in a Class of Wireless Sensor Networks. In: Proceedings of IEEE INFOCOM 2004 (2004)
Zhang, H., Shen, H., Kan, H.: Reliability-Latency Tradeoffs for Data Gathering in Random-Access Wireless Sensor Networks. In: Zhuge, H., Fox, G.C. (eds.) GCC 2005. LNCS, vol. 3795, pp. 701–712. Springer, Heidelberg (2005)
Wang, X., Kar, K.: Distribtuted Algorithm for Max-Min Fair Rate Allocation in ALOHA Networks. In: Proceedings of Annual Allerton Conference (2004)
Altman, E., Borkar, V.S.: Optimal Random Access in Networks with Two-Way Traffic. In: Proceedings of PIMRC 2004 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., Shen, H., Tian, H. (2006). Reliable and Real-Time Data Gathering in Multi-hop Linear Wireless Sensor Networks. In: Cheng, X., Li, W., Znati, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2006. Lecture Notes in Computer Science, vol 4138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814856_16
Download citation
DOI: https://doi.org/10.1007/11814856_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37189-2
Online ISBN: 978-3-540-37190-8
eBook Packages: Computer ScienceComputer Science (R0)