Abstract
Gathering sensor data at high reliability and low latency is one of the key design challenges for wireless sensor networks(WSNs). In this paper, we explore the reliability-latency tradeoffs for data gathering in random-access multi-hop wireless sensor networks. We introduce a model considering both packet delivery reliability and latency for the objective to construct an optimal data gathering tree, which can minimize the packet delivery latency for each node while providing guaranteed per-link packet successful delivery probability. We formulate this problem as an optimization problem and propose a sink targeted shortest path algorithm(STSPA). The solution for calculating optimal channel access parameters is also presented. We evaluate the performance of our model by extensive simulations, and results show that our model can provide good tradeoffs between reliability and latency. Furthermore, our model is robust to environmental interference.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Zhao, J., Govindan, R.: Understanding Packet Delivery Performanc. In: Dense Wireless Sensor Networks. In: Sensys 2003, Los Angeles, CA, USA (2003)
Biagioni, E., Chen, S.: A Reliability Layer for Ad-Hoc Wireless Sensor Network Routing. In: The 37th Hawaii International Conference on System Sciences (2004)
Karnik, A., Kumar, A.: Distributed Optimal Self-Organisation in a Class of Wireless Sensor Networks. In: IEEE INFOCOM (2004)
Cerpa, A., Estrin, D.: ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies. In the IEEE Transactions on Mobile Computing Special Issue on Mission-Oriented Sensor Networks 3(3), 272–285 (2004)
Chatzigiannakis, I., Kinalis, A., Nikoletseas, S.: Wireless sensor networks protocols for efficient collision avoidance in multi-path data propagation. In: The 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks, Italy (2004)
Han, Q., Lazaridis, I., Mehrotra, S., Venkatasubramanian, N.: Sensor Data Collection with Expected Reliability Guarantees. In: PerSeNS (2005)
Yu, Y., Krishnamachari, B., Prasanna, V.K.: Energy-Latency Tradeoffs for Data Gathering in Wireless Sensor Networks. In: IEEE INFOCOM (2004)
Lu, G., Krishnamachari, B., Raghavendra, C.: An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Sensor Networks. In: IEEE 18th International Parallel and Distributed Processing Symposium (April 2004)
Keshavarzian, A., Uysal-Biyikoglu, E.: Energy-efficient Link Assessment in Wireless Sensor Networks. In: INFOCOM (2004)
Ye, T., Kalyanaraman, S.: A recursive random search algorithm for large-scale network parameter configuration. In: ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., Shen, H., Kan, H. (2005). Reliability-Latency Tradeoffs for Data Gathering in Random-Access Wireless Sensor Networks. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_87
Download citation
DOI: https://doi.org/10.1007/11590354_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)