A Multi-source Multicast Routing Protocol for Ad-Hoc Networks
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
Determining a sequence of stable multicast Steiner trees in mobile ad hoc networks
Proceedings of the 44th annual Southeast regional conference
E-ODMRP: Enhanced ODMRP with motion adaptive refresh
Journal of Parallel and Distributed Computing
Profiling a multicast video stream: An evaluation and implementation platform
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science,Software Engineering, Information Technology, e-Business, and Applications, 2003
Analysis of Local Route Maintenance for Ad Hoc Network
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Information Sciences: an International Journal
Multipath passive data acknowledgement on-demand multicast protocol
Computer Communications
Multicast routing protocols in mobile ad hoc networks: a comparative survey and taxonomy
EURASIP Journal on Wireless Communications and Networking
On-demand multicast routing protocol with efficient route discovery
Journal of Network and Computer Applications
An ad hoc multicast protocol based on passive data acknowledgement
Computer Communications
| Hi-index | 0.00 |
In this paper we propose an ad-hoc multicast routing protocol, referred to as PatchODMRP. PatchODMRP extends the ODMRP (On-Demand Multicast Routing Protocol), which is a mesh-base multicast routing protocol proposed for ad-hoc networks [1]. In ODMRP, the nodes that are on the shortest paths between the multicast group members are selected as Forwarding Group (FG) nodes, and form a forwarding mesh for the multicast group. The ODMRP reconfigures the forwarding mesh periodically to adapt it to the node movements. When the number of sources in the multicast group is small, usually the forwarding mesh is formed sparsely and it can be very vulnerable to mobility. In this case, very frequent mesh reconfigurations are required in ODMRP, resulting in large control overhead. To deal with this problem in a more efficient way, PatchODMRP deploys a local patching scheme instead of having very frequent mesh reconfigurations. In PatchODMRP, each FG node keeps checking if there is a symptom of mesh separation around itself. When an FG node finds such symptom, it tries to patch itself to the mesh with a local flooding of control messages. Through a course of simulation experiments, the performance of PatchODMRP is compared to the performance of ODMRP. The simulation results show that PatchODMRP improves the data delivery ratio, and reduces the control overheads. It has also been shown that the performance gain is larger when the degree of node mobility is bigger.