Network connectivity based power-aware routing algorithm for Mobile Ad Hoc Networks Online publication date: Fri, 11-Mar-2011
by G. Varaprasad
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 7, No. 2, 2011
Abstract: Mobile Ad Hoc Network (MANET) is a decentralised network, which consists of mobile nodes. In this paper, we propose an efficient routing algorithm for the MANETs. Here, we use two metrics namely minimum total transmission power and network connectivity over the network. The proposed work has been simulated using .Net and has compared with the existing algorithms such as DSR, Minimum Total Transmission Power Routing (MTPR) and Min-Max Battery Cost Routing (MMBCR). The simulation results have proved that the proposed model has reached at top position in terms of the number of nodes with zero-remaining energy and throughput. If the mobility of the node is 25 m/s, then the proposed model, MTPR model, MMBCR model and AODV model have transmitted 68%, 50%, 59% and 62% of the data packets, respectively. At 700 s, the number of nodes with zero-remaining energy in the proposed model is 5, whereas in the AODV model, MTPR model and MMBCR model the number of nodes with zero-remaining energy was 39, 22 and 7, respectively.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook