IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.4, April 2010319
Multicast Multi-path Power Efficient Routing in Mobile ADHOCnetworks
Faculty of Post Graduate Studies, KSR College of Technology, Namakkal, India-637215
Faculty of Computer Science and Engineering, KSR College of Technology, Namakkal, India-637215
The proposal of this paper presents a measurement-basedrouting algorithm to load balance intra domain traffic alongmultiple paths for multiple multicast sources. Multiple paths areestablished using application-layer overlaying. The proposedalgorithm is able to converge under different network models,where each model reflects a different set of assumptions aboutthe multicasting capabilities of the network. The algorithm isderived from simultaneous perturbation stochasticapproximation and relies only on noisy estimates frommeasurements. Simulation results are presented to demonstratethe additional benefits obtained by incrementally increasing themulticasting capabilities. The main application of mobile ad hocnetwork is in emergency rescue operations and battlefields. Thispaper addresses the problem of power awareness routing toincrease lifetime of overall network. Since nodes in mobile adhoc network can move randomly, the topology may changearbitrarily and frequently at unpredictable times. Transmissionand reception parameters may also impact the topology.Therefore it is very difficult to find and maintain an optimalpower aware route. In this work a scheme has been proposed tomaximize the network lifetime and minimizes the powerconsumption during the source to destination routeestablishment. The proposed work is aimed to provide efficientpower aware routing considering real and non real time datatransfer.
Consumption, Lifetime, Perturbation, Stochastic
Multicast traffic over the Internet is growing steadily withincreasing number of demanding applications includingInternet broadcasting, video conferences, data streamapplications and web-content distributions . Many of these applications require certain rate guarantees, anddemand that the network be utilized more efficiently thanwith current approaches to satisfy the rate requirements.Traffic mapping (load balancing) is one particular methodto carry out traffic engineering, which deals with theproblem of assigning the traffic load onto pre-establishedpaths to meet certain requirements. Our focus is toscrutinize the effects of load balancing the multicasttraffic in an intra domain network. The existing work onmulticast routing with power constraints are refer in theliteratures.,,,,.Propose a solution to optimally distribute the traffic alongmultiple multicast trees. However, the solution covers thecase when there is only one active source in the network.In addition, it is assumed that the gradient of an analyticalcost function is available, which is continuouslydifferentiable and strictly convex. These assumptions maynot be reasonable due to the dynamic nature of networks., , .Even though they approach the problem under a moregeneral architecture, practicality of these solutions islimited due to the unrealistic assumption that the network is lossless as long as the average link rates do not exceedthe link capacities. Moreover, a packet loss is actuallymuch more costly when network coding is employed sinceit potentially affects the decoding of a large number of other packets. In addition, any factor that changes the min-cut max-flow value between a source and a receiverrequires the code to be updated at every nodesimultaneously, which brings high level of complexity andcoordination.The proposal in this paper presented a distributed optimalrouting algorithm to balance the load along multiple pathsfor multiple multicast sessions. Our measurement-basedalgorithm does not assume the existence of the gradient of an analytical cost function and is inspired by the unicastrouting algorithm based on Simultaneous PerturbationStochastic Approximation (SPSA). In addition, we addressthe optimal multipath multicast routing problem in a moregeneral framework than having multiple trees. Weconsider different network models with differentfunctionalities.With this generalized framework, our goal is to examinethe benefits observed by the addition of new capabilitiesto the network beyond basic operations such as storingand forwarding. In particular, we will first analyze thetraditional network model without any IP multicastingfunctionality where multiple paths are established using(application-layer) overlay nodes. Next, we consider anetwork model in which multiple trees can beestablished., Finally, look at the generalized modelby allowing receivers to receive multicast packets atarbitrarily different rates along a multicast tree. Such anassumption potentially creates a complex bookkeepingproblem since source nodes have to make sure eachreceiver gets a distinct set of packets from different trees
Manuscript received April 5, 2010Manuscript revised April 20, 2010