Authenticated Routing For Ad Hoc Networks Research Articles

S-Octopus: A Novel Scalable Secure Position-Based Routing Protocol for MANETs

Mobile Ad-Hoc Networks (MANET) are self-organized wireless networks that are becoming progressively popular. Determining an efficient route leading from a source to a specific destination in these networks is an essential issue since nodes are continuously moving. Furthermore, finding a secure route is a difficult area to deal with since adversaries might insert themselves into these routes unless a strict secure routing procedure is implemented. In this paper, a novel scalable secure routing protocol called S-Octopus has been proposed. Via dividing the network area into sectors and utilizing restricted directional flooding, our protocol intents to achieve improved scalability. Moreover, S-Octopus seeks to enhance robustness against the single point of failure and compromise by introducing several Sector Certificate Authority servers. Together with S-Octopus a location service and a misbehavior detection system have been proposed. Using GloMoSim simulator, S-Octopus security and performance have been evaluated and compared with the basic Authenticated Routing for Ad-Hoc Networks (ARAN) as well as Zone-based Authenticated Routing for Ad-Hoc Networks (ARANz). Simulation results assure that S-Octopus is able to effectively initiate and maintain secure routes in MANETs. Results also confirm that S-Octopus has significantly mitigated the scalability problem by achieving the maximum packet delivery fraction and the minimum network and routing loads within fairly large networks with high-mobility nodes and large malicious node percentage. Thus, S-Octopus is a good choice for MANET established among students on a campus or peers at a conference, where keys and certificates might be previously deployed.

A more secure and scalable routing protocol for mobile ad hoc networks

ABSTRACTAn essential problem in mobile ad hoc networks is finding an efficient and secure route from a source to an intended destination. In this paper, we have proposed a new model of routing protocol named ARANz, which is an extension of the original Authenticated Routing for Ad Hoc Networks (ARAN). ARANz adopts the authentication methods used with ARAN and aims to increase security, achieve robustness and solve the single point of failure and attack problems by introducing multiple local certificate authority servers. Additionally, via dealing with the network as zones and using restricted directional flooding, our new model exhibits better scalability and performance. Through simulation, we evaluated ARANz and compared it with the original ARAN as well as Ad Hoc On‐demand Distance Vector. Simulation results show that ARANz is able to effectively discover secure routes within relatively large networks with large number of mobile nodes, while maintaining the minimum packet routing load. Copyright © 2012 John Wiley & Sons, Ltd.

A Secure Routing Protocol to Eliminate Integrity, Authentication and Sleep Deprivation Based Threats in Mobile Ad hoc Network

Problem statement: Network security in Mobile Ad hoc Network (MANET) is a major issue. Some of the attacks such as modification, impersonation, Time To Live (TTL) and sleep deprivation are due to misbehaviour of malicious nodes, which disrupts the transmission. Some of the existing security protocols such as ARAN, SAODV and SEAD are basically used to detect and eliminate one or two types of attacks. The major requirement of a secure protocol is to prevent and eliminate many attacks simultaneously which will make the MANETs more secured. Approach: We propose the algorithm that can prevent and also eliminate multiple attacks simultaneously, called MIST algorithm (Modification, Impersonation, Sleep deprivation and TTL attacks). This algorithm is written on Node Transition Probability (NTP) based protocol which provides maximum utilization of bandwidth during heavy traffic with less overhead. Thus this has been named MIST NTP. Results: The proposed MIST NTP has been compared with NTP without the MIST algorithm, Authenticated Routing for Ad hoc Networks (ARAN) and Ad hoc on Demand Distance Vector (AODV). Extensive packet level simulations show that MIST NTP produces around 10% less end to end delay than ARAN, it even drops 30% fewer packets compared to malicious NTP on an average and around 50-60% fewer packets compared to AODV during multiple attacks. Conclusion: The results ensure that MIST NTP can break the greatest security challenge prevailing in MANETs by securing the MANET against several attacks at once.

A Scalable and Secure Position-Based Routing Protocols for Ad-Hoc Networks

Mobile Ad-Hoc Networks (MANETs) are becoming increasingly popular as more and more mobile devices find their way to the public. A crucial problem in Ad-Hoc networks is finding an efficient route between a source and a destination. Due to MANET’s inherent characteristics, secure routing may be one of the most difficult areas to tackle because opponents can add themselves to a MANET using the existing common routing protocols. Hence, this paper proposed a new model of routing protocol called ARANz, which is an extension of the original Authenticated Routing for Ad-Hoc Networks (ARAN). Apart from the authentication methods adopted from ARAN, ARANz aims to increase security, achieve robustness and solve the single point of failure and attack problems by introducing multiple Local Certificate Authority servers. Moreover, by dealing with the network as zones and using restricted directional flooding, our new model will exhibit better scalability and performance. An overview and a qualitative comparison between ARANz and some existing Ad-Hoc routing protocols is presented in this paper.

Authenticated AODV Routing Protocol Using One-Time Signature and Transitive Signature Schemes

Mobile ad hoc network (MANET) has been generally regarded as an ideal network model for group communications because of its specialty of instant establishment. However, the security of MANET is still a challenge issue. Although there are some existing security schemes such as ARAN (Authenticated Routing for Ad hoc Networks) protocol that makes use of cryptographic certificate to provide end-to-end authentication during routing phases, the overhead of security computation is still a serious hurdle for real application. In this paper, we propose a comparatively efficient scheme to perform ARAN protocol, based on AODV, by using one-time signature in place of conventional signature, aiming at achieving the same level of security but improved efficiency. We also provide two approaches to handle the authentication of gratuitous route reply using delegation token and transitive signature schemes.

Authenticated routing for ad hoc networks

Initial work in ad hoc routing has considered only the problem of providing efficient mechanisms for finding paths in very dynamic networks, without considering security. Because of this, there are a number of attacks that can be used to manipulate the routing in an ad hoc network. In this paper, we describe these threats, specifically showing their effects on ad hoc on-demand distance vector and dynamic source routing. Our protocol, named authenticated routing for ad hoc networks (ARAN), uses public-key cryptographic mechanisms to defeat all identified attacks. We detail how ARAN can secure routing in environments where nodes are authorized to participate but untrusted to cooperate, as well as environments where participants do not need to be authorized to participate. Through both simulation and experimentation with our publicly available implementation, we characterize and evaluate ARAN and show that it is able to effectively and efficiently discover secure routes within an ad hoc network.