Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Ong, Hean-Loong; | Natsheh, Essam | Wan, Tat-Chee
Affiliations: School of Computer Sciences, University Sains Malaysia, Penang, Malaysia. E-mail: loongx2@gmail.com | College of Applied Studies and Community Services, King Faisal University, Riyadh, Saudi Arabia. E-mail: dr_natsheh@hotmail.com | School of Computer Sciences/National Advanced IPv6 Centre, University Sains Malaysia, Penang, Malaysia. E-mail: tcwan@cs.usm.my
Note: [] Corresponding author: Hean-Loong Ong, School of Computer Sciences, University Sains Malaysia, 11800 USM, Penang, Malaysia. E-mail: loongx2@gmail.com.
Abstract: Ad-hoc networks can operate even when there is a scarcity of network infrastructure. This research examines ad-hoc networks that have varying node densities. These environments can be found in areas struck by disasters to urban city environments. Mobile nodes would not distribute evenly in such environments. Instead, the nodes would likely concentrate around specific landmarks or areas such as public squares with a high number of pedestrians while connecting roads and highways that have a low density of mobile nodes. The main contribution was the integration of a density based probabilistic scheme on AODV to reduce incurred routing overheads and improve packet delivery without significantly affecting the throughput and end to end delays. The proposed AODV–P (AODV–Probabilistic) protocol was compared against the AODV and OLSR protocols via simulation. The evaluation was based on three different environments: a high density, a variable density and a sparse density. The study showed that the AODV–P had a 28% higher data throughput than AODV and a 42% higher data throughput than OLSR at the three environments. Other performance parameters also showed that AODV–P performed better than AODV or OLSR in sub-optimal network environments due to the improved link lifetimes and lower routing overheads.
Keywords: Mobile ad-hoc networks, density based probabilistic algorithm, nodes density, nodes connectivity management, broadcast management
DOI: 10.3233/JHS-2012-0450
Journal: Journal of High Speed Networks, vol. 18, no. 2, pp. 83-114, 2011
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl