In mobile ad hoc networks, how to achieve the multicast communication is a challenging task due to the fact that the topology may change frequently and communication links may be broken because of users' mobility. To keep network connectivity, control packets are periodically sent within the system, resulting in high system overhead. To reduce the amount of control packets, a multicast routing algorithm for mobile ad hoc networks is designed in this paper. Utilizing movement prediction to estimate the life time of connections for every node pairs, the algorithm largely reduces the amount of control packets as compared to those using periodical path maintenance. Based on the estimate, a local path search rather than a global one is performed before the breakage of a path to get a backup path. This further lowers the system load. To avoid frequent path breakage, the algorithm chooses the path with the longest life among all possible paths. Using a simulation approach, we investigate the performance of the proposed algorithm through a comparison with an algorithm previously proposed in the literature. Based on the numerical results, we demonstrate that our proposed algorithm performs well.
|頁（從 - 到）||2518-2522|
|期刊||IEEE Vehicular Technology Conference|
|出版狀態||已發佈 - 2005 十月 17|
|事件||2005 IEEE 61st Vehicular Technology Conference -VTC 2005 - Spring Stockholm: Paving the Path for a Wireless Future - Stockholm, 瑞典|
持續時間: 2005 五月 30 → 2005 六月 1
ASJC Scopus subject areas