Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Lincan Li has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • MPPL: Mean-Based Privacy-Preserving Localization With Linear Complexity for High-Precision Crowdsourcing Systems

    by Shengming Chang, Lincan Li, Dongdong Lv, He Xu

    Accurate localization is fundamental for internet of things (IoT) applications but introduces significant privacy risks in crowdsourcing-based systems. Conventional privacy-preserving techniques suffer from critical limitations: subtraction-based models sacrifice positioning accuracy by discarding measurement equations; cryptographic solutions incur prohibitive computation overhead; while secret-sharing approaches expose target locations. To address these challenges, we propose the mean-based subtraction localization (MSL) model that preserves all measurement equations through global averaging, eliminating information loss while establishing a privacy-conducive mathematical framework. Building on MSL, we develop the mean-based privacy-preserving localization (MPPL) algorithm featuring: 1) matrix decomposition for bidirectional privacy isolation, 2) lightweight secure summation/multiplication primitives, and 3) linear-complexity operations. Rigorous theoretical verification confirms MPPL’s feasibility, correctness, information-theoretic privacy, and efficiency. Experimental results demonstrate 10% – 14% higher accuracy than privacy-preserving multi-lateral localization (PPPL)/efficient privacy-preserving localization (EPPL) under noise while reducing computation time by a factor of 2.8 versus homomorphic encryption schemes, establishing a new paradigm for high-precision privacy-aware localization.

  • Open Access

    A Modified Differential Evolution for Source Localization Using RSS Measurements

    by Yunjie Tao, Lincan Li, Shengming Chang

    In wireless sensor networks, evolutionary algorithms have emerged as pivotal tools for addressing complex localization challenges inherent in non-convex and nonlinear maximum likelihood estimation problems associated with received signal strength (RSS) measurements. While differential evolution (DE) has demonstrated notable efficacy in optimizing multimodal cost functions, conventional implementations often grapple with suboptimal convergence rates and susceptibility to local optima. To overcome these limitations, this paper proposes a novel enhancement of DE by integrating opposition-based learning (OBL) principles. The proposed method introduces an adaptive scaling factor that dynamically balances global exploration and local exploitation during the evolutionary process, coupled with a penalty-augmented cost function to effectively utilize boundary information while eliminating explicit constraint handling. Comparative evaluations against state-of-the-art techniques—including semidefinite programming, linear least squares, and simulated annealing—reveal significant improvements in both convergence speed and positioning precision. Experimental results under diverse noise conditions and network configurations further validate the robustness and superiority of the proposed approach, particularly in scenarios characterized by high environmental uncertainty or sparse anchor node deployments.


  • Open Access

    A Simple and Efficient Method for RSS-AOA-Based Localization with Heterogeneous Anchor Nodes

    by Weizhong Ding, Lincan Li, Shengming Chang

    Accurate and reliable localization is crucial for various wireless communication applications. A multitude of studies have presented accurate localization methods using hybrid received signal strength (RSS) and angle of arrival (AOA) measurements. However, these studies typically assume identical measurement noise distributions for different anchor nodes, which may not accurately reflect real-world scenarios with varying noise distributions. In this paper, we propose a simple and efficient localization method based on hybrid RSS-AOA measurements that accounts for the varying measurement noises of different anchor nodes. We develop a closed-form estimator for the target location employing the linear-weighted least squares (LWLS) algorithm, where the weight of each LWLS equation is the inverse of its residual variance. Due to the unknown variances of LWLS equation residuals, we employ a two-stage LWLS method for estimation. The proposed method is computationally efficient, adaptable to different types of wireless communication systems and environments, and provides more accurate and reliable localization results compared to existing RSS-AOA localization techniques. Additionally, we derive the Cramer–Rao lower bound (CRLB) for the RSS-AOA signal sequences used in the proposed method. Simulation results demonstrate the superiority of the proposed method.


  • Open Access

    A Two-Step SD/SOCP-GTRS Method for Improved RSS-Based Localization in Wireless Sensor Networks

    by Shengming Chang, Lincan Li

    Wireless localization is a fundamental component of modern sensor networks, with applications spanning environmental monitoring and smart cities. Ensuring accurate and efficient localization is critical for enhancing network performance and reliability, particularly in the presence of signal attenuation and noise. This study proposes a novel two-step localization framework, SD/SOCP-GTRS, to improve the precision of target localization using received signal strength (RSS) measurements. In the first step (SD/SOCP), semidefinite programming (SDP) and second-order cone programming (SOCP)-based convex relaxation are applied to the maximum likelihood (ML) estimator, generating an initial coarse estimate. The second step (GTRS) refines this estimate using weighted least squares (WLS) and the generalized trust region subproblem (GTRS), mitigating performance degradation caused by relaxation. Monte Carlo simulations validate that the proposed SD/SOCP-GTRS approach effectively reduces root mean square error (RMSE) compared to other methods. These findings demonstrate that the SD/SOCP-GTRS framework consistently outperforms existing techniques, approaching the theoretical performance limit and offering a robust solution for high-precision localization in wireless sensor networks.


  • Open Access

    A Novel Cooperative Cache Policy for Wireless Networks

    by Lincan Li, Chiew Foong Kwong, Qianyu Liu, Pushpendu Kar, Saeid Pourroostaei Ardakani

    Mobile edge caching is an emerging approach to manage high mobile data traffic in fifth‐generation wireless networks that reduces content access latency and offloading data traffic of backhaul links. This paper proposes a novel cooperative caching policy based on long short‐term memory (LSTM) neural networks considering the characteristics between the features of the heterogeneous layers and the user moving speed. Specifically, LSTM is applied to predict content popularity. Size‐weighted content popularity is utilised to balance the impact of the predicted content popularity and content size. We also consider the moving speeds of mobile users and introduce a two‐level caching architecture consisting of several small base stations (SBSs) and macro base stations (MBSs). To avoid content requests of fast‐moving users affecting the content popularity distribution of the SBS since fast‐moving users frequently handover among SBSs, fast‐moving users are served by MBSs no matter which SBS they are in. SBSs serve low‐speed users, and SBSs in the same cluster can communicate with one another. The simulation results show that compared to common cache methods, for example, the least frequently used and least recently used methods, our proposed policy is at least 8.9% lower and 6.8% higher in terms of the average content access latency and offloading ratio, respectively.