research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:
TitleSimple and Efficient Geographic Routing around Obstacles for Wireless Sensor Networks
Bibtex cite IDRACTI-RU1-2007-9
Booktitle 6th International Workshop on Experimental Algorithms (WEA 2007)
Series Lecture Notes in Computer Science
Year published 2007
Month May
Number 4007
Pages 161-174
Publisher Springer Verlag, LNCS
DOI 10.1007/11764298
Keywords sensor networks,obctacle avoidance,geographic routing
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.
Powell, Olivier
Nikoletseas, Sotiris
WEA07.pdf (main file)
Short description of problem, previous work and result
Publication ID10