k-Span: A k-Redundant Multicast Algorithm in Mobile Wireless Ad Hoc Network
In ubiquitous wireless environment, mobile devices need a more resilient and convenient network communication software. Mobile Ad Hoc Network (MANET)routing protocols are favored in ubiquitous environments due to its self-organization and selfreconstruction characteristics. Routing protocols however, especially the MANET routing protocols, are suffering from the unexpected topology changes and unreliable wireless links. In order to achieve a robust connectivity and steady routing topology, redundancy is usually applied in MANET routing protocols. As multi-path routing without limiting may consume too munch bandwidth and deteriorate network performance, a K-Redundant routing algorithm is proposed, where K is an upper bound of connectivity between nodes. In this work, we propose a multi-cast algorithm on K-redundant topology in MANET routing paradigm. We first prove that the optimuM multicasting problem is NP-Complete. To cope with this hardness, we propose a heuristic algorithm name k-span is proposed in this study. Simulation results show that our proposed algorithm can effectively build multi-cast tree for k-redundant network.
Panlong Yang Guangcheng Qin Hai Wang Guihai Chen
Institute of Communication Engineering,P.L.A University of Science and Technology Institute of Communication Engineering, P.L.A University of Science and Technology Dept. of Computer Science & Technology Nanjing University, Nanjing, China P.R
国际会议
The International Conference on Communication Software and Networks(2009 IEEE通信软件与网络国际会议 ICCSN 2009)
成都
英文
327-331
2009-02-20（万方平台首次上网日期，不代表论文的发表时间）