Jiangyi Hu
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.
- C. E. Perkins, Ad Hoc Networking, Addison-Wesley, 2000. Google Scholar
Digital Library
- M. Conti, E. Gregori, and G. Maselli. Cooperation Issues in Mobile Ad Hoc Networks, Int. Workshop on Wireless Ad Hoc Networking (WWAN), Proc. IEEE ICDCS Workshops, Tokyo, Japan, 2004. Google ScholarDigital Library
- C. E. Perkins and E. M. Royer, Ad hoc On-Demand Distance Vector Routing, Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans 1999. Google ScholarDigital Library
- P. Papadimitratos and Z. J. Haas, Secure Routing for Mobile Ad hoc Networks, SCS Communication Networks and Distributed Systems Modeling and Simulation Conference, 2002.Google Scholar
- Y-C Hu, A. Perrig, D. B. Johnson, Ariadne: A secure On-Demand Routing Protocol for Ad Hoc Networks, Proc. MOBICOM 2002. Google ScholarDigital Library
- K. Sanzgiri, B. Dahill, B. N. Levine, C. Shields, E. M. Belding-Royer, A secure routing protocol for ad hoc networks, International Conference on Network Protocols (ICNP), 2002 Google ScholarDigital Library
- Y-C. Hu, D. B. Johnson, and A. Perrig, SEAD: Secure and efficient distance vector routing for mobile wireless ad hoc networks, 4th IEEE Workshop on Mobile Computing Systems and Applications, 2002. Google ScholarDigital Library
- L. Buttyan and J-P. Hubaux, Enforced Service Availability in Mobile Ad-Hoc WANs, Proc. MobiHoc 2000 Google ScholarDigital Library
- N. B. Salem, L. Buttyan, J-P. Hubaux, M. Jakobsson, A charging and rewarding scheme for packet forwarding in multi-hop cellular networks, Proc. MobiHoc 2003. Google ScholarDigital Library
- 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.Google Scholar
- S. Buchegger and J-Y. Le Boudec, Performance Analysis of the CONFIDANT Protocol: Cooperation Of Nodes - Fairness In Dynamic Ad-hoc NeTworks, Proc. MobiHoc 2002. Google ScholarDigital Library
- 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.Google Scholar
- P. Michiardi, R. Molva, Core: A Collaborative REputation mechanism to enforce node cooperation in Mobile Ad Hoc Networks, IFIP-Communicatin and Multimedia Security Conference 2002. Google ScholarDigital Library
- S. Bansal and M. Baker, Observation-based Cooperation Enforcement in Ad Hoc Networks, Technical report, Stanford University, NI/0307012, 2003.Google Scholar
- S. Buchegger and J-Y. Le Boudec, The effect of rumor spreading in reputation systems for mobile ad-hoc networks. Proc. WiOpt '03.Google Scholar
- P. Yau and C. J. Mitchell, Reputation methods for routing security for mobile ad hoc networks, Proc. SympoTIC '03.Google Scholar
- P. Yau and C. J. Mitchell, Security vulnerabilities in ad hoc networks, 7th Intern. Symp. Communication Theory and Applications, 2003.Google Scholar
- 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. Google ScholarDigital Library
- Y. Wang, V. C. Giruka, M. Singhal. A Fair Distributed Solution for Selfish Nodes Problem in Wireless Ad Hoc Networks. ADHOC-NOW 2004.Google Scholar
- http://www.isi.edu/nsnam/ns/Google Scholar
- C. Bettstetter and C. Wagner. The Spatial Node Distribution of the Random Waypoint Mobility Model. Proc. 1st German Workshop on Mobile Ad-Hoc Networks (WMAN02), 2002. Google ScholarDigital Library
Index Terms
- LARS: a locally aware reputation system for mobile ad hoc networks
Recommendations
Reputation based selfishness prevention techniques for mobile ad-hoc networks
Mobile ad-hoc networks require nodes to cooperate in the relaying of data from source to destination. However, due to their limited resources, selfish nodes may be unwilling to forward packets, which can deteriorate the multi-hop connectivity. Different ...
A cluster-based trust-aware routing protocol for mobile ad hoc networks
Routing protocols are the binding force in mobile ad hoc network (MANETs) since they facilitate communication beyond the wireless transmission range of the nodes. However, the infrastructure-less, pervasive, and distributed nature of MANETs renders them ...
Random feedbacks for selfish nodes detection in mobile ad hoc networks
IPOM'05: Proceedings of the 5th IEEE international conference on Operations and Management in IP-Based NetworksA mobile ad hoc network (MANET) is a temporary infrastructureless network, formed by a set of mobile hosts that dynamically establish their own network on the fly without relying on any central administration. Mobile hosts used in MANET have to ensure ...
Comments