A graph-based cooperative scheduling scheme for vehicular networks

Zheng, Kan and Liu, Fei and Zheng, Qiang and Xiang, Wei and Wang, Wenbo (2013) A graph-based cooperative scheduling scheme for vehicular networks. IEEE Transactions on Vehicular Technology , 62 (4). pp. 1450-1458. ISSN 0018-9545


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.

Statistics for USQ ePrint 23546
Statistics for this ePrint Item
Item Type: Article (Commonwealth Reporting Category C)
Refereed: Yes
Item Status: Live Archive
Additional Information: © 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Faculty/School / Institute/Centre: Historic - Faculty of Engineering and Surveying - No Department (Up to 30 Jun 2013)
Faculty/School / Institute/Centre: Historic - Faculty of Engineering and Surveying - No Department (Up to 30 Jun 2013)
Date Deposited: 27 May 2013 23:06
Last Modified: 11 Jul 2014 05:37
Uncontrolled Keywords: bipartite graph (BG); cooperative communications; maximum weighted matching (MWM); vehicle-to-vehicle (V2V) communications; vehicular networks
Fields of Research (2008): 10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks
08 Information and Computing Sciences > 0805 Distributed Computing > 080502 Mobile Technologies
09 Engineering > 0905 Civil Engineering > 090507 Transport Engineering
Fields of Research (2020): 40 ENGINEERING > 4006 Communications engineering > 400604 Network engineering
46 INFORMATION AND COMPUTING SCIENCES > 4606 Distributed computing and systems software > 460608 Mobile computing
40 ENGINEERING > 4005 Civil engineering > 400512 Transport engineering
Socio-Economic Objectives (2008): B Economic Development > 89 Information and Communication Services > 8901 Communication Networks and Services > 890103 Mobile Data Networks and Services
Identification Number or DOI: https://doi.org/10.1109/TVT.2013.2244929
URI: http://eprints.usq.edu.au/id/eprint/23546

Actions (login required)

View Item Archive Repository Staff Only