Currently, the Internet of Things (IoT) solutions are playing an important role in numerous areas, especially in smart homes and buildings, health-care, vehicles, and energy. It will continue to expand in various fields in the future. However, some issues limit the further development of IoT technologies. First, the battery-powered feature increases the maintenance cost of replacing batteries for IoT devices. Second, existing Cloud-IoT frameworks are not able to cope with emerging delay-constrained applications in the IoT system due to its centralized mode of operation and the considerable communication delay. Existing studies neither satisfy the demand for the quick response in time-constraint IoT applications nor fundamentally solving the problem of energy sustainability. Therefore, this paper studies the problem of energy sustainability and timeliness in IoT system. Based on Energy Harvesting Technologies (EHT), the Green and Sustainable Mobile Edge Computing (GS-MEC) framework is proposed to make IoT devices self-powered by utilizing the green energy in the IoT environment. In this framework, we formulate the problem of minimizing response time and packet losses of tasks under the limitation of energy queue stability to improve the timeliness and reliability of task processing. Additionally, the dynamic parallel computing offloading and energy management (DPCOEM) algorithm is designed to solve the problem based on the Lyapunov optimization technology. Finally, theoretical analysis demonstrates the effectiveness of the proposed algorithm, and the numerical result of simulation shows that the average performance of the proposed algorithm is an order of magnitude better than state-of-the-art algorithms.
6 June 2019 in IEEE Transactions on Services Computing
Spatial crowdsourcing (SC) is a location-based outsourcing service whereby SC-server allocates tasks to workers with mobile devices according to the locations outsourced by requesters and workers. Since location information contains individual privacy, the locations should be protected before being submitted to untrusted SC-server. However, the encryption schemes limit data availability, and existing differential privacy (DP) methods do not protect the tasks' location privacy. In this paper, we propose a differential privacy-based location protection (DPLP) scheme, which protects the location privacy of both workers and tasks, and achieves task allocation with high data utility. Specifically, DPLP splits the exact locations of both workers and tasks into noisy multi-level grids by using adaptive three-level grid decomposition (ATGD) algorithm and DP-based adaptive complete pyramid grid (DPACPG) algorithm, respectively, thereby considering the grid granularity and location privacy. Furthermore, DPLP adopts an optimal greedy algorithm to calculate a geocast region around the task grid, which achieves the trade-off between acceptance rate and system overhead. Detailed privacy analysis demonstrates that our DPLP scheme satisfies ε-differential privacy. The extensive analysis and experiments over two real-world datasets confirm high efficiency and data utility of our scheme.
The smart city is increasingly gaining worldwide attention. It has the potential to improve the quality of life in convenience, at work, and in safety, among many others utilizations. Nevertheless, some of the emerging applications in smart city are computation-intensive and time-sensitive, such as real-time vision processing applications used for public safety and the virtual reality classroom application. Both of them are hard to handle due to the quick turnaround requirements of ultra-short time and large amounts of computation that are necessary. Fortunately, the abundant resource of Internet of Vehicles (IoV) can help to address this issue and improve the development of the smart city. In this paper, we focus on the problem that how to schedule tasks for these computation-intensive and time-sensitive smart city applications with the assistance of IoV based on multi-server mobile edge computing (MEC). Task scheduling is a critical issue due to the limited computational power, storage, and energy of mobile devices. To handle tasks from the aforementioned applications in the shortest time, this paper introduces a cooperative strategy for IoV and formulates an optimization problem to minimize the completion time with a specified cost. Furthermore, we develop four evolving variants based on the alternating direction method of multipliers (ADMM) algorithm to solve the proposed problem: variable splitting (VS)-ADMM, Gauss-Seidel (GS)- ADMM, distributed Jacobi (DJ)-ADMM, and distributed improved Jacobi (DIJ)-ADMM algorithms. These algorithms incorporate an augmented Lagrangian function into the original objective function and divide the large problem into two sub-problems to iteratively solve each sub-problem. Theoretical analysis and simulation results show that the proposed algorithms have a better performance than the existing algorithms. In addition, the DIJ-ADMM algorithm demonstrates optimal performance, and it converges after approximately 10 iterations and improves the task completion time and offloaded tasks by 89% and 40%, respectively.
16 April 2024 in IEEE Transactions on Mobile Computing
The Space-Air-Ground Integrated Network (SAGIN) plays a pivotal role as a comprehensive foundational network communication infrastructure, presenting opportunities for highly efficient global data transmission. Nonetheless, given SAGIN's unique characteristics as a dynamically heterogeneous network, conventional network optimization methodologies encounter challenges in satisfying the stringent requirements for network latency and stability inherent to data transmission within this network environment. Therefore, this paper proposes the use of differentiated federated reinforcement learning (DFRL) to solve the traffic offloading problem in SAGIN, i.e., using multiple agents to generate differentiated traffic offloading policies. Considering the differentiated characteristics of each region of SAGIN, DFRL models the traffic offloading policy optimization process as the process of solving the Decentralized Partially Observable Markov Decision Process (DEC-POMDP) problem. The paper proposes a novel Differentiated Federated Soft Actor-Critic (DFSAC) algorithm to solve the problem. The DFSAC algorithm takes the network packet delay as the joint reward value and introduces the global trend model as the joint target action-value function of each agent to guide the update of each agent's policy. The simulation results demonstrate that the traffic offloading policy based on the DFSAC algorithm achieves better performance in terms of network throughput, packet loss rate, and packet delay compared to the traditional federated reinforcement learning approach and other baseline approaches.
With the development of cloud storage, more data owners are inclined to outsource their data to cloud services. For privacy concerns, sensitive data should be encrypted before outsourcing. There are various searchable encryption schemes to ensure data availability. However, the existing search schemes pay little attention to the efficiency of data users’ queries, especially for the multi-owner scenario. In this study, we proposed a tree-based ranked multi-keyword search scheme for multiple data owners (TBMSM). Specifically, by considering a large amount of data in the cloud, we utilize the TF×IDF model to develop a multi-keyword search and return the top-k ranked search results. To enable the cloud servers to perform a secure search without knowing any sensitive data (e.g. keywords and trapdoors), we construct a novel privacy-preserving search protocol based on the bilinear mapping. To achieve an efficient search, for each data owner, a tree-based index encrypted with an additive order and privacy-preserving function family is constructed. The cloud server can then merge these indexes effectively, using the “Depth-first Search” algorithm to find the corresponding files. Finally, the rigorous security analysis proves that our scheme is secure, and the performance analysis demonstrates its efficacy and efficiency.
Cloud-based Personal Health Record systems (CB-PHR) have great potential in facilitating the management of individual health records. Security and privacy concerns are among the main obstacles for the wide adoption of CB-PHR systems. In this paper, we consider a multi-source CB-PHR system in which multiple data providers such as hospitals and physicians are authorized by individual data owners to upload their personal health data to an untrusted public cloud. The health data are submitted in an encrypted form to ensure data security, and each data provider also submits encrypted data indexes to enable queries over the encrypted data. We propose a novel Multi-Source Order-Preserving Symmetric Encryption (MOPSE) scheme whereby the cloud can merge the encrypted data indexes from multiple data providers without knowing the index content. MOPSE enables efficient and privacy-preserving query processing in that a data user can submit a single data query the cloud can process over the encrypted data from all related data providers without knowing the query content. We also propose an enhanced scheme, MOPSE+, to more efficiently support the data queries by hierarchical data providers. Extensive analysis and experiments over real datasets demonstrate the efficacy and efficiency of MOPSE and MOPSE+.