Next Article in Journal
Calibration of Magnetometers with GNSS Receivers and Magnetometer-Aided GNSS Ambiguity Fixing
Next Article in Special Issue
QuickCash: Secure Transfer Payment Systems
Previous Article in Journal
The Development of an Open Hardware and Software System Onboard Unmanned Aerial Vehicles to Monitor Concentrated Solar Power Plants
Previous Article in Special Issue
Low Duty-Cycling MAC Protocol for Low Data-Rate Medical Wireless Body Area Networks
Article Menu
Issue 6 (June) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(6), 1327; doi:10.3390/s17061327

Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle–Infrastructure Systems

College of Information Engineering, Capital Normal University, Beijing 100048, China
This article is an extended version of our paper published in Tang, X.; Hong, D.; Chen, W. Content Replication Scheme Using Stable Matching in Vehicular Networks. In Proceedings of the International Conference on Identification, Information and Knowledge in the Internet of Things, Beijing, China, 20–21 October 2016; IEEE CPS Publishing: Los Alamitos, CA, USA, 2016; pp. 1–6.
Author to whom correspondence should be addressed.
Academic Editor: Leonhard M. Reindl
Received: 20 February 2017 / Revised: 8 May 2017 / Accepted: 19 May 2017 / Published: 8 June 2017
View Full-Text   |   Download PDF [2108 KB, uploaded 8 June 2017]   |  


Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services. In this article, we propose a data acquisition model using stable matching of bipartite graph in cooperative vehicle-infrastructure systems, namely, DAS. Contents are distributed to roadside units, while vehicular nodes support supplementary storage. The original distribution problem is formulated as a stable matching problem of bipartite graph, where the data and the storage cells compose two sides of vertices. Regarding the factors relevant with the access ratio and delay, the preference rankings for contents and roadside units are calculated, respectively. With a multi-replica preprocessing algorithm to handle the potential one-to-many mapping, the matching problem is addressed in polynomial time. In addition, vehicular nodes carry and forward assistant contents to deliver the failed packets because of bandwidth competition. Furthermore, an incentive strategy is put forward to boost the vehicle cooperation and to achieve a fair bandwidth allocation at roadside units. Experiments show that DAS achieves a high access ratio and a small storage cost with an acceptable delay. View Full-Text
Keywords: vehicular networks; data acquisition; stable matching; bipartite graph; content replication vehicular networks; data acquisition; stable matching; bipartite graph; content replication

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Tang, X.; Hong, D.; Chen, W. Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle–Infrastructure Systems. Sensors 2017, 17, 1327.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top