Mobile multicast (MoM) protocol: multicast support for mobile hosts
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Multicast support for mobile-IP with the hierarchical local registration approach
WOWMOM '00 Proceedings of the 3rd ACM international workshop on Wireless mobile multimedia
MobiCast: a multicast scheme for wireless networks
Mobile Networks and Applications
Supporting IP multicast for mobile hosts
Mobile Networks and Applications - ACM/Kluwer special issue on wireless internet and intranet access
New Approach for Mobile Multicast Based on SSM
ICON '01 Proceedings of the 9th IEEE International Conference on Networks
IP mobile multicast: Challenges and solutions
IEEE Communications Surveys & Tutorials
A reliable advanced-join system for data multicasting in ITS networks
IEEE Transactions on Intelligent Transportation Systems
IDMP-based fast handoffs and paging in IP-based 4G mobile networks
IEEE Communications Magazine
Multicast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees?
IEEE Communications Magazine
Dynamic region-based mobile multicast
Wireless Communications & Mobile Computing
The Journal of Supercomputing
Hi-index | 0.00 |
Traditional mobile multicast schemes have either high multicast tree reconfiguration cost or high packet delivery cost. The former affects service disruption time while the latter affects packet delivery delay. Although existing region-based mobile multicast schemes offer a trade-off between two costs to some extent, most of them do not determine the size of the service range, which is critical to network performance. In this paper, we propose a novel approach, called Distributed Dynamic Mobile Multicast (D^2M^2), to dynamically determine the optimal service range according to the mobility and service characteristics of a user. We derive an analytical model to formulate the costs of multicast tree reconfiguration and multicast packet delivery. The model is based on a Markov chain that analyzes a mobile node's movement in a 2D mesh network. As the complexity of computing steady probability is high, we aggregate the Markov states by leveraging mobility symmetry. Simulation shows that the network performance is enhanced through D^2M^2.