Abstract-Many algorithms for routing in sensor networks exploit greedy forwarding strategies to get packets to their destinations. In this paper we study a fundamental diffcully such strategies face: the 'local minimum phenomena" that am c a w packets to get stuck. We give a definition of stuck nodes where packets may get stuck in greedy multi-hop forwarding, and develop a local rule, the TENT rule, for each node in the network to test whether a packet can get stuck at that node. To help the packets get out nf stuck nodes, we describe a distributed algorithm, BOUNDHOLE, to build routes around holes, which are connected reginns of the network with boundaries consisting of all the stnck nodes. We show that these hole-surrounding routes can he used i n many applications such as geographic routing, path migration, information storage mechanisms and identlcatinn of reginns of interest
In addition, the BOUNDHOLE algorithm proposed in REF tries to solve the holes problem in greedy forwarding by building routes around holes.
Locating and bypassing routing holes in sensor networks
IEEE INFOCOM 2004
IEEE INFOCOM 2004
Computer Science