Abstract：Greedy Forwarding (GF) is an important routing strategy among those routing protocols based on location information in Wireless Sensor Networks (WSN). But there is routing void problem while using greedy forwarding. This paper deduces the probability of a node to be a routing void node theoretically within deterministic deployment and random deployment WSNs, and get the probability of encountering the routing void node while setting up a path randomly. From the analysis the conclusion can be come that when the average number of neighbors is greater than 10, the modified GF algorithm with backoff method is good enough to meet the requirement of WSN applications.
2007, Vol. 29 
