User recruitment for mobile crowdsensing over opportunistic networks

Proceedings - IEEE INFOCOM

Volumn 26, Issue , 2015, Pages 2254-2262

  Karaliopoulos, Merkouris ^a,c   Telelis, Orestis ^b   Koutsopoulos, Iordanis ^a,c  

^a INFORMATION TECHNOLOGIES INSTITUTE   (Greece)

^b UNIVERSITY OF PIRAEUS   (Greece)

^c ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DELAY TOLERANT NETWORKS; WIRELESS NETWORKS;

APPROXIMATION RATIOS; DEVICE-TO-DEVICE COMMUNICATIONS; GREEDY HEURISTICS; INTERNET CONNECTIVITY; OBJECTIVE FUNCTIONS; OPPORTUNISTIC NETWORKING; OPPORTUNISTIC NETWORKS; SET COVER PROBLEM;

DATA ACQUISITION;

EID: 84954200420     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2015.7218612     Document Type: Conference Paper

References (17)

1. Amazon Mechanical Turk. https: //www. mturk. com/mturk/welcome, 2014.
2. D. Ashbrook and T. Starner. Using GPS to learn significant locations and predict movement across multiple users. Personal Ubiquitous Comput., 7 (5): 275-286, Oct. 2003.
3. E. Cho, S. A. Myers, and J. Leskovec. Friendship and mobility: User movement in location-based social networks. In Proc. 17th ACM SIGKDD, KDD'11, pages 1082-1090, 2011.
4. V. Chvátal. A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research, 4 (3): 233-235, 1979.
5. D. Feng, L. Lu, Y. Yuan-Wu, G. Li, S. Li, and G. Feng. Device-to-device communications in cellular networks. IEEE Communications Magazine, 52 (4): 49-55, Apr. 2014.
6. R. Ganti, F. Ye, and H. Lei. Mobile crowdsensing: current state and future challenges. IEEE Communications Magazine, 49 (11): 32-39, Nov. 2011.
7. T. Grossman and A. Wool. Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research, 101 (1): 81-92, 1997.
8. M. Karaliopoulos, O. Telelis, and I. Koutsopoulos. User recruitment for mobile crowdsensing over opportunistic networks (extended version), Information Technologies Institute, CERTH, Volos, Greece. http: //cgi. di. uoa. gr/mkaralio/OppCrowdSensingTR. pdf, Dec 2014.
9. C. Koufogiannakis and N. E. Young. Greedy-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. Algorithmica, 66 (1): 113-152, 2013.
10. Y. Li, M. Qian, D. Jin, P. Hui, Z. Wang, and S. Chen. Multiple mobile data offloading through disruption tolerant networks. IEEE Trans. on Mobile Computing, 13 (7): 1579-1596, Jul 2014.
11. D. Quercia, R. Schifanella, and L. M. Aiello. The shortest path to happiness: Recommending beautiful, quiet, and happy routes in the city. In Proc. 25th ACM Conference on Hypertext and Social Media, HT'14, pages 116-125, 2014.
12. S. Reddy, D. Estrin, and M. Srivastava. Recruitment framework for participatory sensing data collections. In Pervasive Computing, volume 6030 of LNCS, pages 138-155. Springer Berlin Heidelberg, 2010.
13. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD data set cambridge/haggle (v. 2006-01-31). Downloaded from http: //crawdad. org/cambridge/haggle/, Jan. 2006.
14. M. Srivastava, T. Abdelzaher, and B. Szymanski. Human-centric sensing. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 370 (1958): 176-197, 2012.
15. G. S. Tuncay, G. Benincasa, and A. Helmy. Participant recruitment and data collection framework for opportunistic sensing: A comparative analysis. In Proc. 8th ACM MobiCom Workshop on Challenged Networks, CHANTS'13, pages 25-30, 2013.
16. Y. Wang and H. Wu. Delay/fault-tolerant mobile sensor network (dftmsn): A new paradigm for pervasive information gathering. IEEE Trans. on Mobile Computing, 6 (9): 1021-1034, September 2007.
17. X. Xie, H. Chen, and H. Wu. Bargain-based stimulation mechanism for selfish mobile nodes in participatory sensing network. In Proc. 6th IEEE SECON, pages 72-80, June 2009