3 February 2021 in IEEE Access
Federated Learning (FL) has recently attracted considerable attention in internet of things, due to its capability of enabling mobile clients to collaboratively learn a global prediction model without sharing their privacy-sensitive data to the server. Despite its great potential, a main challenge of FL is that the training data are usually non-Independent, Identically Distributed (non-IID) on the clients, which may bring the biases in the model training and cause possible accuracy degradation. To address this issue, this paper aims to propose a novel FL algorithm to alleviate the accuracy degradation caused by non-IID data at clients. Firstly, we observe that the clients with different degrees of non-IID data present heterogeneous weight divergence with the clients owning IID data. Inspired by this, we utilize weight divergence to recognize the non-IID degrees of clients. Then, we propose an efficient FL algorithm, named CSFedAvg, in which the clients with lower degree of non-IID data will be chosen to train the models with higher frequency. Finally, we conduct simulations using publicly-available datasets to train deep neural networks. Simulation results show that the proposed FL algorithm improves the training performance compared with existing FL protocol.
14 February 2020 in IEEE Transactions on Mobile Computing
Providing appropriate monetary rewards is an efficient way for mobile crowdsensing to motivate the participation of task participants. However, a monetary incentive mechanism is generally challenging to prevent malicious task participants and a dishonest task requester. Moreover, prior quality-aware incentive schemes are usually failed to preserve the privacy of task participants. Meanwhile, most existing privacy-preserving incentive schemes ignore the data quality of task participants. To tackle these issues, we propose a privacy-preserving and data quality-aware incentive scheme, called PACE. In particular, data quality consists of the reliability and deviation of data. Specifically, we first propose a zero-knowledge model of data reliability estimation that can protect data privacy while assessing data reliability. Then, we quantify the data quality based on the deviation between reliable data and the ground truth. Finally, we distribute monetary rewards to task participants according to their data quality. To demonstrate the effectiveness and efficiency of PACE, we evaluate it in a real-world dataset. The evaluation and analysis results show that PACE can prevent malicious behaviors of task participants and a task requester, and achieves both privacy-preserving and data quality measurement of task participants.
30 December 2019 in IEEE Transactions on Mobile Computing
8 November 2021 in IEEE Internet of Things Journal
There have been many studies focusing on edge server deployment and service placement in mobile-edge computing (MEC), respectively, but rare works took both of them into consideration. However, edge server deployment and service placement are coupling issues in practice, where the former affects the latter. Besides, the economic benefit of the MEC platform is also a consideration. Due to different service request rates and prices, appropriate service placement solutions are needed to increase the overall profit. In this article, we propose a complete process combining edge server and service placement, where service placement explicitly takes into account the structure of current edge server placement and different service request rates and prices. We design a joint edge server deployment and service placement model with the goal of maximizing the overall profit of all edge servers under the constraints of the number of edge servers, the relationship among edge servers and base stations, the storage capacity, and the computing capacity of each edge server. We propose a two-step method including the clustering algorithm and nonlinear programming to solve the formulated problem. Extensive evaluations based on the real-world data set demonstrate that the proposed algorithm outperforms the baseline methods.
2 October 2019 in IEEE Transactions on Computational Social Systems
Online social networks (OSNs) are becoming more and more prevalent in people's life, but they face the problem of privacy leakage due to the centralized data management mechanism. The emergence of distributed OSNs (DOSNs) can solve this privacy issue, yet they bring inefficiencies in providing the main functionalities, such as access control and data availability. In this article, in view of the above-mentioned challenges encountered in OSNs and DOSNs, we exploit the emerging blockchain technique to design a new DOSN framework that integrates the advantages of both traditional centralized OSNs and DOSNs. By combining smart contracts, we use the blockchain as a trusted server to provide central control services. Meanwhile, we separate the storage services so that users have complete control over their data. In the experiment, we use real-world data sets to verify the effectiveness of the proposed framework.
23 May 2017 in IEEE Transactions on Intelligent Transportation Systems
Many trajectory-based applications require an essential step of mapping raw GPS trajectories onto the digital road network accurately. This task, commonly referred to as map matching, is challenging due to the measurement error of GPS devices in critical environment and the sampling error caused by long sampling intervals. Traditional algorithms focus on either a local or a global perspective to deal with the problem. To further improve the performance, this paper develops a novel map matching model that considers local geometric/topological information and a global similarity measure simultaneously. To accomplish the optimization goal in this complex model, we adopt an ant colony optimization algorithm that mimics the path finding process of ants transporting food in nature. The algorithm utilizes both local heuristic and global fitness to search the global optimum of the model. Experimental results verify that the proposed algorithm is able to provide accurate map matching results within a relatively short execution time.