Effect of Nodes Mobility on Density-Based Probabilistic Routing Algorithm in Ad-hoc Networks

Hean-Loong Ong, Essam Natsheh · International Journal of Wireless Networks and Broadband Technologies · 2012

Density-based probabilistic routing algorithm (AODV–Probabilistic) has been introduced for mobile ad hoc networks. Under ideal settings, it has been proven to provide drastic performance improvement over AODV and OLSR routing protocols. In this paper, the authors study the effect of inaccurate location information caused by node mobility under a rich set of scenarios. They identify three different environments: a high density, a variable density and a sparse density. Simulation results show noticeable improvement under the three environments. Under the settings the authors examine, their proposed algorithm achieve up to 22% longer links lifetime than AODV and 45 percent longer links lifetime than OLSR at the three environments, on average, without incurring any additional routing overheads or intense computation.

Read the paper · More papers on PaperTik