Delay-constrained least-cost multicast routing heuristic in mobile IP networks

Recently there has been an increasing demand for providing multicasting service in mobile IP environment. However, it is still faced with great challenges, such as the established multicast delivery paths may frequently restructure when a node moves from one sub-network to another, incurring expensive overheads. This paper proposed a delay-constrained least-cost multicast routing algorithm to support multicast routing infrastructure for heterogeneous wire/wireless networks. The algorithm has three goals: (a) reduces the overall cost of the multicast tree, (b) reduces the join/leave latency when mobile node hand-off between wireless cells, (c) by using adaptive strategy, overcomes the shortcomings of traditional algorithms which deal with the cost and delay separately and needs lots of retrospect.