Exploiting Interference for Capacity Improvement in Software-Defined Vehicular Networks

Xin Guan, Yan Huang, Min Chen, Huayang Wu, Tomoaki Ohtsuki, Yan Zhang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Vehicular ad hoc networks (VANETs), which are deployed along roads, make traffic systems safer and more efficient. The existing theoretical results on capacity scaling laws provide insights and guidance for designing and deploying VANETs. As a new paradigm of VANETs, software-defined vehicular ad hoc networks (SDVANETs) separate the data plane from the control plane. For many prospective applications, software-defined technology will be used in VANETs to achieve some general targets, such as network management. Therefore, a capacity analysis is critical and necessary for SDVANETs. In this paper, we propose a new fundamental framework named real vehicular wireless network model (RVWNM), which enables a more realistic capacity analysis in SDVANETs. We first introduce a Euclidean planar graph that can be constructed from any real map of an urban area and that represents the practical geometry structure of the urban area. Then, an interference relationship graph is abstracted from the Euclidean planar graph, which considers the transmission interference relations among the nodes in the network. Finally, we theoretically analyze the interference relationships in the interference relationship graph. A practical geometrical structure is used to calculate the asymptotic capacity of SDVANETs. To verify the feasibility of RVWNM, we calculate the asymptotic capacity of social-proximity urban networks. We also consider the social-proximity-based mobility of vehicles, and we derive asymptotic capacity bounds for sparse SDVANETs and constant bounds for high-density SDVANETs.

Original languageEnglish
Article number7937780
Pages (from-to)10662-10673
Number of pages12
JournalIEEE Access
Volume5
DOIs
Publication statusPublished - 2017

Fingerprint

Vehicular ad hoc networks
Wireless networks
Scaling laws
Network management
Application programs

Keywords

  • capacity scaling law
  • graph theory
  • independent set
  • interference
  • Software-defined vehicular ad hoc networks (SDVANETs)

ASJC Scopus subject areas

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

Exploiting Interference for Capacity Improvement in Software-Defined Vehicular Networks. / Guan, Xin; Huang, Yan; Chen, Min; Wu, Huayang; Ohtsuki, Tomoaki; Zhang, Yan.

In: IEEE Access, Vol. 5, 7937780, 2017, p. 10662-10673.

Research output: Contribution to journalArticle

Guan, Xin ; Huang, Yan ; Chen, Min ; Wu, Huayang ; Ohtsuki, Tomoaki ; Zhang, Yan. / Exploiting Interference for Capacity Improvement in Software-Defined Vehicular Networks. In: IEEE Access. 2017 ; Vol. 5. pp. 10662-10673.
@article{c9027126c34d408382106d881952cdd7,
title = "Exploiting Interference for Capacity Improvement in Software-Defined Vehicular Networks",
abstract = "Vehicular ad hoc networks (VANETs), which are deployed along roads, make traffic systems safer and more efficient. The existing theoretical results on capacity scaling laws provide insights and guidance for designing and deploying VANETs. As a new paradigm of VANETs, software-defined vehicular ad hoc networks (SDVANETs) separate the data plane from the control plane. For many prospective applications, software-defined technology will be used in VANETs to achieve some general targets, such as network management. Therefore, a capacity analysis is critical and necessary for SDVANETs. In this paper, we propose a new fundamental framework named real vehicular wireless network model (RVWNM), which enables a more realistic capacity analysis in SDVANETs. We first introduce a Euclidean planar graph that can be constructed from any real map of an urban area and that represents the practical geometry structure of the urban area. Then, an interference relationship graph is abstracted from the Euclidean planar graph, which considers the transmission interference relations among the nodes in the network. Finally, we theoretically analyze the interference relationships in the interference relationship graph. A practical geometrical structure is used to calculate the asymptotic capacity of SDVANETs. To verify the feasibility of RVWNM, we calculate the asymptotic capacity of social-proximity urban networks. We also consider the social-proximity-based mobility of vehicles, and we derive asymptotic capacity bounds for sparse SDVANETs and constant bounds for high-density SDVANETs.",
keywords = "capacity scaling law, graph theory, independent set, interference, Software-defined vehicular ad hoc networks (SDVANETs)",
author = "Xin Guan and Yan Huang and Min Chen and Huayang Wu and Tomoaki Ohtsuki and Yan Zhang",
year = "2017",
doi = "10.1109/ACCESS.2017.2711003",
language = "English",
volume = "5",
pages = "10662--10673",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Exploiting Interference for Capacity Improvement in Software-Defined Vehicular Networks

AU - Guan, Xin

AU - Huang, Yan

AU - Chen, Min

AU - Wu, Huayang

AU - Ohtsuki, Tomoaki

AU - Zhang, Yan

PY - 2017

Y1 - 2017

N2 - Vehicular ad hoc networks (VANETs), which are deployed along roads, make traffic systems safer and more efficient. The existing theoretical results on capacity scaling laws provide insights and guidance for designing and deploying VANETs. As a new paradigm of VANETs, software-defined vehicular ad hoc networks (SDVANETs) separate the data plane from the control plane. For many prospective applications, software-defined technology will be used in VANETs to achieve some general targets, such as network management. Therefore, a capacity analysis is critical and necessary for SDVANETs. In this paper, we propose a new fundamental framework named real vehicular wireless network model (RVWNM), which enables a more realistic capacity analysis in SDVANETs. We first introduce a Euclidean planar graph that can be constructed from any real map of an urban area and that represents the practical geometry structure of the urban area. Then, an interference relationship graph is abstracted from the Euclidean planar graph, which considers the transmission interference relations among the nodes in the network. Finally, we theoretically analyze the interference relationships in the interference relationship graph. A practical geometrical structure is used to calculate the asymptotic capacity of SDVANETs. To verify the feasibility of RVWNM, we calculate the asymptotic capacity of social-proximity urban networks. We also consider the social-proximity-based mobility of vehicles, and we derive asymptotic capacity bounds for sparse SDVANETs and constant bounds for high-density SDVANETs.

AB - Vehicular ad hoc networks (VANETs), which are deployed along roads, make traffic systems safer and more efficient. The existing theoretical results on capacity scaling laws provide insights and guidance for designing and deploying VANETs. As a new paradigm of VANETs, software-defined vehicular ad hoc networks (SDVANETs) separate the data plane from the control plane. For many prospective applications, software-defined technology will be used in VANETs to achieve some general targets, such as network management. Therefore, a capacity analysis is critical and necessary for SDVANETs. In this paper, we propose a new fundamental framework named real vehicular wireless network model (RVWNM), which enables a more realistic capacity analysis in SDVANETs. We first introduce a Euclidean planar graph that can be constructed from any real map of an urban area and that represents the practical geometry structure of the urban area. Then, an interference relationship graph is abstracted from the Euclidean planar graph, which considers the transmission interference relations among the nodes in the network. Finally, we theoretically analyze the interference relationships in the interference relationship graph. A practical geometrical structure is used to calculate the asymptotic capacity of SDVANETs. To verify the feasibility of RVWNM, we calculate the asymptotic capacity of social-proximity urban networks. We also consider the social-proximity-based mobility of vehicles, and we derive asymptotic capacity bounds for sparse SDVANETs and constant bounds for high-density SDVANETs.

KW - capacity scaling law

KW - graph theory

KW - independent set

KW - interference

KW - Software-defined vehicular ad hoc networks (SDVANETs)

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

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

U2 - 10.1109/ACCESS.2017.2711003

DO - 10.1109/ACCESS.2017.2711003

M3 - Article

AN - SCOPUS:85028777525

VL - 5

SP - 10662

EP - 10673

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 7937780

ER -