A hybrid adaptive routing algorithm for event-driven wireless sensor networks

14Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

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 rout-ing 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. © 2009 by the authors.

Cite

CITATION STYLE

APA

Figueiredo, C. M. S., Nakamura, E. F., & Loureiro, A. A. F. (2009). A hybrid adaptive routing algorithm for event-driven wireless sensor networks. Sensors, 9(9), 7287–7307. https://doi.org/10.3390/s90907287

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free