TY - GEN
T1 - Reliable and real-time data gathering in multi-hop linear wireless sensor networks
AU - Zhang, Haibo
AU - Shen, Hong
AU - Tian, Hui
N1 - Funding Information:
We sincerely thank the reviewers for their insightful comments. The research is supported in part by the new researchers start-up program from Le Fonds qu?b?cois de la recherche sur la nature et les technologies (FQRNT), Discovery Grants (356065-2008) and Canada Graduate Scholarships from the Natural Sciences and Engineering Research Council of Canada (NSERC).
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33749683450&partnerID=8YFLogxK
U2 - 10.1007/11814856_16
DO - 10.1007/11814856_16
M3 - Conference contribution
AN - SCOPUS:33749683450
SN - 3540371893
SN - 9783540371892
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 151
EP - 162
BT - Wireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings
PB - Springer Verlag
T2 - First International Conference on Wireless Algorithms, Systems, and Applications, WASA 2006
Y2 - 15 August 2006 through 17 August 2006
ER -