Efficient Hole Bypass Routing Scheme Using Observer Packets for Geographic Routing in Wireless Sensor Networks Hyunseung Choo School of Information and Communication Engineering Sungkyunkwan University Korea Mooshik Choi Smart Networking Division LS Industrial Systems Korea Minhan Shon School of Information and Communication Engineering Sungkyunkwan University Korea choo@ece.skku.ac.kr cmszzang@naver.com Doogsoo Stephen Kim Indiana University Purdue University Indianapolis USA minari95@skku.edu dskim@iupui.edu ABSTRACT 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. Several 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 increase 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 can be arranged to decrease the average hop counts and routing path length. Also, using a virtual regular hexagon model, which can
/lp/association-for-computing-machinery/efficient-hole-bypass-routing-scheme-using-observer-packets-for-NptmgIbPgP