Path quality detection algorithms for near optimal geographic routing in sensor networks with obstacles

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Geographic routing scales well in sensor networks, mainly due to its stateless nature. Most of the algorithms in this area are concerned with guaranteeing a path toward the destination in the context of any network topology, while the optimality of the path is of little interest. In this paper, we are presenting a novel geographic routing algorithm with obstacle avoidance properties. It aims at finding the optimal path from a source to a destination when some areas of the network are unavailable for routing due to low local density or obstacle presence. It locally and gradually with time (but, as we show, quite fast) evaluates and updates the quality of the previously used paths and ignores non-optimal paths for further routing. By means of extensive simulations, we are comparing its performance to existing state of the art protocols, showing that it performs much better in terms of path length and hop count thus minimizing latency, overall traffic and energy consumption. © 2008 John Wiley and Sons, Ltd.

Cite

CITATION STYLE

APA

Moraru, L., Leone, P., Nikoletseas, S., & Rolim, J. (2010). Path quality detection algorithms for near optimal geographic routing in sensor networks with obstacles. Wireless Communications and Mobile Computing, 10(5), 647–661. https://doi.org/10.1002/wcm.727

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