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:
TitleNear optimal geographic routing with obstacle avoidance in wireless sensor networks by fast-converging trust-based algorithms
Bibtex cite IDRACTI-RU1-2007-8
Booktitle 3rd ACM International Workshop on QoS and Security for Wireless and Mobile Networks (Q2SWINET 2007)
Year published 2007
Month October
Pages 31-38
Publisher ACM Press
Keywords geographic routing,QoS routing,obstacle avoidance,void-handling,communication void,geographic ad-hoc routing,optimal path,sensor networks
Geographic routing scales well in sensor networks, mainly due to its stateless nature. Still, most of the algorithms are concerned with finding some path, while the optimality of the path is difficult to achieve. 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 suitability 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 thus minimizing latency, space, overall traffic and energy consumption.
Moraru, Luminita
Leone, Pierre
Nikoletseas, Sotiris
Rolim, Jose
Q2SWINET07.pdf (main file)
Short description of problem, previous work and result
Publication ID9