The Community for Technology Leaders
RSS Icon
Issue No.07 - July (2011 vol.60)
pp: 1045-1056
Tingting Chen , State University of New York at Buffalo
Fan Wu , University of Illinois at Urbana-Champaign
Sheng Zhong , State University of New York at Buffalo
A wireless ad hoc network does not have an infrastructure, and thus, needs the cooperation of nodes in forwarding other nodes' packets. Reputation system is an effective approach to give nodes incentives to cooperate in packet forwarding. However, existing reputation systems either lack rigorous analysis, or have analysis in unrealistic models. In this paper, we propose FITS, the first reputation system that has rigorous analysis and guaranteed incentive compatibility in a practical model. FITS has two schemes: the first scheme is very simple, but needs a Perceived Probability Assumption (PPA); the second scheme uses more sophisticated techniques to remove the need for PPA. We show that both of these two FITS schemes have a subgame perfect Nash equilibrium in which the packet forwarding probability of every node is one. Experimental results verify that FITS provides strong incentives for nodes to cooperate.
Keywords ad hoc networks, incentive compatibility, routing, packet forwarding.
Tingting Chen, Fan Wu, Sheng Zhong, "FITS: A Finite-Time Reputation System for Cooperation in Wireless Ad Hoc Networks", IEEE Transactions on Computers, vol.60, no. 7, pp. 1045-1056, July 2011, doi:10.1109/TC.2010.162
[1] L. Anderegg and S. Eidenbenz, "Ad Hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents," Proc. MOBICOM '03, Sept. 2003.
[2] S. Bansal and M. Baker, "Observation-Based Cooperation Enforcement in Ad Hoc Networks," technical report, Stanford Univ., July 2003.
[3] N.B. Salem, L. Buttyan, J.P. Hubaux, and M. Jakobsson, "A Charging and Rewarding Scheme for Packet Forwarding," Proc. MOBIHOC '02, June 2003.
[4] S. Buchegger and J.-Y. Le Boudec, "Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks," Proc. Euromicro Workshop Parallel, Distributed and Network-Based Processing (EUROMICRO-PDP '02), Jan. 2002.
[5] S. Buchegger and J.-Y. Le Boudec, "Performance Analysis of the CONFIDANT Protocol (Cooperation of Nodes: Fairness in Dynamic Ad-Hoc Networks)," Proc. MOBIHOC '02, June 2002.
[6] L. Buttyan and J.-P. Hubaux, "Enforcing Serviceavailability in Mobile Ad-Hoc WANs," Proc. MOBIHOC '00, Aug. 2000.
[7] L. Buttyan and J.-P. Hubaux, "Stimulating Cooperationin Self-Organizing Mobile Ad Hoc Networks," ACM/Kluwer Mobile Networks and Applications, vol. 8, no. 5, pp. 579-592, Oct. 2003.
[8] J. Crowcroft, R. Gibbens, F. Kelly, and S. Ostring, "Modelling Incentives for Collaboration in Mobile Ad Hoc Networks," Proc. First Workshop Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt '03), Mar. 2003.
[9] S. Eidenbenz, V.S.A. Kumar, and S. Zust, "Equilibria in Topology Control Games for Ad Hoc Networks," Proc. 2003 Joint Workshop Foundations of Mobile Computing, pp. 2-11, 2003.
[10] S. Eidenbenz, G. Resta, and P. Santi, "Commit: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes," Proc. IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '05), Apr. 2005.
[11] UCLA GloMoSim Project Team,, 2010.
[12] Q. He, D. Wu, and P. Khosla, "SORI: A Secure and Objective Reputation-Based Incentive Scheme for Ad-Hoc Networks," Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '04), vol. 2, pp. 825-830, Mar. 2004.
[13] M. Jakobsson, J.P. Hubaux, and L. Buttyan, "A Micropayment Scheme Encouraging Collaboration in Multi-Hop Cellular Networks," Proc. Int'l Conf. Financial Cryptography '03, pp. 15-33, 2003.
[14] J.J. Jaramillo and R. Srikant, "DARWIN: Distributed and Adaptive Reputation Mechanism for Wireless Ad-Hoc Networks," Proc. MOBICOM '07, Sept. 2007.
[15] R. Mahajan, M. Rodrig, D. Wetherall, and J. Zahorjan, "Sustaining Cooperation in Multi-Hop Wireless Networks," Proc. Symp. Networked Systems Design and Implementation (NSDI '05), May 2005.
[16] S. Marti, T. Giuli, K. Lai, and M. Baker, "Mitigating Routing Misbehavior in Mobile Ad Hoc Networks," Proc. MOBICOM '00, Aug. 2000.
[17] P. Michiardi and R. Molva, "CORE: A Collaborative Reputation Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks," Proc. Conf. Comm. and Multimedia Security (CMS '02), Sept. 2002.
[18] P. Michiardi and R. Molva, "Analysis of Coalition Formation and Cooperation Strategies in Mobile Ad Hoc Networks," Ad Hoc Networks, vol. 3, no. 2, pp. 193-219, Mar. 2005.
[19] F. Milan, J.J. Jaramillo, and R. Srikant, "Achieving Cooperation in Multihop Wireless Networks of Selfish Nodes," Proc. Workshop Game Theory for Comm. and Networks (GameNets '06), Oct. 2006.
[20] M.J. Osborne and A. Rubinstein, A Course in Game Theory. The MIT Press, 1994.
[21] M.T. Refaei, V. Srivastava, L. DaSilva, and M. Eltoweissy, "A Reputation-Based Mechanism for Isolating Selfish Nodes in Ad Hoc Networks," Proc. MobiQuitous '05, July 2005.
[22] M.S. Rahman, C.S. Iliopoulos, I. Lee, M. Mohamed, and W.F. Smyth, "Finding Patterns with Variable Length Gaps or Don't Cares," Proc. Ann. Int'l Computing and Combinatorics Conf. (COCOON '06), pp. 146-155, Aug. 2006.
[23] V. Srinivasan, P. Nuggehalli, C.F. Chiasserini, and R.R. Rao, "Energy Efficiency of Ad Hoc Wireless Networks with Selfish Users," Proc. European Wireless Conf., Feb. 2002.
[24] V. Srinivasan, P. Nuggehalli, C.F. Chiasserini, and R.R. Rao, "Cooperation in Wireless Ad Hoc Networks," Proc. INFOCOM '03, Mar./Apr. 2003.
[25] J. Wu and R. Axelrod, "How to Cope with Noise in the Iterated Prisoner's Dilemma," J. Conflict Resolution, vol. 39, no. 1, pp. 183-189, Mar. 1995.
[26] W. Wang, S. Eidenbez, Y. Wang, and X.-Y. Li, "OURS—Optimal Unicast Routing Systems in Non-Cooperative Wireless Networks," Proc. MOBICOM, Sept. 2006.
[27] W. Wang and X.-Y. Li, "Low-Cost Routing in Selfish and Rational Wireless Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 5, no. 5, pp. 596-607, May 2006.
[28] W. Wang, X.-Y. Li, and Y. Wang, "Truthful Multicast in Selfish Wireless Networks," Proc. MOBICOM '04, Sept. 2004.
[29] Y. Zhang, W. Lou, W. Liu, and Y. Fang, "A Secure Incentive Protocol for Mobile Ad Hoc Networks," ACM Wireless Networks, vol. 13, no. 5, pp. 569-582, Oct. 2007.
[30] S. Zhong, J. Chen, and Y.R. Yang, "Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks," Proc. INFOCOM '03, Mar./Apr. 2003.
[31] S. Zhong, L.E. Li, Y.G. Liu, and Y.R. Yang, "On Designing Incentive-Compatible Routing and Forwarding Protocols in Wireless Ad-Hoc Networks—An Integrated Approach Using Game Theoretical and Cryptographic Techniques," Proc. MOBICOM '05, Aug./Sept. 2005.
[32] S. Zhong and F. Wu, "On Designing Collusion-Resistant Routing Schemes for Non-Cooperative Wireless Ad Hoc Networks," Proc. MOBICOM '07, Sept. 2007.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool