Low-cost multicast routing in wireless mobile networks

A routing algorithm is proposed to support multicast routing infrastructure for heterogeneous wireless/wired networks. The algorithm has two goals: (a) reduce the overall cost of the multicast tree, (b) reduce the latency for join and leave operations when mobile units hand-off from one cell to another. The LMM (Low-cost Mobile Multicast) algorithm reduces the delay during the hand-off process by precomputing the least-cost path to all neighboring cells. LMM is able to effectively support both static and mobile hosts.

[1]  Mahmoud Naghshineh,et al.  Control and quality-of-service provisioning in high-speed microcellular networks , 1994, IEEE Personal Communications.

[2]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[3]  Taieb Znati,et al.  A simulation framework for the analysis of multicast tree algorithms , 1997, Proceedings of 1997 SCS Simulation Multiconference.

[4]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[5]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[6]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..