Impact of Varying Offered Data Load on Density-Based Routing in Mobile Ad-hoc Networks
Essam Natsheh
Journal of Networking Technology, Vol. 6, No. 3, 2015.
DOI: 
Link: http://www.dline.info/jnt/fulltext/v6n3/v6n3_1.pdf
Abstract:
We present a new algorithm called Density-based probabilistic routing algorithm (AODVâ€“Probabilistic) for
efficient data transmission in mobile ad-hoc networks. We also define a new metric for routing called traffic density to
represent the degree of contention at the medium access control layer. To evaluate the performance of our proposed protocol,
we 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 we examine, our proposed algorithm achieve up to
22 percent higher percentage of average data throughput for different offered data loads and speeds than AODV and 30
percent higher than OLSR at the three environments without incurring any additional routing overheads or intense computation.