Low complexity outage optimal distributed channel allocation for vehicle-to-vehicle communications

Bo Bai, Wei Chen, Khaled Letaief, Zhigang Cao

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

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(N2/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.

Original languageEnglish
Article number5678791
Pages (from-to)161-172
Number of pages12
JournalIEEE Journal on Selected Areas in Communications
Volume29
Issue number1
DOIs
Publication statusPublished - Jan 2011
Externally publishedYes

Fingerprint

Vehicle to vehicle communications
Outages
Communication
Quality of service
Channel state information
Broadcasting

Keywords

  • Maximum matching
  • Outage capacity
  • Outage probability
  • Random bipartite graph
  • Vehicle-to-vehicle communications

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Low complexity outage optimal distributed channel allocation for vehicle-to-vehicle communications. / Bai, Bo; Chen, Wei; Letaief, Khaled; Cao, Zhigang.

In: IEEE Journal on Selected Areas in Communications, Vol. 29, No. 1, 5678791, 01.2011, p. 161-172.

Research output: Contribution to journalArticle

@article{1be5408de1e44a9fa5284dc657431bfb,
title = "Low complexity outage optimal distributed channel allocation for vehicle-to-vehicle communications",
abstract = "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(N2/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.",
keywords = "Maximum matching, Outage capacity, Outage probability, Random bipartite graph, Vehicle-to-vehicle communications",
author = "Bo Bai and Wei Chen and Khaled Letaief and Zhigang Cao",
year = "2011",
month = "1",
doi = "10.1109/JSAC.2011.110116",
language = "English",
volume = "29",
pages = "161--172",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Low complexity outage optimal distributed channel allocation for vehicle-to-vehicle communications

AU - Bai, Bo

AU - Chen, Wei

AU - Letaief, Khaled

AU - Cao, Zhigang

PY - 2011/1

Y1 - 2011/1

N2 - 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(N2/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.

AB - 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(N2/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.

KW - Maximum matching

KW - Outage capacity

KW - Outage probability

KW - Random bipartite graph

KW - Vehicle-to-vehicle communications

UR - http://www.scopus.com/inward/record.url?scp=78651257621&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78651257621&partnerID=8YFLogxK

U2 - 10.1109/JSAC.2011.110116

DO - 10.1109/JSAC.2011.110116

M3 - Article

VL - 29

SP - 161

EP - 172

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 1

M1 - 5678791

ER -