Information Theory (cs.IT)
Tue, 06 Jun 2023
1.Generalised Impedance Model of Wireless Links Assisted by Reconfigurable Intelligent Surfaces
Authors:Keisuke Konno, Sergio Terranova, Qiang Chen, Gabriele Gradoni
Abstract: We devise an end-to-end communication channel model that describes the performance of RIS-assisted MIMO wireless links. The model borrows the impedance (interaction) matrix formalism from the Method of Moments and provides a physics-based communication model. In configurations where the transmit and receive antenna arrays are distant from the RIS beyond a wavelength, a reduced model provides accurate results for arbitrary RIS unit cell geometry. Importantly, the simplified model configures as a cascaded channel transfer matrix whose mathematical structure is compliant with widely accepted, but less accurate, system level RIS models. A numerical validation of the communication model is presented for the design of binary RIS structures with scatterers of canonical geometry. Attained results are consistent with path-loss models: For obstructed line-of-sight between transmitter and receiver, the channel capacity of the (optimised) RIS-assisted link scales as $R^{-2}$, with $R$ RIS-receiver distance at fixed transmitter position. Our results shows that the applicability of communication models based on mutual impedance matrices is not restricted to canonical minimum scattering RIS unit cells.
2.Destination Scheduling for Secure Pinhole-Based Power-Line Communication
Authors:Chinmoy Kundu, Ankit Dubey, Andrea M. Tonello, Arumugam Nallanathan, Mark F. Flanagan
Abstract: We propose an optimal destination scheduling scheme to improve the physical layer security (PLS) of a power-line communication (PLC) based Internet-of-Things system in the presence of an eavesdropper. We consider a pinhole (PH) architecture for a multi-node PLC network to capture the keyhole effect in PLC. The transmitter-to-PH link is shared between the destinations and an eavesdropper which correlates all end-to-end links. The individual channel gains are assumed to follow independent log-normal statistics. Furthermore, the additive impulsive noise at each node is modeled by an independent Bernoulli-Gaussian process. Exact computable expressions for the average secrecy capacity (ASC) and the probability of intercept (POI) performance over many different networks are derived. Approximate closed-form expressions for the asymptotic ASC and POI are also provided. We find that the asymptotic ASC saturates to a constant level as transmit power increases. We observe that the PH has an adverse effect on the ASC. Although the shared link affects the ASC, it has no effect on the POI. We show that by artificially controlling the impulsive to background noise power ratio and its arrival rate at the receivers, the secrecy performance can be improved.