K-MCore for Multicasting on Mobile Ad Hoc Networks

A k-cluster of a tree includes a single path and k-1 sub-paths growing from that path. A k-MCore is a k-cluster that minimizes the sum of the distances of all vertices to the cluster plus the size of the cluster. This structure is motivated by the applications on overlay multicasting. The overlay multicast protocol constructs a virtual mesh spanning all member nodes of a multicast group. It employs standard unicast routing and forwarding to fulfill multicast functionality. In this paper, we propose effective distributed algorithms for constructing k-MCore on a tree network. The k-MCore is more stable and easier to maintain than the spanning tree in virtual mesh. The simulation results show that our approach handles the flexibility and mobility issues in an overlay multicast protocol effectively, especially when the group size is large

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

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

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

[4]  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.

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

[6]  Pingzhi Fan,et al.  Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies , 2004 .

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

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

[9]  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).

[10]  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).

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

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

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