Radio Link Enabler for Context-aware D2D Communication in Reuse Mode

Device-to-Device (D2D) communication is considered as one of the key technologies for the fifth generation wireless communication system (5G) due to certain benefits provided, e.g. traffic offload and low end-to-end latency. A D2D link can reuse resource of a cellular user for its own transmission, while mutual interference in between these two links is introduced. In this paper, we propose a smart radio resource management (RRM) algorithm which enables D2D communication to reuse cellular resource, by taking into account of context information. Besides, signaling schemes with high efficiency are also given in this work to enable the proposed RRM algorithm. Simulation results demonstrate the performance improvement of the proposed scheme in terms of the overall cell capacity

Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach

Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the system sum rate over the resource sharing of both D2D and cellular modes, we introduce a reverse iterative combinatorial auction as the allocation mechanism. In the auction, all the spectrum resources are considered as a set of resource units, which as bidders compete to obtain business while the packages of the D2D pairs are auctioned off as goods in each auction round. We first formulate the valuation of each resource unit, as a basis of the proposed auction. And then a detailed non-monotonic descending price auction algorithm is explained depending on the utility function that accounts for the channel gain from D2D and the costs for the system. Further, we prove that the proposed auction-based scheme is cheat-proof, and converges in a finite number of iteration rounds. We explain non-monotonicity in the price update process and show lower complexity compared to a traditional combinatorial allocation. The simulation results demonstrate that the algorithm efficiently leads to a good performance on the system sum rate.Comment: 26 pages, 6 fgures; IEEE Journals on Selected Areas in Communications, 201