Ms. Susu Xu Profile

Susu Xu

at Carnegie Mellon Univ

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 27 March 2019 Paper

Incentivizing vehicular crowdsensing system for large scale smart city applications

Susu Xu, Xinlei Chen, Xidong Pi, Carlee Joe-Wong, Pei Zhang, Hae Young Noh

Proceedings Volume 10970, 109701C (2019) https://doi.org/10.1117/12.2514021

KEYWORDS: Sensing systems, Sensors, Optimization (mathematics)

Read Abstract +

Mobile crowd sensing (MCS) enables many smart city applications (e.g., transportation monitoring/management, environmental monitoring, etc.). Recently, MCS systems built on non-dedicated vehicular platforms like taxis have become popular due to their large-scale coverage and low-cost deployment and maintenance. However, the goal of MCS may be inconsistent with the goal of vehicles. For example, MCS expects to get large and balanced sensing coverage over the city, while the taxis gather in busy areas to search for new ride requests. This inconsistency between the goals of MCS and vehicles results in a low sensing coverage and decreases the quality of the collected information. To address this inconsistency and optimize the sensing coverage, this paper presents an incentivizing system to optimize the sensing coverage of the sampled data. Key challenges to resolving this inconsistency include limited budget constraining the ability to incentivize more vehicles and complicate vehicle and trajectory selection problem making it difficult to obtain the incentivizing strategy. To address these challenges, we design a customized incentive by combining monetary incentives and potential ride request at the destination to reduce the cost of incentivizing vehicles and utilize the budget efficiently. Meanwhile, we formulate the problem of incentivizing trajectory planning as a non-linear multiple-choice knapsack problem, and propose a heuristic algorithm to approximate the optimal incentivizing strategy. The experiments based on the real-world data show that our system achieves up to 26.99% improvement in the sensing coverage compared to benchmark methods.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years