Adaptive range-based mobile multicast

  • Authors:

  • Shengling Wang;Yong Cui;Ke Xu;Sajal Das;Jianping Wu

  • Affiliations:

  • Department of Computer Science and Technology, Beijing, China;Department of Computer Science and Technology, Beijing, China;Department of Computer Science and Technology, Beijing, China;University Texas at Arlington, Arlington, TX, USA;Department of Computer Science and Technology, Beijing, China

  • Venue:
  • Proceedings of the 1st ACM workshop on Mobile internet through cellular networks
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an efficient, Adaptive Range-Based Mobile Multicast (ARBMoM) protocol. ARBMoM uses the Multicast Home Agent (MHA) to deliver multicast packets to mobile users. The MHA of a user in ARBMoM is decided not only by its location, but also by its mobility and service characteristics. This makes each router act as either a regular foreign agent (FA) or an MHA, thus balancing the load. To find an optimal service range for an MHA to trade off between the multicast packet delivery and the multicast service disruption latency, we model the user's movement in 2-D mesh network using Markov chain. To reduce the computational complexity, we aggregate the states by using the mobile movement symmetry. In addition, we propose a method to easily obtain the aggregate state set and the transition probability between any two aggregate states once the service range is given. In addition, ARBMoM is compatible with any multicast tree configuration algorithm. Both simulation and numerical results demonstrate that ARBMoM enhances the system performance.