A two‐step authentication framework for Mobile ad hoc networks

The lack of fixed infrastructure in ad hoc networks causes nodes to rely more heavily on peer nodes for communication. Nevertheless, establishing trust in such a distributed environment is very difficult, since it is not straightforward for a node to determine if its peer nodes can be trusted. An additional concern in such an environment is with whether a peer node is merely relaying a message or if it is the originator of the message. In this paper, we propose an authentication approach for protecting nodes in mobile ad hoc networks. The security requirements for protecting data link and network layers are identified and the design criteria for creating secure ad hoc networks using several authentication protocols are analyzed. Protocols based on zero knowledge and challenge response techniques are presented and their performance is evaluated through analysis and simulation

Design & Evaluation of Path-based Reputation System for MANET Routing

Most of the existing reputation systems in mobile ad hoc networks (MANET) consider only node reputations when selecting routes. Reputation and trust are therefore generally ensured within a one-hop distance when routing decisions are made, which often fail to provide the most reliable, trusted route. In this report, we first summarize the background studies on the security of MANET. Then, we propose a system that is based on path reputation, which is computed from reputation and trust values of each and every node in the route. The use of path reputation greatly enhances the reliability of resulting routes. The detailed system architecture and components design of the proposed mechanism are carefully described on top of the AODV (Ad-hoc On-demand Distance Vector) routing protocol. We also evaluate the performance of the proposed system by simulating it on top of AODV. Simulation experiments show that the proposed scheme greatly improves network throughput in the midst of misbehavior nodes while requires very limited message overhead. To our knowledge, this is the first path-based reputation system proposal that may be implemented on top of a non-source based routing scheme such as AODV

Data Confidentiality in Mobile Ad hoc Networks

Mobile ad hoc networks (MANETs) are self-configuring infrastructure-less networks comprised of mobile nodes that communicate over wireless links without any central control on a peer-to-peer basis. These individual nodes act as routers to forward both their own data and also their neighbours' data by sending and receiving packets to and from other nodes in the network. The relatively easy configuration and the quick deployment make ad hoc networks suitable the emergency situations (such as human or natural disasters) and for military units in enemy territory. Securing data dissemination between these nodes in such networks, however, is a very challenging task. Exposing such information to anyone else other than the intended nodes could cause a privacy and confidentiality breach, particularly in military scenarios. In this paper we present a novel framework to enhance the privacy and data confidentiality in mobile ad hoc networks by attaching the originator policies to the messages as they are sent between nodes. We evaluate our framework using the Network Simulator (NS-2) to check whether the privacy and confidentiality of the originator are met. For this we implemented the Policy Enforcement Points (PEPs), as NS-2 agents that manage and enforce the policies attached to packets at every node in the MANET.Comment: 12 page

Achieving MANETs Security by Exchanging Path Oriented Keys and Priority Based Secured Route Discovery

In this work, two scenarios are considered, scenario-1 is key based communication and scenario-2 is priority based routing and communication. In scenario-1, MANET works on generated keys called KEY1 and KEY2 to establish communication between nodes. Here source node will have to generate and store a key called KEY2 and destination node will have to generate and store a key called KEY1. When source node initiates communication with destination-node, source node will send a request-packet to destination via shortest/less- cost path (PATH1) without any key mentioning in the packet. Now destination node will send the requested packet and KEY1 to source node via different path other than PATH1 (path of received packet). Source will send KEY2 to destination again through the same path (PATH2). In scenario-2, communication of each node is based on the neighbour node's priority, here, priority-1 being the highest, hence it is highly recommended for communication and priority three is being the lowest and it is rarely recommended for the communication. Nodes in the network classified into 3 types, unknown node, neighbor's known node, non-neighbors known node. Priority of nodes can be evaluated based on the security measures, energy level and other parameters of the node. It can also consider Trust Value (TV) of each node based on the duration spent in active efficient communication. With help of this strategy, we can achieve highly secured route discovery, which will help network to have smooth communication among its node

ADAPTIVE SECURE AND EFFICIENT ROUTING PROTOCOL FOR ENHANCE THE PERFORMANCE OF MOBILE AD HOC NETWORK

Nowadays Mobile Ad Hoc Network (MANET) is an emerging area of research to provide various communication services to end users. Mobile Ad Hoc Networks (MANETs) are self-organizing wireless networks where nodes communicate with each other without a fixed infrastructure. Due to their unique characteristics, such as mobility, autonomy, and ad hoc connectivity, MANETs have become increasingly popular in various applications, including military, emergency response, and disaster management. However, the lack of infrastructure and dynamic topology of MANETs pose significant challenges to designing a secure and efficient routing protocol. This paper proposes an adaptive, secure, and efficient routing protocol that can enhance the performance of MANET. The proposed protocol incorporates various security mechanisms, including authentication, encryption, key management, and intrusion detection, to ensure secure routing. Additionally, the protocol considers energy consumption, network load, packet delivery fraction, route acquisition latency, packets dropped and Quality of Service (QoS) requirements of the applications to optimize network performance. Overall, the secure routing protocol for MANET should provide a reliable and secure communication environment that can adapt to the dynamic nature of the network. The protocol should ensure that messages are delivered securely and efficiently to the intended destination, while minimizing the risk of attacks and preserving the network resources Simulation results demonstrate that the proposed protocol outperforms existing routing protocols in terms of network performance and security. The proposed protocol can facilitate the deployment of various applications in MANET while maintaining security and efficiency

A robust self-organized public key management for mobile ad hoc networks

A mobile ad hoc network (MANET) is a self-organized wireless network where mobile nodes can communicate with each other without the use of any existing network infrastructure or centralized administration. Trust establishment and management are essential for any security framework of MANETs. However, traditional solutions to key management through accessing trusted authorities or centralized servers are infeasible for MANETs due to the absence of infrastructure, frequent mobility, and wireless link instability. In this paper, we propose a robust self-organized, public key management for MANETs. The proposed scheme relies on establishing a small number of trust relations between neighboring nodes during the network initialization phase. Experiences gained as a result of successful communications and node mobility through the network enhance the formation of a web of trust between mobile nodes. The proposed scheme allows each user to create its public key and the corresponding private key, to issue certificates to neighboring nodes, and to perform public key authentication through at least two independent certificate chains without relying on any centralized authority. A measure of the communications cost of the key distribution process has been proposed. Simulation results show that the proposed scheme is robust and efficient in the mobility environment of MANET and against malicious node attacks

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