Chengcheng Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chengcheng Zhou has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Haitao Xu
University of Science and Technology Beijing
8 shared publications - Zhu Han
University of Houston
6 shared publications - Guangping Zeng
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
3 shared publications - Hongjie Gao
Department of Communication Engineering, University of Science and Technology Beijing, Beijing, China
3 shared publications - Jianwei An
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
2 shared publications - Chao Guo
Beijing Electronics Science and Technology Institute
1 shared publication
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (18) , 42169-42183
Dynamic Group Signatures for Resource-Constrained IoT: A Lattice-Based Construction With Range Membership
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (18) , 42169-42183
Dynamic Group Signatures for Resource-Constrained IoT: A Lattice-Based Construction With Range Membership
- 18 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (11) , 17668-17683
Dynamic Energy Management for UAV-Enabled VR Systems: A Tile-Based Collaboration Approach
Unmanned aerial vehicles (UAVs) have been envisioned as a promising technology to support wireless virtual reality (VR) applications. However, the huge energy consumption during the rendering process is challenging for UAV-enabled VR systems. The existing energy management strategies neglecting the dynamic and tiling features of VR tasks may not achieve optimal performance. To cope with these issues, we present a dynamic energy optimization framework for UAV-enabled VR systems. In the proposed framework, a tile-based collaborative rendering scheme for multi-UAVs is developed by exploiting the correlation among different tiles of VR users. Further, we formulate an optimization problem by jointly considering the collaboration decision, resource allocation, and UAV trajectory, aiming to reduce the long-term energy consumption under the motion-to-photon (MTP) latency requirement. Due to the tight coupling variables and the dynamic factors, the formulated problem is non-convex and difficult to tackle by adopting the traditional method. To this end, we first decompose the original problem into two sub-problems, i.e., the UAV trajectory and collaboration decision (UTCD) problem, and the resource allocation (RA) problem. Then, we design a dynamic UTCD algorithm based on deep reinforcement learning (DRL) and present an optimal RA algorithm based on the Lagrangian multiplier iterative (LMI) method. To enhance the solving efficiency, a block coordinate descent (BCD)-based solving method is introduced by embedding the RA algorithm in the learning environment of DRL. Finally, simulation results prove that the proposed scheme can obtain good performance for UAV-enabled VR systems.
- 18 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73 (11) , 17668-17683
Dynamic Energy Management for UAV-Enabled VR Systems: A Tile-Based Collaboration Approach
Unmanned aerial vehicles (UAVs) have been envisioned as a promising technology to support wireless virtual reality (VR) applications. However, the huge energy consumption during the rendering process is challenging for UAV-enabled VR systems. The existing energy management strategies neglecting the dynamic and tiling features of VR tasks may not achieve optimal performance. To cope with these issues, we present a dynamic energy optimization framework for UAV-enabled VR systems. In the proposed framework, a tile-based collaborative rendering scheme for multi-UAVs is developed by exploiting the correlation among different tiles of VR users. Further, we formulate an optimization problem by jointly considering the collaboration decision, resource allocation, and UAV trajectory, aiming to reduce the long-term energy consumption under the motion-to-photon (MTP) latency requirement. Due to the tight coupling variables and the dynamic factors, the formulated problem is non-convex and difficult to tackle by adopting the traditional method. To this end, we first decompose the original problem into two sub-problems, i.e., the UAV trajectory and collaboration decision (UTCD) problem, and the resource allocation (RA) problem. Then, we design a dynamic UTCD algorithm based on deep reinforcement learning (DRL) and present an optimal RA algorithm based on the Lagrangian multiplier iterative (LMI) method. To enhance the solving efficiency, a block coordinate descent (BCD)-based solving method is introduced by embedding the RA algorithm in the learning environment of DRL. Finally, simulation results prove that the proposed scheme can obtain good performance for UAV-enabled VR systems.
- 8 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (7) , 11606-11618
Cooperative Energy Trading for HetNets With Renewable Energy: A Dynamic Energy Trading Game
Dense low-power small cell base station (SBS)-based heterogeneous wireless cellular networks (HetNets) have attracted much attention to achieving high-traffic density and peak rate performance. However, the serious energy consumption problem is still a challenge for HetNets. The use of renewable energy (RE) has been considered as one promising solution for the above problem. This article proposes an energy trading scheme among base stations in RE-based HetNets. All SBSs in HetNets are considered as either the energy demander (SBS-ED) or the energy supplier (SBS-ES) based on their abilities in producing RE, and the macro base station (MBS) works as the energy trading manager to control the trading price. A dynamic evolutionary game-based energy trading model between SBS-ES and SBS-ED is established to achieve cooperative energy trading, and the evolutionary stable strategy (ESS) of the proposed model is analyzed. The pricing mechanism of MBS is also investigated, which can effectually affect the EES performance of the proposed model. It is concluded that the MBS’s strategy in the trading price can affect the energy trading strategies of the SBSs. An energy transmission model is proposed, and the minimum energy loss is considered as the goal to obtain the optimal solutions. Numerical results are given to prove the validity and correctness of our proposed method.
- 8 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (7) , 11606-11618
Cooperative Energy Trading for HetNets With Renewable Energy: A Dynamic Energy Trading Game
Dense low-power small cell base station (SBS)-based heterogeneous wireless cellular networks (HetNets) have attracted much attention to achieving high-traffic density and peak rate performance. However, the serious energy consumption problem is still a challenge for HetNets. The use of renewable energy (RE) has been considered as one promising solution for the above problem. This article proposes an energy trading scheme among base stations in RE-based HetNets. All SBSs in HetNets are considered as either the energy demander (SBS-ED) or the energy supplier (SBS-ES) based on their abilities in producing RE, and the macro base station (MBS) works as the energy trading manager to control the trading price. A dynamic evolutionary game-based energy trading model between SBS-ES and SBS-ED is established to achieve cooperative energy trading, and the evolutionary stable strategy (ESS) of the proposed model is analyzed. The pricing mechanism of MBS is also investigated, which can effectually affect the EES performance of the proposed model. It is concluded that the MBS’s strategy in the trading price can affect the energy trading strategies of the SBSs. An energy transmission model is proposed, and the minimum energy loss is considered as the goal to obtain the optimal solutions. Numerical results are given to prove the validity and correctness of our proposed method.
- 1 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 32 (4) , 821-839
Dispersed Computing Resource Discovery Model and Algorithm for Polymorphic Migration Network Architecture
Dynamic resource discovery in a network of dispersed computing resources is an open problem. The establishment and maintenance of resource pool information are critical, which involves both the polymorphic migration of the network and the time and energy costs resulting from node selection and frequent interactions of information between nodes. The resource discovery problem for dispersed computing can be considered a dynamic multi-level decision problem. A bi-level programming model of dispersed computing resource discovery is developed, which is driven by time cost, energy consumption and accuracy of information acquisition. The upper-level model is to design a reasonable network structure of resource discovery, and the lower-level model is to explore an effective discovery mode. Complex network topology features are used for the first time to analyze the polymorphic migration characteristics of resource discovery networks. We propose an integrated calibration method for energy consumption parameters based on two discovery modes (i.e., agent mode and self-directed mode). A symmetric trust region based heuristic algorithm is proposed for solving the system model. The numerical simulation is performed in a dispersed computing network with multiple modes and topological states, which proves the feasibility of the model and the effectiveness of the algorithm.
- 1 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 32 (4) , 821-839
Dispersed Computing Resource Discovery Model and Algorithm for Polymorphic Migration Network Architecture
Dynamic resource discovery in a network of dispersed computing resources is an open problem. The establishment and maintenance of resource pool information are critical, which involves both the polymorphic migration of the network and the time and energy costs resulting from node selection and frequent interactions of information between nodes. The resource discovery problem for dispersed computing can be considered a dynamic multi-level decision problem. A bi-level programming model of dispersed computing resource discovery is developed, which is driven by time cost, energy consumption and accuracy of information acquisition. The upper-level model is to design a reasonable network structure of resource discovery, and the lower-level model is to explore an effective discovery mode. Complex network topology features are used for the first time to analyze the polymorphic migration characteristics of resource discovery networks. We propose an integrated calibration method for energy consumption parameters based on two discovery modes (i.e., agent mode and self-directed mode). A symmetric trust region based heuristic algorithm is proposed for solving the system model. The numerical simulation is performed in a dispersed computing network with multiple modes and topological states, which proves the feasibility of the model and the effectiveness of the algorithm.
- 1 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (7) , 9472-9483
Power Control and Interference Pricing Strategies for Heterogeneous Networks With Renewable Energy Sources
In this paper, the power control and interference pricing problems between the macro base station (MBS) and small cell base stations (SBSs) in Heterogeneous networks (HetNets) are investigated. To optimally allocate power resources and effectively manage the power resources to reduce interference in HetNets, an innovative Stackelberg differential game approach is proposed. In the proposed Stackelberg game, the SBSs control their transmit power to achieve cost minimization based on the interference price offered by the MBS. Given the optimal power control strategies of SBSs, the MBS can adjust the interference price to realize the objective optimization. Renewable energy sources are introduced into the proposed HetNets, and differential equations formulate the SBSs' dynamic energy. Meanwhile, the MBS's state is given by the dynamic spectrum resources. Then the differential game is imported to achieve optimal power control and interference pricing. The open-loop Nash equilibrium solutions are first analyzed for the MBS and SBSs. Then the feedback Nash equilibrium solutions are given. Under the feedback pattern, the proposed model's performances in the non-cooperative and cooperative situations are discussed. Numerical simulations are given to show the convergence and effectiveness of the proposed game approach.
- 1 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (7) , 9472-9483
Power Control and Interference Pricing Strategies for Heterogeneous Networks With Renewable Energy Sources
In this paper, the power control and interference pricing problems between the macro base station (MBS) and small cell base stations (SBSs) in Heterogeneous networks (HetNets) are investigated. To optimally allocate power resources and effectively manage the power resources to reduce interference in HetNets, an innovative Stackelberg differential game approach is proposed. In the proposed Stackelberg game, the SBSs control their transmit power to achieve cost minimization based on the interference price offered by the MBS. Given the optimal power control strategies of SBSs, the MBS can adjust the interference price to realize the objective optimization. Renewable energy sources are introduced into the proposed HetNets, and differential equations formulate the SBSs' dynamic energy. Meanwhile, the MBS's state is given by the dynamic spectrum resources. Then the differential game is imported to achieve optimal power control and interference pricing. The open-loop Nash equilibrium solutions are first analyzed for the MBS and SBSs. Then the feedback Nash equilibrium solutions are given. Under the feedback pattern, the proposed model's performances in the non-cooperative and cooperative situations are discussed. Numerical simulations are given to show the convergence and effectiveness of the proposed game approach.
- 9 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (8) , 6973-6987
Resilience-Mechanism-Based Dynamic Resource Allocation in Dispersed Computing Network
When degradation occurs in a dispersed computing network, mitigating the persistent effects of failures and improving the disposal efficiency is an open problem. However, the occurrence of failed nodes in a dispersed computing network is a random and low-probability incident. Further, the resilient resources for emergency allocation are from devices with complex spatial locations in practice. These factors pose challenges to the resource allocation problem using resilience mechanisms. In this article, we explore and analyze a resilience mechanism for dispersed computing networks as an optimization model. We investigate a resilience-aware dynamic resource allocation model to cope with a degraded dispersed computing network and obtain better emergency response at a lower cost. The uncertainties of node failures are uniquely explored to capture failure nodes more precisely and initiate the resilience mechanism for such nodes. In addition, we propose a novel approach to deal with the dynamic and complex coupling characteristics of decision variables in the model. This approach incorporates the induced artificial fish swarm algorithm with dynamic system simulation to generate and improve the scheme for the allocation of resilient resources. Finally, numerical simulation results verify the improved performance of our model and the effectiveness of the algorithm.
- 9 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (8) , 6973-6987
Resilience-Mechanism-Based Dynamic Resource Allocation in Dispersed Computing Network
When degradation occurs in a dispersed computing network, mitigating the persistent effects of failures and improving the disposal efficiency is an open problem. However, the occurrence of failed nodes in a dispersed computing network is a random and low-probability incident. Further, the resilient resources for emergency allocation are from devices with complex spatial locations in practice. These factors pose challenges to the resource allocation problem using resilience mechanisms. In this article, we explore and analyze a resilience mechanism for dispersed computing networks as an optimization model. We investigate a resilience-aware dynamic resource allocation model to cope with a degraded dispersed computing network and obtain better emergency response at a lower cost. The uncertainties of node failures are uniquely explored to capture failure nodes more precisely and initiate the resilience mechanism for such nodes. In addition, we propose a novel approach to deal with the dynamic and complex coupling characteristics of decision variables in the model. This approach incorporates the induced artificial fish swarm algorithm with dynamic system simulation to generate and improve the scheme for the allocation of resilient resources. Finally, numerical simulation results verify the improved performance of our model and the effectiveness of the algorithm.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (1) , 263-267
Quality-Aware Incentive Mechanism for Social Mobile Crowd Sensing
The mobile crowd sensing perception paradigm relies on the participation of generous users, and an appropriate incentive mechanism can promote the participation of more users. Moreover, social relationships among users can promote users’ willingness to complete the sensing tasks, which in turn boosts the collection of high-quality data for the platform. In this letter, we study the problem of designing a suitable incentive mechanism combined with data quality under social influence. Specifically, we divide the design of the incentive mechanism into two stages: participant selection considering social influence; reward payment considering quality measurement. We use the KKT system to get an optimal time of users in stage I. Furthermore, the reward payment stage can be equivalently transformed into a mixed-integer nonlinear problem, and we devise a heuristic algorithm HEAL to solve the problem. Finally, we conduct certain numerical comparative simulation experiments to evaluate the effectiveness and correctness of HEAL.
- 5 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (1) , 263-267
Quality-Aware Incentive Mechanism for Social Mobile Crowd Sensing
The mobile crowd sensing perception paradigm relies on the participation of generous users, and an appropriate incentive mechanism can promote the participation of more users. Moreover, social relationships among users can promote users’ willingness to complete the sensing tasks, which in turn boosts the collection of high-quality data for the platform. In this letter, we study the problem of designing a suitable incentive mechanism combined with data quality under social influence. Specifically, we divide the design of the incentive mechanism into two stages: participant selection considering social influence; reward payment considering quality measurement. We use the KKT system to get an optimal time of users in stage I. Furthermore, the reward payment stage can be equivalently transformed into a mixed-integer nonlinear problem, and we devise a heuristic algorithm HEAL to solve the problem. Finally, we conduct certain numerical comparative simulation experiments to evaluate the effectiveness and correctness of HEAL.
- 24 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (18) , 18098-18112
Mean-Field-Game-Based Dynamic Task Pricing in Mobile Crowdsensing
Mobile crowdsensing (MCS) is an effective perception paradigm for large-scale tasks, driven by the proliferation of mobile devices with more powerful sensing and computing capabilities. An effective incentive mechanism is critical to the operation of an MCS system in promoting public engagement. However, the great majority of works discuss fixed task pricing, while the inherent inequality of the supply–demand relationship of the tasks exists. Therefore, it is essential to study the dynamic task pricing problem in the peer-to-peer data sharing MCS system. In this article, we formulate the interactions between the requester and the sensors as a two-stage Stackelberg differential game model, while considering the average behavior of sensors to solve the dynamic task pricing problem. Specifically, in the game model, the requester is the leader who first announces the issued task rate and provides decisive state-changing task pricing dynamics to the sensors. Then, the sensors are the followers who decide the rate of tasks completed noncooperatively based on requesters’ observed strategy, using the level of effort as the state dynamics. The requester and the sensors interact through a mean-field term included in the dynamic state functions, which catches the average behavior of all users. By solving the model, the optimal strategies for the users and the optimal tasks pricing trends in the dynamic environment are obtained. Furthermore, the effectiveness and feasibility of the scheme are verified by a series of numerical simulation experiments.
- 24 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (18) , 18098-18112
Mean-Field-Game-Based Dynamic Task Pricing in Mobile Crowdsensing
Mobile crowdsensing (MCS) is an effective perception paradigm for large-scale tasks, driven by the proliferation of mobile devices with more powerful sensing and computing capabilities. An effective incentive mechanism is critical to the operation of an MCS system in promoting public engagement. However, the great majority of works discuss fixed task pricing, while the inherent inequality of the supply–demand relationship of the tasks exists. Therefore, it is essential to study the dynamic task pricing problem in the peer-to-peer data sharing MCS system. In this article, we formulate the interactions between the requester and the sensors as a two-stage Stackelberg differential game model, while considering the average behavior of sensors to solve the dynamic task pricing problem. Specifically, in the game model, the requester is the leader who first announces the issued task rate and provides decisive state-changing task pricing dynamics to the sensors. Then, the sensors are the followers who decide the rate of tasks completed noncooperatively based on requesters’ observed strategy, using the level of effort as the state dynamics. The requester and the sensors interact through a mean-field term included in the dynamic state functions, which catches the average behavior of all users. By solving the model, the optimal strategies for the users and the optimal tasks pricing trends in the dynamic environment are obtained. Furthermore, the effectiveness and feasibility of the scheme are verified by a series of numerical simulation experiments.
- Open Access
A Joint Optimization Strategy of Coverage Planning and Energy Scheduling for Wireless Rechargeable Sensor Networks
Wireless Sensor Networks (WSNs) have the characteristics of large-scale deployment, flexible networking, and many applications. They are important parts of wireless communication networks. However, due to limited energy supply, the development of WSNs is greatly restricted. Wireless rechargeable sensor networks (WRSNs) transform the distributed energy around the environment into usable electricity through energy collection technology. In this work, a two-phase scheme is proposed to improve the energy management efficiency for WRSNs. In the first phase, we designed an annulus virtual force based particle swarm optimization (AVFPSO) algorithm for area coverage. It adopts the multi-parameter joint optimization method to improve the efficiency of the algorithm. In the second phase, a queuing game-based energy supply (QGES) algorithm was designed. It converts energy supply and consumption into network service. By solving the game equilibrium of the model, the optimal energy distribution strategy can be obtained. The simulation results show that our scheme improves the efficiency of coverage and energy supply, and then extends the lifetime of WSN.
Open AccessA Joint Optimization Strategy of Coverage Planning and Energy Scheduling for Wireless Rechargeable Sensor Networks
Wireless Sensor Networks (WSNs) have the characteristics of large-scale deployment, flexible networking, and many applications. They are important parts of wireless communication networks. However, due to limited energy supply, the development of WSNs is greatly restricted. Wireless rechargeable sensor networks (WRSNs) transform the distributed energy around the environment into usable electricity through energy collection technology. In this work, a two-phase scheme is proposed to improve the energy management efficiency for WRSNs. In the first phase, we designed an annulus virtual force based particle swarm optimization (AVFPSO) algorithm for area coverage. It adopts the multi-parameter joint optimization method to improve the efficiency of the algorithm. In the second phase, a queuing game-based energy supply (QGES) algorithm was designed. It converts energy supply and consumption into network service. By solving the game equilibrium of the model, the optimal energy distribution strategy can be obtained. The simulation results show that our scheme improves the efficiency of coverage and energy supply, and then extends the lifetime of WSN.
- Open Access
- 3 August 2020
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2020, 1-20
Novel Defense Schemes for Artificial Intelligence Deployed in Edge Computing Environment
The last few years have seen the great potential of artificial intelligence (AI) technology to efficiently and effectively deal with an incredible deluge of data generated by the Internet of Things (IoT) devices. If all the massive data is transferred to the cloud for intelligent processing, it not only brings considerable challenges to the network bandwidth but also cannot meet the needs of AI applications that require fast and real-time response. Therefore, to achieve this requirement, mobile or multiaccess edge computing (MEC) is receiving a substantial amount of interest, and its importance is gradually becoming more prominent. However, with the emerging of edge intelligence, AI also suffers from several tremendous security threats in AI model training, AI model inference, and private data. This paper provides three novel defense strategies to tackle malicious attacks in three aspects. First of all, we introduce a cloud-edge collaborative antiattack scheme to realize a reliable incremental updating of AI by ensuring the data security generated in the training phase. Furthermore, we propose an edge-enhanced defense strategy based on adaptive traceability and punishment mechanism to effectively and radically solve the security problem in the inference stage of the AI model. Finally, we establish a system model based on chaotic encryption with the three-layer architecture of MEC to effectively guarantee the security and privacy of the data during the construction of AI models. The experimental results of these three countermeasures verify the correctness of the conclusion and the feasibility of the methods.
- 3 August 2020
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2020, 1-20
Open AccessNovel Defense Schemes for Artificial Intelligence Deployed in Edge Computing Environment
The last few years have seen the great potential of artificial intelligence (AI) technology to efficiently and effectively deal with an incredible deluge of data generated by the Internet of Things (IoT) devices. If all the massive data is transferred to the cloud for intelligent processing, it not only brings considerable challenges to the network bandwidth but also cannot meet the needs of AI applications that require fast and real-time response. Therefore, to achieve this requirement, mobile or multiaccess edge computing (MEC) is receiving a substantial amount of interest, and its importance is gradually becoming more prominent. However, with the emerging of edge intelligence, AI also suffers from several tremendous security threats in AI model training, AI model inference, and private data. This paper provides three novel defense strategies to tackle malicious attacks in three aspects. First of all, we introduce a cloud-edge collaborative antiattack scheme to realize a reliable incremental updating of AI by ensuring the data security generated in the training phase. Furthermore, we propose an edge-enhanced defense strategy based on adaptive traceability and punishment mechanism to effectively and radically solve the security problem in the inference stage of the AI model. Finally, we establish a system model based on chaotic encryption with the three-layer architecture of MEC to effectively guarantee the security and privacy of the data during the construction of AI models. The experimental results of these three countermeasures verify the correctness of the conclusion and the feasibility of the methods.