Abstract
In the mobile ad hoc network (MANET), mobile devices can move randomly without any specific pattern of their movements. When the devices remain within their coverage, they can share their information through the wireless channel. They do not need any fixed infrastructure and cannot contact each other when they remain out of the communication range and called the unreachable nodes. The routing complexity within the ad-hoc network is high because of the high chance that some nodes can be unreachable at any time or the communication links can be broken. This chapter investigates two important routing techniques— Destination-Sequenced Distance-Vector routing (DSDV) and Ad Hoc On-Demand Distance Vector (AODV) by comparing their performance using the OMNeT++ simulator in terms of delivery, packet loss, delay, and packet throughput for changing the number of nodes, the speeds of nodes, and packet lengths. The investigated outcome indicates that AODV routing exhibits a higher delivery ratio, lower packet loss, and high throughput than DSDV. However, AODV routing shows higher average delays than DSDV.
Published Version
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