In cooperative localization for autonomous underwater vehicles (AUVs), the practical stochastic noise may be heavy-tailed and non-stationary distributed because of acoustic speed variation, multi-path effect of acoustic channel, and changeable underwater environment. To address such noise, a novel heavy-tailed mixture (HTM) distribution is firstly proposed and then expressed as a hierarchical Gaussian form by employing a categorical distributed auxiliary vector. Based on that, a novel HTM distribution based robust Kalman filter is proposed, where the one-step prediction and measurement likelihood probability density functions are, respectively, modelled as a HTM distribution and a Normal-Gamma-inverse Wishart distribution. The proposed filter is verified by a lake experiment about cooperative localization for AUVs. Compared with the cutting-edge filter, the proposed filter has been improved by 50.27% in localization error but no more than twice computational time is required.
Integrated sensing and communication (ISAC) is envisioned as a key pillar for enabling the upcoming sixth generation (6G) communication systems, requiring not only reliable communication functionalities but also highly accurate environmental sensing capabilities. In this article, we design a novel networked ISAC framework to explore the collaboration among multiple users for environmental sensing. Specifically, multiple users can serve as powerful sensors, capturing back scattered signals from a target at various angles to facilitate reliable computational imaging. Centralized sensing approaches are extremely sensitive to the capability of the leader node because it requires the leader node to process the signals sent by all the users. To this end, we propose a two-step distributed cooperative sensing algorithm that allows low-dimensional intermediate estimate exchange among the neighboring users, thus eliminating the reliance on the centralized leader node and improving the robustness of sensing. This way, multiple users can cooperatively sense a target by exploiting the block-wise environment sparsity and the interference cancelation technique. Furthermore, we analyse the mean-square error of the proposed distributed algorithm as a networked sensing performance metric and propose a beamforming design for the proposed network ISAC scheme to maximize the networked sensing accuracy and communication performance subject to a transmit power constraint. Simulation results validate the effectiveness of the proposed algorithm compared with the state-of-the-art algorithms.
14 February 2022 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Evolving networks have always been studied a lot featuring the dynamic properties of real-life networks. Studying the mechanism of the growth and death of a network is of great significance to network modeling. Identical to many models focused on the growing process, in this article, we study the decreasing process thoroughly. A novel evolving network model considering the growing and decreasing process is established based on the queueing system. Focused on the degreasing process, we originally investigate two strategies of vertex deleting that are the brutal strategy and the heritable strategy which characterizes the heritable behavior of ``dying'' vertices in real networks. On the basis of our model, stochastic properties of the proposed network are analyzed, e.g., the distribution and the expectation of the stationary scale of the network are theoretically obtained. In addition to that, degree distributions with different strategies are demonstrated in simulations, which manifests the power-low distribution. The reliability of the network is also studied by different attacks, sharing the same characteristic with the scale-free network.
1 June 2020 in IEEE Transactions on Circuits and Systems I: Regular Papers
Recently there were research works on multi-task estimation. However, there exists an issue that nodes may suffer from malicious attacks when sending data in the adversarial multi-task network environment. To address this issue, we propose a secure distributed information sharing algorithm based on attack detection. In our work, via determining an adaptive threshold, a distributed detection algorithm based on the correlation between tasks and a safe multi-task diffusion least mean square (SM-DLMS) algorithm are proposed, which not only reduce communication costs but also effectively decrease the impact of attacks. We also theoretically analyze the stability performance of the proposed SM-DLMS algorithm. Meanwhile, the robustness and effectiveness of the proposed algorithm under network-attacks are illustrated through numerical simulations.