In this paper, we propose beamforming schemes to simultaneously transmit data securely to multiple information receivers while transferring power wirelessly to multiple energy-harvesting receivers. Taking into account the imperfection of the instantaneous channel state information (CSI), we introduce a chance-constrained optimization problem to minimize the total transmit power while guaranteeing data transmission reliability, data transmission security, and power transfer reliability. As the proposed optimization problem is non-convex due to the chance constraints, we propose two robust reformulations of the original problem based on safe-convex-approximation techniques. Subsequently, applying semidefinite programming relaxation (SDR), the derived robust reformulations can be effectively solved by standard convex optimization packages. We show that the adopted SDR is tight and thus the globally optimal solutions of the reformulated problems can be recovered. Simulation results confirm the superiority of the proposed methods in guaranteeing transmission security compared to a baseline scheme. Furthermore, the performance of proposed methods can closely follow that of a benchmark scheme where perfect CSI is available for resource allocation.

This paper investigates a secure wireless-powered device-to-device (D2D) communication network in the presence of multiple eavesdroppers, where a hybrid base station (BS) in a cellular network not only provides power wirelessly for the D2D transmitter to guarantee power efficiency for the D2D network, but also serves as a cooperative jammer to interfere with the eavesdroppers. The cellular and D2D networks can belong to different service providers, which means that the D2D transmitter would need to pay for the energy service released by the hybrid BS to guarantee secure D2D communication. In order to exploit the hierarchical interaction between the BS and the D2D transmitter, we first formulate a Stackelberg game based energy trading scheme, where the quadratic energy cost model is considered. Then, a nonenergy trading based Stackelberg game is investigated to study the reversed roles of the BS and the D2D users. For comparison, we also formulate and resolve the social welfare optimization problem. We derive the closed-form Stackelberg equilibriums of the formulated games and the optimal solutions for the social welfare optimization problem. Simulation results are provided to validate our proposed schemes to highlight the importance of energy trading interaction between cellular and D2D networks.

Taking into account imperfect channel state information, this letter formulates and solves a joint active/passive beamforming optimization problem in multiple-input single-output systems with the support of an intelligent reflecting surface. In particular, we introduce an optimization problem to minimize the total transmit power subject to maintaining the users’ signal-to-interference-plus-noise-ratio coverage probability above a predefined target. Due to the presence of probabilistic constraints, the proposed optimization problem is non-convex. To circumvent this issue, we first recast the proposed problem in a convex form by adopting the Bernstein-type inequality, and we then introduce a converging alternating optimization approach to iteratively find the active/passive beamforming vectors. In particular, the transformed robust optimization problem can be effectively solved by using standard interior-point methods. Numerical results demonstrate the effectiveness of jointly optimizing the active/passive beamforming vectors.

In this letter, we introduce a novel pilot design approach that minimizes the total mean square errors of the minimum mean square error estimators of all base stations (BSs) subject to the transmit power constraints of individual users in the network, while tackling the pilot contamination in multi-cell massive MIMO systems. First, we decompose the original non-convex problem into distributed optimization sub-problems at individual BSs, where each BS can optimize its own pilot signals given the knowledge of pilot signals from the remaining BSs. We then introduce a successive optimization approach to transform each optimization sub-problem into a linear matrix inequality form, which is convex and can be solved by available optimization packages. Simulation results confirm the fast convergence of the proposed approach and prevails a benchmark scheme in terms of providing higher accuracy.

As one of the most reliable technologies, network intrusion detection system (NIDS) allows the monitoring of incoming and outgoing traffic to identify unauthorised usage and mishandling of attackers in computer network systems. To this extent, this paper investigates the experimental performance of Snort-based NIDS (S-NIDS) in a practical network with the latest technology in various network scenarios including high data speed and/or heavy traffic and/or large packet size. An effective testbed is designed based on Snort using different muti-core processors, e.g., i5 and i7, with different operating systems, e.g., Windows 7, Windows Server and Linux. Furthermore, considering an enterprise network consisting of multiple virtual local area networks (VLANs), a centralised parallel S-NIDS (CPS-NIDS) is proposed with the support of a centralised database server to deal with high data speed and heavy traffic. Experimental evaluation is carried out for each network configuration to evaluate the performance of the S-NIDS in different network scenarios as well as validating the effectiveness of the proposed CPS-NIDS. In particular, by analysing packet analysis efficiency, an improved performance of up to 10% is shown to be achieved with Linux over other operating systems, while up to 8% of improved performance can be achieved with i7 over i5 processors.

This paper proposes a generalized Firefly Algorithm (FA) to solve an optimization framework having objective function and constraints as multivariate functions of independent optimization variables. Four representative examples of how the proposed generalized FA can be adopted to solve downlink beamforming problems are shown for a classic transmit beamforming, cognitive beamforming, reconfigurable-intelligent-surfaces-aided (RIS-aided) transmit beamforming, and RIS-aided wireless power transfer (WPT). Complexity analyzes indicate that in large-antenna regimes the proposed FA approaches require less computational complexity than their corresponding interior point methods (IPMs) do, yet demand a higher complexity than the iterative and the successive convex approximation (SCA) approaches do. Simulation results reveal that the proposed FA attains the same global optimal solution as that of the IPM for an optimization problem in cognitive beamforming. On the other hand, the proposed FA approaches outperform the iterative, IPM and SCA in terms of obtaining better solution for optimization problems, respectively, for a classic transmit beamforming, RIS-aided transmit beamforming and RIS-aided WPT.