Coping With Misbehavior in Mobile Ad-hoc Networks

作者: Sonja Buchegger

DOI: 10.5075/EPFL-THESIS-2935

关键词: Reputation systemFalse positive paradoxMobile ad hoc networkPopulationComputer securityEngineeringCryptographyNetwork packetReputationComputer networkNetwork performance

摘要: In this work, we address the question of how to enable a system operate despite presence misbehavior. Specifically, in mobile ad-hoc network, can keep network functional for normal nodes when other do not route and forward correctly? Node misbehavior due selfish or malicious reasons faulty significantly degrade performance networks. Existing approaches such as economic incentives secure routing by cryptographic means alleviate some problems, but all. For instance, still packets on bogus routes. We propose protocol called CONFIDANT (Cooperation Of Nodes — Fairness Dynamic Ad-hoc NeTworks) cope with It enables detect first-hand observation use second-hand information provided nodes. The view node has about behavior another is captured reputation system, which used classify misbehaving normal. Once detected, it isolated from network. Reputation systems can, however, be tricked spread false ratings, accusations praise. Simple solutions exclusively relying one's own direct observations have drawbacks, they make all available. To solve problem, fully distributed that effectively safe way. Our approach based modified Bayesian estimation classification procedure. our approach, each maintains rating trust cares about. ratings capture quality an actor performing forwarding tasks. From time exchanged others; using designed, only accepted if compatible current rating. are slightly information. Trust reflect whether reported first hand summaries published likely true. updated compatibility prior ratings. redemption prevent sudden exploitation good built over introducing fading. Data entirely distributed, value collection maintained others. simulation evaluate demonstrate performance. found high even up half population misbehaves. show speeds detection while keeping number positives negatives negligibly low.

参考文章(104)
Bruce Schneier, Secrets and Lies Wiley-VCH. ,(2004)
Bruce Schneier, Semantic network attacks. Communications of The ACM. ,vol. 43, pp. 168- ,(2000)
Nick Mathewson, Roger Dingledine, Reputation in P2P Anonymity Systems ,(2003)
Olivier Dousse, Patrick Thiran, Connectivity of self-organized ad hoc wireless networks IEEE Intelligent Systems. ,vol. 18, pp. 83- 86 ,(2003)
Frank Stajano, None, The Resurrecting Duckling international workshop on security. pp. 183- 194 ,(1999) , 10.1007/10720107_25
Radia Joy Perlman, Network layer protocols with byzantine robustness Massachusetts Institute of Technology. ,(1988)
Francis Fukuyama, Robert Axelrod, Robert Jervis, The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration Foreign Affairs. ,vol. 77, pp. 142- ,(1998) , 10.2307/20048800
A. Fasbender, D. Kesdogan, O. Kubitz, Variable and scalable security: protection of location information in mobile IP vehicular technology conference. ,vol. 2, pp. 963- 967 ,(1996) , 10.1109/VETEC.1996.501454
Colin English, Waleed Wagealla, Paddy Nixon, Sotirios Terzis, Helen Lowe, Andrew McGettrick, Trusting Collaboration in Global Computing Systems Lecture Notes in Computer Science. pp. 136- 149 ,(2003) , 10.1007/3-540-44875-6_10
John R. Douceur, The Sybil Attack international workshop on peer to peer systems. pp. 251- 260 ,(2002) , 10.1007/3-540-45748-8_24