Neighbour-based on-demand routing algorithms for mobile ad hoc networks

Mobile Ad hoc NETwork (MANET) is a set of wireless mobile nodes temporary connected without existing network infrastructure or centralized administrations. These nodes with random movement and limited resources have created quite a number of new challenging research issues. One such issue is the routing, which has recently received significant attention from many researchers. In particular, the problems of the dropping decision, routing overhead and network density in the route request stage. The routing overhead is due to the broadcasting method used in route discovery, which floods the network with a Route REQust message (RREQ). Accordingly, the aim of this research is to address the deficiency of the broadcasting method at route request stage. To overcome the issues related to the broadcasting method, several routing algorithms have been proposed over the Ad hoc on demand Distance Vactor (AODV) such as Neighbor Coverage-Based Probabilistic Rebroadcast (NCPR). Although the NCPR did overcome the AODV routing algorithm in terms of reducing the routing overhead, such algorithm has its drawbacks. Thus, there is a room for further enhancement to develop a routing algorithm as to mitigate the drawbacks with the NCPR. The dropping decision of the redundant RREQ in the NCPR algorithm completely relies on preset variables, such variables require to be set by the system administrator based on the scenario. Unfortunately, the setting which is proper for a specific scenario is not suitable for another. Furthermore, the connectivity factor which is used to estimate the connectivity ratio at each node is still unable to estimate such ratio accurately. Therefore, a Dynamic Connectivity Factor Probabilistic (DCFP) is proposed, based on a novel formula that dynamically adjusts the dropping decision based on the neighbor information gathered from the node itself. As the number of nodes or the network traffic load increases, the NCPR fails to relieve the routing overhead due to the increase in the RREQ redundant messages. Thus, a Scalable Neighbor-Based Routing algorithm (SNBR) is proposed, which reduces the routing overhead in the NCPR, by eliminating the redundant RREQ. The broadcasting in this algorithm is governed by the inverse relation between the number of neighbors and the probability of the rebroadcasted RREQ messages. This algorithm enhances the network performance, even though the network is experiencing an increase in the number of nodes or traffic load. Naturally, nodes in MANET are free to move forming an arbitrary topology and at any time the network density may change . Such change may lead to an extreme performance degradation, especially when the routing algorithm relies on fixed threshold values in the dropping decision. Accordingly, a Novel Density-Aware Routing algorithm (NDAR) is proposed. The proposed algorithm totally eliminates the need for fixed threshold values through the use of a novel formula that can easily estimate the node density and replace the fixed threshold value based on the neighbor information. All the three proposed algorithms are evaluated using discrete event simulation, in particular Network Simulator tool (NS2), and compared with the latest routing algorithm (NCPR ) and fundamental algorithm (AODV) using five performance metrics. The first algorithm DCFP outperforms the NCPR algorithm in terms of normalize routing overhead by 11.27%, while maintaining the same packet delivery ratio. In addition, with regard to the second algorithm SNBR, the results show that SNBR overcomes the NCPR algorithm terms of normalize routing overhead by 58.80% as its due to its dropping factor. Furthermore, the third algorithm NDAR presents further enhancement and better performance in all five performance metrics as compared to NCPR and AODV algorithms in a low or high density of nodes. In terms of the applications, The DCFP is more suitable to be used for education applications, while the SNBR is a good algorithm designed to be used for rescue system as data and energy is the main concern. Finally, the NDAR is more suitable for personal area and home networking

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 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

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

An efficient group-based control signalling within proxy mobile IPv6 protocol

Providing a seamless handover in the Internet of Thing (IoT) applications with minimal efforts is a big challenge in mobility management protocols. Several research efforts have been attempted to maintain the connectivity of nodes while performing mobility-related signalling, in order to enhance the system performance. However, these studies still fall short at the presence of short-term continuous movements of mobile nodes within the same network, which is a requirement in several applications. In this paper, we propose an efficient group-based handoff scheme for the Mobile Nodes (MNs) in order to reduce the nodes handover during their roaming. This scheme is named Enhanced Cluster Sensor Proxy Mobile IPv6 (E-CSPMIPv6). E-CSPMIPv6 introduces a fast handover scheme by implementing two mechanisms. In the first mechanism, we cluster mobile nodes that are moving as a group in order to register them at a prior time of their actual handoff. In the second mechanism, we manipulate the mobility-related signalling of the MNs triggering their handover signalling simultaneously. The efficiency of the proposed scheme is validated through extensive simulation experiments and numerical analyses in comparison to the state-of-the-art mobility management protocols under different scenarios and operation conditions. The results demonstrate that the E-CSPMIPv6 scheme significantly improves the overall system performance, by reducing handover delay, signalling cost and end-to-end delay