Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks
Sukhchandan Lally, Ljiljana Trajković · Summit (Simon Fraser University) · 2011
Wireless ad-hoc networks are decentralized wireless networks that do not rely on an infrastructure, such as base stations or access points. Routing protocols in ad-hoc networks specify communication between routers and enable them to select routes between a source and a destination. The choice of the routes is performed by routing algorithms. In this paper, we use OPNET Modeler version 16.0 A to simulate three routing protocols for wireless ad-hoc networks in several Transmission Control Protocol (TCP) and User Datagram Protocol (UDP) scenarios. We analyze route discovery time, end-to-end delay, download response time, and routing traffic overhead in static, less dynamic, and highly dynamic mobility scenarios. Simulation results indicate that Ad-Hoc On-Demand Distance Vector (AODV) protocol is the most flexible when compared to Dynamic Source Routing (DSR) and Optimized Link State Routing (OLSR) protocols in the case of movement. OLSR is the only protocol that meets the end-to-end delay requirements of less than 20 ms.