Early Obstacle Detection and Avoidance for All to All Traffic Pattern in Wireless Sensor Networks

Authors:
Florian Huc;Aubin Jarry;Pierre Leone;Luminita Moraru;Sotiris Nikoletseas;Jose Rolim
Affiliations:
Computer Science Department, University of Geneva, Geneva 4, Switzerland 1211;Computer Science Department, University of Geneva, Geneva 4, Switzerland 1211;Computer Science Department, University of Geneva, Geneva 4, Switzerland 1211;Computer Science Department, University of Geneva, Geneva 4, Switzerland 1211;University of Patras and CTI, Patras, Greece 26500;Computer Science Department, University of Geneva, Geneva 4, Switzerland 1211
Venue:
Algorithmic Aspects of Wireless Sensor Networks
Year:
2009

Citing 0
Cited 4

VRAC: virtual raw anchor coordinate routing in sensor networks

WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Brief announcement: routing with obstacle avoidance mechanism with constant approximation ratio

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Virtual raw anchor coordinates: a new localization paradigm

ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Virtual raw anchor coordinates: A new localization paradigm

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.