ABIDE: A Bid-Based Economic Incentive Model for Enticing Non-cooperative Peers in Mobile-P2P Networks

  • Anirban Mondal
  • Sanjay Kumar Madria
  • Masaru Kitsuregawa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4443)

Abstract

We propose ABIDE, a novel bid-based economic incentive model for enticing non-cooperative mobile peers to provide service in M-P2P networks. The main contributions of ABIDE are three-fold. First, it encourages relay peers to act as brokers for performing value-added routing (i.e., pro-actively search for query results) due to bid-based incentives. Second, it integrates newly joined peers in the system seamlessly by sharing the loads with the neighbouring brokers. This helps the new peers to earn revenues in order to be able to obtain services. Third, it considers effective data sharing among the peers. ABIDE also considers quality of service, load, energy and network topology. Our performance study indicates that ABIDE is indeed effective in increasing the number of service-providers in M-P2P networks, thereby improving query response times and data availability.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adar, E., Huberman, B.A.: Free riding on Gnutella. Proc. First Monday 5(10) (2000)Google Scholar
  2. 2.
    Broch, J., Maltz, D.A., Johnson, D.B., Hu, Y.C., Jetcheva, J.: A performance comparison of multi-hop wireless ad hoc network routing protocol. In: Proc. MOBICOM (1998)Google Scholar
  3. 3.
    Buttyan, L., Hubaux, J.P.: Stimulating cooperation in self-organizing mobile ad hoc networks. Proc. ACM/Kluwer Mobile Networks and Applications 8(5) (2003)Google Scholar
  4. 4.
    Ferguson, D.F., Yemini, Y., Nikolaou, C.: Microeconomic algorithms for load balancing in distributed computer systems. In: Proc. ICDCS, pp. 491–499 (1988)Google Scholar
  5. 5.
    Fischmann, M., Gunther, O.: Free riders: Fact or fiction? (Sep. 2003)Google Scholar
  6. 6.
    Golle, P., Brown, K.L., Mironov, I.: Incentives for sharing in peer-to-peer networks. In: Proc. Electronic Commerce (2001)Google Scholar
  7. 7.
    Grothoff, C.: An excess-based economic model for resource allocation in peer-to-peer networks. In: Proc. Wirtschaftsinformatik (2003)Google Scholar
  8. 8.
    Ham, M., Agha, G.: ARA: A robust audit to prevent free-riding in P2P networks. In: Proc. P2P, pp. 125–132 (2005)Google Scholar
  9. 9.
    Hara, T., Madria, S.K.: Data replication for improving data accessibility in ad hoc networks. To appear in IEEE Transactions on Mobile Computing (2006)Google Scholar
  10. 10.
    Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: Incentives for Combatting Freeriding on P2P Networks. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 1273–1279. Springer, Heidelberg (2003)Google Scholar
  11. 11.
  12. 12.
    Kurose, J.F., Simha, R.: A microeconomic approach to optimal resource allocation in distributed computer systems. Proc. IEEE Trans. Computers 38(5), 705–717 (1989)CrossRefGoogle Scholar
  13. 13.
    Lee, S., Sherwood, R., Bhattacharjee, B.: Cooperative peer groups in NICE. In: Proc. INFOCOM (2003)Google Scholar
  14. 14.
    Liebau, N., Darlagiannis, V., Heckmann, O., Steinmetz, R.: Asymmetric incentives in peer-to-peer systems. In: Proc. AMCIS (2005)Google Scholar
  15. 15.
    First Workshop on the Economics of P2P Systems (2003), http://www.sims.berkeley.edu/research/conferences/p2pecon
  16. 16.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM (2001)Google Scholar
  17. 17.
    Wolfson, O., Xu, B., Sistla, A.P.: An economic model for resource exchange in mobile Peer-to-Peer networks. In: Proc. SSDBM (2004)Google Scholar
  18. 18.
    Xu, B., Wolfson, O., Rishe, N.: Benefit and pricing of spatio-temporal information in Mobile Peer-to-Peer networks. In: Proc. HICSS (2006)Google Scholar
  19. 19.
    Zhong, S., Chen, J., Yang, Y.R.: Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks. In: Proc. IEEE INFOCOM (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Anirban Mondal
    • 1
  • Sanjay Kumar Madria
    • 2
  • Masaru Kitsuregawa
    • 1
  1. 1.Institute of Industrial Science, University of TokyoJapan
  2. 2.Department of Computer Science, University of Missouri-RollaUSA

Personalised recommendations