An efficient routing protocol for ad-hoc networks

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A mobile ad-hoc network is infrastructure less, self organizable, multi hop packet switched network. In ad-hoc network, node movements results in dynamic topology and frequent link failures. Studies shows that on demand protocols perform better compared to table driven protocols. Ad-hoc On Demand Routing (AODV) is one of the popular on demand routing protocol. In this paper, we have proposed an innovative method by considering the MAC layer feed back to reduce the route discovery latency and routing overhead of AODV protocol. Also proposed a new approach of preemptive route maintenance to miti gate the delays and overhead incurred during the original AODV. We implemented and simulated the proposed scheme in NS 2. Simulation results show that the pro posed scheme performs better than AODV. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Kumar, C., Tyagi, N., Tripathi, R., Prasanth Kumar, M. L., Sharma, D. K., & Biswash, S. K. (2011). An efficient routing protocol for ad-hoc networks. In Communications in Computer and Information Science (Vol. 190 CCIS, pp. 11–20). https://doi.org/10.1007/978-3-642-22709-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free