Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks Using OPR
This paper addresses the problem of delivering data packets for highly dynamic mobile ad hoc networks in a reliable and timely manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially for large-scale networks. Driven by this issue, the authors propose an efficient Position-based Opportunistic Petal Routing (OPR) protocol which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium. In the case of communication hole, a Virtual Destination-based Void Handling (VDVH) scheme is further proposed to work together with OPR. Both theoretical analysis and simulation results show that OPR achieves excellent performance even under high node mobility with acceptable overhead and the new void handling scheme also works well.