Proceedings Article•
Performance Analysis of the CONFIDANT Protocol: Cooperation Of Nodes - Fairness In Dynamic Ad-hoc NeTworks
01 Jan 2002-
TL;DR: It is shown 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.
Abstract: 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.
Citations
More filters
Book•
12 Aug 2005
TL;DR: In this article, the authors state several problems related to topology control in wireless ad hoc and sensor networks, and survey state-of-the-art solutions which have been proposed to tackle them.
Abstract: Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and radio interference (with a positive effect on the network traffic carrying capacity). The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes' transmitting range. In this article, we state several problems related to topology control in wireless ad hoc and sensor networks, and we survey state-of-the-art solutions which have been proposed to tackle them. We also outline several directions for further research which we hope will motivate researchers to undertake additional studies in this field.
1,367 citations
09 Jul 2003
TL;DR: In this paper, a simple, cheat-proof, credit-based system for stimulating cooperation among selfish nodes in mobile ad hoc networks is proposed, which does not require any tamper-proof hardware at any node.
Abstract: 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.
1,330 citations
Cites background from "Performance Analysis of the CONFIDA..."
...In [7], [8], Buchegger and Le Boudec proposed and evaluated their CONFIDENT protocol, which detects and isolates misbehaving nodes....
[...]
...One possibility to provide incentive is to use a reputation system [4], [7], [8], [9]....
[...]
...However, as observed by several authors [4], [5], [6], [7], [8], it may soon be possible to deploy ad hoc networks for civilian applications as well....
[...]
TL;DR: This paper proposes a simple mechanism based on a counter in each node to stimulate the nodes for packet forwarding and studies the behavior of the proposed mechanism analytically and by means of simulations, and detail the way in which it could be protected against misuse.
Abstract: 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
1,188 citations
TL;DR: The threat model for ad hoc routing is formulated and several specific attacks that can target the operation of a protocol are presented that can provide the basis for future research in this rapidly evolving area.
Abstract: 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 expected; hence several efforts have been made towards the design of a secure and robust routing protocol for ad hoc networks. We briefly present the most popular protocols that follow the table-driven and the source-initiated on-demand approaches. Based on this discussion we then formulate the threat model for ad hoc routing and present several specific attacks that can target the operation of a protocol. In order to analyze the proposed secure ad hoc routing protocols in a structured way we have classified them into five categories; solutions based on asymmetric cryptography, solutions based on symmetric cryptography, hybrid solutions, reputation-based solutions and a category of add-on mechanisms that satisfy specific security requirements. A comparison between these solutions can provide the basis for future research in this rapidly evolving area.
807 citations
TL;DR: A survey of the state-of-the-art in Intrusion Detection Systems (IDSs) that are proposed for WSNs is presented, followed by the analysis and comparison of each scheme along with their advantages and disadvantages.
Abstract: Wireless Sensor Networking is one of the most promising technologies that have applications ranging from health care to tactical military. Although Wireless Sensor Networks (WSNs) have appealing features (e.g., low installation cost, unattended network operation), due to the lack of a physical line of defense (i.e., there are no gateways or switches to monitor the information flow), the security of such networks is a big concern, especially for the applications where confidentiality has prime importance. Therefore, in order to operate WSNs in a secure way, any kind of intrusions should be detected before attackers can harm the network (i.e., sensor nodes) and/or information destination (i.e., data sink or base station). In this article, a survey of the state-of-the-art in Intrusion Detection Systems (IDSs) that are proposed for WSNs is presented. Firstly, detailed information about IDSs is provided. Secondly, a brief survey of IDSs proposed for Mobile Ad-Hoc Networks (MANETs) is presented and applicability of those systems to WSNs are discussed. Thirdly, IDSs proposed for WSNs are presented. This is followed by the analysis and comparison of each scheme along with their advantages and disadvantages. Finally, guidelines on IDSs that are potentially applicable to WSNs are provided. Our survey is concluded by highlighting open research issues in the field.
743 citations
Cites methods from "Performance Analysis of the CONFIDA..."
...Both the proposed schemes ([16] and [39]) are applicable to WSNs with a slight modification: The renewal period of the reputation tables would be decreased, in order to increase the bandwidth efficiency....
[...]
...CONFIDANT protocol [39] works as an extension to reactive source routing protocols, such as DSR, and uses a...
[...]
...[36] statistical not applicable Rao and Kesidis [37] statistical not applicable Nadkarni and Mishra [38] misuse not applicable CONFIDANT protocol [39] reputation applicable with modification Sun et al....
[...]
References
More filters
Book•
[...]
TL;DR: In this paper, the authors take up the concepts of altruistic and selfish behaviour; the genetical definition of selfish interest; the evolution of aggressive behaviour; kinship theory; sex ratio theory; reciprocal altruism; deceit; and the natural selection of sex differences.
Abstract: Science need not be dull and bogged down by jargon, as Richard Dawkins proves in this entertaining look at evolution. The themes he takes up are the concepts of altruistic and selfish behaviour; the genetical definition of selfish interest; the evolution of aggressive behaviour; kinship theory; sex ratio theory; reciprocal altruism; deceit; and the natural selection of sex differences. Readership: general; students of biology, zoology, animal behaviour, psychology.
10,880 citations
[...]
6,044 citations
"Performance Analysis of the CONFIDA..." refers background or methods in this paper
...As explained by Richard Dawkins in ‘The Selfish Gene’ [6], reciprocal altruism is beneficial for every ecological system when favors are granted simultaneously, so there is an intrinsic motivation for cooperation because of instant gratification....
[...]
...Dawkins divides birds into two types: ‘suckers’ that always help and ‘cheats’ that have other birds groom parasites off their head but fail to return the favor....
[...]
...Dawkins then introduces a third kind of bird, the ‘grudger’ that starts out being helpful to every bird, but bears a grudge against those birds that do not return the favor and subsequently no longer grooms their heads....
[...]
...An ecological example used by Dawkins [6] explains the survival chances (and thus gene selection) of birds grooming parasites off each other’s head, which they cannot clean themselves....
[...]
...According to Dawkins, simulation has shown that when starting with a majority population of cheats and marginal groups of both suckers and grudgers, the grudgers win over time....
[...]
01 Jan 2004
4,182 citations
"Performance Analysis of the CONFIDA..." refers methods in this paper
...Dynamic Source Routing is a protocol developed for routing in mobile ad-hoc networks and was proposed for MANET by Broch, Johnson, and Maltz [ 8 ]....
[...]
01 Aug 2000
TL;DR: 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 are described, using a watchdog that identifies misbehaving nodes and a pathrater that helps routing protocols avoid these nodes.
Abstract: 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%.
3,747 citations
"Performance Analysis of the CONFIDA..." refers background in this paper
...Marti, Giuli, Lai, and Baker [9] observed that throughput increased in mobile ad-hoc networks by complementing DSR with a ‘watchdog’ for detection of non-forwarding nodes and a ‘pathrater’ (for trust management and routing policy, every path used is rated), which enable nodes to avoid non-forwarding nodes in their routes....
[...]
...[9] Sergio Marti, T.J. Giuli, Kevin Lai, and Mary Baker....
[...]
TL;DR: 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.
Abstract: Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. Military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in the design of these networks is their vulnerability to security attacks. In this article, we study the threats on ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes-to defend routing against denial-of-service attacks. We also use replication and new cryptographic schemes, such as threshold cryptography, to build a highly secure and highly available key management service, which terms the core of our security framework.
2,661 citations
"Performance Analysis of the CONFIDA..." refers background in this paper
...Zhou and Haas [18] employ asynchronous threshold security and share refreshing for distributed certification authorities for key management in mobile ad-hoc networks....
[...]
...[18] Lidong Zhou and Zygmunt Haas....
[...]