A Lightweight and Density-Aware Reprogramming Protocol for Wireless Sensor Networks

被引:38
作者
Dong, Wei [1 ]
Chen, Chun [1 ]
Liu, Xue [2 ]
Bu, Jiajun [1 ]
Gao, Yi [1 ]
机构
[1] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Peoples R China
[2] Univ Nebraska, Dept Comp Sci & Engn, Schorr Ctr 104, Lincoln, NE 68588 USA
基金
加拿大自然科学与工程研究理事会; 美国国家科学基金会;
关键词
Wireless sensor networks; network protocols;
D O I
10.1109/TMC.2010.240
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose ReXOR, a lightweight and density-aware reprogramming protocol for wireless sensor networks using XOR. It employs XOR encoding in the retransmission phase to reduce the communication cost. In sparse and lossy networks, it delivers much better performance than Deluge, a typical reprogramming protocol for sensor networks. Compared to prior coding-based reprogramming protocols, it has two salient features. First, it is computationally much more lightweight than previous coding-based reprogramming protocols using Random Linear Codes or Fountain Codes. Second, it is density-aware by adapting its interpage waiting time. Hence, it achieves good performance in both dense and sparse networks. We have implemented ReXOR based on TinyOS and evaluate its performance extensively. Results show that ReXOR is indeed lightweight compared with previous coding-based reprogramming protocols in terms of computation overhead. The results also show that ReXOR achieves good network-level performance in both dense and sparse networks, compared with Deluge and a typical coding-based reprogramming protocol, Rateless Deluge.
引用
收藏
页码:1403 / 1415
页数:13
相关论文
共 26 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[2]  
[Anonymous], 2007, P ACM SIGCOMM
[3]  
Costa R. A., 2008, P IEEE INT C MOB AD
[4]  
Dong W., 2009, P 5 IEEE ACM INT C D
[5]  
FRAGOULI C, 2007, P ANN C INF SCI SYST
[6]  
GU L, 2006, P ACM INT C EMB NETW
[7]  
Guo S., 2009, P ACM MOBICOM
[8]  
Hagedorn A., 2008, P ACM IEEE INT C INF
[9]  
Hou I. H., 2008, P IEEE INFOCOM, P1
[10]  
HUI J, 2004, P ACM INT C EMB NETW