Neighbor-Based Dynamic Connectivity Factor Routing Protocol for Mobile Ad Hoc Network

Recently, Mobile Ad hoc Networks (MANETs) have witnessed rapid development due to the low cost, diversity, and simplicity of mobile devices. Such devices can form a reliable network in a short time for use as a rescue information system after a natural disaster, where the communication infrastructure may no longer be available or accessible. Because the nodes in such a network are free to move at any time in the absence of centralized control, routing is considered to be the most challenging issue. Moreover, some routing protocols, such as Neighbor Coverage-Based Probabilistic Rebroadcast (NCPR), completely rely on preset variables, which are required to be set by the system administrator based on the scenario. Unfortunately, the setting that is proper for a specific scenario is not suitable for another scenario. In addition, some other routing protocols, such as Ad hoc On-demand Distance Vector (AODV), employ the Route REQuest message (RREQ) flooding scheme to find a path to a particular destination in the route discovery stage. Although the flooding scheme guarantees better reachability, it introduces undesirable routing overhead, which in turn leads to system performance degradation. Thus, this paper proposes a novel routing protocol, neighbor-based Dynamic Connectivity Factor routing Protocol (DCFP), that is able to dynamically probe the status of the underlying network without the intervention of a system administrator based on a novel connectivity metric, while reducing the RREQ overhead using a new connectivity factor. Furthermore, extensive simulation experiments are conducted to evaluate the performance of the proposed DCFP, where the NCPR and AODV are used as a benchmark. The proposed DCFP manages to address the need for preset variables in NCPR. Simulation results show that DCFP outperforms both NCPR and AODV in terms of end-to-end delay, normalized routing overhead, MAC collision, energy consumption, network connectivity, and packet delivery ratio due to its novel mechanism for reducing redundant RREQ.

[1]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[2]  K. Raja Sekhar,et al.  A Neighbor Coverage based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad hoc Networks , 2014 .

[3]  Yazeed Al-Sbou,et al.  Introduction to Mobile Ad-Hoc and Vehicular Networks , 2015 .

[4]  Pascal Lorenz,et al.  An adaptive approach for information dissemination in Vehicular Ad hoc Networks , 2011, Journal of Network and Computer Applications.

[5]  Subramaniam Shamala,et al.  A scalable neighbor-based routing protocol for mobile ad hoc networks , 2016, Int. J. Distributed Sens. Networks.

[6]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[7]  Nitin H. Vaidya,et al.  GeoTORA: a protocol for geocasting in mobile ad hoc networks , 2000, Proceedings 2000 International Conference on Network Protocols.

[8]  Haïdar Safa,et al.  PHAODV: Power aware heterogeneous routing protocol for MANETs , 2014, J. Netw. Comput. Appl..

[9]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[10]  Nitin H. Vaidya,et al.  Geocasting in mobile ad hoc networks: location-based multicast algorithms , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[11]  Aminu Mohammed,et al.  An Efficient Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks , 2007, EPEW.

[12]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[13]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[14]  M. Ould-Khaoua,et al.  Neighbour coverage: A dynamic probabilistic route discovery for mobile ad hoc networks , 2008, 2008 International Symposium on Performance Evaluation of Computer and Telecommunication Systems.

[15]  Zygmunt J. Haas,et al.  The Interzone Routing Protocol (IERP) for Ad Hoc Networks , 2002 .

[16]  Xinming Zhang,et al.  A Neighbor Coverage-Based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad Hoc Networks , 2013, IEEE Transactions on Mobile Computing.

[17]  Tadeusz A. Wysocki,et al.  Scalability of MANET routing protocols for heterogeneous and homogenous networks , 2010, Comput. Electr. Eng..

[18]  Qi Zhang,et al.  Probabilistic broadcasting based on coverage area and neighbor confirmation in mobile ad hoc networks , 2004, IEEE Global Telecommunications Conference Workshops, 2004. GlobeCom Workshops 2004..

[19]  Daniel Gutiérrez-Reina,et al.  A survey on probabilistic broadcast schemes for wireless ad hoc networks , 2015, Ad Hoc Networks.

[20]  Ahmed Yassin Al-Dubai,et al.  A new dynamic counter-based broadcasting scheme for Mobile Ad hoc Networks , 2011, Simul. Model. Pract. Theory.

[21]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.