Fault-tolerant wireless sensor network routing protocols for the supervision of context-aware physical environments

被引:62
作者
Boukerche, A [1 ]
Pazzi, RWN
Araujo, RB
机构
[1] Univ Ottawa, SITE, PARAIDSE Res Lab, Ottawa, ON K1N 6N5, Canada
[2] Univ Fed Sao Carlos, DC, BR-13565905 Sao Carlos, SP, Brazil
关键词
sensor networks; hierarchical routing protocol; publish/subscribe;
D O I
10.1016/j.jpdc.2005.12.007
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Applications that require fine-grain monitoring of physical environments subjected to critical conditions, such as fire, leaking of toxic gases and explosions, pose a great challenge to sensor network protocols. These networks have to provide a fast, reliable, fault-tolerant and energy-aware channel for events diffusion, which meets the requirements of query-based, event-driven and periodic sensor networks application scenarios. These requirements have to be met even in the presence of emergency conditions that can lead to node failures and path disruption to the sink. This paper proposes two routing protocols: periodic, event-driven and query-based protocol (PEQ) and its variation CPEQ, two fault-tolerant and low-latency algorithms that meet sensor network requirements for critical conditions supervision in context-aware physical environments. While PEQ can provide low latency for event notification, fast broken path reconfiguration, and high reliability in the delivery of event packets for low-network data traffic, CPEQ is a cluster-based routing protocol that groups sensor nodes to efficiently relay the sensed data to the sink by uniformly distributing energy dissipation among the nodes and reducing latency for high-network data traffic (typical in emergency situations). PEQ and its variant CPEQ use the publish/subscribe paradigm to disseminate requests across the network. We discuss both PEQ and CPEQ protocols, their implementation, and report on the performance results of several scenarios using NS-2 simulator. The results obtained are compared with the well-known directed diffusion (DD) protocol, and show that our proposed algorithms exhibit a clear indication to meet the constraints and requirements of critical condition supervision in context-aware physical environments. Our results indicate that PEQ outperforms DD in the average delay since it uses the shortest path for the delivery of packets and speed up new subscriptions by using the reverse path used for event notification packets. CPEQ also outperforms DD in both the average delay and in the packet delivery ratio when the network scales up. (c) 2006 Published by Elsevier Inc.
引用
收藏
页码:586 / 599
页数:14
相关论文
共 30 条
[1]  
Akkaya K., 2005, Ad Hoc Networks, V3, P325, DOI 10.1016/j.adhoc.2003.09.010
[2]  
[Anonymous], 2002, PARALLEL DISTRIB PRO
[3]  
[Anonymous], MOBICOM
[4]  
[Anonymous], 2002, P IEEE AER C BIG SKY
[5]  
[Anonymous], P 10 IEEE ACM INT S
[6]  
[Anonymous], 2003, PROC 1 INT C EMBEDDE
[7]  
ARDIZZONE E, 2005, P 3 ACM INT WORKSH V, P79
[8]  
BOUKERCHE A, 2004, ANN SIM S P 37 ACM I
[9]  
BOUKERCHE A, 2004, WIRELESS COMMUNICATI, P23
[10]  
Boukerche Azzedine, 2005, Handbook of algorithms for wireless networking and mobile computing