Skip to main content
SpringerLink
Log in

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

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Abbreviations

s :

The source node of a multicast session.

r :

A receiver of a multicast session.

R :

The multicast receiver set of a multicast session.

g_id :

The group ID of a multicast session.

t :

The index of a multicast session.

T :

The multicast-tree set of a network.

|M t |:

The number of multicast receivers of a multicast session t.

Δ:

The delay bound of a multicast session.

C :

The link cost.

D :

The link delay.

p(s, r):

The path in a multicast tree t, i.e., from the source s to an on-tree receiver r.

ℓ (a, b):

The link between nodes a and b.

C(ℓ):

The cost of a tree link ℓ.

D(ℓ):

The delay of a tree link ℓ.

T2D :

A tree-to-destination table in control messages.

trenode :

A branch node of a multicast session.

|V| or n :

The number of nodes in a network.

|E|:

The number of links in a network.

|C| or c :

The number of cycles happened in tree-construction procedure.

S t :

The number of successful reaching receivers of a multicast session t.

F t :

The number of failed reaching receivers of a multicast session t.

MRT :

The multicast routing table.

References

  1. Bauer F., Varma A. (1996) Distributed algorithms for multicast path setup in data networks. IEEE/ACM Transactions on Networking 4: 181–191

    Article  Google Scholar 

  2. Cormen T. H., Leiserson C. E., Rivest R. L., Stein C. (2001) Introduction to algorithms. MIT Press, Cambridge, MA

    MATH  Google Scholar 

  3. Gallarger R. G., Humblet P. A., Spira P. M. (1983) A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems 5: 66–77

    Article  Google Scholar 

  4. Gilbert E. N., Pollak H. O. (1968) Steiner minimal trees. SIAM Journal on Applied Mathematics 16: 1–29

    Article  MathSciNet  MATH  Google Scholar 

  5. Hwang R.-H., Chang B.-J., Hsiao W.-C., Hsu J.-M. (2004) Scalable distributed multicast routing with multiple classes of QoS guarantee. IEICE Transactions on Communications E-87B: 2682–2691

    Google Scholar 

  6. Huang T.-L., Lee D.-T. (2005) Comments and an improvement on a distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transactions on Networking 13: 1410–1411

    Article  Google Scholar 

  7. Jia X. (1998) A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transactions on Networking 6: 828–837

    Article  Google Scholar 

  8. Junhai L., Liu X., Danxia Y. (2008) Research on multicast routing protocols for mobile Ad-hoc networks. Computer Networks 52: 988–997

    Article  MATH  Google Scholar 

  9. Kompella V. P., Pasquale J. C., Polyzos G. C. (1993) Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking 1: 286–292

    Article  Google Scholar 

  10. Kompella V. P., Pasquale J. C., Polyzos G. C. (1996) Optimal multicast routing with quality of service constraints. Journal of Network System Management 4: 107–131

    Article  Google Scholar 

  11. Kou L., Markowsky G., Berman L. (1981) A fast algorithm for steiner trees. Acta Informatica 15: 141–145

    Article  MathSciNet  MATH  Google Scholar 

  12. Kruskal J. B. (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. The American Mathematical Society 7: 48–50

    Article  MathSciNet  MATH  Google Scholar 

  13. Kwon D.-H., Kim W.-J., Suh Y.-J. (2008) An efficient mobile multicast mechanism for fast handovers: A study from design and implementation in experimental networks. Computer Communications 31: 2162–2177

    Article  Google Scholar 

  14. Ni J., Tsang D. H. K. (2005) Large-scale cooperative caching and application-level multicast in multimedia content delivery networks. IEEE Communication Magazine 43: 98–105

    Article  Google Scholar 

  15. Prim R. (1957) Shortest connection networks and some generalizations. Bell Systems Technical Journal 36: 1389–1401

    Google Scholar 

  16. Yang Y., Wang J., Yang M. (2008) A service-centric multicast architecture and routing protocol. IEEE Transactions on Parallel and Distributed Systems 19: 35–51

    Article  Google Scholar 

  17. Winter P. (1987) Steiner problem in networks: A survey. Networks 17: 129–167

    Article  MathSciNet  MATH  Google Scholar 

  18. Zhu, Q., Parsa, M., & Garcia-Luna-Aceves, J. J. (1995). A source-based algorithm for delay-constrained minimum-cost multicasting, IEEE INFOCOM’95, (pp. 377–385). Boston, USA.

  19. Wahid A., Kim D. -K. (2010) Analyzing routing protocols for underwater wireless sensor networks. International Journal of Communication Networks and Information Security 2(3): 253–261

    Google Scholar 

  20. Rabara S. A., Vijayalakshmi S. (2010) Rushing attack mitigation in multicast MANET (RAM3). International Journal of Research and Reviews in Computer Science 1(4): 131–138

    Google Scholar 

  21. Alsaih A. M., Hatem S. A., Jantan A. B., Khatun S., Rasid M. F. A. (2010) A new scalable reliable multicast transport protocol with perfect buffer management. International Journal of Research and Reviews in Computer Science 1(3): 53–60

    Google Scholar 

  22. The GNU Compiler Collection—GCC, Available from. http://gcc.gnu.org/.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, Nan Kai University of Technology, Nantou, Taiwan, ROC

    Ying-Hsin Liang

  2. Department of Computer Science and Information Engineering, National Yunlin University of Science and Technology, Yunlin, Taiwan, ROC

    Ben-Jye Chang

  3. Department of Computer Science and Information Engineering, National Chung-Cheng University, Chiayi, Taiwan, ROC

    Yan-Min Lin

Authors
  1. Ying-Hsin Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ben-Jye Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yan-Min Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ben-Jye Chang.

Additional information

This research was supported in part by the National Science Council of Taiwan, ROC, under the Grants of NSC-99-2221-E-252-010 and NSC-97-2221-E-224-072-MY3.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liang, YH., Chang, BJ. & Lin, YM. Solve the Tree Setup Problem and Minimize Control Overhead for High-Density Members in Delay-Bounded Distributed Multicast Networks. Wireless Pers Commun 65, 875–894 (2012). https://doi.org/10.1007/s11277-011-0317-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-011-0317-4

Keywords

Search

Navigation