Spatial reuse based resource allocation in device-to-device communications
Paper i proceeding, 2016

Device-to-Device (D2D) communications have attracted more concern recently, since it provides a supplemental paradigm of short range communications for the current cellular networks. In D2D communications information bits are directly transmitted between devices without traversing base station (BS). As a result, D2D communications can potentially facilitate the improvement of the network capacity, extension of the network coverage, enhancement of the spectrum efficiency, and the energy efficiency as well. It also works well for couple of new applications, such as information exchange between devices in Internet of Things (IoT) and low delay video content sharing. From the perspective of resource allocation in D2D communications, multiple D2D users (DUs) may reuse the same resource of cellular users (CUs). Thus, we put our focus on the spatial reuse resource allocation in this paper. We formulate the spatial reuse problem which aims to maximize the system throughput while maintaining the desirable signal-noise-interference-ratio (SINR) at receivers. Accordingly, a greedy based user set selection algorithm is proposed to filter the candidate DU set to further reduce the computation complexity. Simulation results show that the cellular network can achieve a higher throughput by using our proposed scheme.

Spatial reuse

Resource allocation

Device-to-device communications

Författare

T. Sun

Beijing University of Posts and Telecommunications (BUPT)

L. Wang

Southeast University

Beijing University of Posts and Telecommunications (BUPT)

Z. Wu

Beijing University of Posts and Telecommunications (BUPT)

Tommy Svensson

Chalmers, Signaler och system, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

1867-8211 (ISSN)

Vol. 169 131-143

Ämneskategorier

Kommunikationssystem

DOI

10.1007/978-3-319-47063-4_12

ISBN

978-3-319-47062-7

Mer information

Senast uppdaterat

2018-05-23