ACM SIGAPP Applied Computing Review, vol. 11 No. 4, pp. 7-16, Dec. 2011
Mooshik Choi, Minhan Shon, Doogsoo Stephen Kim, and Hyunseung Choo
Greedy forwarding fails due to void area (called hole) where no nodes can be deployed in realistic wireless sensor networks. This is known as the local minimum problem. In this paper, we propose BHOP-GR(Bypassing Hole Scheme Using Observer Packets for Geographic Routing) that selects the optimum bypassing path while minimizing overhead to maintain hole boundary information. everal schemes have been recently proposed to solve this problem. However, they have overhead about nodes that are adjacent to the hole that have to maintain hole boundary information and ncrease hop count due to additional data packet transmission. BHOP-GR detects the hole boundary using an observer packet previously. When it transmits the data packet using a time delay, this an be arranged to decrease the average hop counts and routing path length. Also, using a virtual regular hexagon model, which can exactly cover a hole to be detoured, minimizes overhead to aintain hole boundary information. In the performance evaluation, we show that BHOP-GR has at least 34% and 25% of the average hop counts and routing path length compared to SLGF(Safety Information based Limited Geographic greedy Forwarding) and Virtual Circle, respectively.