3 June 2022 in IEEE Transactions on Parallel and Distributed Systems
Distributed fog computing has received wide attention recently. It enables distributed computing and data management on the network nodes within the close vicinity of IoT devices. An important service of fog-cloud based systems is data deduplication. With the increasing concern of privacy, some privacy-preserving data deduplication schemes have been proposed. However, they cannot support lossless deduplication of encrypted similar data in the fog-cloud network. Meanwhile, no existing design can protect message equality information while resisting brute-force and frequency analysis attacks. In this paper, we propose a privacy-preserving and compression-based data deduplication system under the fog-cloud network, which supports lossless deduplication of similar data in the encrypted domain. Specifically, we first use the generalized deduplication technique and cryptographic primitives to implement secure deduplication over similar data. Then, we devise a two-level deduplication protocol that can perform secure and efficient deduplication at distributed fog nodes and the cloud. The proposed system can not only resist brute-force and frequency analysis attacks but also ensure that only the data operator can capture the message equality information. We formally analyze the security of our design. Performance evaluations demonstrate that our proposed design is efficient in computing, storage, and communication.
31 March 2021 in IEEE Internet of Things Journal
The Internet of Things (IoT) can connect intelligent agents, sensors, and many other different devices that facilitate our daily works and lives. With the help of wireless sensor networks (WSNs), the devices can interact with the environment, which is a significant part in the IoT. Coverage is one of the most challenging issues in WSNs. To utilize mobile sensor nodes to provide periodic coverage, a new type of coverage, named sweep coverage, has been proposed and it attracts a lot of attention. To improve data availability in sweep coverage, we introduce the concept of $k$ -coverage in conventional coverage to sweep coverage and propose $t, K$ -sweep coverage problem in this article, where $t$ is the sweep period constraint to finish the whole coverage process and $K$ is the set of coverage time requirements. To achieve $t, K$ -sweep coverage with the minimum number of mobile sensor nodes, we propose an algorithm named 2-partition sweep coverage (2-PSC) based on a partition of the coverage time requirements and positions. Simulation results indicate that our proposed algorithm outperforms the existing algorithms in terms of the number of required mobile sensor nodes.
13 January 2021 in IEEE Internet of Things Journal
With the rapid development and widespread application of crowdsourcing, the limitations of traditional systems are gradually exposed. First, traditional systems fail to protect the privacy of task requesters and workers. They typically rely on a centralized server to aggregate the task content and workers' interests, while these data contain sensitive information. Second, crowdsourcing resources in each system are isolated. The tasks in one system cannot reach potential workers in other systems. Thus, there is a great need to build a new privacy-preserving and federated crowdsourcing system. However, the existing privacy-preserving solutions rely on a trusted third party to perform key management, which is not applicable in a federated setting. To this end, we propose the first proxy-free privacy-preserving and federated crowdsourcing system. It interconnects the existing crowdsourcing systems and can perform encrypted task matching across various systems without relying on a trusted third-party authority. Our main idea is to achieve federated crowdsourcing by moving secure task matching to the trusted smart contract. To get rid of the dependence on the trusted authority, we combine the rewritable deterministic hashing technique with searchable encryption schemes to achieve secure on-chain task-matching authorization. Moreover, we utilize the puncturable encryption technique to implement secure authorization revocation. We formally analyze the security of our design and implement a prototype on Ethereum. Evaluation results demonstrate that our design is secure and efficient for blockchain-based crowdsourcing.
15 December 2020 in IEEE Transactions on Cloud Computing
Mobile edge computing (MEC) can significantly reduce latency by pushing resources away from remote clouds to distributed base stations (BSs) equipped with MEC servers, which are closer to users and deployed by service providers (SPs) at the edge of cellular networks. To improve user experience and increase their own revenue, SPs tend to use resources in their deployed BSs to provide services instead of using resources in BSs deployed by other SPs. We envision a densely-deployed multi-SP MEC network where a user equipment (UE) is covered by multiple BSs from different SPs. As the resource in BSs and MEC servers is limited, it is a challenging problem for SPs to reasonably allocate resources in the edge computing (EC) layer to improve the quality of service. In this paper, we propose a novel resource allocation scheme, Decentralized Multi-SP Resource Allocation (DMRA), which aims to maximize the total profit of all SPs at the EC layer and provide high-quality services. Then, we extend our design to the online scheme. The algorithm Decentralized Multi-SP Online Resource Allocation (DMORA) is proposed to fit the dynamic network environment. Simulation results indicate that our proposed schemes can effectively maximize the total profit of all SPs at the EC layer while improving user experience.
15 June 2017 in IEEE Transactions on Cloud Computing
Energy saving is critical for the cloud radio access networks (C-RANs), which are composed by massive radio access units (RAUs) and energy-intensive computing units (CUs) that host numerous virtual machines (VMs). We attempt to minimize the energy consumption of C-RANs, by leveraging the RAU sleep scheduling and VM consolidation strategies. We formulate the energy saving problem in C-RANs as a joint resource provisioning (JRP) problem of the RAUs and CUs. Since the active RAU selection is coupled with the VM consolidation, the JRP problem shares some similarities with a special bin-packing problem. In this problem, the number of items and the sizes of items are correlated and are both adjustable. No existing method can be used to solve this problem directly. Therefore, we propose an efficient low-complexity algorithm along with a context-aware strategy to dynamically select active RAUs and consolidate VMs to CUs. In this way, we can significantly reduce the energy consumption of C-RANs, while do not incur too much overhead due to VM migrations. Our proposed scheme is practical for a large-size network, and its effectiveness is demonstrated by the simulation results.
1 April 2021 in Theoretical Computer Science