We study the problem of reducing data overhead of mesh-based multicast ad hoc routing protocols by reducing the number of forwarding nodes. We show that minimizing the number of forwarding nodes is equivalent to the problem of finding the minimal cost multicast tree. In addition, we demonstrate the problem to be NP-complete by a transformation to the Steiner tree problem. We propose a distributed heuristic algorithm based on the epidemic propagation of the number of forwarding nodes. Our simulation results show that the proposed heuristic, when implemented into ODMRP, is able to offer similar performance results and a lower average latency while improving the forwarding efficiency in around a 40-50% with respect to the original ODMRP.
Reducing data-overhead of mesh-based ad hoc multicast routing protocols by Steiner tree meshes
2004-01-01
531971 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
SBMT-Steiner Backup Multicast Tree
British Library Online Contents | 2006
|IP Multicast Protocols over Satellite
AIAA | 2003
|Mesh Manipulation for 3D Tetrahedral Meshes
AIAA | 2015
|Cluster-Based MANET Multicast Routing Scheme
British Library Online Contents | 2010
|