research unit 1
 

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

Publication

Type of publication:Inproceedings
Entered by:
TitlePath quality detection algorithms for near optimal geographic routing in sensor networks with obstacles
Bibtex cite IDRACTI-RU1-2010-9
Booktitle Wireless Communications and Mobile Computing
Year published 2010
Volume 10
Number 5
Pages 647-661
URL http://dx.doi.org/10.1002/wcm.727
Keywords geographic routing,QoS routing,obstacle avoidance,communication void ,optimal path,sensor networks
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. Copyright 2008 John Wiley & Sons, Ltd.
Authors
Moraru, Luminita
Leone, Pierre
Nikoletseas, Sotiris
Rolim, Jose
Topics
BibTeXBibTeX
RISRIS
Attachments
 
Publication ID735