research-article

A detour planning algorithm in crowdsourcing systems for multimedia content gathering

Authors:

Chen-Chih Liao,

Cheng-Hsin HsuAuthors Info & Claims

MoVid '13: Proceedings of the 5th Workshop on Mobile Video

Pages 55 - 60

https://doi.org/10.1145/2457413.2457426

Published: 27 February 2013 Publication History

Abstract

Crowdsourcing is a popular paradigm that outsources tasks to general publics. In crowdsourcing systems, requesters submit requests and workers perform selective requests for rewards. We propose a crowdsourcing system for multimedia content gathering, which is a new class of crowdsourcing systems with requests that must be performed at specific locations and time. The workers in our systems gather multimedia content using their smartphones and share the collected content over the Internet. Our system computes a detour path for each worker, who supplies his/her destination with a deadline to the system, and do not mind to take detour paths and perform some requests for profits. More precisely, we develop a detour planning algorithm to produce the optimal detour paths for individual workers. Using extensive trace-driven simulations, we demonstrate the effectiveness and efficiency of our algorithm: for example, it helps workers to achieve optimal profits (up to ~ 100% improvement compared to baseline solutions) and runs in real-time (< 82 ms). Developing a working prototype on Android OS and addressing other challenging aspects of the considered systems are among our future tasks.

References

[1]

Amazon mechanical turk, July 2012. https://www.mturk.com.

[2]

C. Bassem and A. Bestavros. Mechanism design for spatio-temporal request satisfaction in mobile networks. Technical report, Boston University, February 2012.

[3]

S. Casey, B. Kirman, and D. Rowland. The gopher game: A social, mobile, locative game with user generated content and peer review. In Proc. of ACM International Conference on Advances in Computer Entertainment Technology (ACE'07), pages 9--16, Salzburg, Austria, June 2007.

Digital Library

[4]

D. Choffnes, F. Bustamante, and Z. Ge. Crowdsourcing service-level network event monitoring. In Proc. of ACM SIGCOMM'10, pages 387--398, New Delhi, India, August 2010.

Digital Library

[5]

flickr, October 2012. http://www.flickr.com/.

[6]

B. Golden, L. Levy, and R. Vohra. The orienteering problem. Naval Research Logistics, 34(3):307--318, 1987.

[7]

L. Grant, H. Daanen, S. Benford, A. Hampshire, A. Drozd, and C. Greenhalgh. MobiMissions: The game of missions for mobile phones. In Proc. of ACM SIGGRAPH'07, San Diego, CA, August 2007.

Digital Library

[8]

Z. Li, H. Shen, G. Liu, and J. Li. SOS: A distributed mobile Q&A system based on social networks. In Proc. of the IEEE International Conference on Distributed Computing Systems (ICDCS'12), Macau, China, June 2012.

Digital Library

[9]

N. Maisonneuve, M. Stevens, M. Niessen, P. Hanappe, and L. Steels. Citizen noise pollution monitoring. In Proc. of International Digital Government Research Conference (DG.O'09), pages 96--103, Puebla, Mexico, May 2009.

Digital Library

[10]

E. Martins and M. Pascoal. A new implementation of Yen's ranking loopless paths algorithm. 4OR: A Quarterly Journal of Operations Research, 1(2):121--133, June 2003.

[11]

S. Matyas, C. Matyas, C. Schlieder, P. Kiefer, H. Mitarai, and M. Kamata. Designing location-based mobile games with a purpose: Collecting geospatial data with CityExplorer. In Proc. of ACM International Conference on Advances in Computer Entertainment Technology (ACE'08), pages 244--247, Yokohama, Japan, December 2008.

Digital Library

[12]

R. Montemanni., D. Weyland, and L. Gambardella. An enhanced ant colony system for the team orienteering problem with time windows. In Proc. of International Symposium on Science and Society (ISCCS'11), pages 381--384, Kota Kinabalu, Malaysia, July 2011.

Digital Library

[13]

G. Righini and M. Salani. Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Computers and Operations Research, 36(4):1191--1203, April 2009.

Digital Library

[14]

Roamler, 2011. http://www.roamler.com/services.aspx.

[15]

M. Schilde, K. F. Doerner, R. F. Hartl, and G. Kiechle. Metaheuristics for the bi-objective orienteering problem. Swarm Intelligence, 3(3):179--201, September 2009.

[16]

Z. Shen, S. Ay, S. Kim, and R. Zimmermann. Automatic tag generation and ranking for sensor-rich outdoor videos. In Proc. of ACM International Conference on Multimedia (MM'11), pages 93--102, Scottsdale, AZ, November 2011.

Digital Library

[17]

Taipei travel net, October 2012. http://www.taipeitravel.net/en/.

[18]

Vancouver landmarks, October 2012. http://www.hotels.com/de169712-la/all-landmarks-in-vancouver-canada/.

[19]

P. Vansteenwegena, W. Souffriaua, G. Berghe, and D. Oudheusden. A guided local search metaheuristic for the team orienteering problem. European Journal of Operational Research, 196(1):118--127, July 2009.

[20]

P. Vansteenwegena, W. Souffriaua, and D. Oudheusden. The orienteering problem: A survey. European Journal of Operational Research, 209(1):1--10, February 2011.

[21]

T. Yan, B. Hoh, D. Ganesan, K. Tracton, T. Iwuchukwu, and J. Lee. CrowdPark: A crowdsourcing-based parking reservation system for mobile phones. Technical report, University of Massachusetts Amherst, 2011.

[22]

M. Yuen, L. Chen, and I. King. A survey of human computations systems. In Proc. of IEEE Symposium on Social Computing Applications (SCA'09), pages 723--728, Vancouver, Canada, October 2009.

Digital Library

[23]

M. Yuen, I. King, and K. Leung. A survey of crowdsourcing systems. In Proc. of IEEE International Conference on Social Computing (SocialCom'11), pages 766--773, Boston, MA, October 2011.

[24]

M. Yuen, I. King, and K. Leung. Task matching in crowdsourcing. In Proc. of IEEE International Conference on Internet of Things, and Cyber, Physical and Social Computing (iThings/CPSCom'11), pages 409--412, Dalian, China, October 2011.

Digital Library

Cited By

Bouatouche MBelkadi K(2022)GRASP-Tabu Search Algorithms for the Route Planning Problem in Spatial CrowdsourcingInternational Journal of Applied Metaheuristic Computing10.4018/IJAMC.29250213:1(1-18)Online publication date: 1-Jan-2022
https://doi.org/10.4018/IJAMC.292502
Gunawan ALau HLu K(2018)ADOPT: Combining parameter tuning and Adaptive Operator Ordering for solving a class of Orienteering ProblemsComputers & Industrial Engineering10.1016/j.cie.2018.05.016121(82-96)Online publication date: Jul-2018
https://doi.org/10.1016/j.cie.2018.05.016
Luo HNiu YZhu MHu XMa H(2017)Optimization of Pesticide Spraying Tasks via Multi‐UAVs Using Genetic AlgorithmMathematical Problems in Engineering10.1155/2017/71391572017:1Online publication date: 12-Nov-2017
https://doi.org/10.1155/2017/7139157
Show More Cited By

Index Terms

A detour planning algorithm in crowdsourcing systems for multimedia content gathering
1. Information systems
  1. Information systems applications
    1. Multimedia information systems

Recommendations

Detour Admitting Short Paths
ITNG '11: Proceedings of the 2011 Eighth International Conference on Information Technology: New Generations

Finding the shortest path between two vertices in a weighted graph is a well explored problem and several efficient algorithms for solving it have been reported. We propose a new variation of this problem which we call the detour admitting shortest path ...
Nontraceable detour graphs

The detour order (of a vertex v) of a graph G is the order of a longest path (beginning at v). The detour sequence of G is a sequence consisting of the detour orders of its vertices. A graph is called a detour graph if its detour sequence is constant. ...
Task recommendation in crowdsourcing systems
CrowdKDD '12: Proceedings of the First International Workshop on Crowdsourcing and Data Mining

In crowdsourcing systems, tasks are distributed to networked people to complete such that a company's production cost can be greatly reduced. Obviously, it is not efficient that the amount of time for a worker spent on selecting a task is comparable ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MoVid '13: Proceedings of the 5th Workshop on Mobile Video

February 2013

73 pages

ISBN:9781450318938

DOI:10.1145/2457413

Program Chairs:
Cheng-Hsin Hsu
National Tsing-Hua University, Taiwan
,
Shivajit Mohapatra
Motorola Research Labs

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMM: ACM Special Interest Group on Multimedia

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 February 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

MMSys '13

Sponsor:

SIGMM

MMSys '13: Multimedia Systems Conference 2013

February 27, 2013

Oslo, Norway

Acceptance Rates

MoVid '13 Paper Acceptance Rate 11 of 18 submissions, 61%;

Overall Acceptance Rate 18 of 32 submissions, 56%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
142
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)1

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bouatouche MBelkadi K(2022)GRASP-Tabu Search Algorithms for the Route Planning Problem in Spatial CrowdsourcingInternational Journal of Applied Metaheuristic Computing10.4018/IJAMC.29250213:1(1-18)Online publication date: 1-Jan-2022
https://doi.org/10.4018/IJAMC.292502
Gunawan ALau HLu K(2018)ADOPT: Combining parameter tuning and Adaptive Operator Ordering for solving a class of Orienteering ProblemsComputers & Industrial Engineering10.1016/j.cie.2018.05.016121(82-96)Online publication date: Jul-2018
https://doi.org/10.1016/j.cie.2018.05.016
Luo HNiu YZhu MHu XMa H(2017)Optimization of Pesticide Spraying Tasks via Multi‐UAVs Using Genetic AlgorithmMathematical Problems in Engineering10.1155/2017/71391572017:1Online publication date: 12-Nov-2017
https://doi.org/10.1155/2017/7139157
Zhao YLiao CLin TYin JDo NHsu CVenkatasubramanian N(2015)SmartSourceProceedings of the 2015 16th IEEE International Conference on Mobile Data Management - Volume 0110.1109/MDM.2015.73(145-156)Online publication date: 15-Jun-2015
https://dl.acm.org/doi/10.1109/MDM.2015.73
Liao CHou TLin TCheng YErbad AHsu CVenkatasubramania NHossain MEl Saddik A(2014)SAISProceedings of the 1st International Workshop on Emerging Multimedia Applications and Services for Smart Cities10.1145/2661704.2661706(3-8)Online publication date: 7-Nov-2014
https://dl.acm.org/doi/10.1145/2661704.2661706
Liao CHsu CChu HHuang PChoudhury RZhao F(2013)An approximation algorithm of orienteering problems for mobile computingProceeding of the 11th annual international conference on Mobile systems, applications, and services10.1145/2462456.2465718(531-532)Online publication date: 26-Jun-2013
https://dl.acm.org/doi/10.1145/2462456.2465718

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents