TRAC: Truthful auction for location-aware collaborative sensing in mobile crowdsourcing

INFOCOM(2014)

引用 454|浏览374
暂无评分
摘要
In this paper, we tackle the problem of stimulating smartphone users to join mobile crowdsourcing applications with smartphones. Different from existing work of mechanism design, we uniquely take into consideration the crucial dimension of location information when assigning sensing tasks to smartphones. However, the location awareness largely increases the theoretical and computational complexity. In this paper, we introduce a reverse auction framework to model the interactions between the platform and the smartphones. We rigorously prove that optimally determining the winning bids is NP hard. In this paper we design a mechanism called TRAC which consists of two main components. The first component is a near-optimal approximate algorithm for determining the winning bids with polynomial-time computation complexity, which approximates the optimal solution within a factor of 1 + ln(n), where n is the maximum number of sensing tasks that a smartphone can accommodate. The second component is a critical payment scheme which, despite the approximation of determining winning bids, guarantees that submitted bids of smartphones reflect their real costs of performing sensing tasks. Through both rigid theoretical analysis and extensive simulations, we demonstrate that the proposed mechanism achieves truthfulness, individual rationality and high computation efficiency.
更多
查看译文
关键词
near-optimal approximate algorithm,winning bids,submitted bids,smartphone users,polynomial-time computation complexity,reverse auction framework,location-aware collaborative sensing,rigid theoretical analysis,mobile crowdsourcing applications,polynomial approximation,computational complexity,critical payment scheme,np hard,smart phones,location information,location awareness,truthful auction,mobile computing,trac,sensing tasks
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要