Packet Delivery Probability in Two-Hop Relay MANETs with Hybrid Routing

The two-hop relay algorithm with both the packet redundancy and erasure coding techniques serves as a promising routing algorithm to improve the packet delivery performance in mobile ad hoc networks (MANETs). This paper studies the packet delivery probability under this routing algorithm. We first develop a multi-dimensional Markov chain model to characterize the packet delivery process under the hybrid two-hop relay algorithm. Based on the Markov chain model, we then derive an analytical expression for the packet delivery probability in the considered network. Finally, simulation and theoretical results are provided to illustrate the efficiency of the developed model as well as our theoretical findings.