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:chita
TitleEarly Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks
Bibtex cite IDRACTI-RU1-2009-52
Booktitle 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2009)
Series Lecture Notes in Computer Science (LNCS)
Year published 2009
Month July
Publisher Springer Verlag
Location Rhodes, Greece
URL http://www.algosensors.org/algosensors09/
Abstract
This paper deals with early obstacles recognition in wireless sensor networks under various traffic patterns. In the presence of obstacles, the efficiency of routing algorithms is increased by voluntarily avoiding some regions in the vicinity of obstacles, areas which we call dead-ends. In this paper, we first propose a fast convergent routing algorithm with proactive dead-end detection together with a formal definition and description of dead-ends. Secondly, we present a generalization of this algorithm which improves performances in all to many and all to all traffic patterns. In a third part we prove that this algorithm produces paths that are optimal up to a constant factor of 2+1. In a fourth part we consider the reactive version of the algorithm which is an extension of a previously known early obstacle detection algorithm. Finally we give experimental results to illustrate the efficiency of our algorithms in different scenarios.
Authors
Huc, F
Jarry, A.
Leone, Pierre
Rolim, Jose
Moraru, Luminita
Nikoletseas, Sotiris
Topics
BibTeXBibTeX
RISRIS
Attachments
algosensors09.pdf (main file)
 
Publication ID697