Millimeter wave offers a sensible solution to the capacity crunch faced by 5G wireless communications. This paper comprehensively studies physical layer security in a multi-input single-output (MISO) millimeter wave system where multiple single-antenna eavesdroppers are randomly located. Concerning the specific propagation characteristics of millimeter wave, we investigate two secure transmission schemes, namely maximum ratio transmitting (MRT) beamforming and artificial noise (AN) beamforming. Specifically, we first derive closed-form expressions of the connection probability for both schemes. We then analyze the secrecy outage probability (SOP) in both non-colluding eavesdroppers and colluding eavesdroppers scenarios. Also, we maximize the secrecy throughput under a SOP constraint, and obtain optimal transmission parameters, especially the power allocation between AN and the information signal for AN beamforming. Numerical results are provided to verify our theoretical analysis. We observe that the density of eavesdroppers, the spatially resolvable paths of the destination and eavesdroppers all contribute to the secrecy performance and the parameter design of millimeter wave systems.

In the fifth generation era, the pervasive applications of Internet of Things and massive machine-type communications have initiated increasing research interests on the backscatter wireless powered communication (B-WPC) technique due to its ultra high energy efficiency and low cost. The ubiquitous B-WPC network is characterized by nodes with dynamic spatial positions and sporadic short packets, of which the performance has not been fully investigated. In this paper, we give a comprehensive analysis of a multi-antenna B-WPC network with sporadic short packets under a stochastic geometry framework. By exploiting a time-space Poisson point process model, the behavior of the network is well captured in a decentralized and asynchronous transmission way. We then analyze the energy and information outage performance in the energy harvest and backscatter modulation phases of the backscatter network, respectively. The optimal transmission slot length and division are obtained by maximizing the network-wide spatial throughput. Moreover, we find an interesting result that there exists the optimal tradeoff between the durations of the energy harvest and backscatter modulation phases for spatial throughput maximization. Numerical results are demonstrated to verify our analytical findings and show that this tradeoff region gets shrunk when the outage constraints become more stringent.

The block diagonalization (BD) is a linear precoding technique for multi-user multi-input multi-output (MIMO) broadcast channels, which is able to completely eliminate the multi-user interference (MUI), but it is not computationally efficient. In this paper, we propose the block diagonal Jacket matrix decomposition, which is able not only to extend the conventional block diagonal channel decomposition but also to achieve the MIMO broadcast channel capacity. We also prove that the QR algorithm achieves the same sum rate as that of the conventional BD scheme. The complexity analysis shows that our proposal is more efficient than the conventional BD method in terms of the number of the required computation.

Cognitive radio is emerging as one of the key information transmission technologies to enhance spectrum efficiency for dramatically increased wireless network capacity requested by end users. Dynamic spectrum access allows effective use of radio frequency and prevents its underutilization in many real-world networks. It enables unlicensed users to temporarily “borrow” unused spectrum while ensuring that the rights of the incumbent license holders are respected. Problems of optimization of joint access of primary and secondary users can be effectively solved by means of queueing theory. In this paper, the analysis of a novel queueing model suitable for the optimization of access is implemented under quite general assumptions about the system parameters. There are several types of primary customers having different requirements for the service time and preemptive priority over secondary customers. Secondary customers can share a server, while primary customers occupy the whole server. The arrival flow is described by the marked Markovian arrival process. The service time distribution is of phase-type. Effect of retrials of secondary customers is taken into account. An effective way for the analysis of multi-server queues with many types of customers and heterogeneous requirements to the service process is provided and applied.

In this paper, we consider the problem of joint secure routing and transmit power optimization for a multihop ad-hoc network under the existence of randomly distributed eavesdroppers following a Poisson point process. Secrecy messages are delivered from a source to a destination through a multi-hop route connected by multiple legitimate relays in the network. Our goal is to minimize the end-to-end connection outage probability under the constraint of a secrecy outage probability threshold, by optimizing the routing path and the transmit power of each hop jointly. We show that the globally optimal solution could be obtained by a two-step procedure where the optimal transmit power has a closed-form and the optimal routing path can be found by Dijkstra's algorithm. Then a friendly jammer with multiple antennas is applied to enhance the secrecy performance further, and the optimal transmit power of the jammer and each hop of the selected route is investigated. This problem can be solved optimally via an iterative outer polyblock approximation with 1-D search algorithm. Furthermore, suboptimal transmit powers can be derived using the successive convex approximation method with a lower complexity. Simulation results show the performance improvement of the proposed algorithms for both non-jamming and jamming scenarios, and also reveal a non-trivial tradeoff between the numbers of hops and the transmit power of each hop for secure routing.