scholarly journals Joint power allocation and subcarrier assignment for device to device in 5G time division duplex networks

2018 ◽  
Vol 14 (11) ◽  
pp. 155014771881109 ◽  
Author(s):  
Pan Zhao ◽  
Lei Feng ◽  
Peng Yu ◽  
Wenjing Li ◽  
Xuesong Qiu

The explosive demands for mobile broadband service bring a major challenge to 5G wireless networks. Device-to-device communication, adopting side links for user-direct communication, is regarded as a main technical source for offloading large volume of mobile traffic from cellular base station. This article investigates the joint power and subcarrier allocation scheme for device-to-device communication in 5G time division duplex systems. In time division duplex system, instead of utilizing an exclusive portion of the precious cellular spectrum, device-to-device pairs reuse the subcarriers occupied by cellular users, thus producing harmful interference to cellular users in both uplink and downlink communication, and strongly limiting the spectrum efficiency of the system. To this end, we focus on the maximization of device-to-device throughput while guaranteeing both uplink and downlink channel quality of service of cellular users as well as device-to-device pairs. The problem is formulated as a mixed integer non-linear programming (MINLP) problem. To make it tractable, we separate the original MINLP problem into two sub problems: power allocation and sub-carrier reusing. The former is to develop optimal power allocation for each device-to-device pair and each cellular user, with the constraints of maximum power and quality of service. It is solved by geometric programming technique in convex optimization method. The latter is derived as a one-to-many matching problem for scheduling multiple subcarriers occupied by cellulars to device-to-device pairs. It is solved by Hungarian method. Simulation results show that the proposed scheme significantly improves system capacity of the device-to-device underlay network, with quality of service of both device-to-device users and cellular users guaranteed.

2020 ◽  
Author(s):  
Yue Yin ◽  
Miao Liu ◽  
Guan Gui ◽  
Haris Gacanin ◽  
Fumiyuki Adachi

<div>Non-orthogonal multiple access (NOMA) based</div><div>wireless caching network (WCN) is considered as one of the most</div><div>promising technologies for next-generation wireless communications</div><div>since it can significantly improve the spectral efficiency.</div><div>In this paper, we propose a quality of service (QoS)-oriented</div><div>dynamic power allocation strategy for NOMA-WCN. In content</div><div>stack phase, the base station sends multiple files to the content</div><div>servers by allocating different powers according to the different</div><div>QoS targets of files, for ensuring that all content servers can</div><div>successfully decode the two most popular files. In content deliver</div><div>phase, the content servers serve two users at the same time</div><div>by allocating the minimum power to the far user according</div><div>to the QoS requirement, and then all the remaining power is</div><div>allocated to the near user. Hence, the proposed power allocation</div><div>scheme is able to increase the hit probability and drop the outage</div><div>probability compared with conventional method. Simulation</div><div>results confirm that the proposed power allocation method can</div><div>significantly improve the caching hit probability and reduce the</div><div>user outage probability. It is also shown that this strategy can</div><div>reduce the user delay time, improve the system efficiency and</div><div>the capacity.</div>


2020 ◽  
Author(s):  
Yue Yin ◽  
Miao Liu ◽  
Guan Gui ◽  
Haris Gacanin ◽  
Fumiyuki Adachi

<div>Non-orthogonal multiple access (NOMA) based</div><div>wireless caching network (WCN) is considered as one of the most</div><div>promising technologies for next-generation wireless communications</div><div>since it can significantly improve the spectral efficiency.</div><div>In this paper, we propose a quality of service (QoS)-oriented</div><div>dynamic power allocation strategy for NOMA-WCN. In content</div><div>stack phase, the base station sends multiple files to the content</div><div>servers by allocating different powers according to the different</div><div>QoS targets of files, for ensuring that all content servers can</div><div>successfully decode the two most popular files. In content deliver</div><div>phase, the content servers serve two users at the same time</div><div>by allocating the minimum power to the far user according</div><div>to the QoS requirement, and then all the remaining power is</div><div>allocated to the near user. Hence, the proposed power allocation</div><div>scheme is able to increase the hit probability and drop the outage</div><div>probability compared with conventional method. Simulation</div><div>results confirm that the proposed power allocation method can</div><div>significantly improve the caching hit probability and reduce the</div><div>user outage probability. It is also shown that this strategy can</div><div>reduce the user delay time, improve the system efficiency and</div><div>the capacity.</div>


2015 ◽  
Vol 2015 ◽  
pp. 1-15 ◽  
Author(s):  
Weiheng Jiang ◽  
Wenjiang Feng

The secure communication that multiple OFDMA-based cell-edge mobile stations (MS) can only transmit confidential messages to base station (BS) through an untrusted intermediate relay (UR) is discussed. Specifically, with the destination-based jamming (DBJ) scheme and fixed MS transmission power assumption, our focus is on the joint BS and US power allocation to maximize system sum secrecy rate. We first analyze the challenges in solving this problem. The result indicates that our nonconvex joint power allocation is equivalent to a joint MS access control and power allocation. Then, by problem relaxation and the alternating optimization approach, two suboptimal joint MS access control and power allocation algorithms are proposed. These algorithms alternatively solve the subproblem of joint BS and UR power allocation and the subproblem of MS selection until system sum secrecy rate is nonincreasing. In addition, the convergence and computational complexity of the proposed algorithms are analyzed. Finally, simulations results are presented to demonstrate the performance of our proposed algorithms.


Sign in / Sign up

Export Citation Format

Share Document