Simple and efficient geographic routing around obstacles for wireless sensor networks

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

Abstract

Geographic routing is becoming the protocol of choice for many sensor network applications. The current state of the art is unsatisfactory: some algorithms are very efficient, however they require a preliminary planarization of the communication graph. Planarization induces overhead and is thus not realistic for some scenarios such as the case of highly dynamic network topologies. On the other hand, georouting algorithms which do not rely on planarization have fairly low success rates and fail to route messages around all but the simplest obstacles. To overcome these limitations, we propose the GRIC geographic routing algorithm. It has absolutely no topology maintenance overhead, almost 100% delivery rates (when no obstacles are added), bypasses large convex obstacles, finds short paths to the destination, resists link failure and is fairly simple to implement. The case of hard concave obstacles is also studied; such obstacles are hard instances for which performance diminishes. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Powell, O., & Nikoletseas, S. (2007). Simple and efficient geographic routing around obstacles for wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4525 LNCS, pp. 161–174). Springer Verlag. https://doi.org/10.1007/978-3-540-72845-0_13

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