ACM Home Page
Please provide us with feedback. Feedback
Performance analysis of the CONFIDANT protocol
Full text PdfPdf (187 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing table of contents
Lausanne, Switzerland
SESSION: Protocols table of contents
Pages: 226 - 236  
Year of Publication: 2002
ISBN:1-58113-501-7
Authors
Sonja Buchegger  IBM Zurich Research Laboratory, Rüschlikon, Switzerland
Jean-Yves Le Boudec  EPFL-IC-LCA, Lausanne, Switzerland
Sponsor
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 190,   Citation Count: 124
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/513800.513828
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Ross Anderson and Frank Stajano. The resurrecting duckling. Lecture Notes in Computer Science, Springer-Verlag, 1999.
 
2
 
3
Sonja Buchegger and Jean-Yves Le Boudec. Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks. In Proceedings of the Tenth Euromicro Workshop on Parallel, Distributed and Network-based Processing, pages 403--410, Canary Islands, Spain, January 2002. IEEE Computer Society.
 
4
 
5
Levente Buttyán and Jean-Pierre Hubaux. Stimulating cooperation in self-organizing mobile ad hoc networks. MONET Journal of Mobile Networks, to appear 2002.
 
6
Richard Dawkins. The Selfish Gene.Oxford University Press, 1989 edition, 1976.
 
7
Raj Jain. The Art of Computer Systems Performance Analysis. John Wiley & Sons, New York, 1989 edition, 1991. All you need to know about performance analysis.
 
8
Dave B. Johnson and David A. Maltz. The dynamic source routing protocol for mobile ad hoc networks. Internet Draft, Mobile Ad Hoc Network (MANET) Working Group, IETF, October 1999.
9
 
10
MICS. The terminodes project. http://www.terminodes.org, 2002.
 
11
S. L. Murphy and M. R. Badger. Digital signature protection of the OSPF routing protocol. IEEE, 1996.
 
12
13
 
14
 
15
16
17
 
18
Lidong Zhou and Zygmunt Haas. Securing ad hoc networks. In IEEE Network magazine, special issue on networking security, Vol. 13, No. 6, November/Dezember, pages 24--30, 1999.
 
19
P. Zimmerman. PGP user's guide, 1993.

CITED BY  124

Collaborative Colleagues:
Sonja Buchegger: colleagues
Jean-Yves Le Boudec: colleagues