Secure Full-Duplex Device-to-Device Communication

This paper considers full-duplex (FD) device-to-device (D2D) communications in a downlink MISO cellular system in the presence of multiple eavesdroppers. The D2D pair communicate sharing the same frequency band allocated to the cellular users (CUs). Since the D2D users share the same frequency as the CUs, both the base station (BS) and D2D transmissions interfere each other. In addition, due to limited processing capability, D2D users are susceptible to external attacks. Our aim is to design optimal beamforming and power control mechanism to guarantee secure communication while delivering the required quality-of-service (QoS) for the D2D link. In order to improve security, artificial noise (AN) is transmitted by the BS. We design robust beamforming for secure message as well as the AN in the worst-case sense for minimizing total transmit power with imperfect channel state information (CSI) of all links available at the BS. The problem is strictly non-convex with infinitely many constraints. By discovering the hidden convexity of the problem, we derive a rank-one optimal solution for the power minimization problem.Comment: Accepted in IEEE GLOBECOM 2017, Singapore, 4-8 Dec. 201

Secure Full-Duplex Device-to-Device Communication

This paper considers full-duplex (FD) device-to-device (D2D) communications in a downlink MISO cellular system in the presence of multiple eavesdroppers. The D2D pair communicate sharing the same frequency band allocated to the cellular users (CUs). Since the D2D users share the same frequency as the CUs, both the base station (BS) and D2D transmissions interfere each other. In addition, due to limited processing capability, D2D users are susceptible to external attacks. Our aim is to design optimal beamforming and power control mechanism to guarantee secure communication while delivering the required quality-of-service (QoS) for the D2D link. In order to improve security, artificial noise (AN) is transmitted by the BS. We design robust beamforming for secure message as well as the AN in the worst-case sense for minimizing total transmit power with imperfect channel state information (CSI) of all links available at the BS. The problem is strictly non-convex with infinitely many constraints. By discovering the hidden convexity of the problem, we derive a rank-one optimal solution for the power minimization problem.Comment: Accepted in IEEE GLOBECOM 2017, Singapore, 4-8 Dec. 201

QoS-aware User Association and Transmission Scheduling for Millimeter-Wave Train-ground Communications

With the development of wireless communication, people have put forward higher requirements for train-ground communications in the high-speed railway (HSR) scenarios. With the help of mobile relays (MRs) installed on the roof of the train, the application of Millimeter-Wave (mm-wave) communication which has rich spectrum resources to the train-ground communication system can realize high data rate, so as to meet users' increasing demand for broad-band multimedia access. Also, full-duplex (FD) technology can theoretically double the spectral efficiency. In this paper, we formulate the user association and transmission scheduling problem in the mm-wave train-ground communication system with MR operating in the FD mode as a nonlinear programming problem. In order to maximize the system throughput and the number of users meeting quality of service (QoS) requirements, we propose an algorithm based on coalition game to solve the challenging NP-hard problem, and also prove the convergence and Nash-stable structure of the proposed algorithm. Extensive simulation results demonstrate that the proposed coalition game based algorithm can effectively improve the system throughput and meet the QoS requirements of as many users as possible, so that the communication system has a certain QoS awareness.Comment: 14 page