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, Essam Natsheh
Copyright: © 2012 |Pages: 20
DOI: 10.4018/ijwnbt.2012010103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $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
Top

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
Volume 12: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 11: 2 Issues (2022): 1 Released, 1 Forthcoming
Volume 10: 2 Issues (2021)
Volume 9: 2 Issues (2020)
Volume 8: 2 Issues (2019)
Volume 7: 2 Issues (2018)
Volume 6: 2 Issues (2017)
Volume 5: 1 Issue (2016)
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