Robust Joint Active-Passive Beamforming Design for IRS-Assisted ISAC Systems

The idea of Integrated Sensing and Communication (ISAC) offers a promising solution to the problem of spectrum congestion in future wireless networks. This paper studies the integration of intelligent reflective surfaces (IRS) with ISAC systems to improve the performance of radar and communication services. Specifically, an IRS-assisted ISAC system is investigated where a multi-antenna base station (BS) performs multi-target detection and multi-user communication. A low complexity and efficient joint optimization of transmit beamforming at the BS and reflective beamforming at the IRS is proposed. This is done by jointly optimizing the BS beamformers and IRS reflection coefficients to minimize the Frobenius distance between the covariance matrices of the transmitted signal and the desired radar beam pattern. This optimization aims to satisfy the signal-to-interference-and-noise ratio (SINR) constraints of the communication users, the total transmit power limit at the BS, and the unit modulus constraints of the IRS reflection coefficients. To address the resulting complex non-convex optimization problem, an efficient alternating optimization (AO) algorithm combining fractional programming (FP), semi-definite programming (SDP), and second order cone programming (SOCP) methods is proposed. Furthermore, we propose robust beamforming optimization for IRS-ISAC systems by adapting the proposed optimization algorithm to the IRS channel uncertainties that may exist in practical systems. Using advanced tools from convex optimization theory, the constraints containing uncertainty are transformed to their equivalent linear matrix inequalities (LMIs) to account for the channels' uncertainty radius. The results presented quantify the benefits of IRS-ISAC systems under various conditions and demonstrate the effectiveness of the proposed algorithm

A review on analysis and synthesis of nonlinear stochastic systems with randomly occurring incomplete information

Copyright q 2012 Hongli Dong et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In the context of systems and control, incomplete information refers to a dynamical system in which knowledge about the system states is limited due to the difficulties in modeling complexity in a quantitative way. The well-known types of incomplete information include parameter uncertainties and norm-bounded nonlinearities. Recently, in response to the development of network technologies, the phenomenon of randomly occurring incomplete information has become more and more prevalent. Such a phenomenon typically appears in a networked environment. Examples include, but are not limited to, randomly occurring uncertainties, randomly occurring nonlinearities, randomly occurring saturation, randomly missing measurements and randomly occurring quantization. Randomly occurring incomplete information, if not properly handled, would seriously deteriorate the performance of a control system. In this paper, we aim to survey some recent advances on the analysis and synthesis problems for nonlinear stochastic systems with randomly occurring incomplete information. The developments of the filtering, control and fault detection problems are systematically reviewed. Latest results on analysis and synthesis of nonlinear stochastic systems are discussed in great detail. In addition, various distributed filtering technologies over sensor networks are highlighted. Finally, some concluding remarks are given and some possible future research directions are pointed out. © 2012 Hongli Dong et al.This work was supported in part by the National Natural Science Foundation of China under Grants 61273156, 61134009, 61273201, 61021002, and 61004067, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Royal Society of the UK, the National Science Foundation of the USA under Grant No. HRD-1137732, and the Alexander von Humboldt Foundation of German

Resilient and constrained consensus against adversarial attacks: A distributed MPC framework

There has been a growing interest in realizing the resilient consensus of the multi-agent system (MAS) under cyber-attacks, which aims to achieve the consensus of normal agents (i.e., agents without attacks) in a network, depending on the neighboring information. The literature has developed mean-subsequence-reduced (MSR) algorithms for the MAS with F adversarial attacks and has shown that the consensus is achieved for the normal agents when the communication network is at least (2F+1)-robust. However, such a stringent requirement on the communication network needs to be relaxed to enable more practical applications. Our objective is, for the first time, to achieve less stringent conditions on the network, while ensuring the resilient consensus for the general linear MAS subject to control input constraints. In this work, we propose a distributed resilient consensus framework, consisting of a pre-designed consensus protocol and distributed model predictive control (DMPC) optimization, which can help significantly reduce the requirement on the network robustness and effectively handle the general linear constrained MAS under adversarial attacks. By employing a novel distributed adversarial attack detection mechanism based on the history information broadcast by neighbors and a convex set (i.e., resilience set), we can evaluate the reliability of communication links. Moreover, we show that the recursive feasibility of the associated DMPC optimization problem can be guaranteed. The proposed consensus protocol features the following properties: 1) by minimizing a group of control variables, the consensus performance is optimized; 2) the resilient consensus of the general linear constrained MAS subject to F-locally adversarial attacks is achieved when the communication network is (F+1)-robust. Finally, numerical simulation results are presented to verify the theoretical results

Optical energy-constrained slot-amplitude modulation for dimmable VLC. Suboptimal detection and performance evaluation

Energy-constrained slot-amplitude modulation (ECSAM) enables light dimming, eliminates light flicker and constrains the peak optical power while providing robust communication links. However, the complexity of the maximum-likelihood (ML) based ECSAM receiver increases exponentially with required spectral efficiency. This paper provides a comprehensive performance evaluation of ECSAM for the indoor visible light communication (VLC) channel with multipath propagation under realistic illumination constraints and imperfect channel estimation. A sub-optimal receiver that employs a slot-by-slot detection algorithm followed by a slot-correction mechanism for reducing the receiver complexity is proposed. Additionally, the method for optimal selection of parameters when designing the signal waveform is presented. The analytical upper bound on the symbol error rate of ECSAM is derived using the union-bound technique. The results show that the error performance of the sub-optimal receiver are comparable to that of the optimal ML receiver. Compared with conventional power or bandwidth efficient VLC modulation techniques such as multiple pulse position modulation (MPPM) and pulse amplitude modulation (PAM), ECSAM provides complete flexibility in modifying the signal constellation for a desired dimming level to maximise the spectral efficiency and provide a robust bit error rate performance especially in the multipath propagation channel induced intersymbol interference