Delay Optimal Multicast routing for Wireless Ad-hoc networks

In this research paper we are proposing a delay minimization algorithm for minimizing end to end delay for multicasting on a tree based wireless network with multiple source and multiple destinations. Our algorithm uses two stages, first is level division and second is for selecting best path among all paths from tree. The second stage is DOMA (Delay Optimal Multicast Algorithm) algorithm. Our algorithm divides the tree into its sub trees and finds the best delay optimal path. The algorithm is compared with Tree Pruning (TPA) algorithm. In tree pruning algorithm the whole tree is used for routing. Simulation result shows that our algorithm has lower end to end delay as compared with TPA.