Secure Routing Protocol For Mobile Research Articles

Clustering with a high-performance secure routing protocol for mobile ad hoc networks

Clustering with a high-performance secure routing protocol for mobile ad hoc networks

Optimised elliptic curve digital signature on NIST compliant curves for authentication of MANET nodes

Secure routing protocols for mobile ad hoc networks (MANETs) use digital signatures for authentication which increases computational and communication overheads. Elliptical curve digital signature (ECDSA) uses much shorter keys resulting in smaller signatures, lower computational load, less memory and power requirements which are crucial to MANET nodes. The ECDSA has a characteristic that the signature generation is very fast but signature verification takes much longer time. Optimisation of point operations and scalar multiplication of points have been proposed for accelerating the signature generation and verification process. The proposed method has been software implemented by writing the code in Java using Big-integer class on a Linux platform for National Institute of Standards and Technology (NIST) compliant curves and has accelerated the signature verification process of ECDSA by approximately 27% over the sequential mixed Jacobian-Affine NAF scalar multiplication method of verification.

Optimised elliptic curve digital signature on NIST compliant curves for authentication of MANET nodes

Secure routing protocols for mobile ad hoc networks (MANETs) use digital signatures for authentication which increases computational and communication overheads. Elliptical curve digital signature (ECDSA) uses much shorter keys resulting in smaller signatures, lower computational load, less memory and power requirements which are crucial to MANET nodes. The ECDSA has a characteristic that the signature generation is very fast but signature verification takes much longer time. Optimisation of point operations and scalar multiplication of points have been proposed for accelerating the signature generation and verification process. The proposed method has been software implemented by writing the code in Java using Big-integer class on a Linux platform for National Institute of Standards and Technology (NIST) compliant curves and has accelerated the signature verification process of ECDSA by approximately 27% over the sequential mixed Jacobian-Affine NAF scalar multiplication method of verification.

A New Approach of Secure Power Aware Routing for Mobile Ad-Hoc Network

In order to assist communication within a mobile Ad-Hoc network, a well-organized routing protocol is required to determine routes between mobile nodes. Power is one of the most important design criteria for Ad-Hoc networks as batteries provide inadequate working capacity to the mobile nodes. Power failure of a mobile node not only affects the node itself but also its ability to forward packets on behalf of others and hence affects the overall network lifetime. Much research efforts have been devoted to develop energy aware routing protocols. In this paper we propose an efficient algorithm, which maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment alongside making the node secure. Limited resource availability such as battery power and security are the major issues to be handled with mobile Ad-Hoc networks. By using Efficient secure routing protocol for mobile ad hoc networks that achieves secrecy of data message and secure the routing operation. The security schemes aims at preventing attacks by malicious node that intentionally disrupt the route discovery process. The protocol also assures a source node generates a route discovery request is able to identify and authenticate the route reply from destination. In mobile Ad-Hoc networks, an attacker can easily disrupt the functioning of the network by attacking the underlying routing protocol. Packets are secure during source to destination transmission by using Two Fish Encryption algorithm. As a case study proposed algorithm has been incorporated along with the route discovery procedure of AODV and PAR, by simulation it is observed that proposed algorithm’s performance is better as compare to AODV and PAR in terms of packet delivery ratio and network lifetime for different network scenarios.

Adaptive Threat Modeling for Secure Ad Hoc Routing Protocols

Secure routing protocols for mobile ad hoc networks provide the required functionality for proper network operation. If the underlying routing protocol cannot be trusted to follow the protocol operations, additional trust layers, such as authentication, cannot be obtained. Threat models drive analysis capabilities, affecting how we evaluate trust. Current attacker threat models limit the results obtained during protocol security analysis over ad hoc routing protocols. Developing a proper threat model to evaluate security properties in mobile ad hoc routing protocols presents a significant challenge. If the attacker strength is too weak, we miss vital security flaws. If the attacker strength is too strong, we cannot identify the minimum required attacker capabilities needed to break the routing protocol. In this paper we present an adaptive threat model to evaluate route discovery attacks against ad hoc routing protocols. Our approach enables us to evaluate trust in the ad hoc routing process and allows us to identify minimum requirements an attacker needs to break a given routing protocol.