A Graph-Based Cooperative Scheduling Scheme for Vehicular Networks

Zheng, Kan; Liu, Fei; Zheng, Qiang; Wang, Xiang; Wang, Wenbo

doi:10.1109/tvt.2013.2244929

Cited by 76 publications

(52 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this subsection, the MSR and the BG-based schemes proposed in [14] are both simulated for the purpose of performance comparison. The MSR and BG-based schemes are both subject to that one CV could forward data to at most one vehicle and the RBs are divided to all links equally.…”

Section: Results and Analysismentioning

confidence: 99%

“…1, we consider the vehicular network with N VEs, each of which has a single antenna and only one static roadside unit in the network [14]. The basic idea of cooperative relaying is that a vehicle encountering low data rates can be assisted for its downlink transmissions by the neighboring vehicles that encounter higher rates.…”

Section: System Modelmentioning

confidence: 99%

“…But the authors in [13] only consider the resource allocation on V2V link and V2I links and how to avoid the co-channel interference between V2I and V2V links with no regard to relay selection. In [14,15], several relay selection and resource allocation for cooperative communication are presented. The main idea of them is that V2V communication is used to complement V2I communication.…”

Section: Introductionmentioning

confidence: 99%

“…The main idea of them is that V2V communication is used to complement V2I communication. A bipartite graph-based scheduling scheme to allocate the V2I and V2V links for both 1-hop and 2-hop communications is proposed in [14]. The Kuhn-Munkres algorithm is applied to solve the problem of maximum weighted matching of the constructed bipartite graph of the vehicular networks, and simulations indicate that the proposed solution performs extremely close to the optimal one and achieves better fairness.…”

Section: Introductionmentioning

confidence: 99%

“…• Design of a optimal link scheduling and resources allocation scheme for vehicular networks with considerably lower computational complexity; and • Performance comparison against the maximum sum rate (MSR) and BG-based schemes of [14].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Joint optimization of link scheduling and resource allocation in cooperative vehicular networks

Zheng

Liu

2015

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

Vehicular networks are a cornerstone of the envisioned intelligent transportation system (ITS) by enabling vehicles to communicate with each other via vehicle-to-vehicle (V2V) communications to overcome the current and future needs for increasing traffic safety and efficiency. In this paper, we employ the knapsack problem (KP) to formulate the problem of cooperative scheduling and radio resource management in vehicular networks for non-real time services. For the sake of maximizing sum utility (MSU) of the networks, we propose two-dimensional-multi-choice knapsack problem (2D-MCKP)-based scheduling scheme to select the coordinator vehicles for the sink vehicle and allocate radio resource to V2V and vehicle-to-infrastructure (V2I) links to solve the MSU optimization problem. Simulation results indicate that the proposed scheme significantly improves the average utility and average data rates with sustainable computational complexity. Moreover, the designed cooperative communication system achieves higher spectral efficiency and better fairness.

show abstract

Section: Results and Analysismentioning

confidence: 99%

Section: System Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Joint optimization of link scheduling and resource allocation in cooperative vehicular networks

Zheng

Liu

2015

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

A novel link allocation method for vehicle‐to‐vehicle‐based relaying networks

Zheng

Long

et al. 2014

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

Vehicle‐to‐infrastructure (V2I) and vehicle‐to‐vehicle (V2V) are two main communication modes in vehicular ad‐hoc networks. V2V is one of the key techniques to enhance the coverage and capacity of the V2I communication system. In this paper, we propose a novel link allocation method involving both V2I and V2V communications to enhance the throughput of the V2V‐based relaying network. Jointing the links scheduling and radio resource allocation to V2V links is an Non‐deterministic Polynomial (NP) hard problem with huge complexity. The proposed scheduling scheme adopts a dynamic optimization algorithm based on the multi‐choice knapsack problem to solve the problem with acceptable complexity. Simulation results demonstrate that the proposed scheme significantly improves throughput of vehicular networks and achieves higher fairness. Copyright © 2014 John Wiley & Sons, Ltd.

show abstract

Cluster‐based coordination scheme for cooperative cognitive radio networks

Tang

Liu

Zhang

et al. 2015

Wireless Communications

View full text Add to dashboard Cite

In this paper, a cluster‐based two‐phase coordination scheme for cooperative cognitive radio networks is proposed considering both spectrum efficiency and network fairness. Specifically, candidate secondary users (SUs) are first selected by a partner selection algorithm to enter the two‐phase cooperation with primary users (PUs). In phase I, the selected SUs cooperate with PUs to acquire a fraction of time slot as a reward. In phase II, all SUs including the unselected ones share the available spectrum resources in local clusters; each of which is managed by a cluster head who participated in the cooperation in phase I. To improve the total network utility of both PUs and SUs, the maximum weighted bipartite matching is adopted in partner selection. To further improve the network performance and communication reliability, network coding is exploited during the spectrum sharing within the cluster. Simulation results demonstrate that, with the proposed cluster‐based coordination scheme, not only the PUs' transmission performance is improved, but also SUs achieve spectrum access opportunities. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

A Graph-Based Cooperative Scheduling Scheme for Vehicular Networks

Cited by 76 publications

References 21 publications

Joint optimization of link scheduling and resource allocation in cooperative vehicular networks

Joint optimization of link scheduling and resource allocation in cooperative vehicular networks

A novel link allocation method for vehicle‐to‐vehicle‐based relaying networks

Cluster‐based coordination scheme for cooperative cognitive radio networks

Contact Info

Product

Resources

About