Secure routing for mobile ad hoc networks

@article{Argyroudis2005SecureRF,
  title={Secure routing for mobile ad hoc networks},
  author={Patroklos G. Argyroudis and Donal O'Mahony},
  journal={IEEE Communications Surveys \& Tutorials},
  year={2005},
  volume={7},
  pages={2-21}
}
In this paper we present a survey of secure ad hoc routing protocols for mobile wireless networks. A mobile ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. The widely accepted existing routing protocols designed to accommodate the needs of such self-organized networks do not address possible threats aiming at the disruption of the protocol itself. The assumption of a trusted environment is not one that can be realistically… 

Tables from this paper

Secure routing protocols for mobile ad hoc networks

The major attacks that can target the operation of ad hoc routing protocol are discussed and a detailed survey of the well-known secured ad hoc routed protocols for mobile ad hoc networks is presented.

A Review of Secure Ad-hoc Routing

The goal of this paper is to show the limitations of existing unsecure ad-hoc protocols which are more vulnerable to various kind of attacks.

Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks

This paper proposes a mathematical framework in which security can be precisely defined and routing protocols for mobile ad hoc networks can be proved to be secure in a rigorous manner and proposes a new on-demand source routing protocol, called endairA, which is demonstrated by proving that it is secure in the model.

Survey of Secure Routing Protocols for Wireless Ad Hoc Networks

The-state-of-the-art of secure routing protocols proposed in the literature that address routing security issue are surveyed, classifying secure routed protocols in categories according to the secured protocol, and finally discussing the proposed solutions.

An Efficient Secure Routing Protocol Based on Token Escrow Tree for Wireless Ad Hoc Networks

This paper proposes an energy efficient secure routing protocol for various ad hoc mobile environment that enhances packet delivery ratio in network environment which has some malicious nodes, and a life time of entire network is extended through consuming energy evenly.

Studies on the Secure Routing Protocols of Mobile AD Hoc Networks

This paper firstly analyzes the routing attacks of mobile Ad hoc networking, then elaborates and compares some ad hoc secure routing protocols, and points the future researches.

Authenticated routing for ad hoc networks

This paper describes and evaluates ARAN and shows that it is able to effectively and efficiently discover secure routes within an ad hoc network, and details 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 authorization to participate.

A Study on Enhancement of the Security of the Routing Protocols in Adhoc Networks

This paper focuses on analyzing the various routing protocols available in the literature for ad hoc network environment and its applications in security mechanisms.

Distributed secure routing protocol for Mobile Ad-Hoc Networks

The proposed Authenticated Routing for Ad-Hoc Networks with zoning (ARANz) introduces a distributive nature routing algorithm, which improves performance of routing protocol by dividing the area into zones and increases network security by introducing local and global Certificate Authority servers.

Security in multicast mobile ad-hoc networks

A secure scheme for the famous routing protocol, MAODV (Multicast Ad-hoc On-Demand distance Vector routing protocol) is proposed and Secure Hash Algorithm-1 (SHA-1) is used to guarantee the integrity in ad-hock networks.
...

References

SHOWING 1-10 OF 61 REFERENCES

SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks

The Secure Efficient Ad hoc Distance vector routing protocol is designed and evaluated, a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance-Vector routing protocol (DSDV), which performs well over the range of scenarios, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node.

Securing ad hoc networks

This article takes advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes-to defend routing against denial-of-service attacks and uses replication and new cryptographic schemes to build a highly secure and highly available key management service, which terms the core of this security framework.

A secure routing protocol for ad hoc networks

This work details security threats against ad hoc routing protocols, specifically examining AODV and DSR, and proposes a solution to one, the managed-open scenario where no network infrastructure is pre-deployed, but a small amount of prior security coordination is expected.

Secure link state routing for mobile ad hoc networks

The proposed secure link state routing protocol (SLSP) provides secure proactive topology discovery, which can be beneficial to network operation in a number of ways.

An on-demand secure routing protocol resilient to byzantine failures

This work proposes an on-demand routing protocol for ad hoc wireless networks that provides resilience to byzantine failures caused by individual or colluding nodes and develops an adaptive probing technique that detects a malicious link after log n faults have occurred.

Routing Security in Ad Hoc Networks

Threats and attacks against ad hoc routing under several areas of application are discussed and some suggested solutions that could be used when secure protocols are designed are looked at.

Security-aware ad hoc routing for wireless networks

A new routing technique called Security-Aware ad hoc Routing (SAR) is proposed that incorporates security attributes as parameters into ad hoc route discovery and develops a two-tier classification of routing protocol security metrics.

BISS: building secure routing out of an incomplete set of security associations

This work investigates secure routing in ad hoc networks in which security associations exist only between a subset of all pairs of nodes, and proposes a new protocol, designed specifically for ad hoc Networks with an incomplete set of security associations between the nodes.

Ad-hoc on-demand distance vector routing

  • C. PerkinsE. Belding-Royer
  • Computer Science
    Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
  • 1999
An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.

Packet Leashes : A Defense against Wormhole Attacks in Wireless Ad Hoc Networks

A new, general mechanism, called packet leashes, is presented for detecting and thus defending against wormhole attacks, and a specific protocol is presented, called TIK, that implements leashes.
...