A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range

被引:21
作者
Boukerche, A
Chatzigiannakis, I
Nikoletsemb, S
机构
[1] Univ Ottawa, SITE, Ottawa, ON K1N 6N5, Canada
[2] Univ Patras, GR-26110 Patras, Greece
[3] Comp Technol Inst, GR-26110 Patras, Greece
关键词
wireless sensor networks; data propagation; algorithms;
D O I
10.1016/j.comcom.2005.01.013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Smart Dust is a special case of wireless sensor networks, comprised of a vast number of ultra-small fully autonomous computing, communication and sensing devices, with very restricted energy and computing capabilities, that co-operate to accomplish a large sensing task. Smart Dust can be very useful in practice, i.e. in the local detection of remote crucial events and the propagation of data reporting their realization to a control center. In this paper, we propose a new energy efficient and fault tolerant protocol for data propagation in smart dust networks, the Variable Transmission Range Protocol (VTRP). The basic idea of data propagation in VTRP is the varying range of data transmissions, i.e. we allow the transmission range to increase in various ways. Thus, data propagation in our protocol exhibits high fault-tolerance (by bypassing obstacles or faulty sensors) and increases network lifetime (since critical sensors, i.e. close to the control center are not overused). As far as we know, it is the first time varying transmission range is used. We implement the protocol and perform an extensive experimental evaluation and comparison to a representative protocol (LTP) of several important performance measures with a focus on energy consumption. Our findings indeed demonstrate that our protocol achieves significant improvements in energy efficiency and network lifetime. (c) 2005 Published by Elsevier B.V.
引用
收藏
页码:477 / 489
页数:13
相关论文
共 23 条
[1]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[2]  
Boukerche A, 2004, LECT NOTES COMPUT SC, V3121, P137
[3]  
BOUKERCHE A, 2003, P 6 ACM INT WORKSH M, P42, DOI DOI 10.1145/940991.941000
[4]  
BOUKERCHE A, 2005, ALGORITHMS PROTOCOLS
[5]  
BOUKERCHE A, 2004, 7 ACM S MOD AN SIM W
[6]  
BOUKERCHE A, 2005, EN AW COV PRES SCH W
[7]  
CHATZIGIANNAKIS I, 2003, P 3 WORKSH MOB AD HO, P225
[8]  
CHATZIGIANNAKIS I, 2002, IN PRESS ACM MOBILE, P9
[9]  
CHATZIGIANNAKIS I, 2004, IN PRESS PARALLEL PR, P1003
[10]  
CHATZIGIANNAKIS I, 2004, P 5 EUR WIR C MOB WI