A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks

Overlay multicast protocol constructs a virtual mesh spanning all member nodes of a multicast group and employs standard unicast routing to fulfill multicast functionality on application layer. The advantages of this approach are simplicity and flexibility. However, efficiency and stability are the issues that must be addressed as the size of the multicast group grows in the mobile ad hoc networks (MANETs). In this paper, we propose tree trunk for overlay multicast to solve these problems in MANETs. A tree trunk is a path that minimizes the sum of the distances of all vertices to the path plus the length of the path. We give an efficient distributed algorithm for finding a tree trunk in a tree network. We also perform some empirical analysis based on the tree trunk and compare the results with those using spanning tree.

[1]  Mingyan Liu,et al.  AMRoute: Ad Hoc Multicast Routing Protocol , 2002, Mob. Networks Appl..

[2]  Y. C. Tay,et al.  AMRIS: a multicast protocol for ad hoc wireless networks , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[3]  Gorazd Kandus,et al.  Steiner Tree Based Distributed Multicast Routing in Networks , 2001 .

[4]  Shietung Peng,et al.  K-MCore for Multicasting on Mobile Ad Hoc Networks , 2006, 2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06).

[5]  Shietung Peng,et al.  Algorithms for a Core and k-Tree Core of a Tree , 1993, J. Algorithms.

[6]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.

[7]  Klara Nahrstedt,et al.  Effective location-guided tree construction algorithms for small group multicast in MANET , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[9]  Prasant Mohapatra,et al.  Efficient overlay multicast for mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[10]  Peter J. Slater,et al.  A Linear Algorithm for a Core of a Tree , 1980, J. Algorithms.

[11]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[12]  Yamin Li,et al.  MCORE : A SIMPLE STRUCTURE FOR EFFECTIVE OVERLAY MULTICAST ON MOBILE AD HOC NETWORKS , 2006 .

[13]  Michalis Faloutsos,et al.  Overlay Multicasting for Ad Hoc Networks , 2005 .

[14]  Dharma P. Agrawal,et al.  Multicast over wireless mobile ad hoc networks: present and future directions , 2003, IEEE Netw..

[15]  Shietung Peng,et al.  A Simple Optimal Parallel Algorithm for a Core of a Tree , 1994, J. Parallel Distributed Comput..

[16]  Sung-Ju Lee,et al.  A performance comparison study of ad hoc wireless multicast protocols , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).