Solve the Tree Setup Problem and Minimize Control Overhead for High-Density Members in Delay-Bounded Distributed Multicast Networks

The multicast routing is one of the important techniques for achieving multicast applications in wireless networks, e.g., real-time video multicasting in Vehicular Ad-hoc NETwork (VANET). The main objective of a delay-bounded multicast algorithm is to determine the least-cost multicast tree while satisfying the delay-bounded requirement for multicasting voice/video transmission. Several multicast algorithms have been proposed, some disadvantages have not yet solved, including: (1) yielding a large numbers of control messages, (2) yielding dangling nodes, (3) exhibiting the cycle-free problem, (4) increasing the tree setup time, (5) suffering from the tree setup-break problem, etc. Thus, this paper proposes an adaptive distributed multicast routing (ADMR) algorithm to guarantee cycle-free, to overcome the tree setup-break and the dangling nodes problems while achieving the least-cost delay-bounded multicast tree for high density member multicast networks. Numerical results demonstrate that ADMR significantly outperforms the compared algorithms in the number of control messages and the setup convergence time. Finally, the worst case time complexity and the number of messages of ADMR are analyzed, which requires O(n · (m + c)) time and O(2m + 2c) messages, respectively. The analyzed results of ADMR are lower than that of the compared algorithms.

[1]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[2]  D. T. Lee,et al.  Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks" , 2005, TNET.

[3]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[4]  S. Khatun,et al.  A new scalable reliable multicast transport protocol using perfect buffer management , 2008, 2008 International Conference on Computer and Communication Engineering.

[5]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[6]  Xue Liu,et al.  Research on multicast routing protocols for mobile ad-hoc networks , 2008, Comput. Networks.

[7]  Ben-Jye Chang,et al.  Scalable Distributed Multicast Routing with Multiple Classes of QoS Guarantee , 2004 .

[8]  Woo-Jae Kim,et al.  An efficient mobile multicast mechanism for fast handovers: A study from design and implementation in experimental networks , 2008, Comput. Commun..

[9]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[10]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[11]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[12]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[13]  Sang Hoon Bae,et al.  Research on Afterschool Programs in Korea: Trends and Outcomes , 2013 .

[14]  Dongkyun Kim,et al.  Analyzing Routing Protocols for Underwater Wireless Sensor Networks , 2010, Int. J. Commun. Networks Inf. Secur..

[15]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[16]  Yuanyuan Yang,et al.  A Service-Centric Multicast Architecture and Routing Protocol , 2008, IEEE Transactions on Parallel and Distributed Systems.

[17]  Anujan Varma,et al.  Distributed algorithms for multicast path setup in data networks , 1996, TNET.

[18]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[19]  George C. Polyzos,et al.  Optimal multicast routing with quality of service constraints , 2005, Journal of Network and Systems Management.

[20]  Jian Ni,et al.  Large-scale cooperative caching and application-level multicast in multimedia content delivery networks , 2005, IEEE Communications Magazine.

[21]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .