Reliability-Latency tradeoffs for data gathering in random-access wireless sensor networks

Authors:
Haibo Zhang;Hong Shen;Haibin Kan
Affiliations:
Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa, Japan;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa, Japan;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa, Japan
Venue:
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Year:
2005

Citing 6
Cited 1

A recursive random search algorithm for large-scale network parameter configuration

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Understanding packet delivery performance in dense wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
A Reliability Layer for Ad-Hoc Wireless Sensor Network Routing

HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies

IEEE Transactions on Mobile Computing
Wireless sensor networks protocols for efficient collision avoidance in multi-path data propagation

PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Sensor Data Collection with Expected Reliability Guarantees

PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops

Reliable and real-time data gathering in multi-hop linear wireless sensor networks

WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications

Quantified Score

Hi-index	0.00

Visualization

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.