Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks

Finding a near-optimal routing solution for multicast requests is a challenge for supporting different multicast applications including video and group communications over wireless ad hoc networks. A heuristic partitioning algorithm for solving the multicast routing problem with separate paths in ad hoc networks is presented. We consider scheduling a set of multicast requests which may have a source node with multiple destinations respectively through a wireless network. Our heuristic method for partitioning arbitrary routing requests is both effective in finding a near-optimal solution, and efficient to solve large multicast requests. Our simulation shows that the average overall latency reduces up to 38%. We also find that the handling scales up well from 8 nodes to 64 nodes.

[1]  Zongpeng Li,et al.  Improving throughput in multihop wireless networks , 2006, IEEE Transactions on Vehicular Technology.

[2]  Jun-Hong Cui,et al.  Reducing multicast traffic load for cellular networks using ad hoc networks , 2006, IEEE Trans. Veh. Technol..

[3]  Avideh Zakhor,et al.  Multiple Tree Video Multicast Over Wireless Ad Hoc Networks , 2007, IEEE Transactions on Circuits and Systems for Video Technology.

[4]  Byung Ro Moon,et al.  Genetic Algorithm and Graph Partitioning , 1996, IEEE Trans. Computers.

[5]  Pablo Galiasso,et al.  A hybrid genetic algorithm for the point to multipoint routing problem with single split paths , 2001, SAC.

[6]  Kumbesan Sandrasegaran.  Planning point-to-multipoint rural radio access networks using expert systems , 1999 .

[7]  Gene Tsudik,et al.  Exploring mesh and tree-based multicast. Routing protocols for MANETs , 2006, IEEE Transactions on Mobile Computing.

[8]  Jennifer L. Welch,et al.  Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks , 2006, IEEE Trans. Mob. Comput..

[9]  Weifa Liang.  Approximate minimum-energy multicasting in wireless ad hoc networks , 2006 .

[10]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[11]  Avideh Zakhor,et al.  Multipath unicast and multicast video communication over wireless ad hoc networks , 2004, First International Conference on Broadband Networks.

[12]  Liming Zhu,et al.  A genetic algorithm for the point to multipoint routing problem with varying number of requests , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[13]  Gregory W. Wornell,et al.  Fundamental limits and scaling behavior of cooperative multicasting in wireless networks , 2006, IEEE Transactions on Information Theory.

[14]  Cevdet Aykanat,et al.  Two novel multiway circuit partitioning algorithms using relaxed locking , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Zongpeng Li,et al.  On achieving maximum multicast throughput in undirected networks , 2006, IEEE Transactions on Information Theory.

[16]  Vincent Roca,et al.  A survey of proposals for an alternative group communication service , 2003, IEEE Netw..

[17]  Sang-Ha Kim,et al.  A novel overlay multicast protocol in mobile ad hoc networks: design and evaluation , 2005, IEEE Trans. Veh. Technol..

[18]  I.S. Misra,et al.  Congestion controlled reliable multi path source routing in ad-hoc networks , 2005, 2005 IEEE International Conference on Personal Wireless Communications, 2005. ICPWC 2005..