2017
DOI: 10.1002/cpe.4121
|View full text |Cite
|
Sign up to set email alerts
|

Taming the big to small: efficient selfish task allocation in mobile crowdsourcing systems

Abstract: Summary This paper investigates the selfish load balancing problem in mobile distributed crowdsourcing networks. Conventional methods heavily relied on cooperation among users to achieve balanced resource utilization in a platform‐centric view. In achieving fairly low communication and computational overhead, this work leverages the d‐choice method based on Ball and Bin theory for effective balancing under limited information and the Proportional Allocation scheme for selfish load balancing, maintaining good l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 20 publications
0
6
0
Order By: Relevance
“…First, only when the distance between two cloudlets is within an inter-contact range R, they can establish an intermittent connection. Second, based on [24], the connecting probability of two cloudlets i and j is computed as:…”
Section: B Task Transmission Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…First, only when the distance between two cloudlets is within an inter-contact range R, they can establish an intermittent connection. Second, based on [24], the connecting probability of two cloudlets i and j is computed as:…”
Section: B Task Transmission Modelmentioning
confidence: 99%
“…Second, by leveraging the '2-choice' paradigm for selecting the target for computation offloading, FairEdge only probes load information from two contactable neighboring cloudlets for comparison. According to [26] and [24], such a process would significantly reduce the complexity overhead to O(1) compared with greedy offloading's O(n) complexity.…”
mentioning
confidence: 99%
“…The inter-meeting time of cloudlets c i and c j is denoted as t i,j . Based on [16] and [17], the inter-contact time t i,j would follow exponential distribution with pairwise rate α ij , i.e.,…”
Section: System Model and Problem Formulationmentioning
confidence: 99%
“…After querying and comparing their load states, the cloudlet choose offload a task to the one with less task load, where the computing complexity in each time interval is O(1). Similar to [17], we compare performance of proposed scheme with three benchmarks, i.e., random allocation, proportional allocation [14] and greedy allocation. In random allocation, a mobile cloudlet offloads tasks by randomly selecting another mobile cloudlet in its contact range.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…Thus, neutral networks display sparse and less compact communities. Li et al investigate the selfish load balancing problem in mobile distributed crowdsourcing networks. This work leverages the d‐choice method based on Ball and Bin theory for effective balancing under limited information and the proportional allocation scheme for selfish load balancing, maintaining good load balancing property among selfish users.…”
Section: Themes Of This Special Issuementioning
confidence: 99%