LARS: a locally aware reputation system for mobile ad hoc networks

ABSTRACT

Mobile ad hoc networks (MANETs) have nodes that are dynamically and arbitrarily located. The nodes are often battery powered and may behave selfishly to preserve power. A promising mechanism to deal with node selfishness is to use reputation methods. In this paper, we discuss some general issues with current reputation methods that are used to mitigate selfish node behavior and propose a simple and efficient Locally Aware Reputation System (LARS) for which the reputation of the nodes is derived by using direct observation. LARS is flexible and can deal with both extreme selfishness and selective selfishness.

REFERENCES

• 1: C. E. Perkins, Ad Hoc Networking, Addison-Wesley, 2000.
• 2: Marco Conti , Enrico Gregori , Gaia Maselli, Cooperation Issues in Mobile Ad Hoc Networks, Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04), p.803-808, March 23-24, 2004
• 3: Charles E. Perkins , Elizabeth M. Royer, Ad-hoc On-Demand Distance Vector Routing, Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications, p.90, February 25-26, 1999
• 4: P. Papadimitratos and Z. J. Haas, Secure Routing for Mobile Ad hoc Networks, SCS Communication Networks and Distributed Systems Modeling and Simulation Conference, 2002.
• 5: Yih-Chun Hu , Adrian Perrig , David B. Johnson, Ariadne:: a secure on-demand routing protocol for ad hoc networks, Proceedings of the 8th annual international conference on Mobile computing and networking, September 23-28, 2002, Atlanta, Georgia, USA [doi>10.1145/570645.570648]
• 6: Kimaya Sanzgiri , Bridget Dahill , Brian Neil Levine , Clay Shields , Elizabeth M. Belding-Royer, A Secure Routing Protocol for Ad Hoc Networks, Proceedings of the 10th IEEE International Conference on Network Protocols, p.78-89, November 12-15, 2002
• 7: Yih-Chun Hu , David B. Johnson , Adrian Perrig, SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks, Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications, p.3, June 20-21, 2002
• 8: Levente Buttyán , Jean-Pierre Hubaux, Enforcing service availability in mobile ad-hoc WANs, Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing, November 20, 2000, Boston, Massachusetts
• 9: Naouel Ben Salem , Levente Buttyán , Jean-Pierre Hubaux , Markus Jakobsson, A charging and rewarding scheme for packet forwarding in multi-hop cellular networks, Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, June 01-03, 2003, Annapolis, Maryland, USA [doi>10.1145/778415.778418]
• 10: S. Zhong, J. Chen, and Y. R. Yang, Sprite: A simple, Cheat-proof, Credit-based System for Mobile Ad hoc Networks, Proc. IEEE Infocom '03.
• 11: Sonja Buchegger , Jean-Yves Le Boudec, Performance analysis of the CONFIDANT protocol, Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, June 09-11, 2002, Lausanne, Switzerland [doi>10.1145/513800.513828]
• 12: S. Buchegger, J-Y. Le Boudec, A Robust Reputation System for P2P and Mobile Ad-hoc Networks, Proc. 2nd Workshop on the Economics of Peer-to-Peer Systems, 2004.
• 13: Pietro Michiardi , Refik Molva, Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks, Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security, p.107-121, September 26-27, 2002
• 14: S. Bansal and M. Baker, Observation-based Cooperation Enforcement in Ad Hoc Networks, Technical report, Stanford University, NI/0307012, 2003.
• 15: S. Buchegger and J-Y. Le Boudec, The effect of rumor spreading in reputation systems for mobile ad-hoc networks. Proc. WiOpt '03.
• 16: P. Yau and C. J. Mitchell, Reputation methods for routing security for mobile ad hoc networks, Proc. SympoTIC '03.
• 17: P. Yau and C. J. Mitchell, Security vulnerabilities in ad hoc networks, 7th Intern. Symp. Communication Theory and Applications, 2003.
• 18: S. Buchegger, J-Y. Le Boudec, Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks. 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, 2002.
• 19: Y. Wang, V. C. Giruka, M. Singhal. A Fair Distributed Solution for Selfish Nodes Problem in Wireless Ad Hoc Networks. ADHOC-NOW 2004.
• 20: http://www.isi.edu/nsnam/ns/
• 21: Christian Bettstetter , Christian Wagner, The Spatial Node Distribution of the Random Waypoint Mobility Model, Mobile Ad-Hoc Netzwerke, 1. deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002, p.41-58, March 25-26, 2002

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.3 Network Operations
          Subjects: Network monitoring

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication
      C.2.3 Network Operations
          Subjects: Network management

General Terms:
Design, Management

Keywords:
MANET, reputation systems, selfishness, trust, virtual currency schemes