Crowdsourcing Service Node Selection Algorithm Based on Social Network Ability Discovery

被引:0
作者
Peng Z. [1 ,2 ,3 ,4 ]
Gui X. [2 ,3 ]
机构
[1] Faculty of Electronic and Information Engineering, Xi'an Jiaotong University, Xi'an
[2] Tan Siu Lin Business School, Quanzhou Normal University, Quanzhou, 362000, Fujian
[3] Key Laboratory of Computer Network of Shaanxi Province, Xi'an Jiaotong University, Xi'an
[4] High Educational Engineering Research Center of Fujian Province for E-Commerce Intelligent Based on Cloud Computing and Internet of Things, Quanzhou Normal University, Quanzhou, 362000, Fujian
来源
Hsi-An Chiao Tung Ta Hsueh/Journal of Xi'an Jiaotong University | 2019年 / 53卷 / 11期
关键词
Capability discovery; Crowdsourcing; Service node; Social network; Task distribution;
D O I
10.7652/xjtuxb201911021
中图分类号
学科分类号
摘要
To solve the problem of inaccurate crowdsourcing service node selection caused by the unsuccessful information update of the unregistered potential workers or the registered workers in the social network crowdsourcing system, a network crowdsourcing service node selection algorithm is proposed based on social relationship ability discovery. The social relationship cognition is introduced, and the crowdsourcing task publishers or recipients are supposed to be the tasks release centers. Following the relevant theories of social networks, the themes of crowdsourcing tasks and the corresponding keywords are refined, and the key words in the interaction information among friends are analyzed. The number of key words, combined with the number of occurrences of the corresponding keywords in their friends circles, is comprehensively and weightedly calculated to quantify the size of a friend ability to generate a friend ability matrix, thus their social relationships are reconstructed. When a crowdsourcing task is generated or arrives, considering the quality factor of the task completion, the honesty index of the node, the matching degree, the task is selectively forwarded to the friend who meets the ability requirement. Simulation experiment of WeChat interaction shows that the proposed algorithm can better perform ability discovery, select appropriate task receiver, and save about 64.5% of time than random distribution to achieve fast and accurate task publishing and data collection. © 2019, Editorial Office of Journal of Xi'an Jiaotong University. All right reserved.
引用
收藏
页码:148 / 155
页数:7
相关论文
共 25 条
[11]  
Yue D.J., Yu G., Shen D.R., Et al., A weighted aggregation rule in crowdsourcing systems for high result accuracy, 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing, pp. 265-270, (2014)
[12]  
Zhang X.L., Shangguan L.F., Yuan Y., A crowd wisdom management framework for crowdsourc-ing systems, IEEE Access, 4, pp. 9764-9774, (2016)
[13]  
Eickhoff C., De Vries A., How crowdsourcable is your task, Proceedings of the Workshop on Crowdsourcing for Search and Data Mining (CSDM) at the Fourth ACM International Conference on Web Search and Data Mining (WSDM), pp. 11-14, (2011)
[14]  
Qin T., Ma H.D., Zhao D., Et al., Crowdsourcing based event reporting system using smart phones with accurate localization and photo tamper detection, Big Data Computing and Communications, pp. 141-151, (2015)
[15]  
Shamir L., Diamond D., Wallin J., Leveraging pattern recognition consistency estimation for crowdsourcing data analysis, IEEE Transactions on Human-Machine Systems, 46, 3, pp. 474-480, (2016)
[16]  
Zhao D., Ma H.D., Tang S.J., Et al., COUPON: a cooperative framework for building sensing maps in mobile opportunistic networks, IEEE Transactions on Parallel and Distributed Systems, 26, 2, pp. 392-402, (2015)
[17]  
Pu L.J., Chen X., Xu J.D., Et al., Crowd foraging: a QoS-oriented self-organized mobile crowdsourcing framework over opportunistic networks, IEEE Journal on Selected Areas in Communications, 35, 4, pp. 848-862, (2017)
[18]  
Zhan Y.F., Xia Y.Q., Liu Y., Et al., Incentive-aware time-sensitive data collection in mobile opportunistic crowdsensing, IEEE Transactions on Vehicular Technology, 66, 9, pp. 7849-7861, (2017)
[19]  
Guo B., Liu Y., Wu W.L., Et al., ActiveCrowd: a framework for optimized multitask allocation in mobile crowdsensing systems, IEEE Transactions on Human-Machine Systems, 47, 3, pp. 392-403, (2017)
[20]  
Zhang J., Zhao Z., Zhou S., Vector task map: progressive task allocation in crowd-sensing, Chinese Journal of Computers, 40, 8, pp. 1946-1960, (2017)