Date Added: Dec 2009
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 the authors call dead-ends. In this paper, they first propose a fast convergent routing algorithm with proactive dead-end detection together with a formal definition and description of dead-ends. Secondly, they present a generalization of this algorithm which improves performances in all to many and all to all traffic patterns. In a third part they prove that this algorithm produces paths that are optimal up to a constant factor of 2? + 1.