K-MCore for Multicasting on Mobile Ad Hoc Networks

Abstract

A k-cluster of a tree includes a single path and k −1 subpaths 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.

A new drug testing platform based on 3D tri-culture in lab-on-a-chip devices

“…It is provided by a pre-built tree structure. Multicast routing in MANETs is very important in order to support group communication under unreliable conditions and it is a hot research topic [10,13,15,49,55,76]. In this paper, we surveyed the multicast algorithms that are targeted for both cluster and spanning tree formation.…”

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

“…However, for multicast on mobile ad hoc networks, the length of the path should be included in the optimization criteria. Li, Peng, and Chu proposed distributed algorithms [12,13] for multicasting in mobile ad hoc networks, but the algorithms do not guarantee to generate a tree trunk.…”