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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Reducing data-overhead of mesh-based ad hoc multicast routing protocols by Steiner tree meshes


    Contributors:


    Publication date :

    2004-01-01


    Size :

    531971 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    SBMT-Steiner Backup Multicast Tree

    Hsu, W.-H. / Chen, J. / Sheu, S.-T. et al. | British Library Online Contents | 2006


    Study of Multicast Routing Protocols in Mobile Ad Hoc Networks

    Yang, X. / Layuan, L. / Chuanhui, C. | British Library Online Contents | 2005



    Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

    Lianzhen, C. / Jun, Z. / Kai, L. | British Library Online Contents | 2007


    Multicast routing algorithms with low tree cost for LEO satellite networks

    Lianzhen, C. / Jun, Z. / Kai, L. | British Library Online Contents | 2007