Research Article
Distributed Cooperative Admission and Power Control for Device-to-Device Links with QoS Protection in Cognitive Heterogeneous Network
@INPROCEEDINGS{10.1109/ChinaCom.2012.6417576, author={Pei Liu and Chun Hu and Tao Peng and Wen Wang}, title={Distributed Cooperative Admission and Power Control for Device-to-Device Links with QoS Protection in Cognitive Heterogeneous Network}, proceedings={First International Workshop on Cognitive Cooperative Communications in Heterogeneous Wireless Networks}, publisher={IEEE}, proceedings_a={C3HETNET}, year={2013}, month={2}, keywords={device-to-device quality of service admission and power control gradient descent cooperation price message}, doi={10.1109/ChinaCom.2012.6417576} }- Pei Liu
Chun Hu
Tao Peng
Wen Wang
Year: 2013
Distributed Cooperative Admission and Power Control for Device-to-Device Links with QoS Protection in Cognitive Heterogeneous Network
C3HETNET
IEEE
DOI: 10.1109/ChinaCom.2012.6417576
Abstract
In this paper, we propose two distributed admission and power control (DAPC) algorithms for Device-to-Device (D2D) communication which share uplink resources with cellular system through cognitive radio techniques in underlay mode. In the presence of quality of service (QoS) protection (both for admitted D2D link (DL) and cellular link (CL)) and transmit power limit, the DAPC-Capacity algorithm is proposed with preference for the D2D system capacity, and the DAPC-Number algorithm is proposed with preference for the number of admitted DLs. Both the two algorithms try to determine if the new coming DL can be admitted in the system, and optimize powers of DLs to maximize the D2D system capacity. In proposed algorithms, each DL uses gradient descent method to update its transmit power, and the new coming DL and admitted DLs use different formulas to calculate gradients. In calculation of gradients, DLs cooperate with each other and only need to exchange “price” messages which indicate the effect of interference. Through the numerical results, we demonstrate the satisfying performance of proposed algorithms compared to traditional centralized algorithm.
