Distributed WRBG Matching Approach for Multiflow Two-Way D2D Networks

Bo Bai, Wei Chen, Khaled Letaief, Zhigang Cao

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Device-to-device (D2D) communication has great potential to improve spectrum efficiency and offload traffic for cellular networks. In this paper, we focus on a multiflow two-way D2D network with decode-and-forward (DF) relays, coexisting with OFDMA cellular network. The spectrum sharing and relay selection are considered to minimize the outage probability of the device in D2D networks. The induced problem is a complicated probabilistic integral programming. A novel weighted random bipartite graph (WRBG)-based minimum weight maximum matching (MWMM) approach will be proposed in this paper. To offload not only the traffic but also the signaling and computation overhead, the improved min-sum algorithm will be applied to find the MWMM in the distributed manner with only polynomial complexity. The proposed approach enjoys an advantage that the close-form approximation formulas for optimal outage probability and diversity-multiplexing tradeoff can be derived by analyzing the properties of MWMM on WRBG. Both the theoretical derivations and simulation results will illustrate that the proposed approach for multiflow two-way D2D networks achieves the same performance as single-flow two-way D2D systems. Therefore, the distributed WRBG matching approach yields not only a practical distributed algorithm, but also a simple and elegant theoretical framework for multiflow two-way D2D networks.

Original languageEnglish
Article number7368206
Pages (from-to)2925-2939
Number of pages15
JournalIEEE Transactions on Wireless Communications
Volume15
Issue number4
DOIs
Publication statusPublished - 1 Apr 2016
Externally publishedYes

Fingerprint

Graph Matching
Random Graphs
Outages
Bipartite Graph
Maximum Matching
Outage Probability
Cellular Networks
Multiplexing
Parallel algorithms
Traffic
Polynomials
Diversity-multiplexing Tradeoff
Spectrum Sharing
Polynomial Complexity
Relay Selection
Decode-and-forward
Orthogonal Frequency Division multiple Access (OFDMA)
Communication
Distributed Algorithms
Relay

Keywords

  • belief propagation
  • Device-to-device communication
  • diversity-multiplexing tradeoff
  • minimum weight maximum matching
  • outage probability
  • weighted random bipartite graph

ASJC Scopus subject areas

  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Distributed WRBG Matching Approach for Multiflow Two-Way D2D Networks. / Bai, Bo; Chen, Wei; Letaief, Khaled; Cao, Zhigang.

In: IEEE Transactions on Wireless Communications, Vol. 15, No. 4, 7368206, 01.04.2016, p. 2925-2939.

Research output: Contribution to journalArticle

@article{43bb129925ec4219bcfe0c2889ce060f,
title = "Distributed WRBG Matching Approach for Multiflow Two-Way D2D Networks",
abstract = "Device-to-device (D2D) communication has great potential to improve spectrum efficiency and offload traffic for cellular networks. In this paper, we focus on a multiflow two-way D2D network with decode-and-forward (DF) relays, coexisting with OFDMA cellular network. The spectrum sharing and relay selection are considered to minimize the outage probability of the device in D2D networks. The induced problem is a complicated probabilistic integral programming. A novel weighted random bipartite graph (WRBG)-based minimum weight maximum matching (MWMM) approach will be proposed in this paper. To offload not only the traffic but also the signaling and computation overhead, the improved min-sum algorithm will be applied to find the MWMM in the distributed manner with only polynomial complexity. The proposed approach enjoys an advantage that the close-form approximation formulas for optimal outage probability and diversity-multiplexing tradeoff can be derived by analyzing the properties of MWMM on WRBG. Both the theoretical derivations and simulation results will illustrate that the proposed approach for multiflow two-way D2D networks achieves the same performance as single-flow two-way D2D systems. Therefore, the distributed WRBG matching approach yields not only a practical distributed algorithm, but also a simple and elegant theoretical framework for multiflow two-way D2D networks.",
keywords = "belief propagation, Device-to-device communication, diversity-multiplexing tradeoff, minimum weight maximum matching, outage probability, weighted random bipartite graph",
author = "Bo Bai and Wei Chen and Khaled Letaief and Zhigang Cao",
year = "2016",
month = "4",
day = "1",
doi = "10.1109/TWC.2015.2512984",
language = "English",
volume = "15",
pages = "2925--2939",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Distributed WRBG Matching Approach for Multiflow Two-Way D2D Networks

AU - Bai, Bo

AU - Chen, Wei

AU - Letaief, Khaled

AU - Cao, Zhigang

PY - 2016/4/1

Y1 - 2016/4/1

N2 - Device-to-device (D2D) communication has great potential to improve spectrum efficiency and offload traffic for cellular networks. In this paper, we focus on a multiflow two-way D2D network with decode-and-forward (DF) relays, coexisting with OFDMA cellular network. The spectrum sharing and relay selection are considered to minimize the outage probability of the device in D2D networks. The induced problem is a complicated probabilistic integral programming. A novel weighted random bipartite graph (WRBG)-based minimum weight maximum matching (MWMM) approach will be proposed in this paper. To offload not only the traffic but also the signaling and computation overhead, the improved min-sum algorithm will be applied to find the MWMM in the distributed manner with only polynomial complexity. The proposed approach enjoys an advantage that the close-form approximation formulas for optimal outage probability and diversity-multiplexing tradeoff can be derived by analyzing the properties of MWMM on WRBG. Both the theoretical derivations and simulation results will illustrate that the proposed approach for multiflow two-way D2D networks achieves the same performance as single-flow two-way D2D systems. Therefore, the distributed WRBG matching approach yields not only a practical distributed algorithm, but also a simple and elegant theoretical framework for multiflow two-way D2D networks.

AB - Device-to-device (D2D) communication has great potential to improve spectrum efficiency and offload traffic for cellular networks. In this paper, we focus on a multiflow two-way D2D network with decode-and-forward (DF) relays, coexisting with OFDMA cellular network. The spectrum sharing and relay selection are considered to minimize the outage probability of the device in D2D networks. The induced problem is a complicated probabilistic integral programming. A novel weighted random bipartite graph (WRBG)-based minimum weight maximum matching (MWMM) approach will be proposed in this paper. To offload not only the traffic but also the signaling and computation overhead, the improved min-sum algorithm will be applied to find the MWMM in the distributed manner with only polynomial complexity. The proposed approach enjoys an advantage that the close-form approximation formulas for optimal outage probability and diversity-multiplexing tradeoff can be derived by analyzing the properties of MWMM on WRBG. Both the theoretical derivations and simulation results will illustrate that the proposed approach for multiflow two-way D2D networks achieves the same performance as single-flow two-way D2D systems. Therefore, the distributed WRBG matching approach yields not only a practical distributed algorithm, but also a simple and elegant theoretical framework for multiflow two-way D2D networks.

KW - belief propagation

KW - Device-to-device communication

KW - diversity-multiplexing tradeoff

KW - minimum weight maximum matching

KW - outage probability

KW - weighted random bipartite graph

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

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

U2 - 10.1109/TWC.2015.2512984

DO - 10.1109/TWC.2015.2512984

M3 - Article

AN - SCOPUS:84963813566

VL - 15

SP - 2925

EP - 2939

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 4

M1 - 7368206

ER -