检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《通信学报》2014年第11期59-68,80,共11页Journal on Communications
基 金:中央高校基本科研业务费基金资助项目(CDJXS11162236)~~
摘 要:针对多个与基站(BS,base station)无直达链路蜂窝边缘移动站(MS,mobile station)在上行链路具有保密信息传输需求且存在不信任中继(UR,untrusted relay)协作通信场景,引入目的节点(即BS)干扰机制,并研究MS固定传输功率下UR与BS功率分配以最大化系统安全速率问题。分析表明,该联合功率控制问题等价于联合接入控制与功率分配问题因而是NP-难。通过问题松弛,提出一种次优MS接入控制与基于交替优化的功率分配算法,并证明该次优算法具有多项式复杂度且至少收敛到原始问题一个次优解。仿真结果表明,所提次优算法相对于同场景各种参考算法在系统可达安全速率性能上有显著提高。The scenario that multiple cell-edge mobile stations (MS) all without direct-links to the base station (BS) but have confidential messages in the uplink in the presence of untrusted relay (UR) cooperation was considered. In order to implement the secure communication between BS and multiple MS, destination-based jamming (DBJ) scheme was adopted. With the assumption that all MS had fixed transmit power, the joint UR and BS power control which aims at maximizing system sum secrecy rate was discussed. For this problem, analysis indicated that it was equivalent to joint access control and power allocation problem thus its NP-hard. Through problem relaxation, a suboptimal MS access control and alternatively power allocation algorithm was provided. This algorithm is proved to have polynomial complexity and can converge to at least a suboptimal solution for original problem. Simulation results show that compared with the benchmark algorithms, the proposed suboptimal algorithm is better in the achievable secrecy rate performance.
分 类 号:TN919.1[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117