Skip to main content
Springer Nature Link
Log in

An economic incentive model for encouraging peer collaboration in mobile-P2P networks with support for constraint queries

  • Published:
Save article
View saved research
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

In mobile ad hoc peer-to-peer (M-P2P) networks, economic models become a necessity for enticing non-cooperative mobile peers to provide service. M-P2P users may issue queries with varying constraints on query response time, data quality of results and trustworthiness of the data source. Hence, we propose ConQuer, which is an economic incentive model for the efficient processing of constraint queries in M-P2P networks. ConQuer also provides incentives for peer collaboration in order to improve data availability. The main contributions of ConQuer are three-fold. First, it uses a broker-based economic M-P2P model for processing constraint queries via a Vickrey auction mechanism. Second, it proposes the CR*-tree, a dynamic multidimensional R-tree-based index for constraints of data quality, trust and price of data to determine target peers efficiently. The CR*-tree is hosted by brokers, who can sell it to other peers, thereby encouraging the creation of multiple copies of the index for facilitating routing. Third, it provides incentives for peers to form collaborative peer groups for maximizing data availability and revenues by mutually allocating and deallocating data items using royalty-based revenue-sharing. Such reallocations facilitate better data quality, thereby further increasing peer revenues. Our performance study shows that ConQuer is indeed effective in answering constraint queries with improved response time, success rate and data quality, and querying hop-counts.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+
from €37.37 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price includes VAT (Netherlands)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
The alternative text for this image may have been generated using AI.
Fig. 2
The alternative text for this image may have been generated using AI.
Fig. 3
The alternative text for this image may have been generated using AI.
Fig. 4
The alternative text for this image may have been generated using AI.
Fig. 5
The alternative text for this image may have been generated using AI.
Fig. 6
The alternative text for this image may have been generated using AI.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.

References

  1. Adar E, Huberman BA (2000) Free riding on Gnutella. Proc First Monday 5(10):2

    Google Scholar 

  2. Anagnostakis KG, Greenwald MB (2004) Exchange-based incentive mechanisms for peer-to-peer file sharing. In: Proc ICDCS

  3. Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proc ACM SIGMOD

  4. Broch J, Maltz DA, Johnson DB, Hu YC, Jetcheva J (1998) A performance comparison of multi-hop wireless ad hoc network routing protocol. In: Proc MOBICOM

  5. Buttyan L, Hubaux J (2001) Nuglets: a virtual currency to stimulate cooperation in self-organized mobile ad hoc networks. Technical Report DSC/2001/001. Swiss Federal Institute of Technology, Lausanne

  6. Buttyan L, Hubaux JP (2003) Stimulating cooperation in self-organizing mobile ad hoc networks. ACM/Kluwer Mob Netw Appl 8(5):579–592

    Article  Google Scholar 

  7. Chakravorty R, Agarwal S, Banerjee S, Pratt I (2005) MoB: a mobile bazaar for wide-area wireless services. In: Proc. MobiCom

  8. Chen K, Nahrstedt K (2004) iPass: an incentive compatible auction scheme to enable packet forwarding service in MANET. In: Proc. ICDCS

  9. Crowcroft J, Gibbens R, Kelly F, Ostring S (2003) Modelling incentives for collaboration in mobile ad hoc networks. In: Proc. WiOpt

  10. Daras P, Palaka D, Giagourta V, Bechtsis D (2003) A novel peer-to-peer payment protocol. In: Proc. IEEE EUROCON, vol 1

  11. Datta A, Hauswirth M, Aberer K (2003) Beyond web of trust: Enabling P2P e-commerce. In: Proc. ICEC

  12. Elrufaie E, Turner D (2004) Bidding in P2P content distribution networks using the lightweight currency paradigm. In: Proc. ITCC

  13. Figueiredo DR, Shapiro J, Towsley D (2004) Payment-based incentives for anonymous peer-to-peer systems. UMass CMPSCI Technical Report 04-62

  14. Garyfalos A, Almeroth KC (2004) Coupon based incentive systems and the implications of equilibrium theory. In: Proc. IEEE international conference on E-commerce technology proceedings

  15. Golle P, Brown KL, Mironov I (2001) Incentives for sharing in peer-to-peer networks. In: Proc. Electronic Commerce

  16. Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD, pp 47–57

  17. Guy R, Reiher P, Ratner D, Gunter M, Ma W, Popek G (1998) Rumor: mobile data access through optimistic peer-to-peer replication. In: Proc. ER Workshops

  18. Ham M, Agha G (2005) ARA: a robust audit to prevent free-riding in P2P networks. In: Proc. P2P, pp 125–132

  19. Hara T, Madria SK (2005) Consistency management among replicas in peer-to-peer mobile ad hoc networks. In: Proc. IEEE SRDS

  20. Hara T, Madria SK (2006) Data replication for improving data accessibility in ad hoc networks. IEEE Trans Mob Comput 5(11):1515–1532

    Article  Google Scholar 

  21. http://tv.seas.harvard.edu/research.php

  22. Kamvar S, Schlosser M, Garcia-Molina H (2003) Incentives for combatting free-riding on P2P networks. In: Proc. Euro-Par

  23. Kremer S, Markowitch O, Zhou J (2002) An intensive survey of non-repudiation protocols. Technical Report 473, ULB

  24. Lee S, Muhammad RM, Kim C (2007) A leader election algorithm within candidates on ad hoc mobile networks. LNCS embedded software and systems. Springer, Heidelberg

    Google Scholar 

  25. Liebau N, Darlagiannis V, Heckmann O, Steinmetz R (2005) Asymmetric incentives in peer-to-peer systems. In: Proc. AMCIS

  26. Liu J, Issarny V (2004) Service allocation in selfish mobile ad hoc networks using vickrey auction. In: Proc. current trends in database technology - EDBT workshops, LNCS 3268

  27. Lu M, Li F, Wu J (2006) Incentive compatible cost and stability-based routing in ad hoc networks. In: Proc. ICPADS

  28. Lu R, Lin X, et al (2008) A novel fair incentive protocol for mobile ad hoc networks. In: Proc. WCNC

  29. Mannak R, de Ridder H, Keyson DV (2004) The human side of sharing in peer-to-peer networks. In: Proc. European union symposium on ambient intelligence

  30. Mondal A, Madria SK, Kitsuregawa M (2006) CADRE: a collaborative replica allocation and deallocation approach for Mobile-P2P networks. In: Proc. IDEAS

  31. Mondal A, Madria SK, Kitsuregawa M (2006) CLEAR: an efficient context and location-based dynamic replication scheme for Mobile-P2P networks. In: Proc. DEXA, pp 399–408

  32. Ratsimor O, Finin T, Joshi A, Yesha Y (2003) eNcentive: a framework for intelligent marketing in mobile peer-to-peer environments. In: Proc. ICEC

  33. Repantis T, Kalogeraki V (2006) Decentralized trust management for ad-hoc peer-to-peer networks. In: Proc. MPAC

  34. Richard B, Nioclais D, Chalon D (2003) Clique: a transparent, peer-to-peer replicated file system. In: Proc. MDM

  35. Sabater J, Sierra C (2005) Review on computational trust and reputation models. Artif Intell Rev 24(1):33–60

    Article  MATH  Google Scholar 

  36. Saroiu S, Gummadi PK, Gribbler SD (2002) A measurement study of P2P file sharing systems. In: Proc. MMCN

  37. Srinivasan V, Nuggehalli P, Chiasserini CF, Rao RR (2003) Cooperation in wireless ad hoc networks. In: Proc. INFOCOM

  38. Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM

  39. Straub T, Heinemann A (2004) An anonymous bonus point system for mobile commerce based on word-of-mouth recommendation. In: Proc. ACM SAC

  40. Turner DA, Ross KW (2004) A lightweight currency paradigm for the P2P resource market. In: Proc. electronic commerce research

  41. Vickrey W (1961) Counter speculation, auctions, and competitive sealed tenders. J Finance 41:8–37

    Article  Google Scholar 

  42. Wolfson O, Xu B, Sistla AP (2004) An economic model for resource exchange in mobile peer-to-peer networks. In: Proc. SSDBM

  43. Xu B, Wolfson O, Rishe N (2006) Benefit and pricing of spatio-temporal information in mobile peer-to-peer networks. In: Proc. HICSS-39

  44. Xue Y, Li B, Nahrstedt K (2005) Channel-relay price pair: towards arbitrating incentives in wireless ad hoc networks. J Wirel Commun Mob Comput 6:235–245 (Special issue on Ad Hoc Networks)

    Article  Google Scholar 

  45. Xue Y, Li B, Nahrstedt K (2005) Optimal resource allocation in wireless ad hoc networks: a price-based approach. IEEE Trans Mob Comput 5(4):347–364

    Google Scholar 

  46. Yu C, Shin KG, Lee B, Park SM, Kim HN (2006) Node clustering in mobile peer-to-peer multihop networks. In: Proc. PERCOMW

  47. Zhang Y, Lou W, Liu W, Fang Y (2006) A secure incentive protocol for mobile ad hoc networks. ACM Wirel Netw 13(5):663–678

    Article  Google Scholar 

  48. Zhong S, Chen J, Yang YR (2003) Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks. In: Proc. IEEE INFOCOM

  49. Zhong S, Li L (Erran), Liu YG, Yang Y (Richard) (2005) On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques. In: Proc. proc. international conference on mobile computing and networking

Download references

Author information

Authors and Affiliations

  1. Institute of Industrial Science, University of Tokyo, Tokyo, Japan

    Anirban Mondal & Masaru Kitsuregawa

  2. Department of Computer Science, Missouri University of Science and Technology, Rolla, MO, USA

    Sanjay Kumar Madria

Authors
  1. Anirban Mondal
    View author publications

    Search author on:PubMed Google Scholar

  2. Sanjay Kumar Madria
    View author publications

    Search author on:PubMed Google Scholar

  3. Masaru Kitsuregawa
    View author publications

    Search author on:PubMed Google Scholar

Corresponding author

Correspondence to Sanjay Kumar Madria.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mondal, A., Madria, S.K. & Kitsuregawa, M. An economic incentive model for encouraging peer collaboration in mobile-P2P networks with support for constraint queries. Peer-to-Peer Netw. Appl. 2, 230–251 (2009). https://doi.org/10.1007/s12083-009-0035-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue date:

  • DOI: https://doi.org/10.1007/s12083-009-0035-9

Keywords