Abstract
The security requirements of data transmission over wireless networks are energy-limited in many situations. In this paper, the secure energy efficiency (EE), is defined as the ratio of the secrecy rate to the total power, and is investigated in a systematic way considering a decode-and-forward (DF) relay network with a potential eavesdropper. We maximize the secure EE subject to the individual power constraint and the minimum decoding rate constraint of the relay. To deal with the nonconvexity of the formulated problem, a fractional programming approach embedded with DC (difference of convex functions) programming is proposed to solve the problem by two-layer iterations. The key point of the proposed algorithm is to translate the primal problem into a series of convex subproblems, which can be solved by convex programming. It is verified by simulation that the proposed algorithm achieves much better secure EE than the conventional secrecy rate maximization yet with a minor performance loss measured by average secrecy rate or secrecy outage probability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
