Search

The performance of the integrated sensing and communication (ISAC) networks is considerably affected by the mobility of the transceiver nodes, user equipment devices (UEs) and the passive objects that are sensed. For instance, the sensing efficiency is considerably affected by the presence or absence of a line-of-sight connection between the sensing transceivers and the object; a condition that may change quickly due to mobility. Moreover, the mobility of the UEs and objects may result in dynamically varying communication-to-sensing and sensing-to communication interference, deteriorating the network performance. In such cases, there may be a need to handover the sensing process to neighbor nodes. In this article, we develop the concept of mobility management in ISAC networks. Here, depending on the mobility of objects and/or the transceiver nodes, the data traffic, the sensing or communication coverage area of the transceivers, and the network interference, the transmission and/or the reception of the sensing signals may be handed over to neighbor nodes. Also, the ISAC configuration and modality - that is, using monostatic or bistatic sensing - are updated accordingly, such that the sensed objects can be continuously sensed with low overhead. We show that mobility management reduces the sensing interruption and boosts the communication and sensing efficiency of ISAC networks.

In this letter, we consider an intelligent reflecting surface (IRS)-assisted multiple input multiple output (MIMO) communication and we optimize the joint active and passive beamforming by exploiting the geometrical structure of the propagation channels. Due to the inherent Kronecker product structure of the channel matrix, the global beamforming optimization problem is split into lower dimensional horizontal and vertical sub-problems. Based on this factorization property, we propose two closed-form methods for passive and active beamforming designs, at the IRS, the base station, and user equipment, respectively. The first solution is a singular value decomposition (SVD)-based algorithm independently applied on the factorized channels, while the second method resorts to a third-order rank-one tensor approximation along each domain. Simulation results show that exploiting the channel Kronecker structures yields a significant improvement in terms of computational complexity at the expense of negligible spectral efficiency (SE) loss. We also show that under imperfect channel estimation, the tensor-based solution shows better SE than the benchmark and proposed SVD-based solutions., Comment: 5 pages, 3 figures, submited to wireless communication letters (under review)