Progressive or Conservative: Rationally Allocate Cooperative Work in Mobile Social Networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 26, Issue 7, 2015, Pages 2020-2035

  Chang, Wei ^a   Wu, Jie ^a  

^a Temple University   (United States)

Author keywords

Mobile social networks; outsourcing; potential resource; social crowdsourcing; work partition

Indexed keywords

OUTSOURCING; SOCIAL SCIENCES COMPUTING;

COMPUTATIONAL RESOURCES; CROWDSOURCING; CROWDSOURCING PLATFORMS; EXTENSIVE SIMULATIONS; MOBILE SOCIAL NETWORK (MSNS); MOBILE SOCIAL NETWORKS; POTENTIAL RESOURCES; WORK-LOAD DISTRIBUTION;

SOCIAL NETWORKING (ONLINE);

EID: 84933517048     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2014.2330298     Document Type: Article

References (25)

1. (2014) [Online]. Available: boinc.berkeley.edu/, 2014.
2. (2014) [Online]. Available: folding.stanford.edu/, 2014.
3. (2014) [Online]. Available: www.mturk.com/mturk/, 2014.
4. L. B. Chilton, G. Little, D. Edge, D. S. Weld, and J. A. Landay, "Cascade: Crowdsourcing taxonomy creation," in Proc. ACM SIGCHI Conf. Human Factors Comput. Syst., 2013, pp. 1999-2008.
5. S. M. Ross, Introduction to Probability Models. Amsterdam, The Netherlands: Elsevier, 2006.
6. (2014) [Online]. Available: www-personal.umich.edu/~mejn/netdata/, 2014.
7. J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, and A. S. Tomkins, "The web as a graph: Measurements, models, and methods," in Proc. 5th Annu. Int. Conf. Comput. Combinatorics, 1999, pp. 1-17.
8. H. Deng, M. R. Lyu, and I. King, "A generalized Co-HITS algorithm and its application to bipartite graphs," in Proc. 15th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2009, pp. 239-248.
9. A. McCallum, D. Freitag, and F. C. Pereira, "Maximum entropy Markov models for information extraction and segmentation," in Proc. 17th Int. Conf. Mach. Learn., 2000, pp. 591-598.
10. L. Tassiulas, "Adaptive back-pressure congestion control based on local information," IEEE Trans. Autom. Control, vol. 40, no. 2, pp. 236-250, Feb. 1995.
11. S. Moeller, A. Sridharan, B. Krishnamachari, and O. Gnawali, "Routing without routes: The backpressure collection protocol," in Proc. 9th ACM/IEEE Int. Conf. Inf. Process. Sens. Netw., 2010, pp. 279-290.
12. M. J. Neely and R. Urgaonkar, "Optimal backpressure routing for wireless networks with multi-receiver diversity," Ad Hoc Netw., vol. 7, pp. 862-881, 2009.
13. D. C. Brabham, Crowdsourcing. Cambridge, MA, USA: MIT Press, 2013.
14. J. Howe, "The rise of crowdsourcing," Wired Mag., vol. 14, pp. 1-4, 2006.
15. J. J. Horton and L. B. Chilton, "The labor economics of paid crowdsourcing," in Proc. ACM 11th ACM Conf. Electron. Commerce, 2010, pp. 209-218.
16. D. C. Brabham, "Crowdsourcing as a model for problem solving an introduction and cases," Convergence: Int. J. Res. New Media Technol., vol. 14, pp. 75-90, 2008.
17. A. Kittur, E. H. Chi, and B. Suh, "Crowdsourcing user studies with Mechanical Turk," in Proc. ACM SIGCHI Conf. Human Factors Comput. Syst., 2008, pp. 453-456.
18. N. Eagle, "txteagle: Mobile crowdsourcing," in Proc. 3rd Int. Conf. Int., Des. Global Develop., 2009, pp. 447-456.
19. [Online]. Available: aws.amazon.com/pricing/mturk/, 2014.
20. S. Zhang, J. Wu, and S. Lu, "Minimum makespan workload dissemination in DTNs: Making full utilization of computational surplus around," in Proc. ACM MobiHoc Int. Symp. Mobile Ad Hoc Netw. Comput., 2013, pp. 293-296.
21. C. Koulamas, S. Gupta, and G. J. Kyparisis, "A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times," Eur. J. Oper. Res., vol. 205, pp. 479-482, 2010.
22. S. A. Slotnick, "Order acceptance and scheduling: A taxonomy and review," Eur. J. Oper. Res., vol. 2012, pp. 1-11, 2011.
23. L. Wang, H. J. Siegel, V. P. Roychowdhury, and A. A. Maciejewski, "Task matching and scheduling in heterogeneous computing environments using a genetic-algorithmbased approach," J. Parallel Distrib. Comput., vol. 47, pp. 8-22, 1997.
24. M. Thiele, U. Fischer, and W. Lehner, "Partition-based workload scheduling in living data warehouse environments," Inf. Syst., vol. 34, pp. 382-399, 2009.
25. A. L. Rosenberg, "Sharing partitionable workloads in heterogeneous NOWs: Greedier is not better," in Proc. IEEE Int. Conf. Cluster Comput., 2001, p. 124.