A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The holes problem in wireless sensor networks: a survey
ACM SIGMOBILE Mobile Computing and Communications Review
Location verification and trust management for resilient geographic routing
Journal of Parallel and Distributed Computing
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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 exactly cover a hole to be detoured, minimizes overhead to maintain 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.