By Topic

Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bo Bai ; State Key Laboratory on Microwave and Digital Communications in Department of Electronic Engineering, Tsinghua National Laboratory for Information Science and Technology (TNList), Tsinghua University, Beijing 100084, China ; Wei Chen ; Khaled Ben Letaief ; Zhigang Cao

Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communications, has recently been receiving much attention. Because of both safety and non-safety real-time applications, V2V communications has QoS requirements on rate, latency, and reliability. How to appropriately design channel allocation is therefore a key MAC/PHY layer issue in vehicular communications. The QoS requirements of real-time V2V communications can be met by achieving a low outage probability and high outage capacity. In this paper, we first formulate the subchannel allocation in V2V communications into a maximum matching problem on random bipartite graphs. A distributed shuffling based Hopcroft-Karp (DSHK) algorithm will then be proposed to solve this problem with a sub-linear complexity of O(N^{2/3}), where N is the number of subchannels. By studying the maximum matching generated by the DSHK algorithm on random bipartite graphs, the outage probabilities are derived in the high (two near vehicles) and low (two far away vehicles) SNR regimes, respectively. It is then demonstrated that the proposed method has a similar outage performance as the scenario of two communicating vehicles occupying N subchannels. By solving high degree algebraic equations, the outage capacity can be obtained to determine the maximum traffic rate given an outage probability constraint. It is also shown that the proposed scheme can take an advantage of small signaling overhead with only one-bit channel state information broadcasting for each subchannel.

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:29 ,  Issue: 1 )