当前位置: X-MOL 学术J. Netw. Comput. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Two-sided preferences task matching mechanisms for blockchain-based crowdsourcing
Journal of Network and Computer Applications ( IF 7.7 ) Pub Date : 2021-07-09 , DOI: 10.1016/j.jnca.2021.103155
Maha Kadadha 1 , Hadi Otrok 1 , Shakti Singh 1 , Rabeb Mizouni 1 , Anis Ouali 2
Affiliation  

In this paper, novel task matching mechanisms with two-sided preferences of workers and requesters are proposed for blockchain-based crowdsourcing. Existing blockchain-based crowdsourcing frameworks match workers to tasks using allocation mechanisms considering metrics such as cost, location, and workers’ reputation to answer requesters’ requirements. However, they still match workers to tasks through mechanisms that are requester-biased with no consideration for workers’ preferences. This may lead to workers rejecting or neglecting their allocated tasks. As a solution, we propose two-sided preferences task matching mechanisms for blockchain-based crowdsourcing, namely SenseChain+, and Gale–Shapley Matching (GSM). In order to do the matching, the proposed mechanisms utilize the preferences of workers based on a proposed Quality-of-Task (QoT) metric, and the preferences of tasks based on a Quality-of-Information (QoI) metric. To ensure their autonomous, reliable, and transparent execution, these matching mechanisms are integrated in an existing blockchain-based crowdsourcing framework, implemented using smart contracts. The mechanisms and framework are implemented using Solidity on a private blockchain and evaluated using a real dataset. They are benchmarked to the Nearest Neighbor Matching (NNM) mechanism. The proposed mechanisms demonstrate higher performance compared to the benchmark in terms of workers’ QoI, payment, satisfaction, and confidence. To demonstrate the need for each mechanism, the performance under different demand to supply contexts is measured in terms of the workers’ QoI, confidence, and the minimum payment. Each proposed matching mechanism was found to outperform the others in a range of demand to supply ratios. Finally, the proposed matching mechanisms are stable and feasible on-chain with reasonable execution cost.



中文翻译:

基于区块链的众包双边偏好任务匹配机制

在本文中,针对基于区块链的众包提出了具有工人和请求者两侧偏好的新型任务匹配机制。现有的基于区块链的众包框架使用分配机制将工作人员与任务匹配,考虑成本、位置和工作人员声誉等指标,以回答请求者的要求。然而,他们仍然通过偏向请求者的机制将工人与任务匹配,而不考虑工人的偏好。这可能会导致工人拒绝或忽视他们分配的任务。作为一种解决方案,我们为基于区块链的众包提出了双边偏好任务匹配机制,即 SenseChain+ 和 Gale–Shapley 匹配(GSM)。为了进行匹配,提议的机制利用基于提议的任务质量 (QoT) 指标的工人偏好,以及基于信息质量 (QoI) 指标的任务偏好。为确保其自主、可靠和透明的执行,这些匹配机制被集成到现有的基于区块链的众包框架中,使用智能合约实施。该机制和框架是在私有区块链上使用 Solidity 实现的,并使用真实数据集进行评估。它们以最近邻匹配 (NNM) 机制为基准。与基准相比,拟议的机制在工人的 QoI、支付、满意度和信心方面表现出更高的绩效。为了证明对每种机制的需求,不同供需环境下的绩效是根据工人的 QoI、信心和最低工资来衡量的。发现每个提议的匹配机制在一定范围的供需比率方面都优于其他机制。最后,所提出的匹配机制在链上稳定可行,执行成本合理。

更新日期:2021-07-14
down
wechat
bug