On the recruitment of smart vehicles for urban sensing
- 1 December 2013
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
With the abundant on-board resources in intelligent vehicles, they have become major candidates for providing ubiquitous services, including urban sensing. This paper proposes an efficient recruitment scheme for vehicles in urban sensing applications. Our trajectory-based recruitment (TBR) scheme solves the problem of participant selection by considering spatiotemporal availability of participants. The aim of TBR is choosing the minimum number of vehicles that achieve a required level of coverage for the area of interest. TBR utilizes the easy-to-acquire trajectories of the candidate vehicles as indicators of the availability of participants, and applies a minimal-cover greedy algorithm for selection. The basic greedy algorithm is adapted to handle some practical scenarios, including departing vehicles and varying redundancy requirements. The paper also discusses two data acquisition models for retrieving the sensing data (on-demand and unsolicited). Assessment of TBR shows that it achieves high levels of coverage even when vehicles do not stick to their announced trajectories.Keywords
This publication has 7 references indexed in Scilit:
- Embedded solution for road condition monitoring using vehicular sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Delay-bounded data gathering in urban vehicular sensor networksPervasive and Mobile Computing, 2012
- A location-based incentive mechanism for participatory sensing systems with budget constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- New Automotive Sensors—A ReviewIEEE Sensors Journal, 2008
- Dissemination and Harvesting of Urban Data Using Vehicular Sensing PlatformsIEEE Transactions on Vehicular Technology, 2008
- The Rise of People-Centric SensingIEEE Internet Computing, 2008
- The budgeted maximum coverage problemInformation Processing Letters, 1999