Dian Shi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dian Shi has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Miao Pan
University of Houston
11 shared publications - Liang Li
Peng Cheng Laboratory, Shenzhen, China
6 shared publications - Ronghui Hou
School of Cyber Engineering, Xidian University, Xian, China
3 shared publications - Zhu Han
University of Houston
3 shared publications - Hao Yue
University of California, Santa Cruz, Santa Cruz, CA, USA
2 shared publications - Harold Vincent Poor
Princeton University
2 shared publications
Latest Publications
- 1 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (9) , 7836-7850
Eve Said Yes: AirBone Authentication for Head-Wearable Smart Voice Assistant
Recent advances in speech and language processing have led to the rise of smart voice services like Alexa, Google Home, and Siri. However, these advancements also increase security risks due to sophisticated voice domain attacks. Instead of relying on acoustic clues to detect replayed or synthesized speech, we utilize microphones and motion sensors in head-wearable devices to authorize legitimate users through bone-conducted vibrations, enabling multi-factor authentication (MFA) for spoken voice. Our proposed two-stage authentication system, AirBone, captures air and bone conduction (AirBone) signals and exploits two authentication factors sequentially. The first stage, called temporal consistency scoring (TCS), employs signal processing to verify the recorded AC and BC signals are concurrent and originate from the same vocalization process. Statistical tools are employed to distinguish legitimate attempts against false-triggering or acoustic attacks. The second stage leverages deep learning to verify the user’s unique bone conduction patterns in the vibration domain. Specifically, we enhance the robustness through data augmentation with constant-Q transform and adversarial training, improving the model’s ability to detect impersonation and machine-induced vibrations. Thanks to these designs, AirBone authentication offers enhanced security via MFA with no extra cost of user effort. In addition, our experimental results demonstrate a$96.3\%$ overall accuracy, robustness against AirBone noise and room impulse responses, and$0.3\%$ Equal Error Rate (EER) against acoustic and cross-domain attacks.- 1 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24 (9) , 7836-7850
Eve Said Yes: AirBone Authentication for Head-Wearable Smart Voice Assistant
Recent advances in speech and language processing have led to the rise of smart voice services like Alexa, Google Home, and Siri. However, these advancements also increase security risks due to sophisticated voice domain attacks. Instead of relying on acoustic clues to detect replayed or synthesized speech, we utilize microphones and motion sensors in head-wearable devices to authorize legitimate users through bone-conducted vibrations, enabling multi-factor authentication (MFA) for spoken voice. Our proposed two-stage authentication system, AirBone, captures air and bone conduction (AirBone) signals and exploits two authentication factors sequentially. The first stage, called temporal consistency scoring (TCS), employs signal processing to verify the recorded AC and BC signals are concurrent and originate from the same vocalization process. Statistical tools are employed to distinguish legitimate attempts against false-triggering or acoustic attacks. The second stage leverages deep learning to verify the user’s unique bone conduction patterns in the vibration domain. Specifically, we enhance the robustness through data augmentation with constant-Q transform and adversarial training, improving the model’s ability to detect impersonation and machine-induced vibrations. Thanks to these designs, AirBone authentication offers enhanced security via MFA with no extra cost of user effort. In addition, our experimental results demonstrate a$96.3\%$ overall accuracy, robustness against AirBone noise and room impulse responses, and$0.3\%$ Equal Error Rate (EER) against acoustic and cross-domain attacks.- 29 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (2) , 1228-1242
Energy and Spectrum Efficient Federated Learning via High-Precision Over-the-Air Computation
Federated learning (FL) enables mobile devices to collaboratively learn a shared prediction model while keeping data locally. However, there are two major research challenges to practically deploy FL over mobile devices: (i) frequent wireless updates of huge size gradients v.s. limited spectrum resources, and (ii) energy-hungry FL communication and local computing during training v.s. battery-constrained mobile devices. To address those challenges, in this paper, we propose a novel multi-bit over-the-air computation (M-AirComp) approach for spectrum-efficient aggregation of local model updates in FL and further present an energy-efficient FL design for mobile devices. Specifically, a high-precision digital modulation scheme is designed and incorporated in the M-AirComp, allowing mobile devices to upload model updates at the selected positions simultaneously in the multi-access channel. Moreover, we theoretically analyze the convergence property of our FL algorithm. Guided by FL convergence analysis, we formulate a joint transmission probability and local computing control optimization, aiming to minimize the overall energy consumption (i.e., iterative local computing + multi-round communications) of mobile devices in FL. Extensive simulation results show that our proposed scheme outperforms existing ones in terms of spectrum utilization, energy efficiency, and learning accuracy.
- 29 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (2) , 1228-1242
Energy and Spectrum Efficient Federated Learning via High-Precision Over-the-Air Computation
Federated learning (FL) enables mobile devices to collaboratively learn a shared prediction model while keeping data locally. However, there are two major research challenges to practically deploy FL over mobile devices: (i) frequent wireless updates of huge size gradients v.s. limited spectrum resources, and (ii) energy-hungry FL communication and local computing during training v.s. battery-constrained mobile devices. To address those challenges, in this paper, we propose a novel multi-bit over-the-air computation (M-AirComp) approach for spectrum-efficient aggregation of local model updates in FL and further present an energy-efficient FL design for mobile devices. Specifically, a high-precision digital modulation scheme is designed and incorporated in the M-AirComp, allowing mobile devices to upload model updates at the selected positions simultaneously in the multi-access channel. Moreover, we theoretically analyze the convergence property of our FL algorithm. Guided by FL convergence analysis, we formulate a joint transmission probability and local computing control optimization, aiming to minimize the overall energy consumption (i.e., iterative local computing + multi-round communications) of mobile devices in FL. Extensive simulation results show that our proposed scheme outperforms existing ones in terms of spectrum utilization, energy efficiency, and learning accuracy.
- 6 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 41 (4) , 990-1006
Service Delay Minimization for Federated Learning Over Mobile Devices
Federated learning (FL) over mobile devices has fostered numerous intriguing applications/services, many of which are delay-sensitive. In this paper, we propose a service delay efficient FL (SDEFL) scheme over mobile devices. Unlike traditional communication efficient FL, which regards wireless communications as the bottleneck, we find that under many situations, the local computing delay is comparable to the communication delay during the FL training process, given the development of high-speed wireless transmission techniques. Thus, the service delay in FL should be computing delay + communication delay over training rounds. To minimize the service delay of FL, simply reducing local computing/communication delay independently is not enough. The delay trade-off between local computing and wireless communications must be considered. Besides, we empirically study the impacts of local computing control and compression strategies (i.e., the number of local updates, weight quantization, and gradient quantization) on computing, communication and service delays. Based on those trade-off observation and empirical studies, we develop an optimization scheme to minimize the service delay of FL over heterogeneous devices. We establish testbeds and conduct extensive emulations/experiments to verify our theoretical analysis. The results show that SDEFL reduces notable service delay with a small accuracy drop compared to peer designs.
- 6 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 41 (4) , 990-1006
Service Delay Minimization for Federated Learning Over Mobile Devices
Federated learning (FL) over mobile devices has fostered numerous intriguing applications/services, many of which are delay-sensitive. In this paper, we propose a service delay efficient FL (SDEFL) scheme over mobile devices. Unlike traditional communication efficient FL, which regards wireless communications as the bottleneck, we find that under many situations, the local computing delay is comparable to the communication delay during the FL training process, given the development of high-speed wireless transmission techniques. Thus, the service delay in FL should be computing delay + communication delay over training rounds. To minimize the service delay of FL, simply reducing local computing/communication delay independently is not enough. The delay trade-off between local computing and wireless communications must be considered. Besides, we empirically study the impacts of local computing control and compression strategies (i.e., the number of local updates, weight quantization, and gradient quantization) on computing, communication and service delays. Based on those trade-off observation and empirical studies, we develop an optimization scheme to minimize the service delay of FL over heterogeneous devices. We establish testbeds and conduct extensive emulations/experiments to verify our theoretical analysis. The results show that SDEFL reduces notable service delay with a small accuracy drop compared to peer designs.
- 14 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (12) , 11038-11050
To Talk or to Work: Dynamic Batch Sizes Assisted Time Efficient Federated Learning Over Future Mobile Edge Devices
The coupling of federated learning (FL) and multi-access edge computing (MEC) has the potential to foster numerous applications. However, it poses great challenges to train FL fast enough with limited communication and computing resources of mobile edge devices. Motivated by recent development in ultra fast wireless transmissions and promising advances in artificial intelligence (AI) computing hardware of mobile devices, in this paper, we propose a time efficient FL over future mobile edge devices, called dynamic batch sizes assisted federated learning (DBFL) with convergence guarantee. The DBFL allows batch sizes to increase dynamically during training, which can unleash the computing potential of GPU’s parallelism for on-device training and effectively leverage the fast wireless transmissions (WiFi-6, 5G, 6G, etc.) of mobile edge devices. Furthermore, based on the derived DBFL’s convergence bound, we develop a batch size control scheme to minimize the total time consumption of FL over mobile edge devices, which trade-offs the “talking", i.e., communication time, and “working", i.e., computing time, by adjusting the incremental factor appropriately. Extensive simulations are conducted to validate the effectiveness of our proposed DBFL algorithm and demonstrate that our scheme outperforms existing time efficient FL approaches in terms of the total time consumption in various settings.
- 14 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 21 (12) , 11038-11050
To Talk or to Work: Dynamic Batch Sizes Assisted Time Efficient Federated Learning Over Future Mobile Edge Devices
The coupling of federated learning (FL) and multi-access edge computing (MEC) has the potential to foster numerous applications. However, it poses great challenges to train FL fast enough with limited communication and computing resources of mobile edge devices. Motivated by recent development in ultra fast wireless transmissions and promising advances in artificial intelligence (AI) computing hardware of mobile devices, in this paper, we propose a time efficient FL over future mobile edge devices, called dynamic batch sizes assisted federated learning (DBFL) with convergence guarantee. The DBFL allows batch sizes to increase dynamically during training, which can unleash the computing potential of GPU’s parallelism for on-device training and effectively leverage the fast wireless transmissions (WiFi-6, 5G, 6G, etc.) of mobile edge devices. Furthermore, based on the derived DBFL’s convergence bound, we develop a batch size control scheme to minimize the total time consumption of FL over mobile edge devices, which trade-offs the “talking", i.e., communication time, and “working", i.e., computing time, by adjusting the incremental factor appropriately. Extensive simulations are conducted to validate the effectiveness of our proposed DBFL algorithm and demonstrate that our scheme outperforms existing time efficient FL approaches in terms of the total time consumption in various settings.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 21 (12) , 4426-4438
Make Smart Decisions Faster: Deciding D2D Resource Allocation via Stackelberg Game Guided Multi-Agent Deep Reinforcement Learning
Device-to-Device (D2D) communication enabling direct data transmission between two mobile users has emerged as a vital component for 5G cellular networks to improve spectrum utilization and enhance system capacity. A critical issue for realizing these benefits in D2D-enabled networks is to properly allocate radio resources while coordinating the co-channel interference in a time-varying communication environment. In this paper, we propose a Stackelberg game (SG) guided multi-agent deep reinforcement learning (MADRL) approach, which allows D2D users to make smart power control and channel allocation decisions in a distributed manner. In particular, we define a crucial Stackelberg Q-value (ST-Q) to guide the learning direction, which can be calculated based on the equilibrium achieved in the Stackelberg game. With the guidance of the Stackelberg equilibrium, our approach converges faster with fewer iterations than the general MADRL method and thereby exhibits better performance in handling the network dynamics. After the initial training, each agent can infer timely D2D resource allocation strategies with distributed execution. Extensive simulations are conducted to validate the efficacy of our proposed scheme in developing timely resource allocation strategies. The results also show that our method outperforms the general MADRL based approach in terms of the average utility, channel capacity, and training time.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 21 (12) , 4426-4438
Make Smart Decisions Faster: Deciding D2D Resource Allocation via Stackelberg Game Guided Multi-Agent Deep Reinforcement Learning
Device-to-Device (D2D) communication enabling direct data transmission between two mobile users has emerged as a vital component for 5G cellular networks to improve spectrum utilization and enhance system capacity. A critical issue for realizing these benefits in D2D-enabled networks is to properly allocate radio resources while coordinating the co-channel interference in a time-varying communication environment. In this paper, we propose a Stackelberg game (SG) guided multi-agent deep reinforcement learning (MADRL) approach, which allows D2D users to make smart power control and channel allocation decisions in a distributed manner. In particular, we define a crucial Stackelberg Q-value (ST-Q) to guide the learning direction, which can be calculated based on the equilibrium achieved in the Stackelberg game. With the guidance of the Stackelberg equilibrium, our approach converges faster with fewer iterations than the general MADRL method and thereby exhibits better performance in handling the network dynamics. After the initial training, each agent can infer timely D2D resource allocation strategies with distributed execution. Extensive simulations are conducted to validate the efficacy of our proposed scheme in developing timely resource allocation strategies. The results also show that our method outperforms the general MADRL based approach in terms of the average utility, channel capacity, and training time.
- 8 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 21 (9) , 3250-3262
Privacy Preserving Participant Recruitment for Coverage Maximization in Location Aware Mobile Crowdsensing
Mobile crowdsensing has emerged as a promising paradigm where location-based sensing tasks are outsourced to mobile participants carrying sensor-equipped devices. A critical issue of crowdsensing is to guarantee the sensing coverage by appropriately recruiting participants, which requires participants’ precise locations and thus raises privacy concerns. In this paper, we are motivated to develop a privacy preserving participant recruitment scheme for mobile crowdsensing, which maximizes the spatial coverage of the sensing range while protecting participants’ location privacy against an untrusted crowdsensing platform. Briefly, we propose a utility-assured location obfuscation mechanism operated in a hexagonal grid system, which the participants can follow to locally perturb their locations with personalized privacy demands. Given the obfuscated locations, we efficiently solve a coverage-maximized participant recruitment problem with the budget constraint by using a deterministic rounding algorithm. Considering the existence of biased sensing data incurred by location obfuscation, we further develop a fault-aware crowdsensing framework to improve the robustness of the recruitment strategy, where a constant-approximation algorithm is applied to select participants against any number of unqualified sensing results. Extensive simulations on real-world location datasets and Uber’s geospatial indexing system validate the efficacy of our location obfuscation mechanism and participant recruitment schemes in mobile crowdsensing systems.
- 8 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 21 (9) , 3250-3262
Privacy Preserving Participant Recruitment for Coverage Maximization in Location Aware Mobile Crowdsensing
Mobile crowdsensing has emerged as a promising paradigm where location-based sensing tasks are outsourced to mobile participants carrying sensor-equipped devices. A critical issue of crowdsensing is to guarantee the sensing coverage by appropriately recruiting participants, which requires participants’ precise locations and thus raises privacy concerns. In this paper, we are motivated to develop a privacy preserving participant recruitment scheme for mobile crowdsensing, which maximizes the spatial coverage of the sensing range while protecting participants’ location privacy against an untrusted crowdsensing platform. Briefly, we propose a utility-assured location obfuscation mechanism operated in a hexagonal grid system, which the participants can follow to locally perturb their locations with personalized privacy demands. Given the obfuscated locations, we efficiently solve a coverage-maximized participant recruitment problem with the budget constraint by using a deterministic rounding algorithm. Considering the existence of biased sensing data incurred by location obfuscation, we further develop a fault-aware crowdsensing framework to improve the robustness of the recruitment strategy, where a constant-approximation algorithm is applied to select participants against any number of unqualified sensing results. Extensive simulations on real-world location datasets and Uber’s geospatial indexing system validate the efficacy of our location obfuscation mechanism and participant recruitment schemes in mobile crowdsensing systems.
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (6) , 4317-4328
Data-Driven Optimization for Cooperative Edge Service Provisioning With Demand Uncertainty
Multi-access Edge Computing (MEC) empowers Service Providers (SPs) to run applications on the shared edge platforms in close proximity to mobile users, enabling ultra-low latency access to a wide variety of cloud services. However, how to decide the amount of edge computing resources to rent for mobile service provisioning poses great challenges as the service demand is unknown to SPs a priori and may vary across the geographically-distributed edge sites spatially and temporally. The resource rental decision also significantly affects SPs’ deploying profits since it is critical for service deployment and workload assignment. This paper investigates the service provisioning problem in a cooperative edge computing system under service demand uncertainty. We develop a holistic solution to make two-timescale decisions on edge resource rental and workload assignment to maximize SP’s deploying profits. Briefly, we exploit historical service demand traces at the edge sites to characterize the uncertainty in a data-driven manner and formulate the edge service provisioning problem into a two-stage risk-averse optimization. To solve the formulated problem without compromising the data privacy, we propose an algorithm integrating Benders Decomposition (BD) and Alternating Direction Method of Multipliers (ADMM), which enables each edge site to keep the historical traces locally and participate in the optimization process. Based on real-world datasets, extensive simulations are conducted to validate the efficacy of our scheme.
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (6) , 4317-4328
Data-Driven Optimization for Cooperative Edge Service Provisioning With Demand Uncertainty
Multi-access Edge Computing (MEC) empowers Service Providers (SPs) to run applications on the shared edge platforms in close proximity to mobile users, enabling ultra-low latency access to a wide variety of cloud services. However, how to decide the amount of edge computing resources to rent for mobile service provisioning poses great challenges as the service demand is unknown to SPs a priori and may vary across the geographically-distributed edge sites spatially and temporally. The resource rental decision also significantly affects SPs’ deploying profits since it is critical for service deployment and workload assignment. This paper investigates the service provisioning problem in a cooperative edge computing system under service demand uncertainty. We develop a holistic solution to make two-timescale decisions on edge resource rental and workload assignment to maximize SP’s deploying profits. Briefly, we exploit historical service demand traces at the edge sites to characterize the uncertainty in a data-driven manner and formulate the edge service provisioning problem into a two-stage risk-averse optimization. To solve the formulated problem without compromising the data privacy, we propose an algorithm integrating Benders Decomposition (BD) and Alternating Direction Method of Multipliers (ADMM), which enables each edge site to keep the historical traces locally and participate in the optimization process. Based on real-world datasets, extensive simulations are conducted to validate the efficacy of our scheme.
- 27 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (10) , 9330-9340
Mean Field Game Guided Deep Reinforcement Learning for Task Placement in Cooperative Multiaccess Edge Computing
Cooperative Multi-Access Edge Computing (MEC) is a promising paradigm for the next generation mobile networks. However, when the number of users explodes, the computational complexity of existing optimization or learning based task placement approaches in the cooperative MEC can increase significantly, which leads to intolerable MEC decision making delay. In this paper, we propose a mean field game (MFG) guided deep reinforcement learning (DRL) approach for the task placement in the cooperative MEC, which can help servers make timely task placement decisions, and significantly reduce average service delay. Instead of applying MFG or DRL separately, we jointly leverage MFG and DRL for task placement, and let the equilibrium of MFG guide the learning directions of DRL. We also ensure that the MFG and DRL approaches are consistent with the same goal. Specifically, we novelly define a mean field guided Q-value (MFG-Q), which is an estimation of Q-value with the Nash equilibrium gained by MFG. We evaluate the proposed method’s performance using real-world user distribution. Through extensive simulations, we show that the proposed scheme is effective in making timely decisions and reducing the average service delay. Besides, the convergence rates of our proposed method outperform the pure DRL based approaches.
- 27 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (10) , 9330-9340
Mean Field Game Guided Deep Reinforcement Learning for Task Placement in Cooperative Multiaccess Edge Computing
Cooperative Multi-Access Edge Computing (MEC) is a promising paradigm for the next generation mobile networks. However, when the number of users explodes, the computational complexity of existing optimization or learning based task placement approaches in the cooperative MEC can increase significantly, which leads to intolerable MEC decision making delay. In this paper, we propose a mean field game (MFG) guided deep reinforcement learning (DRL) approach for the task placement in the cooperative MEC, which can help servers make timely task placement decisions, and significantly reduce average service delay. Instead of applying MFG or DRL separately, we jointly leverage MFG and DRL for task placement, and let the equilibrium of MFG guide the learning directions of DRL. We also ensure that the MFG and DRL approaches are consistent with the same goal. Specifically, we novelly define a mean field guided Q-value (MFG-Q), which is an estimation of Q-value with the Nash equilibrium gained by MFG. We evaluate the proposed method’s performance using real-world user distribution. Through extensive simulations, we show that the proposed scheme is effective in making timely decisions and reducing the average service delay. Besides, the convergence rates of our proposed method outperform the pure DRL based approaches.
- 16 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (6) , 5549-5561
Energy-Efficient Proactive Caching for Adaptive Video Streaming via Data-Driven Optimization
- 16 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (6) , 5549-5561
Energy-Efficient Proactive Caching for Adaptive Video Streaming via Data-Driven Optimization
- 21 June 2019
- Published by Springer Nature
- p. 297-309
Optimal Transportation Network Company Vehicle Dispatching via Deep Deterministic Policy Gradient
- 21 June 2019
- Published by Springer Nature
- p. 297-309
Optimal Transportation Network Company Vehicle Dispatching via Deep Deterministic Policy Gradient