Open Access Open Access  Restricted Access Subscription or Fee Access

Multicast Multi-path Power Efficient Routing in MANET

M. Raghavendra Rao, K. Eswar, Dr.P. Harini, Syed. Azhad


The proposal of this paper presents a measurement-based routing algorithm to load balance intra domain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application - layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities. The main application of mobile ad hoc network is in emergency rescue operations and battlefields. This paper addresses the problem of power awareness routing to increase lifetime of overall network. Since nodes in mobile ad hoc network can move randomly, the topology may change arbitrarily and frequently at unpredictable times. Transmission and reception parameters may also impact the topology. Therefore it is very difficult to find and maintain an optimal power a ware route. In this work a scheme has been pro posed to maximize the network lifetime and minimizes the power consumption during the source to destination route establishment. The proposed work is aimed to pro vide efficient power aware routing considering real and non real time data transfer.


Consumption, Lifetime, Perturbation, Stochastic

Full Text:



S.-Y. R. Li and R. W. Yeung, “Linear net work coding,” IEEE

Transact ions on Information Theory, vol. 49, pp. 371 –381, 2003. [2] T. Noguchi, T. Mat suda, and M. Yamamoto, “Performance evaluation of new multicast architecture with net work coding,” IEICE Trans. Commun, vol. E86-B, pp. 1788– 1795, 2003.

Y. Zhu, B. Li, and J. Guo, “ Multicast with net work coding in application-layer overlay net works,” IEEE Journal on Selected Areas in Communications, vol. 22, pp. 107–120, 2004.

Li Q, Aslam J, Rus D, “Online Power -aware Rout ing in Wireless Ad-hoc Net works,” Proceedings of Intl Conf. on Mobile Computing and Net working (MobiCom‟2001), 2001.

St ojmenovic I, Lin X. “Power -Aware Localized Routing in Wireless Net 108 works,” IEEE Trans. Parallel and Distributed systems 2001; 12(11):1122-1133.

Doshi S, Brown TX, “Minimum Energy Routing Schemes for a Wireless Ad Hoc Net work,” Proceedings of t he Conference on Computer Communications (IEEE Infocom 2002), 2002.

Woo K, Yu C et al., “Localized Routing Algorithm for Balanced Energy Consumption in Mobile Ad Hoc Net works,” Proc. of Int'l Symp. on Modeling, Analysis and Simulation of Computer and Telecommunication Systems 2001,117 -124.

Toh C-K,“Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad hoc Net works,” IEEE Communications Magazine, vol. 39, no. 6, pp. 138 -147, June 2001.

M. Adamou and S.Sarkar, “A Framework for Optimal Battery Management for Wireless Nodes,” Proceedings of IEEE INFOCOMP 2002, pp. 1783-1792.

C. F. Chiasserini, and R. R. Rao, “Improving Battery Performance by Using Traffic Shaping Policies,” IEEE Journal on Select ed Areas of Communications, vol. 19, no. 7, pp. 1385 -1394, July 2001.

S. Agarwal, A. Ahuja, and J. P. Singh, “Rout e –Lifetime Assessment -Based Routing (RABR) for Mobile Ad Hoc Net works,” Proceedings of IEEE ICC 2000, vol. 3,pp. 1697 -1701, June 2000.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.