Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Ant Based Multicast Routing Algorithm with Multiple Constraints for Mobile Adhoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Sabari, A. ; Dept. of Inf. Technol., K.S. Rangasamy Coll. of Technol., Tiruchengode ; Duraiswamy, K.

One particular challenging environment for multicast is a mobile ad-hoc network (MANET). Existing studies show that tree-based and mesh based on-demand protocols are not necessarily the best choice, since associated overhead will be more. Several algorithms based on the ant colony optimization (ACO) approach minimizes the cost of the tree under multiple constraints. These algorithms treat the traffic engineering multicast problem as a single-purpose problem with several constraints. The main disadvantage of this approach is the necessity of a predefined upper bound that can exclude good trees from the final solution. This paper presents a design on ant-colony based multicast routing (AMR) algorithm for MANETs, to solve the traffic Engineering multicast problem that optimizes several objectives simultaneously. 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 and try to minimize this combined cost metric. Simulation results show that the proposed algorithm outperforms all previous algorithms by forming the multicast tree with varying sizes.

Published in:

Security Technology, 2008. SECTECH '08. International Conference on

Date of Conference:

13-15 Dec. 2008