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 data propagation by efficiently advertising obstacle boundaries
Bibtex cite IDRACTI-RU1-2009-105
Booktitle International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems
Year published 2009
Location Spain
Note to appear
We propose local mechanisms for efficiently marking the broader network region around obstacles, for data propagation to early enough avoid them towards near-optimal routing paths. In particular, our methods perform an online identification of sensors lying near obstacle boundaries, which then appropriately emit beacon messages in the network towards establishing efficient obstacle avoidance paths. We provide a variety of beacon dissemination schemes that satisfy different trade-offs between protocol overhead and performance. Compared to greedy, face routing and trustbased methods in the state of the art, our methods achieve significantly shorter propagation paths, while introducing much lower overhead and converging faster to near-optimality.
Koutsopoulos, A
Nikoletseas, Sotiris
Rolim, Jose
p15-koutsopoulos.pdf (main file)
Publication ID790