Access Restriction

Author Ch, Prem ♦ Kumar, Deepak
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Mobile Node ♦ Rreq Packet ♦ Wireless Link ♦ Hop Count ♦ Hop Count Node ♦ Route Request Packet Aodv ♦ New Route ♦ Stale Link ♦ Many Challenge ♦ Rrep Packet ♦ Limited Processing Capability ♦ Mobile Ad-hoc Network ♦ Short Battery Backup ♦ Ad-hoc Network ♦ Protocol Aodv ♦ Network Topology ♦ Simulation Result
Abstract Mobile Ad-hoc networks are the collection of mobile nodes connected by a wireless link, where each node acts as a router. Ad-hoc networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology: thus the need for a robust dynamic routing protocol that can accommodate such an environment. In addition to this routing protocols face many challenges like short battery backup, limited processing capability. Two protocols AODV and DSR have compared in terms of number of routes selected, number of hop counts, number of RREQ packets and number of RREP packets. Simulation results shows that AODV compared with DSR reduces the number of hop count nodes, we will also see that AODV has less number of routes as compare to DSR, which helps AODV to be more efficient and less bulky. While comparing route request packets AODV is again better with good some of packets which made it more efficient in finding a new route and each time in replacing a stale link.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study