Multiobjective Multicast DSR Algorithm for Routing in Mobile Networks with Cost, Delay, and Hop Count

Tremendous evaluation of wireless mobile communication needs more efficient algorithms for communication systems. *e use of conventional single-objective optimization algorithmsmay be unsuitable for real applications, because they act to the detriment of the rest of the performance parameters like lifetime network, delay, cost, and hop count; for this reason, multiobjective is needed. *is paper presents performance evaluation and compares between the Multicast MDSR and MAODV with MACO.*e proposed MDSR is concerned with change of the route discovery phase, where the route selection is based on the shortest path of route reply packets on the route with calculating the number of hop counts. Also, this article compares our MDSR modification with the evaluation algorithm based on Ant Colony Optimization (ACO), which finds the best path and multicast tree optimizes total weight (cost, delay, and hop count) of the multicast tree using multiobjective. Experimental results proved that the proposed MDSR algorithm is more efficient than MAODV and MACO in the total weight (cost, delay, and hop count), respectively. Moreover, the MACO outperforms MAODV for multicast routing problem.