Name
Abstract | ||
|---|---|---|
In this paper, we consider the latency-constrained content dissemination scheme in vehicular networks. Moreover, we assume that roadside units (RSUs) are densely deployed such that a vehicle may suffer interference from neighboring RSUs. Due to interference, the transmission rate varies as the vehicle moves. We formulate the content scheduling problem with the objective of minimizing the spectrum resources consumption while satisfying the delay requirement of contents. Due to the huge computation complexity, we then propose a sub-optimal algorithm based on time expanded graph. We conduct simulation experiments to evaluate the performance of our proposed algorithm. |
Year | Venue | Field |
|---|---|---|
2017 | ICCC | Transmission rate,Graph,Job shop scheduling,Scheduling (computing),Latency (engineering),Computer science,Computer network,Interference (wave propagation),Vehicular ad hoc network,Computation complexity |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Suxia Guo | 1 | 0 | 0.34 |
| Ronghui Hou | 2 | 73 | 13.79 |
| King-Shan Lui | 3 | 151 | 16.93 |
| Hongyan Li | 4 | 269 | 64.39 |