Skip to main content
SpringerLink
Log in

Top-k query processing in mobile-P2P networks using economic incentive schemes

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

This work proposes the E-Top system for the efficient processing of top-k queries in mobile ad hoc peer to peer (M-P2P) networks using economic incentive schemes. In E-Top, brokers facilitate top-k query processing in lieu of a commission. E-Top issues economic rewards to the mobile peers, which send relevant data items (i.e., those that contribute to the top-k query result), and penalizes peers otherwise, thereby optimizing the communication traffic. Peers use the payoffs (rewards/penalties) as a means of feedback to re-evaluate the scores of their items for re-ranking purposes. The main contributions of E-Top are three-fold. First, it proposes two economic incentive schemes, namely ETK and ETK+, in which peers act individually towards top-k query processing. Second, it extends ETK and ETK+ to propose a peer group-based economic incentive scheme ETG. Third, our performance evaluation shows that our schemes are indeed effective in improving the performance of top-k queries in terms of query response times and accuracy at reasonable communication traffic cost.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Notes

  1. 1 Query results received by QI after the deadline entail no payments.

References

  1. Mechanical Turk (Amazon.com). http://www.mturk.com/mturk/welcome

  2. OMNeT++ (omnet.org). http://www.omnetpp.org

  3. Broch J, Maltz D, Johnson D, Hu Y, Jetcheva J (1998) A performance comparison of multi-hop wireless ad hoc network routing protocol. Proc. MobiCom

  4. 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

  5. Buttyan L, Hubaux J (2003) Stimulating cooperation in self-organizing mobile Ad Hoc networks. ACM Mob Netw Appl 8(5)

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

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

  8. Crowcroft J, Gibbens R, Kelly F, Ostring S (2003) Modelling incentives for collaboration in mobile Ad Hoc networks. Proc. WiOpt

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

  10. Dong M, Kimata T, Sugiura K, Zettsu K (2014) Quality-of-experience (QoE) in emerging mobile social networks. IEICE Trans 97-D(10)

  11. Ferguson D, Nikolaou C, Yemini Y (1993) An economy for managing replicated data in autonomous decentralized systems. In: Proc. International Symposium in Autonomous Decentralized Systems

  12. Ferguson D, Yemini Y, Nikolaou C (1988) Microeconomic algorithms for load balancing in distributed computer systems. Proc. ICDCS

  13. Franklin M, Kossmann D, Kraska T, Ramesh S, Xin R (2011) CrowdDB: Answering Queries with Crowdsourcing. Proc. SIGMOD

  14. Golle P, Brown K, Mironov I (2001) Incentives for sharing in peer-to-peer networks. Proc. Electronic Commerce

  15. Grothoff C (2003) An excess-based economic model for resource allocation in peer-to-peer networks. Proc. Wirtschaftsinformatik

  16. Gutierrez-Nolasco S, Venkatasubramanian N, Talcott C, Stehr MO (2011) Tailoring group membership consistency for mobile networks. Proc. CTS

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

  18. Hagihara R, Shinohara M, Hara T, Nishio S (2009) A message processing method for top-k query for traffic reduction in Ad Hoc networks. Proc. MDM

  19. Ham M, Agha G (2005) ARA: a robust audit to prevent free-riding in P2P networks. Proc. P2P

  20. Hara T, Hagihara R, Sasaki Y, Shinohara M, Nishio S (2010) Efficient top-k query processing in mobile ad hoc networks. Next-Generation Comput. 1(2)

  21. Hara T, Madria S (2006) Data replication for improving data accessibility in Ad Hoc networks. IEEE TMC 5(11)

  22. Hwang S, Chang K (2007) Optimizing top-k queries for middleware access: a unified cost-based approach. ACM TODS 32(1)

  23. Jung H, Cho B, Chung Y, Liu L (2010) On processing location based top-k queries in the wireless broadcasting system. Proc. ACM SAC

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

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

  26. Kumrai T, Ota K, Dong M, Champrasert P (2014) RSU placement optimization in vehicular participatory sensing networks. Proc. INFOCOM workshops

  27. Kurose JF, Simha R (1989) A microeconomic approach to optimal resource allocation in distributed computer systems, vol 38

  28. Lam K, Cheng R, Liang B, Chau J (2004) Sensor node selection for execution of continuous probabilistic queries in wireless sensor networks. Proc. ACM VSSN Workshop

  29. Lee W, Lee J, Kim Y, Leung C (2009) AnchorWoman: Top-k structured mobile web search engine. Proc. CIKM

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

  31. Liu J, Issarny V (2004) Service allocation in selfish mobile Ad Hoc networks using Vickrey auction. Proc. Current trends in database Technology - EDBT Workshops

  32. Liu X, Xu J, Lee W (2010) A cross pruning framework for top-k data collection in wireless sensor networks. Proc. MDM

  33. Ota K, Dong M, Chang S, Zhu H (2015) MMCD: cooperative downloading for highway VANETs, vol 3, IEEE Trans Emerg Top Comput

  34. Ramaswamy L, Liu L (2003) Free riding: A new challenge to P2P file sharing systems. Proc. HICSS

  35. Ratner D, Reiher P, Popek G, Kuenning G (2001) Replication requirements in mobile environments, vol 6

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

  37. Sabater J, Sierra C (2005) Review on computational trust and reputation models. Artif Intell Rev 24(1)

  38. Soliman M, Ilyas I, Chang K (2008) Probabilistic top-k and ranking-aggregate queries. ACM TODS 33 (3)

  39. Srinivasan V, Nuggehalli P, Chiasserini C, Rao RR (2003) Cooperation in wireless Ad Hoc networks. Proc. INFOCOM

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

  41. Wu M, Xu J, Tang X, Lee W (2006) Monitoring top-k query in wireless sensor networks. Proc. ICDE

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

  43. Xue Y, Li B, Nahrstedt K (2005) Channel-relay price pair: towards arbitrating incentives in wireless Ad Hoc networks. Wireless communications and mobile computing

  44. Xue Y, Li B (2005) Optimal resource allocation in wireless Ad Hoc networks: A price-based approach. IEEE TMC

  45. Zeinalipour-Yazti D, Vagena Z (2008) Distributed Top-K Query processing in wireless sensor networks. Proc. MDM

  46. Zhong S, Chen J, Yang Y (2003) Sprite: A simple: Cheat-proof, credit-based system for mobile Ad-Hoc networks. Proc. INFOCOM

Download references

Author information

Authors and Affiliations

  1. Indraprastha Institute of Information Technology, Delhi, India

    Nilesh Padhariya

  2. Xerox Research, Bengaluru, India

    Anirban Mondal

  3. Missouri University of Science, Technology, Rolla, MO, 65409, USA

    Sanjay Kumar Madria

Authors
  1. Nilesh Padhariya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anirban Mondal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sanjay Kumar Madria
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sanjay Kumar Madria.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Padhariya, N., Mondal, A. & Madria, S.K. Top-k query processing in mobile-P2P networks using economic incentive schemes. Peer-to-Peer Netw. Appl. 9, 731–751 (2016). https://doi.org/10.1007/s12083-015-0391-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-015-0391-6

Keywords

Search

Navigation