English abstract
Wireless ad hoc networks are decentralized wireless networks. Each node in the ad hoc networks is willing to forward data for other nodes. The network connectivity dynamically determines which nodes forward data. The ad hoc network allows users to access information and services anywhere and anytime. It is a self-organizing network that might consist of thousands of devices. Ad hoc networks are used in emergency search-and-rescue operations or for data acquisition operations in inhospitable environments. They have special limitations such as limited bandwidth, highly dynamic topology, and limited range of links due to the nature of the network. One of the most important tasks is to deliver data from one device to another. Several routing algorithms were proposed and evaluated in the recent years.
This project conducts a comparative performance evaluation of selected routing protocols for ad hoc networks including AODV and OLSR. The project studies performance characteristics of the selected protocols using the NS-2 simulator. We measure the end-to-end delay, average routing distance and percentage of lost packets for different conditions of network load, network size and mobility intervals. We have derived some results and conclusions for these experiments:
t much affected by changes in mobility as it establishes optimal paths to destinations. The percentage of lost packets in AODV is less than the percentage of lost packets in OLSR. In large networks, using AODV may be preferred over OLSR to reduce the amount of overhead. If the Ad-hoc networks are established for emergency and rescue purposes then, OLSR will be more helpful as the paths are optimal and ready and hence the delay is less compared with AODV. Keywords: Ad-hoc wireless network, routing protocol, performance evaluation, simulation.
