Trading data in the crowd: Profit-driven data acquisition for mobile crowdsensing

IEEE Journal on Selected Areas in Communications

Volumn 35, Issue 2, 2017, Pages 486-501

  Zheng, Zhenzhe ^a   Peng, Yanqing ^a   Wu, Fan ^a   Tang, Shaojie ^b   Chen, Guihai ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

auction theory; Data marketplace; mobile crowdsensing

Indexed keywords

COMMERCE; PROFITABILITY;

AUCTION THEORY; COMPLEMENTARY MECHANISMS; DATA MARKETPLACES; DESIGN CHALLENGES; EVALUATION RESULTS; MOBILE CROWDSENSING; PROFIT MAXIMIZATION; STRATEGY-PROOFNESS;

DATA ACQUISITION;

EID: 85017325205     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2017.2659258     Document Type: Article

References (58)

1. K. Amin, A. Rostamizadeh, and U. Syed, "Learning prices for repeated auctions with strategic buyers," in Proc. Adv. Neural Inf. Process. Syst. (NIPS), South Lake Tahoe, CA, USA, Dec. 2013, pp. 1169-1177.
2. A. Archer, C. Papadimitriou, K. Talwar, and E. Tardos, "An approximate truthful mechanism for combinatorial auctions with single parameter agents," in Proc. 14th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), Baltimore, MD, USA, Jan. 2003, pp. 205-214.
3. M. Balazinska, B. Howe, and D. Suciu, "Data markets in the cloud: An opportunity for the database community," Proc. VLDB Endowment, vol. 4, no. 12, pp. 1482-1485, 2011.
4. H. K. Bhargava and V. Choudhary, "Research note-When is versioning optimal for information goods?" Manage. Sci., vol. 54, no. 5, pp. 1029-1035, 2008.
5. J.-M. Bohli, C. Sorge, and D. Westhoff, "Initial observations on economics, pricing, and penetration of the Internet of Things market," SIGCOMM Comput. Commun. Rev., vol. 39, no. 2, pp. 50-55, Apr. 2009.
6. Y. Chen, B. Li, and Q. Zhang, "Incentivizing crowdsourcing systems with network effects," in Proc. 35th IEEE Int. Conf. Comput. Commun. (INFOCOM), San Francisco, CA, USA, Apr. 2016, pp. 1-9.
7. M. H. Cheung, R. Southwell, F. Hou, and J. Huang, "Distributed timesensitive task selection in mobile crowdsensing," in Proc. 16th ACM Symp. Mobile Ad Hoc Netw. Comput. (MobiHoc), Hangzhou, China, Jun. 2015, pp. 157-166.
8. D. Cohn, L. Atlas, and R. Ladner, "Improving generalization with active learning," Mach. Learn., vol. 15, no. 2, pp. 201-221, May 1994.
9. T. M. Cover and J. A. Thomas, Elements of Information Theory. Hoboken, NJ, USA: Wiley, 2012.
10. A. Deshpande, C. Guestrin, S. R. Madden, J. M. Hellerstein, and W. Hong, "Model-driven data acquisition in sensor networks," in Proc. 13th Int. Conf. Very Large Data Bases (VLDB), Toronto, ON, Canada, Aug. 2004, pp. 588-599.
11. L. Duan, T. Kubo, K. Sugiyama, J. Huang, T. Hasegawa, and J. Walrand, "Incentive mechanisms for smartphone collaboration in data acquisition and distributed computing," in Proc. IEEE INFOCOM, Mar. 2012, pp. 1701-1709.
12. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, "A BGPbased mechanism for lowest-cost routing," Distrib. Comput., vol. 18, no. 1, pp. 61-72, Jul. 2005.
13. D. Fudenberg and J. Tirole, Game Theory. Cambridge, MA, USA: MIT Press, 1991.
14. T. Fujito, "Approximation algorithms for submodular set cover with applications," IEICE Trans. Inf. Syst., vol. 83, no. 3, pp. 480-487, Mar. 2000.
15. R. Gao et al., "Jigsaw: Indoor floor plan reconstruction via mobile crowdsensing," in Proc. 20th Int. Conf. Mobile Comput. Netw. (MobiCom), Maui, HI, USA, Sep. 2014, pp. 249-260.
16. L. Gargano and M. Hammar, "A note on submodular set cover on matroids," Discrete Math., vol. 309, no. 18, pp. 5739-5744, Sep. 2009.
17. A. V. Goldberg and J. D. Hartline, "Collusion-resistant mechanisms for single-parameter agents," in Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), Vancouver, BC, Canada, Jan. 2005, pp. 620-629.
18. S. He, D.-H. Shin, J. Zhang, and J. Chen, "Toward optimal allocation of location dependent tasks in crowdsensing," in Proc. 33rd IEEE Int. Conf. Comput. Commun. (INFOCOM), Toronto, ON, Canada, Apr. 2014, pp. 745-753.
19. Intel Research Berkeley Sensor Network Data. (2004). [Online]. Available: http://db.csail.mit.edu/labdata/labdata.html
20. I. Simonson and A. Tversky, "Choice in context: Tradeoff contrast and extremeness aversion," J. Marketing Res., vol. 29, no. 3, pp. 281-295, 1992.
21. R. K. Iyer and J. Bilmes, "Submodular optimization with submodular cover and submodular knapsack constraints," in Proc. Adv. Neural Inf. Process. Syst. (NIPS), South Lake Tahoe, CA, USA, Dec. 2013, pp. 2436-2444.
22. R. Iyer, S. Jegelka, and J. A. Bilmes, "Fast semidifferentialbased submodular function optimization," in Proc. 30th Int. Conf. Mach. Learn. (ICML), Atlanta, GA, USA, Jun. 2013, pp. 855-863.
23. H. Jin, L. Su, D. Chen, K. Nahrstedt, and J. Xu, "Quality of information aware incentive mechanisms for mobile crowd sensing systems," in Proc. 16th ACM Symp. Mobile Ad Hoc Netw. Comput. (MobiHoc), Hangzhou, China, Jun. 2015, pp. 167-176.
24. M. Karaliopoulos, I. Koutsopoulos, and M. Titsias, "First learn then earn: Optimizing mobile crowdsensing campaigns through data-driven user profiling," in Proc. 17th ACM Symp. Mobile Ad Hoc Netw. Comput. (MobiHoc), Paderborn, Germany, Jul. 2016, pp. 271-280.
25. M. Karaliopoulos, O. Telelis, and I. Koutsopoulos, "User recruitment for mobile crowdsensing over opportunistic networks," in Proc. 34th IEEE Int. Conf. Comput. Commun. (INFOCOM), Hong Kong, Apr. 2015, pp. 2254-2262.
26. A. R. Karlin and D. Kempe, "Beyond VCG: Frugality of truthful mechanisms," in Proc. 46th Annu. IEEE Symp. Found. Comput. Sci. (FOCS), Oct. 2005, pp. 615-624.
27. G. S. Kasbekar and S. Sarkar, "Spectrum pricing games with spatial reuse in cognitive radio networks," IEEE J. Sel. Areas Commun., vol. 30, no. 1, pp. 153-164, Jan. 2012.
28. D. Kempe, M. Salek, and C. Moore, "Frugal and truthful auctions for vertex covers, flows and cuts," in Proc. 51th Annu. Symp. Foud. Comput. Sci. (FOCS), Las Vegas, NV, USA, Oct. 2010, pp. 745-754.
29. G. Koop, D. J. Poirier, and J. L. Tobias, Bayesian Econometric Methods. Cambridge, U.K.: Cambridge Univ. Press, 2007.
30. P. Koutris, P. Upadhyaya, M. Balazinska, B. Howe, and D. Suciu, "Toward practical query pricing with QueryMarket," in Proc. ACM SIGMOD Int. Conf. Manage. Data (SIGMOD), New York, NY, USA, Jun. 2013, pp. 613-624.
31. P. Koutris, P. Upadhyaya, M. Balazinska, B. Howe, and D. Suciu, "Query-based data pricing," J. ACM, vol. 62, no. 5, Nov. 2015, Art. no. 43.
32. I. Koutsopoulos, "Optimal incentive-driven design of participatory sensing systems," in Proc. IEEE INFOCOM, Apr. 2013, pp. 1402-1410.
33. A. Krause and C. Guestrin, "Near-optimal nonmyopic value of information in graphical models," in Proc. 21st Conf. Uncertainty Artif. Intell. (UAI), Edinburgh, Scotland, Jul. 2005, pp. 324-331.
34. A. Krause and C. Guestrin, "A note on the budgeted maximization on submodular functions," Dept. Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA, Tech. Rep. CMU-CALD-05-103, 2005.
35. B.-R. Lin and D. Kifer, "On arbitrage-free pricing for general data queries," Proc. VLDB Endowment, vol. 7, no. 9, pp. 757-768, May 2014.
36. R. T. B. Ma, D. M. Chiu, J. C. S. Lui, V. Misra, and D. Rubenstein, "Internet economics: The use of shapley value for ISP settlement," IEEE/ACM Trans. Netw., vol. 18, no. 3, pp. 775-787, Jun. 2010.
37. P. Marbach and R. Berry, "Downlink resource allocation and pricing for wireless networks," in Proc. 21st Annu. IEEE Conf. Comput. Commun. (INFOCOM), New York, NY, USA, Jun. 2002, pp. 1470-1479.
38. A. Mas-Colell, M. D. Whinston, and J. R. Green, Microecon. Theory. London, U.K.: Oxford Univ. Press, 1995.
39. R. B. Myerson, "Optimal auction design," Math. Oper. Res., vol. 6, no. 1, pp. 58-73, 1981.
40. N. Nisan and A. Ronen, "Algorithmic mechanism design (extended abstract)," in Proc. 31st Annu. Symp. Theory Comput. (STOC), Atlanta, GA, USA, 1999, pp. 129-140.
41. NoiseMap: A Research Project at Technische Universität Darmstadt. [Online]. Available: https://www:tk:informatik:tu-darmstadt:de/de/ research/smarturban-networks/noisemap/
42. NoiseTube: A Research Project at the Sony Computer Science Laboratory in Paris. (2008). [Online]. Available: http://www:noisetube:net/
43. A. Odlyzko, "Paris metro pricing for the Internet," in Proc. ACM Symp. Electron. Commerce (EC), Denver, CO, USA, Oct. 1999, pp. 140-147.
44. C. Papadimitriou, M. Schapira, and Y. Singer, "On the hardness of being truthful," in Proc. 49th Annu. Symp. Foud. Comput. Sci. (FOCS), Philadelphia, PA, USA, Oct. 2008, pp. 250-259.
45. Quandl. (2011). [Online]. Available: https://www.quandl.com/
46. A. Ronen and A. Saberi, "On the hardness of optimal auctions," in Proc. 43rd Annu. Symp. Foud. Comput. Sci. (FOCS), Vancouver, BC, Canada, Oct. 2002, pp. 396-405.
47. C. Shapiro and H. R. Varian, "Versioning: The smart way to sell information," Harvard Bus. Rev., vol. 107, no. 6, pp. 106-114, 1998.
48. G. E. Smith and T. T. Nagle, "Frames of reference and buyers' perception of price and value," California Manage. Rev., vol. 38, no. 1, pp. 98-116, 1995.
49. J. Tadrous, A. Eryilmaz, and H. El Gamal, "Pricing for demand shaping and proactive download in smart data networks," in Proc. IEEE INFOCOM, Apr. 2013, pp. 3189-3194.
50. Terbin. (2013). [Online]. available: http://www.terbine.com
51. Thingful. (2014). [Online]. Available: https://thingful.net/
52. Thingspeak. (2010). [Online]. Available: https://thingspeak.com/
53. V. Valancius, C. Lumezanu, N. Feamster, R. Johari, and V. V. Vazirani, "How many tiers?: Pricing in the Internet transit market," in Proc. ACM SIGCOMM Conf. Appl., Technol., Archit., Protocols Comput. Commun. (SIGCOMM), Toronto, ON, Canada, Aug. 2011, pp. 194-205.
54. H. R. Varian, "Versioning information goods," Univ. California, Berkeley, Berkeley, CA, USA, Tech. Rep., 1997.
55. P.-J. Wan, D.-Z. Du, P. Pardalos, and W. Wu, "Greedy approximations for minimum submodular cover with submodular cost," Comput. Optim. Appl., vol. 45, no. 2, pp. 463-474, Mar. 2010.
56. Windows Azure Data Marketplace. [Online]. Avbailable: https:// datamarket:azure:com/browse/data.
57. L. A. Wolsey, "An analysis of the greedy algorithm for the submodular set covering problem," Combinatorica, vol. 2, no. 4, pp. 385-393, Dec. 1982.
58. D. Yang, G. Xue, X. Fang, and J. Tang, "Crowdsourcing to smartphones: Incentive mechanism design for mobile phone sensing," in Proc. 18th Int. Conf. Mobile Comput. Netw. (Mobicom), Aug. 2012, pp. 173-184.