Séminaires AND et extérieurs

Besides of its high efficiency, in particular its scalability, geographic greedy routing is of a memoryless nature (i.e., nodes do not maintain any routing tables) which makes it well suitable for large-scale sensor networks with limited resources. Nevertheless, the occurrence of local minimum phenomenon, especially in networks with many holes, limits considerably the applicability of such routing protocol. The local minimum situations occur when the packet could not be delivered by the current node based only on distance to the destination. This problem has been tackled in previous research works to guarantee packets delivery by routing around the boundaries of the hole but at an excessive consumption of control overheads. In this paper, we propose and study a novel approach that is of memoryless nature and performs better that the state-of-art approaches in terms of guarantying packet delivery and deriving efficient routing paths. We provide in this paper proofs of its correctness (guarantying packet delivery) whereas showing, through simulations, its performance effectiveness in terms of reducing routing paths.