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.

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.