On-demand Ad-hoc Routing Protocol Research Articles

A Simulation Study and Comparison of On-Demand Ad-hoc Routing Protocols using QualNet 5. 2

mobile ad-hoc network is a wireless network of mobile devices in which the devices can locate them randomly and thus the network cannot have any fixed or centralized infrastructure. The paper aims to evaluate the performance of two main on-demand ad-hoc routing protocols- AODV and DSR using QUALNET 5.2 network simulator. Here, these protocols are analysed under two network simulation scenarios- varying number of nodes and mobility. Various performance metrics- average end-to-end delay, throughput, packet loss percentage, Packet delivery ratio and average jitter are examined to compare the network performance of these protocols. The simulation results show that DSR outperforms AODV with respect to increasing number of nodes while AODV performs better than DSR with respect to increasing pause time. KeywordsAODV, DSR, Packet delivery ratio, throughput, average end-to-end delay, packet loss percentage and jitter.

An efficient on-demand routing approach with directional flooding for wireless mesh networks

Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

Improving Path Discovery Performance in Dense Mobile Ad Hoc Networks

In on-demand ad-hoc routing protocols, control packets are flooded into a network during path discovery. Especially in dense ad-hoc networks, these protocols generate a large number of broadcast packets that cause contention, packet collisions and battery power wastage in mobile nodes. We propose an efficient route establishment method that adaptively lowers re-broadcasting overhead based on the number of adjacent nodes and the number of routes that these nodes accommodate. Through simulation, we demonstrate that our proposed method is especially efficient in densely populated areas. It achieves efficiency by lowering the number of control packets for path discovery without causing a drop in the path discovery success ratio. Also, by taking path concentration into account, our method further improves packet delivery. We provide useful guidelines based on simulation results.