Journal
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume 62, Issue 4, Pages 1450-1458Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2013.2244929
Keywords
Bipartite graph (BG); cooperative communications; maximum weighted matching (MWM); vehicle-to-vehicle (V2V) communications; vehicular networks
Categories
Funding
- National Natural Science Foundation of China [61271183]
- Program for New Century Excellent Talents in University [NCET-11-0600]
- National Key Technology R&D Program of China [2013ZX03003005]
- Commonwealth Government of Australia [3052_2012]
Ask authors/readers for more resources
Vehicle-to-vehicle (V2V) communications are considered to be a significant step forward toward a highly secure and efficient intelligent transportation system. In this paper, we propose the use of graph theory to formulate the problem of cooperative communications scheduling in vehicular networks. In lieu of exhaustive search with intractable complexity for the maximum sum rate (MSR), we propose a bipartite-graph-based (BG) scheduling scheme to allocate the vehicle-to-infrastructure (V2I) and V2V links for both single-hop and dual-hop communications. The Kuhn-Munkres (KM) algorithm is adopted to solve the problem of maximum weighted matching (MWM) of the constructed BG. Simulation results indicate that the proposed scheme performs extremely close to the optimal scheme and results in better fairness among vehicle users with considerably lower computational complexity. Moreover, cooperative communications can improve both the throughput and spectral efficiency (SE) of vehicular networks.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available