TY - JOUR

T1 - Transmission-Order Optimization for Bidirectional Device-to-Device (D2D) Communications Underlaying Cellular TDD Networks

T2 - A Graph Theoretic Approach

AU - Uykan, Zekeriya

AU - Jäntti, Riku

PY - 2016/1

Y1 - 2016/1

N2 - Device-to-device (D2D) communications underlaying cellular networks is a promising concept that has several advantages over the traditional cellular networks. In the TDD system, the frame structure defines the order of uplink and downlink transmission slots. Typically, a TDD system is synchronized, and the same transmission order (TO) is used in all cells. In a direct D2D link, we have the freedom of selecting the TO of the devices freely. To our best knowledge, no paper has explicitly examined the TO optimization problem in D2D communications underlaying cellular network so far. In this paper, we focus exactly on this problem: once the proper co-channel D2D pairs are determined in the network, how do we minimize the network interference by optimally determining the TOs in all D2D links (together with co-channel cellular links) in the network, which is an NP-complete problem. In this paper, we formulate the TO optimization problem from a graph theoretic point of view: 1) we show that the TO optimization problem is equal to a constraint balanced min-cut graph partitioning problem of our defined augmented graph; and 2) we propose and analyze a distributed and a centralized efficient asynchronous clustering algorithm for solving the TO optimization probleme quivalently for themin-cut of our proposed augmented graph. Computer simulations for the TDD-based D2D underlaying cellular network show that the proposed distributed and centralized algorithms, called ABCAMiC and CABCAMiC, respectively, 1) remarkably outperform the reference case where all TOs are fixed, 2) converge within a relatively small number of steps and generally converge in only a few epochs even for a large number of cellular and D2D users, and 3) the expected performance of the (partly/fully) distributed ABCAMiC is almost equal to that of the centralized solution CABCAMiC, which generally gives near-global optimal solution to the TO optimization problem.

AB - Device-to-device (D2D) communications underlaying cellular networks is a promising concept that has several advantages over the traditional cellular networks. In the TDD system, the frame structure defines the order of uplink and downlink transmission slots. Typically, a TDD system is synchronized, and the same transmission order (TO) is used in all cells. In a direct D2D link, we have the freedom of selecting the TO of the devices freely. To our best knowledge, no paper has explicitly examined the TO optimization problem in D2D communications underlaying cellular network so far. In this paper, we focus exactly on this problem: once the proper co-channel D2D pairs are determined in the network, how do we minimize the network interference by optimally determining the TOs in all D2D links (together with co-channel cellular links) in the network, which is an NP-complete problem. In this paper, we formulate the TO optimization problem from a graph theoretic point of view: 1) we show that the TO optimization problem is equal to a constraint balanced min-cut graph partitioning problem of our defined augmented graph; and 2) we propose and analyze a distributed and a centralized efficient asynchronous clustering algorithm for solving the TO optimization probleme quivalently for themin-cut of our proposed augmented graph. Computer simulations for the TDD-based D2D underlaying cellular network show that the proposed distributed and centralized algorithms, called ABCAMiC and CABCAMiC, respectively, 1) remarkably outperform the reference case where all TOs are fixed, 2) converge within a relatively small number of steps and generally converge in only a few epochs even for a large number of cellular and D2D users, and 3) the expected performance of the (partly/fully) distributed ABCAMiC is almost equal to that of the centralized solution CABCAMiC, which generally gives near-global optimal solution to the TO optimization problem.

KW - Device-to-device (D2D) communications underlaying TDD cellular network

KW - transmission-order optimization

KW - graph representation of wireless systems

KW - balanced min-cut graph partitioning

KW - clustering

KW - WIRELESS NETWORK

KW - RADIO SYSTEMS

KW - HOC NETWORKS

KW - PERFORMANCE

KW - ASSIGNMENT

KW - ALGORITHM

KW - DESIGN

KW - RANGE

KW - REUSE

UR - http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7147786&isnumber=7358196

U2 - 10.1109/JSAC.2015.2452511

DO - 10.1109/JSAC.2015.2452511

M3 - Article

VL - 34

SP - 1

EP - 14

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 1

ER -