Abstract
In this paper, an adaptive routing in Mobile Adhoc Network (MANET) is presented using special neighbors on different routes. The routing table of each node is computed and stored in a metric. The path with the minimum cost is selected as the primary routing path among all feasible paths. The Adhoc On—Demand Distance Vector (AODV) Routing protocol is modified in such a way that only the destination node will respond to a route request which greatly reduces the transmission of control data packets in a network. The performance of modified AODV is evaluated based on metrics such as throughput, packet delivery ratio, and normalized routing overhead.
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 callSimilar Papers
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.
