A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE 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
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
The holes problem in wireless sensor networks: a survey
ACM SIGMOBILE Mobile Computing and Communications Review
Characterizing the Impact of Routing Holes on Geographic Routing
ICW '05 Proceedings of the 2005 Systems Communications
Graph Theory With Applications
Graph Theory With Applications
Location verification and trust management for resilient geographic routing
Journal of Parallel and Distributed Computing
GLR: a novel geographic routing scheme for large wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A modeling for hole problem in wireless sensor networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Hole-shadowing routing in large-scale MANETs
International Journal of Sensor Networks
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Mobile ad-hoc networks (MANETs) usually contain sparse or even empty regions called holes. The local optimum problem will occur when routing packets meet holes in the network. In this paper, we propose a novel hole-reshaping routing protocol (HRR) in large-scale MANETs. It effectively solves the hole problem by regularizing a hole with an ellipse, and then locally broadcasting the hole information away from the hole. Simulation results show that the proposed protocol guarantees finding a short routing path with a small routing delay, which is a prerequisite to achieve scalability in large-scale networks.