Multiple Constraints for Ant Based Multicast Routing in Mobile Ad Hoc Networks
A. Sabari and K. Duraiswamy
DOI : 10.3844/jcssp.2009.1020.1027
Journal of Computer Science
Volume 5, Issue 12
Problem statement: A Mobile Ad hoc Network (MANET) is one of the challenging environments for multicast. Since the associated overhead is more, the existing studies illustrate that tree-based and mesh-based on-demand protocols are not the best choice. The costs of the tree under multiple constraints are reduced by the several algorithms which are based on the Ant Colony Optimization (ACO) approach. The traffic-engineering multicast problem is treated as a single-purpose problem with several constraints with the help of these algorithms. The main disadvantage of this approach is the need of a predefined upper bound that can isolate good trees from the final solution. Approach: In order to solve the traffic engineering multicast problem which optimizes many objectives simultaneously this study offers a design on Ant Based Multicast Routing (AMR) algorithm for multicast routing in mobile ad hoc networks. Results: Apart from the existing constraints such as distance, delay and bandwidth, the algorithm calculates one more additional constraint in the cost metric which is the product of average-delay and the maximum depth of the multicast tree. Moreover it also attempts to reduce the combined cost metric. Conclusion: By simulation results, it is clear that our proposed algorithm surpasses all the previous algorithms by developing multicast trees with different sizes.
© 2009 A. Sabari and K. Duraiswamy. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.