A survey of survivability in mobile ad hoc networks
---
paper_title: A survey of security issues in mobile ad hoc and sensor networks

paper_content:

Security in mobile ad hoc networks is difficult to achieve, notably because of the vulnerability of wireless links, the limited physical protection of nodes, the dynamically changing topology, the absence of a certification authority, and the lack of a centralized monitoring or management point. Earlier studies on mobile ad hoc networks (MANETs) aimed at proposing protocols for some fundamental problems, such as routing, and tried to cope with the challenges imposed by the new environment. These protocols, however, fully trust all nodes and do not consider the security aspect. They are consequently vulnerable to attacks and misbehavior. More recent studies focused on security problems in MANETs, and proposed mechanisms to secure protocols and applications. This article surveys these studies. It presents and discusses several security problems along with the currently proposed solutions (as of July 2005) at different network layers of MANETs. Security issues involved in this article include routing and data forwarding, medium access, key management and intrusion detection systems (IDSs). This survey also includes an overview of security in a particular type of MANET, namely, wireless sensor networks (WSNs).
---
paper_title: The Sybil Attack

paper_content:

Large-scale peer-to-peer systems face security threats from faulty or hostile remote computing elements. To resist these threats, many such systems employ redundancy. However, if a single faulty entity can present multiple identities, it can control a substantial fraction of the system, thereby undermining this redundancy. One approach to preventing these "Sybil attacks" is to have a trusted agency certify identities. This paper shows that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
---
paper_title: Ad hoc networking: an introduction

paper_content:

In recent years, mobile computing has enjoyed a tremendous rise in popularity. The continued miniaturization of mobile computing devices and the extraordinary rise of processing power available in mobile laptop computers combine to put more and better computer-based applications into the hands of a growing segment of the population. At the same time, the markets for wireless telephones and communication devices are experiencing rapid growth. Projections have been made that, by the year 2002, there will be more than a billion wireless communication devices in use, and more than 200 million wireless telephone handsets will be purchased annually. The rise of wireless telephony will change what it means to be “in touch”; already many people use their office telephone for taking messages while they are away and rely on their mobile telephone for more important or timely messages. Indeed, mobile phones are used for tasks as simple and as convenient as finding one’s associates in a crowded shopping mall or at a conference. A similar transformation awaits mobile computer users, and we can expect new applications to be built for equally mundane but immediately convenient uses. Much of the context for the transformation has to do with keeping in touch with the Internet. We expect to have “the network” at our disposal for the innumerable little conveniences that we have begun to integrate into our professional lives. We might wish to download a roadmap on the spur of the moment so that we can see what is available in the local area. We might wish to have driving suggestions sent to us, based on information from the global positioning system (GPS) in our car, using the services offered by various web sites. The combination of sufficiently fast and inexpensive wireless communication links and cheap mobile computing devices makes this a reality for many people today. In the future, the average traveler is likely to take such services for granted.
---
paper_title: Internet Security: An Intrusion-Tolerance Approach

paper_content:

The Internet has become essential to most enterprises and many private individuals. However, both the network and computer systems connected to it are still too vulnerable and attacks are becoming evermore frequent. To face this situation, traditional security techniques are insufficient and fault-tolerance techniques are becoming increasingly cost-effective. Nevertheless,intrusions are very special faults, and this has to be taken into account when selecting the fault-tolerance techniques.
---
paper_title: Survivable mobile wireless networks: issues, challenges, and research directions

paper_content:

In this paper we survey issues and challenges in enhancing the survivability of mobile wireless networks, with particular emphasis on military requirements*. Research focus on three key aspects can significantly enhance network survivability: (i) establishing and maintaining survivable topologies that strive to keep the network connected even under attack, (ii) design for end-to-end communication in challenging environments in which the path from source to destination is not wholly available at any given instant of time, (iii) the use of technology to enhance survivability such as adaptive networks and satellites.
---
paper_title: Dependability and Its Threats: A Taxonomy

paper_content:

This paper gives the main definitions relating to dependability, a generic concept including as special case such attributes as reliability, availability, safety, confidentiality, integrity, maintainability, etc. Basic definitions are given first. They are then commented upon, and supplemented by additional definitions, which address the threats to dependability (faults, errors, failures), and the attributes of dependability. The discussion on the attributes encompasses the relationship of dependability with security, survivability and trustworthiness.
---
paper_title: Secure Routing for Mobile Ad hoc Networks

paper_content:

Buttyan L.et al.found out a security flaw in Aridane and proposed a secure routing protocol,EndairA, which can resist attacks of active-1-1 according to ref[9].But unfortunately we discover an as yet unknown active-0-1 attack,"man-in-the-middle attack",which EndairA can't resist.So we propose a new secure routing protocol,En- dairALoc.Analysis shows that EndairALoc can not only inherit security of EndairA,but also resist"man-in-the-mid- dle attack"and even wormhole attack.Furthermore EndairALoc uses pairwise secret keys instead of public keys Endai- rA used,so compared with EndairA,EndairALoc can save more energy in the process of routing establishment.
---
paper_title: Global Positioning System Theory And Practice

paper_content:

Thank you for reading global positioning system theory and practice. Maybe you have knowledge that, people have search hundreds times for their favorite novels like this global positioning system theory and practice, but end up in infectious downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they are facing with some malicious bugs inside their desktop computer. global positioning system theory and practice is available in our digital library an online access to it is set as public so you can get it instantly. Our digital library spans in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the global positioning system theory and practice is universally compatible with any devices to read.
---
paper_title: Mitigating routing misbehavior in mobile ad hoc networks

paper_content:

This paper describes two techniques that improve throughput in an ad hoc network in the presence of nodes that agree to forward packets but fail to do so. To mitigate this problem, we propose categorizing nodes based upon their dynamically measured behavior. We use a watchdog that identifies misbehaving nodes and a pathrater that helps routing protocols avoid these nodes. Through simulation we evaluate watchdog and pathrater using packet throughput, percentage of overhead (routing) transmissions, and the accuracy of misbehaving node detection. When used together in a network with moderate mobility, the two techniques increase throughput by 17% in the presence of 40% misbehaving nodes, while increasing the percentage of overhead transmissions from the standard routing protocol's 9% to 17%. During extreme mobility, watchdog and pathrater can increase network throughput by 27%, while increasing the overhead transmissions from the standard routing protocol's 12% to 24%.
---
paper_title: SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks

paper_content:

An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. We design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance-Vector routing protocol (DSDV). In order to support use with nodes of limited CPU processing capability, and to guard against denial-of-service (DoS) attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.
---
paper_title: Struggling against selfishness and black hole attacks in MANETs

paper_content:

Since mobile ad hoc networks (MANETs) are infrastructureless and multi-hop by nature, transmitting packets from any node to another usually relies on services provided by intermediate nodes. This reliance introduces a new vulnerability; one node could launch a Black Hole DoS attack by participating in the routing protocol and including itself in routes, then simply dropping packets it receives to forward. Another motivation for dropping packets in self-organized MANETs is resource preservation. Some solutions for detecting and isolating packet droppers have been recently proposed, but almost all of them employ the promiscuous mode monitoring approach (watchdog (WD)) which suffers from many problems, especially when employing the power control technique. In this paper we propose a novel monitoring approach that overcomes some WD's shortcomings, and improves the efficiency in detection. To overcome false detections due to nodes mobility and channel conditions we propose a Bayesian technique for the judgment, allowing node redemption before judgment. Finally, we suggest a social-based approach for the detection approval and isolation of guilty nodes. We analyze our solution and asses its performance by simulation. The results illustrate a large improvement of our monitoring solution in detection versus the WD, and an efficiency through our judgment and isolation techniques as well. Copyright © 2007 John Wiley & Sons, Ltd.
---
paper_title: Using Directional Antennas to Prevent Wormhole Attacks

paper_content:

Wormhole attacks enable an attacker with limited resources and no cryptographic material to wreak havoc on wireless networks. To date, no general defenses against wormhole attacks have been proposed. This paper presents an analysis of wormhole attacks and proposes a countermeasure using directional antennas. We present a cooperative protocol whereby nodes share directional information to prevent wormhole endpoints from masquerading as false neighbors. Our defense greatly diminishes the threat of wormhole attacks and requires no location information or clock synchronization.
---
paper_title: Secure Multipath Routing for Mobile Ad Hoc Networks

paper_content:

Multipath routing minimizes the consequences of security attacks deriving from collaborating malicious nodes in MANET, by maximizing the number of nodes that an adversary must compromise in order to take control of the communication. In this paper, we identify several attacks that render multipath routing protocols more vulnerable than it is expected, to collaborating malicious nodes. We propose a novel on-demand multipath routing protocol, the Secure Multipath Routing protocol (SecMR) and we analyze its security properties. The SecMR protocol can be easily integrated in a wide range of on-demand routing protocols, such as DSR and AODV.
---
paper_title: Packet leashes: a defense against wormhole attacks in wireless networks

paper_content:

As mobile ad hoc network applications are deployed, security emerges as a central requirement. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts, and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them (possibly selectively) to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many ad hoc network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.
---
paper_title: Mitigating Byzantine Attacks in Ad Hoc Wireless Networks

paper_content:

Attacks where adversaries have full control of a number of authenticated devices and behave arbitrarily to disrupt the network are referred to as Byzantine attacks. Traditional secure routing protocols are vulnerable to this class of attacks since they usually assume that once authenticated, a node can be trusted to execute the protocol correctly. We present a detailed description of several Byzantine attacks (black hole, flood rushing, wormhole and overlay network wormhole), analyze their mechanisms and describe the major mitigation techniques. Through simulation, we perform a quantitative evaluation of the impact of these attacks on an insecure on-demand routing protocol. The relative strength of the attacks is analyzed in terms of the magnitude of disruption caused per adversary. An implementation of the On-Demand Secure Byzantine Routing protocol (ODSBR) was created in order to quantify its ability to mitigate the considered attacks. ODSBR was chosen because its design addresses a wide range of Byzantine attacks.
---
paper_title: Ad-hoc on-demand distance vector routing

paper_content:

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. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.
---
paper_title: DSR : The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks

paper_content:

The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastructure or administration. The protocol is composed of the two mechanisms of Route Discovery and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary destinations in the ad hoc network. The use of source routing allows packet routing to be trivially loop-free, avoids the need for up-to-date routing information in the intermediate nodes through which packets are forwarded, and allows nodes forwarding or overhearing packets to cache the routing information in them for their own future use. All aspects of the protocol operate entirely on-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. We have evaluated the operation of DSR through detailed simulation on a variety of movement and communication patterns, and through implementation and significant experimentation in a physical outdoor ad hoc networking testbed we have constructed in Pittsburgh, and have demonstrated the excellent performance of the protocol. In this chapter, we describe the design of DSR and provide a summary of some of our simulation and testbed implementation results for the protocol.
---
paper_title: Requirements definition for survivable network systems

paper_content:

Pervasive societal dependency on large scale, unbounded network systems, the substantial risks of such dependency, and the growing sophistication of system intruders, have focused increased attention on how to ensure network system survivability. Survivability is the capacity of a system to provide essential services even after successful intrusion and compromise, and to recover full services in a timely manner. Requirements for survivable systems must include definitions of essential and non essential services, plus definitions of new survivability services for intrusion resistance, recognition, and recovery. Survivable system requirements must also specify both legitimate and intruder usage scenarios, and survivability practices for system development, operation, and evolution. The paper defines a framework for survivable systems requirements definition and discusses requirements for several emerging survivability strategies. Survivability must be designed into network systems, beginning with effective survivability requirements analysis and definition.
---
paper_title: A survey of security issues in mobile ad hoc and sensor networks

paper_content:

Security in mobile ad hoc networks is difficult to achieve, notably because of the vulnerability of wireless links, the limited physical protection of nodes, the dynamically changing topology, the absence of a certification authority, and the lack of a centralized monitoring or management point. Earlier studies on mobile ad hoc networks (MANETs) aimed at proposing protocols for some fundamental problems, such as routing, and tried to cope with the challenges imposed by the new environment. These protocols, however, fully trust all nodes and do not consider the security aspect. They are consequently vulnerable to attacks and misbehavior. More recent studies focused on security problems in MANETs, and proposed mechanisms to secure protocols and applications. This article surveys these studies. It presents and discusses several security problems along with the currently proposed solutions (as of July 2005) at different network layers of MANETs. Security issues involved in this article include routing and data forwarding, medium access, key management and intrusion detection systems (IDSs). This survey also includes an overview of security in a particular type of MANET, namely, wireless sensor networks (WSNs).
---
paper_title: Intrusion detection in wireless ad hoc networks

paper_content:

Intrusion detection has, over the last few years, assumed paramount importance within the broad realm of network security, more so in the case of wireless ad hoc networks. These are networks that do not have an underlying infrastructure; the network topology is constantly changing. The inherently vulnerable characteristics of wireless ad hoc networks make them susceptible to attacks, and it may be too late before any counter action can take effect. Second, with so much advancement in hacking, if attackers try hard enough they will eventually succeed in infiltrating the system. This makes it important to constantly (or at least periodically) monitor what is taking place on a system and look for suspicious behavior. Intrusion detection systems (IDSs) do just that: monitor audit data, look for intrusions to the system, and initiate a proper response (e.g., email the systems administrator, start an automatic retaliation). As such, there is a need to complement traditional security mechanisms with efficient intrusion detection and response. In this article we present a survey on the work that has been done in the area of intrusion detection in mobile ad hoc networks.
---
paper_title: Secure Routing for Mobile Ad hoc Networks

paper_content:

Buttyan L.et al.found out a security flaw in Aridane and proposed a secure routing protocol,EndairA, which can resist attacks of active-1-1 according to ref[9].But unfortunately we discover an as yet unknown active-0-1 attack,"man-in-the-middle attack",which EndairA can't resist.So we propose a new secure routing protocol,En- dairALoc.Analysis shows that EndairALoc can not only inherit security of EndairA,but also resist"man-in-the-mid- dle attack"and even wormhole attack.Furthermore EndairALoc uses pairwise secret keys instead of public keys Endai- rA used,so compared with EndairA,EndairALoc can save more energy in the process of routing establishment.
---
paper_title: SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks

paper_content:

An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vector approaches, they have generally assumed a trusted environment. We design and evaluate the Secure Efficient Ad hoc Distance vector routing protocol (SEAD), a secure ad hoc network routing protocol based on the design of the Destination-Sequenced Distance-Vector routing protocol (DSDV). In order to support use with nodes of limited CPU processing capability, and to guard against denial-of-service (DoS) attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic operations in the protocol. SEAD performs well over the range of scenarios we tested, and is robust against multiple uncoordinated attackers creating incorrect routing state in any other node, even in spite of any active attackers or compromised nodes in the network.
---
paper_title: Secure ad hoc on-demand distance vector routing

paper_content:

This article gives an overview of different approaches to provide security features to routing protocols in mobile ad hoc networks (MANET). It also describes Secure AODV (an extension to AODV that provides security features) giving a summary of its operation and talking about future enhancements to the protocol.
---
paper_title: Fault and intrusion tolerance in wireless ad hoc networks

paper_content:

Current algorithms for distributed applications, such as the wireless GRID, for wireless ad hoc networks (WAHN) contain a few mechanisms for providing robust/tolerant network operation in the face of security attacks launched on the network by intruders. One approach to address thus issue is to design these applications for WAHNs in a way that they can handle intruder-induced malicious faults. However, this presents several drawbacks, including the considerable investment that it can induce. We present a new approach for building intrusion tolerant WAHN. The approach relies on extending the capabilities of existing applications to handle intruders without modifying their structure. We describe a new network mechanism for resource allocation using capabilities for detecting and recovering from intruder induced malicious faults. We also present a wireless router component that allows these mechanisms to be added to existing wireless nodes.
---
paper_title: Techniques for intrusion-resistant ad hoc routing algorithms (TIARA)

paper_content:

Architecture Technology Corporation (ATC) has developed a new approach for building intrusion resistant ad hoc networks called TIARA (Techniques for Intrusion-Resistant Ad Hoc Routing Algorithms). The approach, developed with funding from DARPA's Fault Tolerant Networks program, relies on extending the capabilities of existing ad hoc routing algorithms to handle intruders without modifying these algorithms. TIARA implements new network layer survivability mechanisms for detecting and recovering from intruder induced malicious faults that work in concert with existing ad hoc routing algorithms and augment their capabilities. The TIARA implementation architecture is designed to allow these survivability mechanisms to be "plugged" into existing wireless routers with little effort.
---
paper_title: Bootstrapping security associations for routing in mobile ad-hoc networks

paper_content:

To date, most solutions proposed for secure routing in mobile ad-hoc networks (MANETs), assume that secure associations between pairs of nodes can be established on-line; e.g., by a trusted third party, by distributed trust establishment. However, establishing such security associations, with or without trusted third parties, requires reliance on routing layer security. In this paper, we eliminate this apparent cyclic dependency between security services and secure routing in MANETs and show how to bootstrap security for the routing layer. We use the notion of statistically unique and cryptographically verifiable (SUCV) identifiers to implement a secure binding between IP addresses and keys that is independent of any trusted security service. We illustrate our solution with the dynamic source routing (DSR) protocol and compare it with other solutions for secure routing.
---
paper_title: ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks

paper_content:

Ah hoc networks offer increased coverage by using multihop communication. This architecture makes services more vulnerable to internal attacks coming from compromised nodes that behave arbitrarily to disrupt the network, also referred to as Byzantine attacks. In this work, we examine the impact of several Byzantine attacks performed by individual or colluding attackers. We propose ODSBR, the first on-demand routing protocol for ad hoc wireless networks that provides resilience to Byzantine attacks caused by individual or colluding nodes. The protocol uses an adaptive probing technique that detects a malicious link after log n faults have occurred, where n is the length of the path. Problematic links are avoided by using a route discovery mechanism that relies on a new metric that captures adversarial behavior. Our protocol never partitions the network and bounds the amount of damage caused by attackers. We demonstrate through simulations ODSBR's effectiveness in mitigating Byzantine attacks. Our analysis of the impact of these attacks versus the adversary's effort gives insights into their relative strengths, their interaction, and their importance when designing multihop wireless routing protocols.
---
paper_title: Fault and intrusion tolerance in wireless ad hoc networks

paper_content:

Current algorithms for distributed applications, such as the wireless GRID, for wireless ad hoc networks (WAHN) contain a few mechanisms for providing robust/tolerant network operation in the face of security attacks launched on the network by intruders. One approach to address thus issue is to design these applications for WAHNs in a way that they can handle intruder-induced malicious faults. However, this presents several drawbacks, including the considerable investment that it can induce. We present a new approach for building intrusion tolerant WAHN. The approach relies on extending the capabilities of existing applications to handle intruders without modifying their structure. We describe a new network mechanism for resource allocation using capabilities for detecting and recovering from intruder induced malicious faults. We also present a wireless router component that allows these mechanisms to be added to existing wireless nodes.
---
paper_title: Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks

paper_content:

In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority; therefore, they are motivated to cooperate in order to support the basic functions of the network. In this paper, we consider the case when each node is its own authority and tries to maximize the benefits it gets from the network. More precisely, we assume that the nodes are not willing to forward packets for the benefit of other nodes. This problem may arise in civilian applications of mobile ad hoc networks. In order to stimulate the nodes for packet forwarding, we propose a simple mechanism based on a counter in each node. We study the behavior of the proposed mechanism analytically and by means of simulations, and detail the way in which it could be protected against misuse.
---
paper_title: Cooperation in wireless ad hoc networks

paper_content:

In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios (complete cooperation and complete noncooperation) are inimical to the interests of a user. In this paper we address the issue of user cooperation in ad hoc networks. We assume that nodes are rational, i.e., their actions are strictly determined by self interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we are able to determine the optimal throughput that each node should receive. We define this to be the rational Pareto optimal operating point. We then propose a distributed and scalable acceptance algorithm called generous tit-for-tat (GTFT). The acceptance algorithm is used by the nodes to decide whether to accept or reject a relay request. We show that GTFT results in a Nash equilibrium and prove that the system converges to the rational and optimal operating point.
---
paper_title: Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes – Fairness In Dynamic Ad Hoc Networks

paper_content:

Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive; it is based on selective altruism and utilitarianism. It aims at detecting and isolating misbehaving nodes, thus making it unattractive to deny cooperation. Trust relationships and routing decisions are based on experienced, observed, or reported routing and forwarding behavior of other nodes. The detailed implementation of CONFIDANT in this paper assumes that the network layer is based on the Dynamic Source Routing (DSR) protocol. We present a performance analysis of DSR fortified by CONFIDANT and compare it to regular defenseless DSR. It shows that a network with CONFIDANT and up to 60% of misbehaving nodes behaves almost as well as a benign network, in sharp contrast to a defenseless network. All simulations have been implemented and performed in GloMoSim.
---
paper_title: On designing MAC protocols for wireless networks using directional antennas

paper_content:

We investigate the possibility of using directional antennas for medium access control in wireless ad hoc networks. Previous research in ad hoc networks typically assumes the use of omnidirectional antennas at all nodes. With omnidirectional antennas, while two nodes are communicating using a given channel, MAC protocols such as IEEE 802.11 require all other nodes in the vicinity to remain silent. With directional antennas, two pairs of nodes located in each other's vicinity may potentially communicate simultaneously, increasing spatial reuse of the wireless channel. Range extension due to higher gain of directional antennas can also be useful in discovering fewer hop routes. However, new problems arise when using directional beams that simple modifications to 802.11 may not be able to mitigate. This paper identifies these problems and evaluates the tradeoffs associated with them. We also design a directional MAC protocol (MMAC) that uses multihop RTSs to establish links between distant nodes and then transmits CTS, DATA, and ACK over a single hop. While MMAC does not address all the problems identified with directional communication, it is an attempt to exploit the primary benefits of beamforming in the presence of some of these problems. Results show that MMAC can perform better than IEEE 802.11, although we find that the performance is dependent on the topology and flow patterns in the system.
---
paper_title: Resisting Malicious Packet Dropping in Wireless Ad Hoc Networks

paper_content:

Most of the routing protocols in wireless ad hoc networks, such as DSR, assume nodes are trustworthy and cooperative. This assumption renders wireless ad hoc networks vulnerable to various types of Denial of Service (DoS) attacks. We present a distributed probing technique to detect and mitigate one type of DoS attacks, namely malicious packet dropping, in wireless ad hoc networks. A malicious node can promise to forward packets but in fact fails to do so. In our distributed probing technique, every node in the network will probe the other nodes periodically to detect if any of them fail to perform the forwarding function. Subsequently, node state information can be utilized by the routing protocol to bypass those malicious nodes. Our experiments show that in a moderately changing network, the probing technique can detect most of the malicious nodes with a relatively low false positive rate. The packet delivery rate in the network can also be increased accordingly.
---
paper_title: Friends and foes: preventing selfishness in open mobile ad hoc networks

paper_content:

Technological advances are leveraging the widespread deployment of mobile ad hoc networks. An interesting characteristic of ad hoc networks is their self-organization and their dependence of the behavior of individual nodes. Until recently, most research on ad hoc networks has assumed that all nodes were cooperative. This assumption is no longer valid in spontaneous networks formed by individuals with diverse goals and interests. In such environment, the presence of selfish nodes may degrade significantly the performance of the ad hoc network. This paper proposes a novel algorithm that aims to discourage selfish behavior in mobile ad hoc networks.
---
paper_title: Struggling against selfishness and black hole attacks in MANETs

paper_content:

Since mobile ad hoc networks (MANETs) are infrastructureless and multi-hop by nature, transmitting packets from any node to another usually relies on services provided by intermediate nodes. This reliance introduces a new vulnerability; one node could launch a Black Hole DoS attack by participating in the routing protocol and including itself in routes, then simply dropping packets it receives to forward. Another motivation for dropping packets in self-organized MANETs is resource preservation. Some solutions for detecting and isolating packet droppers have been recently proposed, but almost all of them employ the promiscuous mode monitoring approach (watchdog (WD)) which suffers from many problems, especially when employing the power control technique. In this paper we propose a novel monitoring approach that overcomes some WD's shortcomings, and improves the efficiency in detection. To overcome false detections due to nodes mobility and channel conditions we propose a Bayesian technique for the judgment, allowing node redemption before judgment. Finally, we suggest a social-based approach for the detection approval and isolation of guilty nodes. We analyze our solution and asses its performance by simulation. The results illustrate a large improvement of our monitoring solution in detection versus the WD, and an efficiency through our judgment and isolation techniques as well. Copyright © 2007 John Wiley & Sons, Ltd.
---
paper_title: CORE: A Collaborative Reputation Mechanism to enforce node cooperation in Mobile Ad hoc Networks

paper_content:

Countermeasures for node misbehavior and selfishness are mandatory requirements in MANET. Selfishness that causes lack of node activity cannot be solved by classical security means that aim at verifying the correctness and integrity of an operation. We suggest a generic mechanism based on reputation to enforce cooperation among the nodes of a MANET to prevent selfish behavior. Each network entity keeps track of other entities’ collaboration using a technique called reputation. The reputation is calculated based on various types of information on each entity’s rate of collaboration. Since there is no incentive for a node to maliciously spread negative information about other nodes, simple denial of service attacks using the collaboration technique itself are prevented. The generic mechanism can be smoothly extended to basic network functions with little impact on existing protocols.
---
paper_title: Data Security in MANETs using Multipath Routing and Directional Transmission

paper_content:

A cross-layer approach is investigated to improve data security in Mobile Ad Hoc Networks (MANETs). The use of directional antennas and intelligent multipath routing is proposed to enhance end-to-end data confidentiality and data availability with respect to outsider attacks. The goal is to impede rogue attempts to gain unauthorized access to classified information or disrupt the information flow. The interplay between the physical, link, and network layers is considered. A novel simulator is developed to accurately quantify the data confidentiality benefits of these approaches. This study leverages the existence of multiple paths between end-nodes to statistically improve data confidentiality and data availability in hostile MANET environments, where both insider and outsider adversaries may be present. Simulation results show that the proposed mechanisms can greatly improve data confidentiality as compared to existing schemes. These mechanisms can also improve data availability.
---
paper_title: Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks

paper_content:

Mobile ad hoc networking has been an active research area for several years. How to stimulate cooperation among selfish mobile nodes, however, is not well addressed yet. In this paper, we propose Sprite, a simple, cheat-proof, credit-based system for stimulating cooperation among selfish nodes in mobile ad hoc networks. Our system provides incentive for mobile nodes to cooperate and report actions honestly. Compared with previous approaches, our system does not require any tamper-proof hardware at any node. Furthermore, we present a formal model of our system and prove its properties. Evaluations of a prototype implementation show that the overhead of our system is small. Simulations and analysis show that mobile nodes can cooperate and forward each other's messages, unless the resource of each node is extremely low.
---
paper_title: Secure data transmission in mobile ad hoc networks

paper_content:

The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the open, collaborative MANET environment practically any node can maliciously or selfishly disrupt and deny communication of other nodes. In this paper, we present and evaluate the Secure Message Transmission (SMT) protocol, which safeguards the data transmission against arbitrary malicious behavior of other nodes. SMT is a lightweight, yet very effective, protocol that can operate solely in an end-to-end manner. It exploits the redundancy of multi-path routing and adapts its operation to remain efficient and effective even in highly adverse environments. SMT is capable of delivering up to 250% more data messages than a protocol that does not secure the data transmission. Moreover, SMT outperforms an alternative single-path protocol, a secure data forwarding protocol we term Secure Single Path (SSP) protocol. SMT imposes up to 68% less routing overhead than SSP, delivers up to 22% more data packets and achieves end-to-end delays that are up to 94% lower than those of SSP. Thus, SMT is better suited to support QoS for real-time communications in the ad hoc networking environment. The security of data transmission is achieved without restrictive assumptions on the network nodes' trust and network membership, without the use of intrusion detection schemes, and at the expense of moderate multi-path transmission overhead only.
---
paper_title: SPREAD: enhancing data confidentiality in mobile ad hoc networks

paper_content:

Security is a critical issue in a mobile ad hoc network (MANET). We propose and investigate a novel scheme, security protocol for reliable data delivery (SPREAD), to enhance the data confidentiality service in a mobile ad hoc network. The proposed SPREAD scheme aims to provide further protection to secret messages from being compromised (or eavesdropped) when they are delivered across the insecure network. The basic idea is to transform a secret message into multiple shares by secret sharing schemes and then deliver the shares via multiple independent paths to the destination so that even if a small number of nodes that are used to relay the message shares are compromised, the secret message as a whole is not compromised. We present the overall system architecture and investigate the major design issues. We first describe how to obtain message shares using the secret sharing schemes. Then we study the appropriate choice of the secret sharing schemes and the optimal allocation of the message shares onto each path in order to maximize the security. The results show that the SPREAD is more secure and also provides a certain degree of reliability without sacrificing the security. Thirdly, the multipath routing techniques are discussed and the path set optimization algorithm is developed to find the multiple paths with the desired property, i.e., the overall path set providing maximum security. Finally, we present the simulation results to justify the feasibility and evaluate the effectiveness of SPREAD.
---
paper_title: Diversity coding for transparent self-healing and fault-tolerant communication networks

paper_content:

A channel coding approach called diversity coding is introduced for self-healing and fault-tolerance in digital communication networks for nearly instantaneous recovery from link failures. To achieve this goal, the problem of link failures is treated as an erasure channel problem. Implementation details of this technique in existing and future communication networks are discussed. >
---
paper_title: Efficient dispersal of information for security, load balancing, and fault tolerance

paper_content:

An Information Dispersal Algorithm (IDA) is developed that breaks a file F of length L = u F u into n pieces F i , l ≤ i ≤ n , each of length u F i u = L / m , so that every m pieces suffice for reconstructing F . Dispersal and reconstruction are computationally efficient. The sum of the lengths u F i u is ( n / m ) · L . Since n / m can be chosen to be close to l, the IDA is space efficient. IDA has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission of information in networks, and to communications between processors in parallel computers. For the latter problem provably time-efficient and highly fault-tolerant routing on the n -cube is achieved, using just constant size buffers.
---
paper_title: Data Security in MANETs using Multipath Routing and Directional Transmission

paper_content:

A cross-layer approach is investigated to improve data security in Mobile Ad Hoc Networks (MANETs). The use of directional antennas and intelligent multipath routing is proposed to enhance end-to-end data confidentiality and data availability with respect to outsider attacks. The goal is to impede rogue attempts to gain unauthorized access to classified information or disrupt the information flow. The interplay between the physical, link, and network layers is considered. A novel simulator is developed to accurately quantify the data confidentiality benefits of these approaches. This study leverages the existence of multiple paths between end-nodes to statistically improve data confidentiality and data availability in hostile MANET environments, where both insider and outsider adversaries may be present. Simulation results show that the proposed mechanisms can greatly improve data confidentiality as compared to existing schemes. These mechanisms can also improve data availability.
---
paper_title: A survey of security issues in mobile ad hoc and sensor networks

paper_content:

Security in mobile ad hoc networks is difficult to achieve, notably because of the vulnerability of wireless links, the limited physical protection of nodes, the dynamically changing topology, the absence of a certification authority, and the lack of a centralized monitoring or management point. Earlier studies on mobile ad hoc networks (MANETs) aimed at proposing protocols for some fundamental problems, such as routing, and tried to cope with the challenges imposed by the new environment. These protocols, however, fully trust all nodes and do not consider the security aspect. They are consequently vulnerable to attacks and misbehavior. More recent studies focused on security problems in MANETs, and proposed mechanisms to secure protocols and applications. This article surveys these studies. It presents and discusses several security problems along with the currently proposed solutions (as of July 2005) at different network layers of MANETs. Security issues involved in this article include routing and data forwarding, medium access, key management and intrusion detection systems (IDSs). This survey also includes an overview of security in a particular type of MANET, namely, wireless sensor networks (WSNs).
---
paper_title: Self-Organized Public-Key Management for Mobile Ad Hoc Networks

paper_content:

In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. We propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.
---
paper_title: Secure, redundant, and fully distributed key management scheme for mobile ad hoc networks: an analysis

paper_content:

Security poses a major challenge in ad hoc networks today due to the lack of fixed or organizational infrastructure. This paper proposes a modification to the existing "fully distributed certificate authority" scheme for ad hoc networks. In the proposed modification, redundancy is introduced by allocating more than one share to each node in order to increase the probability of creating the certificate for a node in a highly mobile network. A probabilistic analysis is carried out to analyze the trade-offs between the ease of certificate creation and the security provided by the proposed scheme. The analysis carried out from the intruder's perspective suggests that in the worst-case scenario, the intruder is just "one node" away from a legitimate node in compromising the certificate. The analysis also outlines the parameter selection criteria for a legitimate node to maintain a margin of advantage over an intruder in creating the certificate.
---
paper_title: The official PGP user's guide

paper_content:

A pretty bad problem, John Perry Barlow. Part 1 Essential topics: quick overview why do you need GDP? how public key cryptography works installing PGP using PGP managing keys advanced topics beware of snake oil. Part 2 Special topics: useful details setting configuration parameters a peek under the hood vulnerabilities legal issues compatibility with previous and future versions of PGP sources of information on PGP appendix - PGP quick reference.
---

Title: A Survey of Survivability in Mobile Ad Hoc Networks

Section 1: INTRODUCTION
Description 1: Introduce the importance and applications of mobile ad hoc networks (MANETs) and outline the challenges in ensuring their survivability against attacks.

Section 2: SURVIVABILITY CONCEPTS
Description 2: Define survivability, discuss key properties of survivable systems, and present a classification of defense lines including preventive, reactive, and intrusion tolerance mechanisms.

Section 3: ISSUES AND MECHANISMS FOR SECURITY IN MANETS
Description 3: Summarize the characteristics of MANETs, their susceptibility to various security issues, and conventional countermeasures applied to address these issues.

Section 4: SURVIVABILITY REQUIREMENTS FOR MANETS
Description 4: Analyze the requirements for achieving survivability in MANETs, with a focus on maintaining essential services and addressing the constraints and dynamic nature of these networks.

Section 5: SURVIVABLE INITIATIVES FOR MANETS
Description 5: Describe and categorize several initiatives aimed at building survivable MANETs, divided into three main groups: route discovery, data forwarding, and key management and access control.

Section 6: CONCLUSION
Description 6: Summarize the findings of the survey, highlighting the need for cooperative defense lines and multi-layered approaches to enhance survivability in MANETs. Discuss future directions for research in this field.