Local detection of selfish routing behavior in ad hoc networks

• Published in: 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05) p. 8 pp.
• Main Authors: Wang, B., Soltani, S., Shapiro, J.K., Tan, P.-N.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Ad hoc networks; Automata; Automatic testing; Bandwidth; Computer science; Data mining; Intelligent networks; Peer to peer computing; Routing protocols; Wireless networks
• ISBN: 9780769525099; 0769525091
• ISSN: 1087-4089; 2375-527X
• DOI: 10.1109/ISPAN.2005.55

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.