|This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies.
For more information visit Aigaion.nl.|
|Type of publication:||Inproceedings|
|Title||Near optimal Data Propagation by Efficiently Advertising Obstacle Boundaries|
|Bibtex cite ID||RACTI-RU1-2009-50|
|Booktitle ||6th ACM Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN 2009)|
|Year published ||2009|
|Location ||Canary Islands, Spain|
|Keywords ||sensor networks,obstacle avoidance,routing,performance evaluation|
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.
wasun-koutsopoulos.pdf (main file) |