A Hybrid Adaptive Routing Algorithm for Event-Driven Wireless Sensor Networks

Sensors

Carlos M. S. Figueiredo¹  Eduardo F. Nakamura¹ 

[1] Analysis, Research and Technological Innovation Center, Av. Gov. Danilo de Matos Areosa, 381, Distrito Industrial, 69075-351, Manaus, AM, Brazil; E-Mail:

关键词: wireless sensor networks;    self-adaptive routing;    self organization;    proactive routing;    reactive routing;    moving average;    estimation;   

DOI  :  10.3390/s90907287

来源: mdpi

【 摘 要 】

Routing is a basic function in wireless sensor networks (WSNs). For these networks, routing algorithms depend on the characteristics of the applications and, consequently, there is no self-contained algorithm suitable for every case. In some scenarios, the network behavior (traffic load) may vary a lot, such as an event-driven application, favoring different algorithms at different instants. This work presents a hybrid and adaptive algorithm for routing in WSNs, called Multi-MAF, that adapts its behavior autonomously in response to the variation of network conditions. In particular, the proposed algorithm applies both reactive and proactive strategies for routing infrastructure creation, and uses an event-detection estimation model to change between the strategies and save energy. To show the advantages of the proposed approach, it is evaluated through simulations. Comparisons with independent reactive and proactive algorithms show improvements on energy consumption.

【 授权许可】

CC BY   
© 2009 by the authors; licensee MDPI, Basel, Switzerland