Conventional Mobile Ad-hoc Networks Research Articles

A Novel Cryptography-Based Multipath Routing Protocol for Wireless Communications

Communication in a heterogeneous, dynamic, low-power, and lossy network is dependable and seamless thanks to Mobile Ad-hoc Networks (MANETs). Low power and Lossy Networks (LLN) Routing Protocol (RPL) has been designed to make MANET routing more efficient. For different types of traffic, RPL routing can experience problems with packet transmission rates and latency. RPL is an optimal routing protocol for low power lossy networks (LLN) having the capacity to establish a path between resource constraints nodes by using standard objective functions: OF0 and MRHOF. The standard objective functions lead to a decrease in the network lifetime due to increasing the computations for establishing routing between nodes in the heterogeneous network (LLN) due to poor decision problems. Currently, conventional Mobile Ad-hoc Network (MANET) is subjected to different security issues. Weathering those storms would help if you struck a good speed-memory-storage equilibrium. This article presents a security algorithm for MANET networks that employ the Rapid Packet Loss (RPL) routing protocol. The constructed network uses optimization-based deep learning reinforcement learning for MANET route creation. An improved network security algorithm is applied after a route has been set up using (ClonQlearn). The suggested method relies on a lightweight encryption scheme that can be used for both encryption and decryption. The suggested security method uses Elliptic-curve cryptography (ClonQlearn+ECC) for a random key generation based on reinforcement learning (ClonQlearn). The simulation study showed that the proposed ClonQlearn+ECC method improved network performance over the status quo. Secure data transmission is demonstrated by the proposed ClonQlearn + ECC, which also improves network speed. The proposed ClonQlearn + ECC increased network efficiency by 8-10% in terms of packet delivery ratio, 7-13% in terms of throughput, 5-10% in terms of end-to-end delay, and 3-7% in terms of power usage variation.

A mathematical framework for link failure time estimation in MANETs

Mobile ad-hoc network (MANET) is an infrastructure-less network of mobile nodes, connected by wireless links. Although mobility is the key characteristic of MANETs, yet the frequent movement of nodes may lead to link failure. This frequent topology change due to evasive mobility is one of the primary reason of Quality of service (QoS) degradation in conventional MANETs. If link failure time of already established root is estimated in advance, data packet loss can be avoided by exploring alternate path well within time. Thus, accurate link failure time estimation is one of the key areas that have drawn the attention of researchers of the ad-hoc networking community. This paper outlines a least-square quadratic polynomial regression-based technique for estimating link failure time by using the signal strength of received data packets. The distance between the transmitting and receiving nodes is calculated from the received signal strength of data packets. The authors have generated an optimal error quadratic model between this node distance and data packet arrival time. After quadratic model formulation, the link failure time is estimated by finding the moment at which the maximum communication range will be achieved for considered transmitter–receiver pair. A detailed analysis has been done for observing the behaviour of link failure time estimation accuracy of the proposed technique with varying network parameters. The repercussion of mobility variation on estimated link failure time has also been analysed. The proposed technique has also been compared with an existing interpolation-based technique. Network Simulator 2.35 has been selected as the primary simulation tool along with BonnMotion and MOVE tool for various mobility scenarios generation.

Game Theory Analysis and Modeling of Sophisticated Multi-Collusion Attack in MANETs

Mobile Adhoc Network (MANET) has been a core topic of research since the last decade. Currently, this form of networking paradigm is increasingly being construed as an integral part of upcoming urban applications of Internet-of-Things (IoT), consisting of massive connectivity of diverse types of nodes. There is a significant barrier to the applicability of existing routing approaches in conventional MANETs when integrated with IoT. This routing mismatch can lead to security risks for the MANET-based application tied with the IoT platform. This paper examines a pragmatic scenario as a test case wherein the mobile nodes must exchange multimedia signals for supporting real-time streaming applications. There exist two essential security requirements viz. i) securing the data packet and ii) understanding the unpredictable behavior of the attacker. The current study considers sophistication on the part of attacker nodes. They are aware of each other’s identity and thereby collude to conduct lethal attacks, which is rarely reflected in existing security modeling statistics. This research harnesses the potential modeling aspect of game theory to model the multiple-collusion attacker scenario. It contributes towards i) modeling strategies of regular/malicious nodes and ii) applying optimization principle using novel auxiliary information to formulate the optimal strategies. The model advances each regular node’s capability to carry out precise computation about the opponent player’s strategy prediction, i.e., malicious node. The simulation outcome of the proposed mathematical model in MATLAB ascertains that it outperforms the game theory’s baseline approach.

Real-time routing algorithm for mobile ad hoc networks using reinforcement learning and heuristic algorithms

Mobile ad hoc networks (MANETs) consist of a set of nodes which can move freely and communicate with each other wirelessly. Due to the movement of nodes and unlike wired networks, the available routes used among the nodes for transmitting data packets are not stable. Hence, proposing real-time routing protocols for MANETs is regarded as one of the major challenges in this research domain. Algorithms compatible with the changes created in the network due to the nodes' movements are of high significance. For reducing data packet transmission time among nodes, not only should route shortness be considered but also route stability should be taken into consideration. Since available factors in different environments have specific behavior patterns especially in human environments, the parameters of link stability and route shortness were taken into consideration and the reinforcement learning was used to propose a method so as to make the best choice among the neighbors at any moment to transmit a packet to the destination. That is, the proposed method was aimed at predicting the behavior pattern of the nodes in relation to the target node through using reinforcement learning. The proposed method used Q-learning algorithm which has more homogeneity to estimate the value of actions. Simulation results in OPNET demonstrate the superiority of the proposed scheme over conventional MANET routing methods.

SCIDR: A Scalable Cluster based Inter-Domain Routing Protocol for Heterogeneous MANET

The area of Mobile Ad-hoc Network (MANET) has already been a topic of attention from past decade among the research community owing to its potential communication advantages as well as issues associated with it. However, the cases of inter-domain routing in the MANET have challenges furthermore compared to conventional MANET system. Border gateway protocol cannot be applied to support interdomain routing in mobile ad-hoc network as it cannot support the dynamic behavior of MANET. Hence, the this paper proposes a novel technique called as SCIDR-Scalable Cluster based Inter-domain Routing that is meant exclusively for heterogeneous MANET system. SCIDR is designed on a totally different principle compared to standard CIDR protocol, where CSI-Channel State Information, as well as channel correlation factor, are introduced to leverage further outcomes. For the first time, extensive performance parameters are used to benchmark the proposed system that ensures effective scalability.

The capacity of aeronautical ad-hoc networks

Currently aeronautical communications are extremely limited by the Aeronautical Telecommunications Network standard, which does not support the inter-aircraft communications directly. To this end, we consider an aeronautical ad-hoc network based on a single flight path, whereby the aircrafts in the cruise stage can communicate with each other through multi-hop relays without the aid of ground stations. Due to the special topology of this network model, existing results based on the conventional mobile ad-hoc networks are not applicable for determining its capacity scaling law. In this paper, we prove the upper bound on the per-node capacity and construct a simple transmission scheduling scheme to achieve the lower bound.

Routing in the presence of groups in mobile ad hoc networks

A mobile ad hoc network (MANET) is a collection of cooperative mobile nodes that communicate over a shared wireless medium, in the absence of a supporting infrastructure such as base stations. It is envisaged that MANETs will serve applications in which a group of mobile nodes collaborate to carry out a specific task, for instance, a group of mobile tourists taking a city tour. Mobile nodes participating in a group adhere to a movement pattern that maintains spatial proximity between all group members. The coordinated motion of group members and the resulting group-wise clustering of nodes, as well as the atypical traffic requirements of group mobility scenarios present a substantially different networking environment than in conventional MANETs. A routing protocol specifically tailored to exploit group mobility is, therefore, designed in this work. A service discovery-based approach to the creation of groups at the application layer and their configuration at the routing layer is first described. Next, a hierarchical design of the routing protocol that discriminates between intra- and inter-group communications is proposed. A performance evaluation of the protocol is done in network simulator-2 (ns-2).