K-MCore for multicasting on mobile ad hoc networks

A k-cluster of a treeincludes a single path and k - 1 subpaths growingfirom thatpath. A k-MCore is a k-cluster that minimizes the sum of the distances of all vertices to the clusterplus 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 andforwarding tofulfill multicast functionality. In this paper we propose effective distributed algorithms for constructing k-Wore on a tree network. The k-Wore is more stable and easier to maintain than the spanning tree in virtual mesh. The simulation results show that our approach handles theflexibility and mobility issues in an overlay multicast protocol effectively, especially when the group size is large.