Abstract
The available delivery probability studies for mobile ad hoc networks (MANETs) mainly considered unicast scenario, i.e., a source has only one destination, which cannot support future multicast-intensive applications in such networks. In this paper, we propose a general two-hop relay algorithm with cooperative probability p, packet lifetime t, packet redundancy f and multicast fanout g. In such an algorithm, source node can replicate a packet to at most f distinct relay nodes, which help to forward the packet to its g destination nodes before t expires. Specifically, the destination nodes may also forward the packet for each other with cooperative probability p. To study the multicast delivery probability in MANETs, we first develop a Markov chain model to characterize the packet delivery process under the routing algorithm, based on which an analytical expression is then derived for the delivery probability. Finally, simulation and numerical results are presented to illustrate the accuracy of the theoretical delivery probability analysis as well as our theoretical findings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
