209 results on '"Cheng, Xiuzhen"'
Search Results
2. Plug and Power: Fingerprinting USB Powered Peripherals via Power Side-channel
- Author
-
Spolaor, Riccardo, primary, Liu, Hao, additional, Turrin, Federico, additional, Conti, Mauro, additional, and Cheng, Xiuzhen, additional
- Published
- 2023
- Full Text
- View/download PDF
3. Latency-First Smart Contract: Overclock the Blockchain for a while
- Author
-
Qi, Huayi, primary, Xu, Minghui, additional, Cheng, Xiuzhen, additional, and Lyu, Weifeng, additional
- Published
- 2023
- Full Text
- View/download PDF
4. mmEcho: A mmWave-based Acoustic Eavesdropping Method
- Author
-
Hu, Pengfei, primary, Li, Wenhao, additional, Spolaor, Riccardo, additional, and Cheng, Xiuzhen, additional
- Published
- 2023
- Full Text
- View/download PDF
5. Finer-Grained Engagement in Hypergraphs
- Author
-
Luo, Qi, primary, Yu, Dongxiao, additional, Liu, Yu, additional, Zheng, Yanwei, additional, Cheng, Xiuzhen, additional, and Lin, Xuemin, additional
- Published
- 2023
- Full Text
- View/download PDF
6. Plug and Power: Fingerprinting USB Powered Peripherals via Power Side-channel
- Author
-
Spolaor, Riccardo (author), Liu, Hao (author), Turrin, Federico (author), Conti, M. (author), Cheng, Xiuzhen (author), Spolaor, Riccardo (author), Liu, Hao (author), Turrin, Federico (author), Conti, M. (author), and Cheng, Xiuzhen (author)
- Abstract
The literature and the news regularly report cases of exploiting Universal Serial Bus (USB) devices as attack tools for malware injections and private data exfiltration. To protect against such attacks, security researchers proposed different solutions to verify the identity of a USB device via side-channel information (e.g., timing or electromagnetic emission). However, such solutions often make strong assumptions on the measurement (e.g., electromagnetic interference-free area around the device), on a device’s state (e.g., only at the boot or during specific actions), or are limited to one particular type of USB device (e.g., flash drive or input devices).In this paper, we present PowerID, a novel method to fingerprint USB peripherals based on their power consumption. PowerID analyzes the power traces from a peripheral to infer its identity and properties. We evaluate the effectiveness of our method on an extensive power trace dataset collected from 82 USB peripherals, including 35 models and 8 types. Our experimental results show that PowerID accurately recognizes a peripheral type, model, activity, and identity., Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public., Cyber Security
- Published
- 2023
- Full Text
- View/download PDF
7. zk-PCN: A Privacy-Preserving Payment Channel Network Using zk-SNARKs
- Author
-
Yu, Wenxuan, primary, Xu, Minghui, additional, Yu, Dongxiao, additional, Cheng, Xiuzhen, additional, Hu, Qin, additional, and Xiong, Zehui, additional
- Published
- 2022
- Full Text
- View/download PDF
8. Curb: Trusted and Scalable Software-Defined Network Control Plane for Edge Computing
- Author
-
Xu, Minghui, primary, Wang, Chenxu, additional, Zou, Yifei, additional, Yu, Dongxiao, additional, Cheng, Xiuzhen, additional, and Lyu, Weifeng, additional
- Published
- 2022
- Full Text
- View/download PDF
9. PPAR: A Privacy-Preserving Adaptive Ranking Algorithm for Multi-Armed-Bandit Crowdsourcing
- Author
-
Chen, Shuzhen, primary, Yu, Dongxiao, additional, Li, Feng, additional, Zou, Zongrui, additional, Liang, Weifa, additional, and Cheng, Xiuzhen, additional
- Published
- 2022
- Full Text
- View/download PDF
10. MILLIEAR: Millimeter-wave Acoustic Eavesdropping with Unconstrained Vocabulary
- Author
-
Hu, Pengfei, primary, Ma, Yifan, additional, Santhalingam, Panneer Selvam, additional, Pathak, Parth H, additional, and Cheng, Xiuzhen, additional
- Published
- 2022
- Full Text
- View/download PDF
11. AccEar: Accelerometer Acoustic Eavesdropping with Unconstrained Vocabulary
- Author
-
Hu, Pengfei, primary, Zhuang, Hui, additional, Santhalingam, Panneer Selvam, additional, Spolaor, Riccardo, additional, Pathak, Parth, additional, Zhang, Guoming, additional, and Cheng, Xiuzhen, additional
- Published
- 2022
- Full Text
- View/download PDF
12. Malice-Aware Transaction Forwarding in Payment Channel Networks
- Author
-
Qin, Yi, primary, Hu, Qin, additional, Yu, Dongxiao, additional, and Cheng, Xiuzhen, additional
- Published
- 2021
- Full Text
- View/download PDF
13. Extending On-Chain Trust to Off-Chain – Trustworthy Blockchain Data Collection Using Trusted Execution Environment (TEE).
- Author
-
Liu, Chunchi, Guo, Hechuan, Xu, Minghui, Wang, Shengling, Yu, Dongxiao, Yu, Jiguo, and Cheng, Xiuzhen
- Subjects
TRUST ,VACCINATION status ,BLOCKCHAINS ,MICROCONTROLLERS - Abstract
Blockchain creates a secure environment on top of strict cryptographic assumptions and rigorous security proofs. It permits on-chain interactions to achieve trustworthy properties such as traceability, transparency, and accountability. However, current blockchain trustworthiness is only confined to on-chain, creating a “trust gap” to the physical, off-chain environment. This is due to the lack of a scheme that can truthfully reflect the physical world in a real-time and consistent manner. Such an absence hinders further blockchain applications in the physical world, especially for the security-sensitive ones. In this paper, we propose a framework to extend blockchain trust from on-chain to off-chain, and take trustworthy vaccine tracing as an example scheme. Our scheme consists of 1) a Trusted Execution Environment (TEE)-enabled trusted environment monitoring system built with the Arm Cortex-M33 microcontroller that continuously senses the inside of a vaccine box through trusted sensors and generates anti-forgery data; and 2) a consistency protocol to upload the environment status data from the TEE system to blockchain in a truthful, real-time consistent, continuous and fault-tolerant fashion. Our security analysis indicates that no adversary can tamper with the vaccine in any way without being captured. We carry out an experiment to record the internal status of a vaccine shipping box during transportation, and the results indicate that the proposed system incurs an average latency of 84 ms in local sensing and processing followed by an average latency of 130 ms to have the sensed data transmitted to and been available in the blockchain. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
14. CloudChain: A Cloud Blockchain Using Shared Memory Consensus and RDMA.
- Author
-
Xu, Minghui, Liu, Shuo, Yu, Dongxiao, Cheng, Xiuzhen, Guo, Shaoyong, and Yu, Jiguo
- Subjects
MEMORY ,BLOCKCHAINS ,CLOUD computing ,GOVERNMENT agencies ,ALGORITHMS - Abstract
Blockchain technologies can enable secure computing environments among mistrusting parties. Permissioned blockchains are particularly enlightened by companies, enterprises, and government agencies due to their efficiency, customizability, and governance-friendly features. Obviously, seamlessly fusing blockchain and cloud computing can significantly benefit permissioned blockchains; nevertheless, most blockchains implemented on clouds are originally designed for loosely-coupled networks where nodes communicate asynchronously, failing to take advantages of the closely-coupled nature of cloud servers. In this paper, we propose an innovative cloud-oriented blockchain – CloudChain, which is a modularized three-layer system composed of the network layer, consensus layer, and blockchain layer. CloudChain is based on a shared-memory model where nodes communicate synchronously by direct memory accesses. We realize the shared-memory model with the Remote Direct Memory Access technology, based on which we propose a shared-memory consensus algorithm to ensure presistence and liveness, the two crucial blockchain security properties countering Byzantine nodes. We also implement a CloudChain prototype based on a RoCEv2-based testbed to experimentally validate our design, and the results verify the feasibility and efficiency of CloudChain. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
15. Harnessing Context for Budget-Limited Crowdsensing With Massive Uncertain Workers.
- Author
-
Li, Feng, Zhao, Jichao, Yu, Dongxiao, Cheng, Xiuzhen, and Lv, Weifeng
- Subjects
CROWDSENSING ,SMART devices ,BUDGET ,KNOWLEDGE workers - Abstract
Crowdsensing is an emerging paradigm of ubiquitous sensing, through which a crowd of workers are recruited to perform sensing tasks collaboratively. Although it has stimulated many applications, an open fundamental problem is how to select among a massive number of workers to perform a given sensing task under a limited budget. Nevertheless, due to the proliferation of smart devices equipped with various sensors, it is very difficult to profile the workers in terms of sensing ability. Although the uncertainties of the workers can be addressed by conventional Combinatorial Multi-Armed Bandit (CMAB) framework through a trade-off between exploration and exploitation, we do not have sufficient allowance to directly explore and exploit the workers under the limited budget. Furthermore, since the sensor devices usually have quite limited resources, the workers may have bounded capabilities to perform the sensing task only few times, which further restricts our opportunities to learn the uncertainty. To address the above issues, we propose a Context-Aware Worker Selection (CAWS) algorithm in this paper. By leveraging the correlation between the context information of the workers and their sensing abilities, CAWS aims at maximizing the expected cumulative sensing revenue efficiently with both budget constraint and capacity constraints respected, even when the number of the uncertain workers is massive. The efficacy of CAWS can be verified by rigorous theoretical analysis and extensive experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
16. Proactive Deployment of Chain-based VNF Backup at the Edge using Online Bandit Learning
- Author
-
Wang, Chen, primary, Hu, Qin, additional, Yu, Dongxiao, additional, and Cheng, Xiuzhen, additional
- Published
- 2021
- Full Text
- View/download PDF
17. Decentralized Wireless Federated Learning With Differential Privacy.
- Author
-
Chen, Shuzhen, Yu, Dongxiao, Zou, Yifei, Yu, Jiguo, and Cheng, Xiuzhen
- Abstract
This article studies decentralized federated learning algorithms in wireless IoT networks. The traditional parameter server architecture for federated learning faces some problems such as low fault tolerance, large communication overhead and inaccessibility of private data. To solve these problems, we propose a decentralized wireless federated learning algorithm called DWFL. The algorithm works in a system where the workers are organized in a peer-to-peer and server-less manner, and the workers exchange their privacy preserving data with the analog transmission scheme over wireless channels in parallel. With rigorous analysis, we show that DWFL satisfies $(\epsilon,\delta)$ -differential privacy and the privacy budget per worker scales as $\mathcal {O}(\frac{1}{\sqrt{N}})$ , in contrast with the constant budget in the orthogonal transmission approach. Furthermore, DWFL converges at the same rate of $\mathcal {O}(\sqrt{\frac{1}{TN}})$ as the best known centralized algorithm with a central parameter server. Extensive experiments demonstrate that our algorithm DWFL also performs well in real settings. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
18. A Misreport- and Collusion-Proof Crowdsourcing Mechanism Without Quality Verification.
- Author
-
Li, Kun, Wang, Shengling, Cheng, Xiuzhen, and Hu, Qin
- Subjects
CROWDSOURCING ,STRATEGIC planning ,PROFESSIONAL employees ,QUALITY control ,TECHNOLOGICAL innovations - Abstract
Quality control plays a critical role in crowdsourcing. The state-of-the-art work is not suitable for crowdsourcing applications that require extensive validation of the tasks quality, since it is a long haul for the requestor to verify task quality or select professional workers in a one-by-one mode. In this paper, we propose a misreport- and collusion-proof crowdsourcing mechanism, guiding workers to truthfully report the quality of submitted tasks without collusion by designing a mechanism, so that workers have to act the way the requestor would like. In detail, the mechanism proposed by the requester makes no room for the workers to obtain profit through quality misreport and collusion, and thus, the quality can be controlled without any verification. Extensive simulation results verify the effectiveness of the proposed mechanism. Finally, the importance and originality of our work lie in that it reveals some interesting and even counterintuitive findings: 1) a high-quality worker may pretend to be a low-quality one; 2) the rise of task quality from high-quality workers may not result in the increased utility of the requestor; 3) the utility of the requestor may not get improved with the increasing number of workers. These findings can boost forward looking and strategic planning solutions for crowdsourcing. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
19. Hypercore Maintenance in Dynamic Hypergraphs
- Author
-
Luo, Qi, primary, Yu, Dongxiao, additional, Cai, Zhipeng, additional, Lin, Xuemin, additional, and Cheng, Xiuzhen, additional
- Published
- 2021
- Full Text
- View/download PDF
20. Fault-Tolerant Consensus with NOMA in Mobile Networks.
- Author
-
Zou, Yifei, Xu, Minghui, Yu, Jiguo, Zhao, Feng, and Cheng, Xiuzhen
- Abstract
As a traditional research topic, consensus is one of the foundational building blocks in distributed systems and networks, by which all agents can reach an agreement in the judgments, opinions, and actions for some events. In this article, we study the fault-tolerant consensus problem in mobile networks, considering that the faults and mobility of agents are common and nearly ineluctable in mobile networks. Specifically, a distributed algorithm is proposed to achieve the fault-tolerant consensus in mobile networks with Byzantine faults. When designing our algorithm, the NOMA technique in 5G is adopted to facilitate the transmissions between agents, which makes our algorithm efficient in runtime. Both the theoretical analysis and extensive simulation are included in this article to evaluate the performance of our algorithm. By designing an algorithm such as the one in this article, we not only want to show an efficient solution for the fault-tolerant consensus problem, but also hope to shed light on how to design resilient algorithms in mobile networks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
21. Low-Power and Low-Delay WLAN Using Wake-Up Receivers.
- Author
-
Blobel, Johannes, Menne, Florian, Yu, Dongxiao, Cheng, Xiuzhen, and Dressler, Falko
- Subjects
WIRELESS LANs ,ENERGY consumption ,IEEE 802.11 (Standard) ,SENSOR networks ,TELECOMMUNICATION ,DELAY lines - Abstract
Energy-efficient communication technologies are a key enabler for many IoT applications. Many existing communication protocols are based on duty-cycling techniques, that have an inherent tradeoff between delay and energy consumption. In the field of sensor networks, wake-up receivers have been investigated to overcome these problems and to further reduce energy consumption. We now go one step further and investigate the use of wake-up receivers in combination with IEEE 802.11 WLAN. We extend the protocol used to communicate between the access point and the client to introduce a wake-up signal. This can be implemented in a way that is fully compatible with existing wireless LAN (WLAN) standards, thus, it can be deployed gradually with little effort and no need to change existing systems. As a proof of concept and to perform first lab experiments, we developed a hardware prototype using a selective wake-up receiver and off-the-shelf USB-WLAN dongles. All experimental results are verified using an analytical model and a detailed simulation study. We show that our wake-up WLAN can provide connectivity for low-power devices with low delays and low energy consumption at the same time. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
22. A Reinforcement Learning Approach for Branch Overload Relief in Power Systems
- Author
-
Kamel, Mariana, primary, Wang, Yawei, additional, Yuan, Chen, additional, Li, Fangxing, additional, Liu, Guangyi, additional, Dai, Renchang, additional, and Cheng, Xiuzhen, additional
- Published
- 2020
- Full Text
- View/download PDF
23. Efficient Link Scheduling Solutions for the Internet of Things Under Rayleigh Fading.
- Author
-
Yu, Kan, Yu, Jiguo, Cheng, Xiuzhen, Yu, Dongxiao, and Dong, Anming
- Subjects
DISTRIBUTED algorithms ,INTERNET of things ,RAYLEIGH model ,SCHEDULING - Abstract
Link scheduling is an appealing solution for ensuring the reliability and latency requirements of Internet of Things (IoT). Most existing results on the link scheduling problem were based on the graph or SINR (Signal-to-Interference-plus-Noise-Ratio) models, which ignored the impact of the random fading gain of the signals strength. In this paper, we address the link scheduling problem under the Rayleigh fading model. Both Shortest Link Scheduling (SLS) and Maximum Link Scheduling (MLS) problems are studied. In particular, we show that a set of links can be activated simultaneously under Rayleigh fading model if all link SINR constraints are satisfied. Based on the analysis of previous Link Diversity Partition (LDP) algorithm, we propose an Improved LDP (ILDP) algorithm and a centralized algorithm by localizing the global interference (denoted by CLT), building on which we design a distributed CLT algorithm (denoted by RCRDCLT) that converges to a constant approximation factor of the optimum with the time complexity of $O(\ln n)$ , where $n$ is the number of links. Furthermore, executing repeatedly RCRDCLT can solve the SLS with an approximation factor of $\Theta (\ln n)$. Extensive simulations indicate that CLT is more effective than previous six popular link scheduling algorithms, and RCRDCLT has the lowest time complexity while only losses a constant fraction of the optimum schedule. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
24. wChain: A Fast Fault-Tolerant Blockchain Protocol for Multihop Wireless Networks.
- Author
-
Xu, Minghui, Liu, Chunchi, Zou, Yifei, Zhao, Feng, Yu, Jiguo, and Cheng, Xiuzhen
- Abstract
This paper presents $\mathit {wChain}$ , a blockchain protocol specifically designed for multihop wireless networks that deeply integrates wireless communication properties and blockchain technologies under the realistic SINR model. We adopt a hierarchical spanner as the communication backbone to address medium contention and achieve fast data aggregation within $O(\log N\log \Gamma)$ slots where $N$ is the network size and $\Gamma $ refers to the ratio of the maximum distance to the minimum distance between any two nodes. Besides, $\mathit {wChain}$ employs data aggregation and reaggregation as well as node recovery mechanisms to ensure efficiency, fault tolerance, persistence, and liveness. The worst-case runtime of $\mathit {wChain}$ is upper bounded by $O(f\log N\log \Gamma)$ , where $f=\lfloor \frac {N}{2} \rfloor $ is the upper bound of the number of faulty nodes. To validate our design, we conduct both theoretical analysis and simulation studies. The results not only demonstrate the nice properties of $\mathit {wChain}$ , but also point to a large new space for the exploration of blockchain protocols in wireless networks. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
25. Distributed Broadcasting in Dynamic Networks.
- Author
-
Yu, Dongxiao, Zou, Yifei, Yu, Jiguo, Wu, Yu, Lv, Weifeng, Cheng, Xiuzhen, Dressler, Falko, and Lau, Francis C. M.
- Subjects
DISTRIBUTED algorithms ,BROADCASTING industry ,DIAMETER ,SENSOR networks ,GRAPH algorithms ,SIGNAL-to-noise ratio ,DYNAMIC models - Abstract
In this paper, we investigate distributed broadcasting in dynamic networks, where the topology changes continually over time. We propose a network model that captures the dynamicity caused by both churn and mobility of nodes. In contrast to existing work on dynamic networks, our model defines the dynamicity in terms of localized topological changes in the vicinity of each node, rather than a global view of the whole network. Obviously, a local dynamic model suits distributed algorithms better than a global one. The proposed dynamic model uses the more realistic SINR model to depict wireless interference, instead of oversimplified graph-based models adopted in most existing work. We consider the fundamental communication primitive of global broadcast, which is to disseminate a message from a source node to the whole network. Specifically, we present a randomized distributed algorithm that can accomplish dynamic broadcasting in an asymptotically optimal running time of $O(D_{T})$ with a high probability guarantee, under the assumption of reasonably constant dynamicity rate, where $D_{T}$ is the dynamic diameter, a parameter proposed to depict the complexity of dynamic broadcasting. We believe our local dynamic model can greatly facilitate distributed algorithm studies in mobile and dynamic wireless networks. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
26. Implementing the Abstract MAC Layer via Inductive Coloring Under the Rayleigh-Fading Model.
- Author
-
Yu, Dongxiao, Zou, Yifei, Wang, Yuexuan, Yu, Jiguo, Cheng, Xiuzhen, and Lau, Francis C. M.
- Abstract
In this paper, we study distributed algorithms to realize efficient communications under the Rayleigh-fading model. This model extends the popular deterministic SINR model using stochastic propagations to address the fading effects observed in reality. Stochastic propagations can greatly increase the difficulty of handling interference and collisions, especially in a local context without much global knowledge. We present a new technique called Inductive Coloring that can be used to schedule fast transmissions with Rayleigh-fading interference. The computation of inductive coloring takes only $O(\log ^{2}n)$ time with the proposed distributed algorithm, where $n$ is the number of nodes in the network. We illustrate the power of inductive coloring by giving a distributed and randomized algorithm to implement the abstract MAC (absMAC) layer, which was first proposed by Kuhn et al.. With two basic time-guaranteed communication primitives, namely acknowledgement and progress, which correspond to the operations of node local broadcasts and message receptions from others, the absMAC layer decomposes the algorithm design and analysis in networks into two independent components, i.e., implementing the absMAC layer over a physical network and designing algorithms with the help of the two primitives in the absMAC layer. Thus, it sharply reduces the fussy and complicated process of algorithm design and analysis over the physical network. Our proposed algorithm implements the absMAC layer under the Rayleigh-fading model with no more than a logarithmic factor inferior to the optimal solution in terms of time complexity. The presented simulation results indicate that our algorithm performs well in realistic environments. Furthermore, we show that by making full use of our proposed absMAC layer algorithm, many network primitives such as Neighbor Discovery, Single/Multiple-Message Broadcast, and Consensus, can be efficiently implemented. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
27. Distributed Byzantine-Resilient Multiple-Message Dissemination in Wireless Networks.
- Author
-
Zou, Yifei, Yu, Dongxiao, Yu, Jiguo, Zhang, Yong, Dressler, Falko, and Cheng, Xiuzhen
- Subjects
ALGORITHMS ,WIRELESS sensor networks ,SIGNAL-to-noise ratio ,COMPUTER network protocols ,VEHICULAR ad hoc networks - Abstract
The byzantine model is widely used to depict a variety of node faults in networks. Previous studies on byzantine-resilient protocols in wireless networks assume reliable communications and do not consider the jamming behavior of byzantine nodes. Such jamming, however, is a very critical and realistic behavior to be considered in modern wireless networks. In this paper, for the first time, we integrate the jamming behavior of byzantine nodes into the network setting. We show that, in this much more comprehensive and harsh model, efficient distributed communication protocols can be still devised with elaborate protocol design. In particular, we developed an algorithm that can accomplish the basic multiple-message dissemination task close to the optimal solution in terms of running time. Empirical results validate the byzantine-resilience and efficiency of our algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
28. Privacy-Aware Data Trading.
- Author
-
Wang, Shengling, Shi, Lina, Hu, Qin, Zhang, Junshan, Cheng, Xiuzhen, and Yu, Jiguo
- Abstract
The growing threat of personal data breach in data trading pinpoints an urgent need to develop countermeasures for preserving individual privacy. The state-of-the-art work either endows the data collector with the responsibility of data privacy or reports only a privacy-preserving version of the data. The basic assumption of the former approach that the data collector is trustworthy does not always hold true in reality, whereas the latter approach reduces the value of data. In this paper, we investigate the privacy leakage issue from the root source. Specifically, we take a fresh look to reverse the inferior position of the data provider by making her dominate the game with the collector to solve the dilemma in data trading. To that aim, we propose the noisy-sequentially zero-determinant (NSZD) strategies by tailoring the classical zero-determinant strategies, originally designed for the simultaneous-move game, to adapt to the noisy sequential game. NSZD strategies can empower the data provider to unilaterally set the expected payoff of the data collector or enforce a positive relationship between her and the data collector’s expected payoffs. Both strategies can stimulate a rational data collector to behave honestly, boosting a healthy data trading market. Numerical simulations are used to examine the impacts of key parameters and the feasible region where the data provider can be an NSZD player. Finally, we prove that the data collector cannot employ NSZD to further dominate the data market for deteriorating privacy leakage. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
29. An Exact Implementation of the Abstract MAC Layer via Carrier Sensing in Dynamic Networks.
- Author
-
Yu, Dongxiao, Zou, Yifei, Zhang, Yong, Sheng, Hao, Lv, Weifeng, and Cheng, Xiuzhen
- Subjects
PROBLEM solving ,FACE-to-face communication ,ALGORITHMS ,DISTRIBUTED algorithms ,COMMUNICATION models - Abstract
In this paper, we present the first algorithm to precisely implement the abstract MAC (absMAC) layer under the physical SINR model in dynamic networks. The absMac layer, first presented by (Kuhn et al., 2009), provides reliable local broadcast communications, with timing guarantees stated in terms of a collection of abstract delay functions, based on which high-level algorithms can be designed, independent of specific channel behaviors. The implementation of absMAC requires the design of a distributed algorithm for the local broadcast communication primitives over a particular communication model that defines concrete channel behaviors, and the objective is to minimize the bounds of the abstract delay functions. Halldórsson et al. (2015) showed that under the standard SINR model (synchronous communications without physical carrier sensing or location information), there exist no efficient exact implementations. In this work, we demonstrate that physical carrier sensing, a commonly seen function performed by wireless devices, can help get efficient exact implementation algorithms. Specifically, we propose an algorithm that precisely implements the absMAC layer under the SINR model in dynamic networks. The algorithm provides asymptotically optimal bounds for both acknowledgement and progress functions defined in the absMAC layer. Our algorithm leads to many new faster algorithms for solving high-level problems under the SINR model in dynamic networks. We demonstrate this by exemplifying problems of Consensus, Multi-Message Broadcast, and Single-Message Broadcast. It deserves to point out that our implementation algorithm is designed based on an optimal algorithm for a General Local Broadcast (GLB) problem, which takes the number of distinct messages into consideration for the first time. The GLB algorithm can handle many communication scenarios apart from those defined in the absMAC layer. Simulation results show that our proposed algorithms perform well in reality. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
30. Achieving Privacy Preservation and Billing via Delayed Information Release.
- Author
-
Hu, Chunqiang, Cheng, Xiuzhen, Tian, Zhi, Yu, Jiguo, and Lv, Weifeng
- Subjects
INVOICES ,PRIVACY ,SMART meters ,COMPUTATIONAL complexity - Abstract
Many applications such as smart metering and location based services pose strong privacy requirements but achieving privacy protection at the client side is a non-trial problem as payment for the services must be computed by the server at the end of each billing period. In this paper, we propose a privacy preservation and billing scheme termed PPDIR based on delayed information release. PPDIR relies on a novel group signature mechanism and the asymmetric Rabin cryptosystem to protect the privacy of the clients and their requests, to achieve accountability and non-repudiation, and to shift the computational complexity to the server side. It adopts a secret token for anonymity and the token is updated for each client at the beginning of each billing period and securely released only to the server at the end of the billing period. Such a strategy can prevent the server from linking a client’s requests made at different billing periods. It also prevents any adversary from linking any request to any client. Note that the server is able to figure out all requests made by a client within a billing period after receiving the delayed token, which is unavoidable for billing purpose. We prove the security properties of the group signature scheme, and analyze the security strength of PPDIR. Our study indicates that PPDIR can achieve privacy-preservation, confidentiality, non-repudiation, accountability, and other security objectives. We also evaluate the performance of our scheme in terms of communication and computational overheads. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
31. Decentralized Parallel SGD With Privacy Preservation in Vehicular Networks.
- Author
-
Yu, Dongxiao, Zou, Zongrui, Chen, Shuzhen, Tao, Youming, Tian, Bing, Lv, Weifeng, and Cheng, Xiuzhen
- Subjects
VEHICULAR ad hoc networks ,PRIVACY ,INTELLIGENT transportation systems ,INTELLIGENT networks ,LEARNING problems ,ALGORITHMS - Abstract
With the prosperity of vehicular networks and intelligent transport systems, vast amount of data can be easily collected by vehicular devices from their users and widely spread in the vehicular networks for the purpose of solving large-scale machine learning problems. Hence how to preserve the data privacy of users during the learning process has become a public concern. To address this concern, under the celebrated framework of differential privacy (DP), we present in this paper a decentralized parallel stochastic gradient descent (D-PSGD) algorithm, called DP
2 -SGD, which can offer protection for privacy of users in vehicular networks. With thorough analysis we show that DP2 -SGD satisfies (ε, δ)-DP while the learning efficiency is the same as D-PSGD without privacy preservation. We also propose a refined algorithm called EC-SGD by introducing an error-compensate strategy. Extensive experiments show that EC-SGD can further improve the convergence efficiency over DP2 -SGD in reality. [ABSTRACT FROM AUTHOR]- Published
- 2021
- Full Text
- View/download PDF
32. Implementing The Abstract MAC Layer in Dynamic Networks.
- Author
-
Yu, Dongxiao, Zou, Yifei, Yu, Jiguo, Zhang, Yong, Li, Feng, Cheng, Xiuzhen, Dressler, Falko, and Lau, Francis C.M.
- Subjects
PROBLEM solving ,DISTRIBUTED algorithms ,DISTRIBUTED computing ,DYNAMIC models ,SIGNAL-to-noise ratio - Abstract
Dynamicity is one of the most challenging, yet, key aspects of wireless networks. It can come in many guises, such as churn (node insertion/deletion) and node mobility. Although the study of dynamic networks has been popular in distributed computing domain, previous works considered only partial factors causing dynamicity. In this work, we propose a dynamic model that is comprehensive to include crucial dynamic factors on nodes and links. Our model defines dynamicity in terms of localized topological changes in the vicinity of each node, rather than a global view of the whole network. Obviously, a localized dynamic model suits distributed algorithm studies better than a global one. The proposed dynamic model makes use of the more realistic SINR model to describe wireless interference, instead of the oversimplified graph-based models adopted by most existing research. Under the proposed dynamic model, we develop an efficient distributed algorithm accomplishing local broadcast services in the abstract MAC layer that was first presented by Kuhn et al.. Our solution paves the way for many new fast algorithms to solve high-level problems in dynamic networks, such as consensus, single-message broadcast, and multiple-message broadcast. Extensive simulation studies indicate that our algorithm exhibits good performance in realistic environments with dynamic network behaviors. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
33. Fast Fault-Tolerant Sampling via Random Walk in Dynamic Networks
- Author
-
Yuan, Yuan, primary, Li, Feng, additional, Yu, Dongxiao, additional, Yu, Jiguo, additional, Wu, Yu, additional, Lv, Weifeng, additional, and Cheng, Xiuzhen, additional
- Published
- 2019
- Full Text
- View/download PDF
34. Analysis of Antagonistic Dynamics for Rumor Propagation
- Author
-
Wang, Shengling, primary, Chen, Shasha, additional, Cheng, Xiuzhen, additional, Lv, Weifeng, additional, and Yu, Jiguo, additional
- Published
- 2019
- Full Text
- View/download PDF
35. Distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model
- Author
-
Yu, Dongxiao, primary, Zou, Yifei, additional, Zhang, Yong, additional, Li, Feng, additional, Yu, Jiguo, additional, Wu, Yu, additional, Cheng, Xiuzhen, additional, and Lau, Francis C.M., additional
- Published
- 2019
- Full Text
- View/download PDF
36. Fully Dynamic Broadcasting under SINR
- Author
-
Yu, Dongxiao, primary, Lin, Longlong, additional, Zhang, Yong, additional, Yu, Jiguo, additional, Zou, Yifei, additional, Hua, Qiang-Sheng, additional, and Cheng, Xiuzhen, additional
- Published
- 2018
- Full Text
- View/download PDF
37. Lightweight Hardware Based Secure Authentication Scheme for Fog Computing
- Author
-
Huang, Baiyi, primary, Cheng, Xiuzhen, additional, Cao, Yuan, additional, and Zhang, Le, additional
- Published
- 2018
- Full Text
- View/download PDF
38. Cost-Efficient Mobile Crowdsensing With Spatial-Temporal Awareness.
- Author
-
Hu, Qin, Wang, Shengling, Cheng, Xiuzhen, Zhang, Junshan, and Lv, Weifeng
- Abstract
A cost-efficient deal that can achieve high sensing quality with a low reward is the permanent goal of the requestor in mobile crowdsensing, which heavily depends on the quantity and quality of the workers. However, the spatial diversity and temporal dynamics lead to heterogeneous worker supplies, making it hard for the requestor to utilize a homogeneous pricing strategy to realize a cost-efficient deal from a systematic point of view. Therefore, a cost-efficient deal calls for a cost-efficient pricing strategy, boosting the whole sensing quality with less operation (computation) cost. However, the state-of-the-art studies ignore the dual cost-efficient demands of large-scale sensing tasks. Hence, we propose a combinatorial pinning zero-determinant (ZD) strategy, which empowers the requestor to utilize a single strategy within its feasible range to minimize the total expected utilities of the workers throughout all sensing regions for each time interval, without being affected by the strategies of the workers. Through turning the worker-customized strategy to an interval-customized one, the proposed combinatorial pinning ZD strategy reduces the number of pricing strategies required by the requestor from $O(n^3)$ O (n 3) to $O(n)$ O (n) . Besides, it extends the application scenarios of the classical ZD strategy from two-player simultaneous-move games to multiple-heterogeneous-player sequential-move ones, where a leader can determine the linear relationship of the players’ expected utilities. Such an extension enriches the theoretical hierarchy of ZD strategies, broadening their application scope. Extensive simulations based on real-world data verify the effectiveness and efficiency of the proposed scheme. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
39. Enabling Technologies for Spectrum and Energy Efficient NOMA-MmWave-MaMIMO Systems.
- Author
-
Wang, Yue, Tian, Zhi, and Cheng, Xiuzhen
- Abstract
With the proliferation of versatile devices and data-consuming services, the quest for spectrum efficiency has led to the merging of three disruptive technologies: millimeter-wave (mmWave) communications, massive MIMO (maMIMO), and non-orthogonal multiple access (NOMA). Emerging wireless networks move toward ultra-dense deployment of massive devices with diverse service demands, which call for efficient spectrum sharing even on mmWave bands. This article studies some key techniques that account for the unique angular selectivity of mmWave maMIMO channels and thus enable re-engineering the spectrum sharing paradigm of NOMA. An overview is provided on research challenges and opportunities related to spectrum and energy efficiency of spectrum-shared NOMA-mmWave systems with maMIMO, with focus on high-performance and low-complexity channel sensing, optimal sensing resource allocation, security and privacy provisioning, and learning- aided real-time system optimization. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
40. Spectrum Prediction for Supporting IoT Applications over 5G.
- Author
-
Gao, Qinghe, Xing, Xiaoshuang, Cheng, Xiuzhen, and Jing, Tao
- Abstract
Spectrum-prediction-based dynamic spectrum access (DSA) has been considered as a promising approach to meet the higher spectral efficiency, more system throughput, and better network connectivity requirements of 5G Internet of Things (IoT) applications. This article discusses the feasibility of applying spectrum prediction in 5G followed by proposing a 5G architecture supporting the spectrum-prediction-based DSA for IoT users. The prediction techniques, which have critical impacts on the performance of spectrum-prediction-based DSA, are reviewed in this article. The information that can be obtained from prediction is summarized, and the typical impacts of spectrum prediction on DSA are discussed. We also identify and discuss a few open research issues and challenges resulted from applying spectrum prediction for DSA in 5G. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
41. Efficient Link Scheduling in Wireless Networks Under Rayleigh-Fading and Multiuser Interference.
- Author
-
Yu, Jiguo, Yu, Kan, Yu, Dongxiao, Lv, Weifeng, Cheng, Xiuzhen, Chen, Honglong, and Cheng, Wei
- Abstract
Link scheduling plays a key role in the network capacity and the transmission delay. In this paper, we study the problem of maximum link scheduling (MLS), aiming to characterize the maximum number of links that can be successfully scheduled simultaneously under Rayleigh-fading and multiuser interference. After analyzing the minimum distance between successful links in the existing GHW scheduling algorithm, we propose a DLS (Distance-based Link Scheduling) algorithm. Then, the global interference is characterized and bounded by introducing a separation distance between selected links, building on which we propose a distributed version of DLS (denoted by DDLS) that converges to a constant factor of the non-fading optimum within time complexity $O(n\ln n)$ , where $n$ is the number of links. Furthermore, we study the Shortest Link Scheduling (SLS) problem, which minimizes the number of time slots to successfully schedule each link for at least once. An algorithm for SLS with approximation factor of $O(\ln n)$ is obtained by executing DDLS. Extensive simulations show that DDLS greatly outperforms GHW and the other two popular algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
42. Solving the Crowdsourcing Dilemma Using the Zero-Determinant Strategies.
- Author
-
Hu, Qin, Wang, Shengling, Cheng, Xiuzhen, Ma, Liran, and Bie, Rongfang
- Abstract
Crowdsourcing is a promising technology to accomplish a complex task via eliciting services from a large group of contributors. Recent observations indicate that the success of crowdsourcing has been threatened by the malicious behaviors of the contributors. In this paper, we analyze the attack problem using an iterated prisoner’s dilemma (IPD) game and propose a reward-penalty expected payoff algorithm based on zero-determinant (ZD) strategies to reward a worker’s cooperation or penalize its defection in order to entice the final cooperation. Both theoretical analysis and simulation studies are performed, and the results indicate that the proposed algorithm has the following two attractive characteristics: 1) the requestor can incentivize the worker to become cooperative without any long-term extra cost; and 2) the proposed algorithm is fair so that the requestor cannot arbitrarily penalize an innocent worker to increase its payoff even though it can dominate the game. To the best of our knowledge, we are the first to adopt the ZD strategies to stimulate both players to cooperate in an IPD game. Moreover, our proposed algorithm is not restricted to solve only the problem of crowdsourcing dilemma - it can be employed to tackle any problem that can be formulated into an IPD game. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
43. Quality Control in Crowdsourcing Using Sequential Zero-Determinant Strategies.
- Author
-
Hu, Qin, Wang, Shengling, Ma, Peizi, Cheng, Xiuzhen, Lv, Weifeng, and Bie, Rongfang
- Subjects
CROWDSOURCING ,ELECTRICITY markets ,QUALITY of work life ,MONETARY incentives ,QUALITY control - Abstract
Quality control in crowdsourcing is challenging due to the heterogeneous nature of the workers. The state-of-the-art solutions attempt to address the issue from the technical perspective, which may be costly because they function as an additional procedure in crowdsourcing. In this paper, an economics based idea is adopted to embed quality control into the crowdsourcing process, where the requestor can take advantage of the market power to stimulate the workers for submitting high-quality jobs. Specifically, we employ two sequential games to model the interactions between the requestor and the workers, with one considering binary strategies while the other taking continuous strategies. Accordingly, two incentive algorithms for improving the job quality are proposed to tackle the sequential crowdsourcing dilemma problem. Both algorithms are based on a sequential zero-determinant (ZD) strategy modified from the classical ZD strategy. Such a revision not only provides a theoretical basis for designing our incentive algorithms, but also enlarges the application space of the classical ZD strategy itself. Our incentive algorithms have the following desired features: 1) they do not depend on any specific crowdsourcing scenario; 2) they leverage economics theory to train the workers to behave nicely for better job quality instead of filtering out the unprofessional workers; 3) no extra costs are incurred in a long run of crowdsourcing; and 4) fairness is realized as even the requestor (the ZD player), who dominates the game, cannot increase her utility by arbitrarily penalizing any innocent worker. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
44. Multi-Armed-Bandit-Based Spectrum Scheduling Algorithms in Wireless Networks: A Survey.
- Author
-
Li, Feng, Yu, Dongxiao, Yang, Huan, Yu, Jiguo, Karl, Holger, and Cheng, Xiuzhen
- Abstract
Assigning bands of the wireless spectrum as resources to users is a common problem in wireless networks. Typically, frequency bands were assumed to be available in a stable manner. Nevertheless, in recent scenarios where wireless networks may be deployed in unknown environments, spectrum competition is considered, making it uncertain whether a frequency band is available at all or at what quality. To fully exploit such resources with uncertain availability, the multi-armed bandit (MAB) method, a representative online learning technique, has been applied to design spectrum scheduling algorithms. This article surveys such proposals. We describe the following three aspects: how to model spectrum scheduling problems within the MAB framework, what the main thread is following which prevalent algorithms are designed, and how to evaluate algorithm performance and complexity. We also give some promising directions for future research in related fields. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
45. Quantum Game Analysis on Extrinsic Incentive Mechanisms for P2P Services.
- Author
-
Wang, Shengling, Sun, Weiman, Ma, Liran, Lv, Weifeng, and Cheng, Xiuzhen
- Subjects
DATA transmission systems ,PEER-to-peer architecture (Computer networks) ,QUANTUM entanglement - Abstract
Peer-to-peer (P2P) services such as mobile P2P transmissions and resource sharing, provide efficient methods to deliver data without the deployment of any central server. Nevertheless, the free-riding phenomenon inherit in such services presses a need for incentive mechanisms to stimulate contributions of data transmissions or sharing. As a result, it is imperative to answer the following questions: whether, and if so to what extent, an incentive mechanism can invoke such contributions? To answer these questions, we employ an $n$ n -player continuous quantum game model to analyze the general extrinsic incentive mechanisms as well as the reputation-based incentive mechanisms, a typical class of extrinsic incentive mechanisms. We focus on studying the extrinsic incentive mechanisms in this paper due to their wide scope of applications stemming from the fact that they promote cooperative behaviors by offering rewards rather than depending on the internal bounds (e.g., social ties) among peers, which may not always exist between any pair of peers. To the best of our knowledge, we are the first to analyze the extrinsic incentive mechanisms for P2P services from a quantum game perspective. Such a perspective is adopted because the extended strategy space in the quantum game broadens the range for searching optimal strategies and the introduction of entanglement makes the proposed analytical frameworks more practical due to the consideration of the peers’ relationships imposed by the rewards in extrinsic incentive mechanisms. Our quantum game-based analytical framework is generic because it is compatible with classic game-based schemes. The analytical results can provide a straightforward insight on evaluating the potential of the extrinsic incentive mechanisms and can serve as important references for designing new extrinsic incentive mechanisms. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
46. PRIDE: A Private and Decentralized Usage-Based Insurance Using Blockchain
- Author
-
Wan, Zhiguo, primary, Guan, Zhangshuang, additional, and Cheng, Xiuzhen, additional
- Published
- 2018
- Full Text
- View/download PDF
47. A Novel Graph-based Mechanism for Identifying Traffic Vulnerabilities in Smart Home IoT
- Author
-
Jia, Yizhen, primary, Xiao, Yinhao, additional, Yu, Jiguo, additional, Cheng, Xiuzhen, additional, Liang, Zhenkai, additional, and Wan, Zhiguo, additional
- Published
- 2018
- Full Text
- View/download PDF
48. Poster: Perturbation Based Private Profile Matching in Social Networks
- Author
-
Li, Ruinian, primary, Li, Hongjuan, additional, Cheng, Xiuzhen, additional, Li, Keqiu, additional, Wang, Shenglin, additional, and Bie, Rongfang, additional
- Published
- 2017
- Full Text
- View/download PDF
49. A Hierarchical Game Framework for Data Privacy Preservation in Context-Aware IoT Applications
- Author
-
Li, Wei, primary, Song, Tianyi, additional, Li, Yingshu, additional, Ma, Liran, additional, Yu, Jiguo, additional, and Cheng, Xiuzhen, additional
- Published
- 2017
- Full Text
- View/download PDF
50. Personal Information Inference in Social Networks
- Author
-
Mei, Bo, primary, Xiao, Yinhao, additional, Cheng, Xiuzhen, additional, Li, Hong, additional, and Sun, Yunchuan, additional
- Published
- 2017
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.