Secure Resource Allocation for OFDMA Two-Way Relay Wireless Sensor Networks Without and With Cooperative Jamming

• Published in: IEEE transactions on industrial informatics Vol. 12; no. 5; pp. 1714 - 1725
• Main Authors: Haijun Zhang, Hong Xing, Julian Cheng, Nallanathan, Arumugam, Victor Leung, C. M.
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.10.2016; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Communication system security; Cooperative jamming (CJ); Frequency division multiple access; Heuristic methods; Integer programming; Jamming; Mixed integer; Optimization; orthogonal frequency division multiple access (OFDMA); Orthogonal Frequency Division Multiplexing; physical layer security; Relay stations; Relays; Resource allocation; Resource management; secure resource allocation; Sensors; Wireless communication; Wireless networks; wireless sensor network (WSN); Wireless sensor networks
• ISSN: 1551-3203; 1941-0050; 1941-0050
• DOI: 10.1109/TII.2015.2489610

We consider secure resource allocations for orthogonal frequency division multiple access (OFDMA) two-way relay wireless sensor networks (WSNs). The joint problem of subcarrier (SC) assignment, SC pairing and power allocations, is formulated under scenarios of using and not using cooperative jamming (CJ) to maximize the secrecy sum rate subject to limited power budget at the relay station (RS) and orthogonal SC allocation policies. The optimization problems are shown to be mixed integer programming and nonconvex. For the scenario without CJ, we propose an asymptotically optimal algorithm based on the dual decomposition method and a suboptimal algorithm with lower complexity. For the scenario with CJ, the resulting optimization problem is nonconvex, and we propose a heuristic algorithm based on alternating optimization. Finally, the proposed schemes are evaluated by simulations and compared with the existing schemes.