An efficient hop-based routing scheme for mobile Ad-Hoc Networks

Abstract

All reactive routing protocols in Mobile Ad-hoc Network incur latency in route discovery phase whenever a transmission between two nodes is initialized. In this thesis, we propose a new scheme to reduce route discovery latency for these routing protocols, named $\It{HO}p-\It{B}ased \It{A}daptive \It{R}eduction$ (HOBAR). In the route discovery phase of reactive routing protocols, source nodes spend an extra waiting time period to get optimal routes after receiving the first route reply. Our scheme appropriately sets this waiting time period depending on the number of hops in the first Route REPly (RREP). After having received the first RREP, the source nodes get the number of hop from this RREP and use this number to decide how long they should spend to wait for the most optimal routes. Our simulation results show that HOBAR offers fewer hop routes than both AODV routing protocol and RTT-based algorithm. Moreover, HOBAR significantly reduces route discovery latency according to hop-distances and is more scalable in highly loaded and large networks.