An efficient geographic algorithm for routing in the proximity of a large hole in wireless sensor networks

Geographic routing is well suited for large-scale wireless sensor networks (WSNs) because of its simplicity and scalability. With the occurrence of routing holes, however, geographic routing suffers from the so-called local minimum phenomenon and the issue of traffic concentrating on the hole boundary. Several recent proposals attempt to fix these issues by deploying a special, keep-away area around the hole, which helps to improve the congestion on the hole boundary but they still are deficient if the source or destination is close to the hole. We propose a novel approach to target this problem of routing in a hole proximity while ensure both two main requirements in energy efficiency and load balancing. Our simulation experiments show that our proposed routing scheme strongly outperforms previous approaches considering routing in a hole proximity, especially in energy efficiency and load balancing.