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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.