As a popular service management system, the spatial crowdsourcing (SC) server is responsible for allocating nearby workers to perform tasks based on outsourced locations. However, protecting the sensitive information contained in these outsourced locations is crucial. Traditional differential privacy (DP) methods suffer from two limitations: 1) they usually rely on a trusted third party, failing to protect both worker and task location privacy simultaneously, thus risking privacy breaches; 2) they ignore the personalized privacy demands of different users. In this paper, we propose a personalized local DP-based location obfuscation (PLDPLO) scheme, thereby providing personalized privacy-preserving both worker and task locations locally while allocating high-quality tasks. To achieve this, we introduce a personalized location indistinguishability (PLI) model, a new personalized Laplace mechanism achieving local DP, to jointly provide the protection of worker locations and different privacy levels for different workers. To address task privacy, we present a spatial mapping indistinguishability (SMI) algorithm to obfuscate task locations based on a random response mechanism, thereby ensuring data utility. Additionally, we propose a Zipf-Poisson model-based task allocation graph (ZPTAG) algorithm to perform one-task-multiple-workers allocation and achieve a high competitive ratio, which reduces the move distance of workers. Our PLDPLO scheme guarantees ϵ-LDP. Extensive experiments over real datasets demonstrate that our scheme achieves over 89% data utility for task allocation and outperforms state-of-the-art methods while providing personalized privacy levels.

Federated Digital Twin (FDT) services are crucial for enabling collaborative perception and decision-making in ITSs, such as coordinated traffic signal control, multi-vehicle path planning, and real-time congestion management. However, their practical deployment still encounters significant challenges, including dependence on centralized orchestration and poor adaptability to dynamic and resource-constrained edge environments. To address these challenges, we formulate an offloading problem across heterogeneous edge nodes and propose FRA-GETS, a Fractal Generative Task Scheduling method optimized for dynamic ITS scenarios. FRA-GETS recursively decomposes complex tasks into self-similar sub-tasks, enabling localized execution and dynamic, anomaly-driven rescheduling, thereby alleviating reliance on centralized computation and enhancing responsiveness to environmental variations. Experimental results show that FRA-GETS reduces average task delay by up to 9% compared with baseline methods, while effectively improving weighted latency for high-priority tasks and maintaining stable resource utilization.

The intelligent reflecting surface (IRS) and unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system is widely used in temporary and emergency scenarios. Our goal is to minimize the energy consumption of the MEC system by jointly optimizing UAV locations, IRS phase shift, task offloading, and resource allocation with a variable number of UAVs. To this end, we propose a flexible resource scheduling (FRES) framework by employing a novel deep progressive reinforcement learning that includes the following innovations. First, a novel multitask agent is presented to deal with the mixed integer nonlinear programming (MINLP) problem. The multitask agent has two output heads designed for different tasks, in which a classified head is employed to make offloading decisions with integer variables while a fitting head is applied to solve resource allocation with continuous variables. Second, a progressive scheduler is introduced to adapt the agent to the varying number of UAVs by progressively adjusting a part of neurons in the agent. This structure can naturally accumulate experiences and be immune to catastrophic forgetting. Finally, a light taboo search (LTS) is introduced to enhance the global search of the FRES. The numerical results demonstrate the superiority of the FRES framework, which can make real-time and optimal resource scheduling even in dynamic MEC systems.

Human-machine interaction has sparked significant interest, leading to the rise of Channel State Information (CSI)-based gesture recognition systems. However, these systems often struggle with accuracy due to high noise levels and limited cross-domain performance. This paper presents a robust approach that enhances CSI-based gesture recognition by addressing these challenges. We introduce key concepts such as the CSI ratio and phase matrix and develop a robust data preprocessing method that reduces environmental noise while retaining dynamic components crucial for gesture recognition. Our method, WiMT, leverages a robust multi-features fusion transformer with spatiotemporal partitioning and a multiscale spatiotemporal self-attention mechanism to effectively capture both local spatial and global temporal features of gestures. Evaluations on the Widar3 dataset demonstrate that our model surpasses existing methods in in-domain and cross-domain gesture recognition tasks.

A part of off-the-shelf wireless communication chips can only provide very coarse-grained information of the distance range between the transmitter and receiver. Exploiting such chips for precise wireless indoor positioning (WIP) becomes very valuable since their costs are comparatively low. For the WIP systems built on the coarse-grained communication chips, this article discusses the optimal anchor node deployment problem for fingerprint localization. The problem is very challenging since it implies three particularly important requirements of adaptive localization precision, unique fingerprint, and a minimum number of anchor nodes. To minimize the required number of anchor nodes while satisfying the three requirements, we propose two anchor node deployment algorithms, namely, ANDAs and WANDA, both of which are developed for mediate and large-area deployment, respectively. We first prove the effectiveness of the chip in maintaining robust fingerprints and formulate the deployment optimization problem as a minimum attribute reduction problem. Then, to deal with the high computational complexity involved, ANDA is proposed by significantly reducing the search space of the optimization problem. To practically address the combination explosion problem for large-area deployment, the idea of area partitioning is adopted. Investigating anchor nodes at different grid vertices in subareas that may have different sharing degrees, WANDA is proposed to achieve an overall anchor node deployment optimization. Simulation and experimental results demonstrate the validity and the superiority of ANDA and WANDA over counterparts. For large-area deployment, compared to ANDA, WANDA can further decrease the total amount of anchor nodes by 17%.

With the increasing wide applications of wearable wireless networks, body-to-body networks (BBNs) have become significantly important to provide timely and reliable data delivery services. For a specific BBN, assessing its theoretically achievable Quality of Service (QoS) is necessary, especially on the key performance metrics of end-to-end delay distribution and packet loss ratio. The existing analysis models in the literature mainly focused on 1-D space scenarios. In this article, BBN in a 2-D area is considered, where mobile nodes freely and stochastically move along lanes. By introducing two new definitions: 1) node entrance probability and 2) network entrance probability, a systematically analytical framework for end-to-end delay distribution and packet loss ratio is presented. The proposed analytical framework is built on three critical techniques: 1) the Markov chain to model node behaviors; 2) the first passage theory to calculate node entrance probability and network entrance probability; and 3) the central limit theory to decrease the computation time for summing up per-hop delay. Simulation results demonstrate the effectiveness and accuracy of our proposed analysis model.

The development of smart cities and deep learning technology is changing our physical world to a cyber world. As one of the main applications, the Internet of Vehicles has been developing rapidly. However, privacy leakage and delay problem for data collection remain as the key concerns behind the fast development of the cyber intelligence technologies. If the original data collected are directly uploaded to the cloud for processing, it will bring huge load pressure and delay to the network communication. Moreover, during this process, it will lead to the leakage of data privacy. To this end, in this article we design a data collection and preprocessing scheme based on deep learning, which adopts the semisupervised learning algorithm of data augmentation and label guessing. Data filtering is performed at the edge layer, and a large amount of similar data and irrelevant data are cleared. If the edge device cannot process some complex data independently, it will send the processed and reliable data to the cloud for further processing, which maximizes the protection of user privacy. Our method significantly reduces the amount of data uploaded to the cloud, and meanwhile protects the user's data privacy effectively.