A scalable neighbor-based routing protocol for mobile ad hoc networks

Broadcasting is an essential and effective mechanism used to disseminate data on several types of networks such as mobile ad hoc network. Such method is adopted by a considerable number of routing protocols, in particular, in the route discovery stage since the broadcasting is easy to implement and...

Full description

Bibliographic Details
Main Authors: Ejmaa, Ali Mohamed E., Subramaniam, Shamala, Ahmad Zulkarnain, Zuriati, Mohd Hanapi, Zurina
Format: Article
Language:English
Published: Hindawi Publishing Corporation 2016
Online Access:http://psasir.upm.edu.my/id/eprint/54931/
http://psasir.upm.edu.my/id/eprint/54931/1/A%20Scalable%20Neighbor-based%20Routing%20Protocol%20for%20Mobile%20Ad%20Hoc%20Networks.pdf
_version_ 1848852669612949504
author Ejmaa, Ali Mohamed E.
Subramaniam, Shamala
Ahmad Zulkarnain, Zuriati
Mohd Hanapi, Zurina
author_facet Ejmaa, Ali Mohamed E.
Subramaniam, Shamala
Ahmad Zulkarnain, Zuriati
Mohd Hanapi, Zurina
author_sort Ejmaa, Ali Mohamed E.
building UPM Institutional Repository
collection Online Access
description Broadcasting is an essential and effective mechanism used to disseminate data on several types of networks such as mobile ad hoc network. Such method is adopted by a considerable number of routing protocols, in particular, in the route discovery stage since the broadcasting is easy to implement and certainly provides an ideal connectivity among nodes. However, the broadcasting increases the routing overhead, packet delay, which negativity affects the throughput due to the excessive use of the redundant Route REQuest message. In addition, the network is susceptible to so-called broadcast storm problem. Therefore, developing a new routing protocol, which is able to relieve the unnecessary Route REQuest messages while boosting the performance of the network, is required. In this article, a novel routing protocol for mobile ad hoc network, called scalable neighbor-based mobile routing, is proposed. The broadcasting in this protocol is governed by the inverse relation between the number of neighbors and the probability of the rebroadcasted Route REQuest messages. Extensive simulation experiments are carried out to evaluate the performance of the proposed protocol and to compare the state-of-the-art protocols, namely, neighbor coverage-based probabilistic rebroadcast, with the latest version of ad hoc on-demand distance vector protocol. Simulation results show that scalable neighbor-based mobile routing outperforms both protocols, the neighbor coverage-based probabilistic rebroadcast and the ad hoc on-demand distance vector, in terms of routing overhead, medium access control collision, end-to-end delay, packet delivery ratio, and energy consumption.
first_indexed 2025-11-15T10:41:45Z
format Article
id upm-54931
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T10:41:45Z
publishDate 2016
publisher Hindawi Publishing Corporation
recordtype eprints
repository_type Digital Repository
spelling upm-549312018-06-12T06:58:24Z http://psasir.upm.edu.my/id/eprint/54931/ A scalable neighbor-based routing protocol for mobile ad hoc networks Ejmaa, Ali Mohamed E. Subramaniam, Shamala Ahmad Zulkarnain, Zuriati Mohd Hanapi, Zurina Broadcasting is an essential and effective mechanism used to disseminate data on several types of networks such as mobile ad hoc network. Such method is adopted by a considerable number of routing protocols, in particular, in the route discovery stage since the broadcasting is easy to implement and certainly provides an ideal connectivity among nodes. However, the broadcasting increases the routing overhead, packet delay, which negativity affects the throughput due to the excessive use of the redundant Route REQuest message. In addition, the network is susceptible to so-called broadcast storm problem. Therefore, developing a new routing protocol, which is able to relieve the unnecessary Route REQuest messages while boosting the performance of the network, is required. In this article, a novel routing protocol for mobile ad hoc network, called scalable neighbor-based mobile routing, is proposed. The broadcasting in this protocol is governed by the inverse relation between the number of neighbors and the probability of the rebroadcasted Route REQuest messages. Extensive simulation experiments are carried out to evaluate the performance of the proposed protocol and to compare the state-of-the-art protocols, namely, neighbor coverage-based probabilistic rebroadcast, with the latest version of ad hoc on-demand distance vector protocol. Simulation results show that scalable neighbor-based mobile routing outperforms both protocols, the neighbor coverage-based probabilistic rebroadcast and the ad hoc on-demand distance vector, in terms of routing overhead, medium access control collision, end-to-end delay, packet delivery ratio, and energy consumption. Hindawi Publishing Corporation 2016-09-06 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/54931/1/A%20Scalable%20Neighbor-based%20Routing%20Protocol%20for%20Mobile%20Ad%20Hoc%20Networks.pdf Ejmaa, Ali Mohamed E. and Subramaniam, Shamala and Ahmad Zulkarnain, Zuriati and Mohd Hanapi, Zurina (2016) A scalable neighbor-based routing protocol for mobile ad hoc networks. International Journal of Distributed Sensor Networks, 12 (9). pp. 1-12. ISSN 1550-1329; ESSN: 1550-1477 10.1177/1550147716665501
spellingShingle Ejmaa, Ali Mohamed E.
Subramaniam, Shamala
Ahmad Zulkarnain, Zuriati
Mohd Hanapi, Zurina
A scalable neighbor-based routing protocol for mobile ad hoc networks
title A scalable neighbor-based routing protocol for mobile ad hoc networks
title_full A scalable neighbor-based routing protocol for mobile ad hoc networks
title_fullStr A scalable neighbor-based routing protocol for mobile ad hoc networks
title_full_unstemmed A scalable neighbor-based routing protocol for mobile ad hoc networks
title_short A scalable neighbor-based routing protocol for mobile ad hoc networks
title_sort scalable neighbor-based routing protocol for mobile ad hoc networks
url http://psasir.upm.edu.my/id/eprint/54931/
http://psasir.upm.edu.my/id/eprint/54931/
http://psasir.upm.edu.my/id/eprint/54931/1/A%20Scalable%20Neighbor-based%20Routing%20Protocol%20for%20Mobile%20Ad%20Hoc%20Networks.pdf