Detail View
Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network
WEB OF SCIENCE
SCOPUS
- Title
- Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network
- Issued Date
- 2016-06
- Citation
- Liu, Kai. (2016-06). Cooperative Data Scheduling in Hybrid Vehicular Ad Hoc Networks: VANET as a Software Defined Network. IEEE/ACM Transactions on Networking, 24(3), 1759–1773. doi: 10.1109/TNET.2015.2432804
- Type
- Article
- Author Keywords
- Cooperative data dissemination ; scheduling ; software defined network ; vehicular ad hoc networks
- Keywords
- Ad hoc Networks ; Admission Control ; Algorithms ; Centralized Schedulers ; Cooperative Communication ; Cooperative Data Dissemination ; DATA DISSemINATION ; DELIVERY ; DemAND DATA BROADCAST ; DSRC ; Information Dissemination ; Maximum Weighted Independent Set ; Mobile Telecommunication Systems ; Polynomial-Time Reduction ; Polynomial Approximation ; Realistic Traffics ; Scheduling ; Scheduling Decisions ; Sender and Receivers ; Signal Receivers ; Software-Defined Networks ; Software Defined Network ; SYSTemS ; Telecommunication Networks ; V2V Communications ; Vehicle to Vehicle Communications ; Vehicles ; Vehicular AD Hoc Networks
- ISSN
- 1063-6692
- Abstract
-
This paper presents the first study on scheduling for cooperative data dissemination in a hybrid infrastructure-to-vehicle (I2V) and vehicle-to-vehicle (V2V) communication environment. We formulate the novel problem of cooperative data scheduling (CDS). Each vehicle informs the road-side unit (RSU) the list of its current neighboring vehicles and the identifiers of the retrieved and newly requested data. The RSU then selects sender and receiver vehicles and corresponding data for V2V communication, while it simultaneously broadcasts a data item to vehicles that are instructed to tune into the I2V channel. The goal is to maximize the number of vehicles that retrieve their requested data. We prove that CDS is NP-hard by constructing a polynomial-time reduction from the Maximum Weighted Independent Set (MWIS) problem. Scheduling decisions are made by transforming CDS to MWIS and using a greedy method to approximately solve MWIS. We build a simulation model based on realistic traffic and communication characteristics and demonstrate the superiority and scalability of the proposed solution. The proposed model and solution, which are based on the centralized scheduler at the RSU, represent the first known vehicular ad hoc network (VANET) implementation of software defined network (SDN) concept. © 2015 IEEE.
더보기
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
File Downloads
- There are no files associated with this item.
공유
Related Researcher
- Son, Sang Hyuk손상혁
-
Department of Information and Communication Engineering
Total Views & Downloads
???jsp.display-item.statistics.view???: , ???jsp.display-item.statistics.download???:
