Multi-Hop Routing Mechanism for Reliable Sensor Computing

Sensors

Jiann-Liang Chen¹  Yi-Wei Ma³  Chia-Ping Lai²  Chia-Cheng Hu⁴ 

[1] Department of Electrical Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan; E-Mail:;Department of Computer Science & Information Engineering, National Dong Hwa University, Hualien, Taiwan; E-Mail:;Department of Engineering Science, National Cheng Kung University, Tainan, Taiwan; E-Mail:;Department of Information Management, Naval Academy, Kaohsiung, Taiwan

关键词: reliability;    sensor computing;    cluster mechanism;    routing algorithm;    service lifetime;   

DOI  :  10.3390/s91210117

来源: mdpi

【 摘 要 】

Current research on routing in wireless sensor computing concentrates on increasing the service lifetime, enabling scalability for large number of sensors and supporting fault tolerance for battery exhaustion and broken nodes. A sensor node is naturally exposed to various sources of unreliable communication channels and node failures. Sensor nodes have many failure modes, and each failure degrades the network performance. This work develops a novel mechanism, called Reliable Routing Mechanism (RRM), based on a hybrid cluster-based routing protocol to specify the best reliable routing path for sensor computing. Table-driven intra-cluster routing and on-demand inter-cluster routing are combined by changing the relationship between clusters for sensor computing. Applying a reliable routing mechanism in sensor computing can improve routing reliability, maintain low packet loss, minimize management overhead and save energy consumption. Simulation results indicate that the reliability of the proposed RRM mechanism is around 25% higher than that of the Dynamic Source Routing (DSR) and ad hoc On-demand Distance Vector routing (AODV) mechanisms.

【 授权许可】

CC BY   
© 2009 by the authors; licensee Molecular Diversity Preservation International, Basel, Switzerland.