A mobile ad hoc network is a wireless mobile network that does not have any base station or other central control infrastructure. Design of efficient multicast routing protocols in such a network is challenging, especially when the mobile hosts move rapidly. Shared-tree routing protocol is a widely used multicast routing protocol in ad hoc networks. However, this protocol is deficient in terms of the end-to-end delay and network throughput. In this paper, we propose a protocol to improve the inherent problem of the large end-to-end delay in the shared-tree method as a modification to the existing multicast Ad hoc On-demand Distance Vector (MAODV) routing for the low mobility network. The protocol uses the n-hop local ring search to establish a new forwarding path and limit the flooding region. We then propose an extension to our proposed protocol, by using the periodic route discovery message to improve the network throughput for the high mobility network. Simulation results demons trate the improvement in the average end-to-end delay for the low mobility case as well as in the high packet delivery ratio for the high mobility case.
In REF , the authors designed a novel protocol to improve the general problem regarding the end-to-end delay in the shared-tree method as a modification to the existing Multicast Ad Hoc On-Demand Distance Vector (MAODV) routing for MANETs.
A modified shared-tree multicast routing protocol in Ad hoc network
CIT
CIT
Computer Science