{'fraction_non_alphanumeric': 0.014363885088919288, 'fraction_numerical': 0.0, 'mean_word_length': 5.502222222222223, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Physical layer security and energy efficiency driven resource optimisation for cognitive relay networks

: In this study, a resource allocation problem considering physical layer security and power consumption for cognitive relay networks is studied. In a secondary network, the ratio of secret rate to power consumption is defined as a secret rate per watt (SRW). Fixed circuit power, dynamic circuit power, and transmit power are all considered in the power consumption model. Under the constraints of the maximum total transmit power of secondary user transmitters and relay nodes, minimum secret rate requirement of secondary user receiver and tolerable interference threshold of each primary user receiver, the authors propose a SRW maximisation algorithm to maximise SRW. The resource allocation problem is formulated as a non-linear fractional programming and it is transformed into an equivalent subtraction based on the Dinkelbach method. They incorporate the non- convex constraints into the objective function to convert the feasible region into a convex set and achieve an optimal resource allocation scheme with the nested loop iteration algorithm through the Lagrange dual theory and the difference of convex programming. By the Dinkelbach method and the nested loop iteration algorithm, the optimal SRW is obtained. Simulation results demonstrate the effectiveness and the out-performance of the proposed algorithm comparing with other algorithms.