Accurate beam tracking in high-mobility vehicular networks has become a key issue for reliable communication link establishment. Recent work on integrated sensing and communication has shown the superiority of the sensing-assisted beam tracking. By estimating the angular parameters of vehicles based on the radar echoes, the roadside unit (RSU) can perform a so-called predictive beamforming to pair the beams with high accuracy as well as low latency. To further reduce the estimation error due to the nonlinear measurements, in this letter, we develop a deep learning-based approach to exploit the dependency between the angles and the measurements, and to obtain the angle estimates. Simulation results show that our proposed approach can improve the estimation performance and maintain reliable communications in high-mobility vehicular networks.

Recently, federated learning (FL) has become a promising distributed learning technology by collaboratively training shared learning models on clients. However, due to the statistical heterogeneity of clients and differences in computing and communication resources, the convergence speed and accuracy of FL may decrease. The energy consumption and latency performance of clients may also be affected. To achieve a flexible balance between FL's model performance, overall energy consumption, and latency, thereby meeting customized requirements, we propose a deep reinforcement learning based FL framework called FedAEB. It adopts a dynamic optimization method based on the Soft Actor-Critic network for client selection and resource allocation, which can effectively adapt to complex and time-varying systems. The weight factors that balance optimization variables can be flexibly adjusted according to different application needs. Many experiments have been conducted on well-known and state-of-the-art datasets, demonstrating that our FedAEB outperforms the benchmark method in reward values, learning accuracy, energy consumption, and latency performance.

Mobile networks and smart phones have become ubiquitous in our daily life. Large amount of customer related telecom data from various sources are generated every day, from which diversified behavior patterns can be revealed, including some anomalous behaviors that are vicious. It becomes increasingly important to achieve both efficient and effective customer behavior analysis based on the telecom big data. In this paper, the Multi-faceted Telecom Customer Behavior Analysis (MTCBA) framework for anomalous telecom customer behavior detection and clustering analysis is proposed. In this framework, we further design the hierarchical Locality Sensitive Hashing-Local Outlier Factor (hierarchical LSHLOF) scheme for suspicious customer detection, and the Autoencoders with Factorization Machines (FMAE) structure for dimension reduction to achieve more efficient clustering. Hierarchical LSH-LOF is an improved algorithm of LOF, in which we design a hierarchical LSH process that selects the approximate k nearest neighbors from coarse to fine by gradually narrowing down the scope. Experiments show its superiority over KD-tree w.r.t searching speed. FM-AE exploits Factorization Machines for learning second order feature interactions, which we prove to be useful by designing comparative experiments with five dimension reduction algorithms. With the proposed MTCBA framework, efficient and effective telecom customer behavior analysis including anomalous customer behavior detection and clustering analysis is performed on the real world telecom operating data provided by one of the major Internet service providers (ISPs) in China. Meanwhile, interpretable clustering results of six clusters are obtained to provide valuable information for the precision marketing of telecom operators, criminal combating, and social credit system construction.

Extremely Large-scale Array (ELAA) promises to deliver ultra-high data rates with increased antenna elements. However, increasing antenna elements leads to a wider realm of near-field, which challenges the traditional design of codebooks. In this paper, we propose novel near-field codebook schemes based on the fitting formula of codewords’ quantization performance. First, we analyze the quantization performance properties of uniform linear array (ULA) and uniform planar array (UPA) codewords. Our findings reveal an intriguing property: the correlation formula for ULA codewords can be represented by the elliptic formula, while the correlation formula for UPA codewords can be approximated using the ellipsoid formula. Building on this insight, we propose a ULA uniform codebook that maximizes the minimum correlation based on the derived formula. Moreover, we introduce a ULA dislocation codebook to further reduce quantization overhead. Continuing our exploration, we propose UPA uniform and dislocation codebook schemes. Our investigation demonstrates that oversampling in the angular domain offers distinct advantages, achieving heightened accuracy while minimizing overhead in quantifying near-field channels. Numerical results demonstrate the appealing advantages of the proposed codebook over existing methods in decreasing quantization overhead and increasing quantization accuracy.

This paper represents a semi-supervised learning framework, which integrates multi-view learning, extreme learning machine (ELM) and graph-based semi-supervised learning. The aim is to expand the scope of adaptation of non-negative sparse graph (NNSG) framework, under a multi-view condition and a non-linear relationship. The proposed multi-view learning method will be adaptive since when data is single-view the framework will degenerate into an embedded framework for NNSG framework. The proposed ELM method also will be adaptive since the number of hidden layer neuron will change with different number of input and output layer neuron. The combination of both proposed methods outperforms traditional graph-based semisupervised learning, such as flexible manifold embedding (FME) and NNSG framework, which can not establish an affinity matrix for multi-view and can not establish a non-liner model for unknown data. Unlike traditional graph-based semi-supervised learning methods, which only can label propagation and build linear regression models for single or multi-view data, our proposed method has an obvious advantage that is applicable to any single or multi-view data, and builds linear or non-linear models. We provides extensive experiments on four public database in order to evaluate the performance of the proposed method. These experiments demonstrate significant improvement over the state-of-the-art algorithms in label propagation and processing of new data.

In light of the problems of slow convergence speed, insufficient optimization accuracy and easy falling into local optima in the sparrow search algorithm, this paper proposes an adaptive sinusoidal-disturbance-strategy sparrow search algorithm (ASDSSA) and its mathematical equation. Firstly, the initial population quality of the algorithm is improved by fusing cubic chaos mapping and perturbation compensation factors; secondly, the sinusoidal-disturbance-strategy is introduced to update the mathematical equation of the discoverer’s position to improve the information exchange ability of the population and the global search performance of the algorithm; finally, the adaptive Cauchy mutation strategy is used to improve the ability of the algorithm to jump out of the local optimal solutions. Through the optimization experiments on eight benchmark functions and CEC2017 test functions, as well as the Wilcoxon rank-sum test and time complexity analysis, the results show that the improved algorithm has better optimization performance and convergence efficiency. Further, the improved algorithm was applied to optimize the parameters of the long short term memory network (LSTM) model for passenger flow prediction on selected metro passenger flow datasets. The effectiveness and feasibility of the improved algorithm were verified by experiments.