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

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

Hean-Loong Ong (School of Computer Sciences, Universiti Sains Malaysia, Georgetown, Penang, Malaysia) and Essam Natsheh (College of Applied Studies and Community Services, King Faisal University, Hofuf, Saudi Arabia)
DOI: 10.4018/ijwnbt.2012010103
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

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.
Article Preview

2. Node Density Issues

The nature of our proposed scheme is a combination of the issues of nodes connectivity (density) and broadcast management. In this section, we conducted a survey for both issues.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 6: 2 Issues (2017): Forthcoming, Available for Pre-Order
Volume 5: 2 Issues (2016): 1 Released, 1 Forthcoming
Volume 4: 3 Issues (2015)
Volume 3: 4 Issues (2014)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing