A Method for Distributed Computation of Semi-Optimal Multicast Tree in MANET

In this paper, we propose a new method to construct a semi-optimal QoS-aware multicast tree on MANET using distributed computation of the tree based on genetic algorithm (GA). This tree is sub-optimal for a given objective (e.g., communication stability and power consumption), and satisfies given QoS constraints for bandwidth and delay. In order to increase scalability, our proposed method first divides the whole MANET to multiple clusters, and computes a tree for each cluster and a tree connecting all clusters. Each tree is computed by GA in some nodes selected in the corresponding cluster. Through experiments using network simulator, we confirmed that our method outperforms existing on-demand multicast routing protocol in some useful objectives.

[1]  Toshimitsu Masuzawa,et al.  Clustering algorithms in ad hoc networks , 2005 .

[2]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Leonard Barolli,et al.  GAMAN: A GA Based QoS Routing Method for Mobile Ad-Hoc Networks , 2003, J. Interconnect. Networks.

[4]  L. Layuan,et al.  QoS multicast routing in networks with uncertain parameter , 2003 .

[5]  George F. Riley,et al.  The Georgia Tech Network Simulator , 2003, MoMeTools '03.

[6]  Cem Ersoy,et al.  Ad hoc quality of service multicast routing , 2005, Comput. Commun..

[7]  Reiko Tanese,et al.  Distributed Genetic Algorithms , 1989, ICGA.

[8]  Vaduvur Bharghavan,et al.  MCEDAR: multicast core-extraction distributed ad hoc routing , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).