2006 · 30 citations · 16 references
ComputingInformation TechnologyDistributed SystemsMarkov Decision ProcessesNetwork SecurityAd Hoc Mobile NetworksCooperative BehaviorMobile Ad Hoc NetworksRoutingRouting ProtocolsAd Hoc Network ProtocolsAd Hoc NetworkingAd Hoc NetworksMobile Ad Hoc Network RoutingMobile Ad Hoc RoutingReputation-based RoutingRoute DiscoveryRouting Attack Detection
Reputation mechanisms for detecting and punishing free-riders in ad hoc networks depend on the local detection of selfish behavior. Although naive selfish strategies based on dropping data packets are readily detected, more sophisticated strategies that manipulate ad hoc routing protocols present a greater challenge. In this work we develop a method to distinguish selfish peers from cooperative ones based solely on local observations of AODV routing protocol behavior. Our approach uses the finite state machine model of locally observed AODV actions to build up a statistical description of the behavior of each neighbor. We apply a series of well-known statistical tests to features derived from this description to partition the set neighboring nodes into a cooperative and selfish class. Simulation results for a non-mobile ad hoc network show that our approach can detect two different types of routing manipulation while maintaining a low rate of false positives.
16
Individual Comparisons by Ranking Methods
Frank Wilcoxon · Biometrics Bulletin · 1945 · 14.4K citations
Business, Computer Science, Multi-criteria Decision Making +8
Ad-hoc on-demand distance vector routing
Charles E. Perkins, E.M. Royer · 1999 · 10.3K citations
Mitigating routing misbehavior in mobile ad hoc networks
Sergio Marti, TJ Giuli, Kevin Lai et al. · 2000 · 3.4K citations · Full text
Mathematical Statistics and Data Analysis
Larry Rabinowitz · Technometrics · 1989 · 3.1K citations · Full text
Performance analysis of the CONFIDANT protocol
Sonja Buchegger, Jean‐Yves Le Boudec · 2002 · 1.5K citations · Full text