Search

Stimulating participation from smartphone users is of paramount importance to mobile crowd sourcing systems and applications. A few incentive mechanisms have been proposed, but most of them have made the impractical assumption that smartphones remain static in the system and sensing tasks are known in advance. The existing mechanisms fail when being applied to the realistic scenario where smartphones dynamically arrive to the system and sensing tasks are submitted at random. It is particularly challenging to design an incentive mechanism for such a mobile crowd sourcing system, given dynamic smartphones, uncertain arrivals of tasks, strategic behaviors, and private information of smartphones. We propose two truthful auction mechanisms for two different cases of mobile crowd sourcing with dynamic smartphones. For the offline case, we design an optimal truthful mechanism with an optimal task allocation algorithm of polynomial-time computation complexity of O (n+γ)3, where n is the number of smartphones and γ is the number of sensing tasks. For the online case, we design a near-optimal truthful mechanism with an online task allocation algorithm that achieves a constant competitive ratio of 1\2. Rigorous theoretical analysis and extensive simulations have been performed, and the results demonstrate the proposed auction mechanisms achieve truthfulness, individual rationality, computational efficiency, and low overpayment.

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. © 2014 IEEE.

Vehicular networks have become a promising platform for large-scale urban sensing. On-demand data retrieval is a crucial operation for many applications of vehicular networks. It is particularly challenging, however, to achieve high performance of on-demand data retrieval in sparse vehicular networks. Data replication based on random linear network coding can solve the coupon collection problem but suffers the problem of unnecessary data replications which waste the precious communication opportunities of sparse vehicular networks. With real traces we reveal the existence of community structures in vehicular networks, which causes excessive linearly correlated blocks. Motivated by the important observation, we propose a community-aware data replication scheme based on random linear network coding. To reduce the excessive correlated coded blocks because of community structures, we make probabilistic control on the data replication phase, taking the community structures into account. It is demonstrated through extensive simulations that the community-aware scheme can effectively save up to 50% communication opportunities whiling achieving high performance of on-demand data retrieval. © 2013 IEEE.

Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of applications of vehicular networks, such as road surface monitoring and sharing. The key to improving the data retrieval performance is to increase the data availability such that a retrieving node can easily acquire its desired data from the vehicles that it contacts. Network coding has widely been exploited as an effective technique for defusing information over a network. In this paper we explore the exploitation of network coding for improving data availability in vehicular networks. By random linear codes, simple replication is avoided, and instead a node forwards a coded block which is a random combination of all data received by the node. We implement a network coding based approach for improving data availability in vehicular networks. To understand the performance of this approach, we have conducted empirical study with extensive simulations based on real vehicular GPS traces from around 2,000 taxis in Shanghai, China. We make the important observation that in spite of significant improvement up to 300% in data availability, there is a serious issue with linear correlation among the received codes, which degrades the performance of data retrieval success rate. By analyzing the real vehicular traces, we reveal that there is strong community structure with a real vehicular network and then explain that such community structure may contribute to the issue of linear dependence. Then, we point out the opportunities for improving the network coding based approach by developing communityaware codes distribution techniques.