22 February 2024 in IEEE Internet of Things Journal
Due to the swift advancement of edge computing and mobile crowdsensing (MCS), edge-assisted MCS (EAMCS) has emerged as a promising paradigm, leveraging sensor-embedded mobile devices for the collection and sharing of environmental data. As the sensing scale increases in the modern urban, the application scenario becomes more and more complex, and the budget of users and platform is limited. Therefore, it is indispensable to study the effective task allocation mechanism with considering the multiple budget constraints in the EAMCS system. However, a majority of the existing studies unilaterally focus on either the users’ time budget or the platform’s budget, disregarding the crucial aspect of the users’ energy budget. In this article, we design a joint user movement, sensing, offloading, and computation framework adopting the computation offloading strategy called binary processing strategy. In addition, the multitask data collection with a limited budget (MDCB) problem considering time, energy, and platform budget in EAMCS is formulated, which is proved to be nondeterministic polynomial-hard. In order to maximize the amount of data collected by the users in the MDCB problem, we first verify the submodularity of the objective function, then propose the global maximum data first search algorithm and task sequence-based genetic algorithm to solve the problem. The extensive experiments are conducted on both synthetic and real-world data sets to demonstrate the effectiveness of our proposed schemes.
23 February 2024 in IEEE Transactions on Mobile Computing
In recent years, wireless rechargeable sensor networks (WRSNs) have gained significant attention in the research community due to the current advancements in wireless power transfer technology. In mobile charger scheduling, previous works primarily emphasized the survival rate of sensor nodes. However, the primary task of a WRSN is to monitor targets in a given area. Therefore, the coverage of targets (CoT) maximization should be the primary objective of mobile charger scheduling. In this paper, we shift the focus to the CoT maximization on-demand charging scheduling problem, and formulate it as a multi-objective optimization problem, aiming to simultaneously enhance the average coverage and energy efficiency. We prove that the problem is NP-hard by reformulating it as a Multiple Travelling Salesman Problem with Deadline. We first propose the multiple chargers scheduling scheme for maximizing coverage of targets called MaxCov, which is designed to optimize the charging scheduling process and improve network performance in terms of coverage. Then, we further propose the multiple chargers scheduling scheme based on requests grouping called MaxCov-RG, which can well balance the trade-off between the performance and computational complexity. Finally, we validate the effectiveness of the proposed schemes via extensive simulations.
6 May 2022 in IEEE Transactions on Computational Social Systems
In recent years, wireless rechargeable sensor networks (WRSNs), as a crucial technology in cyber-physical-social systems (CPSSs), have gradually become a hotspot of research, with the development of wireless energy transmission technology. In previous works, the objective is to maximize the survival rate of sensor nodes. However, in this article, we focus on maintaining more targets. First, it details the charging scheduling problem of maximizing coverage of targets (CoT) in on-demand charging architecture of WRSNs. Also, the problem is formalized as a multiple-objective optimization problem, which aims at maximizing the CoT and the energy efficiency simultaneously. After that, the charging scheduling for maximizing coverage of targets (CSCT) scheme is proposed to achieve the above objectives. Then, the problem is reformulated as a Deadline-TSP problem that is NP-hard. To address this problem, we design an energy predictive model and propose the CSCT with an n-path (n-CSCT) scheme that has an O(|N|ⁿ) computational complexity. In addition, the resurrection of sensor nodes is considered in this article. Thus, the n-CSCT with node resurrection (n-CSCT-R) scheme is proposed for this case. Finally, we validate the effectiveness of the proposed schemes via extensive simulations.
4 April 2024 in IEEE Transactions on Sustainable Computing
Federated learning (FL) is a distributed machine learning paradigm that addresses the challenges of privacy leakage and data silos by collaboratively training the global model through parameter exchange, rather than data, between the central server and local clients. However, recent researches highlight the vulnerability of FL to gradient leakage attacks where adversaries exploit shared parameters from clients to reconstruct sensitive training data. Differential privacy (DP) effectively mitigates this threat by adding noise to shared parameters, yet introduces a trade-off between privacy and accuracy in FL. To better balance the privacy and accuracy, in this paper we propose a staged noise perturbation strategy, called alternating noise permutation (ANP), from a novel perspective. ANP adds Gaussian-distributed random noise to model parameters during the critical learning period of FL, following DP principles. While in non-critical learning period, ANP alternately permutes the noise during odd and even communication rounds, achieving near mutual cancellation and mitigating the negative impact. Experimental results across three datasets and two neural networks under both independent identical distribution (IID) and NonIID scenarios demonstrate that ANP significantly improves classification accuracy and exhibits robustness against gradient leakage attack, ensuring the effectiveness of FL for secure and accurate collaborative model training.
3 July 2023 in IEEE Transactions on Intelligent Transportation Systems
Over the last decade, the Internet of Things (IoT) technology has advanced significantly in a variety of fields. As a pivotal application of IoT, intelligent transportation systems (ITS) have harvested great attention from the research community. Radio frequency identification (RFID) which is an essential technology in IoT plays a key role in ITS to identify tagged vehicles. Unknown tag identification which aims at identifying the existing unknown tags is crucial to monitor the newly entering vehicles in the RFID-assisted intelligent transportation systems. However, the COTS (commercial-off-the-shelf) RFID tags that harvest energy from the reader can not support the hash function in reality, which hinders the widespread deployment of hash-enabled unknown tag identification protocols. To conquer this tough issue, we propose two approaches to efficiently identify unknown COTS RFID tags. We first propose a Single-Point Selective unknown tag identification approach called SPS, where an analog hash pattern using the EPC (Electronic Product Code) segments is deployed to exclusively identify unknown tags. An unknown tag will be identified when it selects a singleton slot to reply. To improve the time efficiency of SPS, we further propose a Multi-Point Selective unknown tag identification approach called MPS. In MPS, two techniques of batch identification and batch division are developed to reduce the number of empty slots and avoid tag collisions, respectively. Then the parameters are theoretically analyzed to maximize the identification efficiency. The effectiveness of the proposed approaches is validated via both the simulations and COTS RFID device based experiments.
1 January 2026 in IEEE Transactions on Vehicular Technology
The development of Artificial Intelligence and Internet of Things has not only paved the way to realize real-time intelligent tasks in vehicular edge computing systems, but also caused a series of problems such as system overload. Task offloading based on edge-terminal cooperation is one of the efficient paradigms to solve these problems. However, the dependency between the subtasks in vehicular intelligent tasks, as well as the resource shortage of terminal vehicles and edge servers, all pose serious challenges to efficient task offloading. In this paper, we investigate the optimization problem of task offloading in vehicular edge computing systems with the consideration of the above challenges, aiming to minimize the system consumption including processing delay and energy consumption, and prove it as a mixed integer nonlinear and NP-hard problem. To address this problem, we construct directed acyclic graphs to represent the complex dependency between the subtasks and utilize pipeline diagrams to calculate the task processing delay. Then, an efficient Dependency-aware and Energy efficient task offloading schedule DESR is proposed, which utilizes a cyclic iterative method to decouple the problem into sub-problems and introduces multi-layer activity on edge networks and the interior point method to jointly optimize offloading Selection and Resource allocation. Extensive simulations are conducted to evaluate the proposed DESR, and the results illustrate its superior performance.