Author of the publication

Modelling Cyber Attacks on Electricity Market Using Mathematical Programming With Equilibrium Constraints.

, , , and . IEEE Access, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Energy-Efficient Communication Networks via Multiple Aerial Reconfigurable Intelligent Surfaces: DRL and Optimization Approach., , , , and . CoRR, (2022)Free Space Optical Integrated Sensing and Communication Based on LFM and CPM., , , and . IEEE Commun. Lett., 28 (1): 43-47 (January 2024)CCA-Net: A Lightweight Network Using Criss-Cross Attention for CSI Feedback., , , and . IEEE Commun. Lett., 27 (7): 1879-1883 (July 2023)Affective Computing Model With Impulse Control in Internet of Things Based on Affective Robotics., , , , , , and . IEEE Internet Things J., 9 (21): 20815-20832 (2022)A Survey on STAR-RIS: Use Cases, Recent Advances, and Future Research Challenges., , , , , , , and . IEEE Internet Things J., 10 (16): 14689-14711 (August 2023)Design and Performance Analysis of 3-D Markov-Chain-Model-Based Fair Spectrum-Sharing Access for IoT Services., , , and . IEEE Internet Things J., 9 (17): 15756-15770 (2022)Joint 3-D Position Deployment and Traffic Offloading for Caching and Computing-Enabled UAV Under Asymmetric Information., , , , and . IEEE Internet Things J., 10 (7): 6312-6323 (April 2023)Mean Field Evolutionary Dynamics in Dense-User Multi-Access Edge Computing Systems., , , , and . IEEE Trans. Wirel. Commun., 19 (12): 7825-7835 (2020)Two-Tier Matching Game in Small Cell Networks for Mobile Edge Computing., , , , , and . IEEE Trans. Serv. Comput., 15 (1): 254-265 (2022)Distributionally Robust Planning for Data Delivery in Distributed Satellite Cluster Network., , , , and . IEEE Trans. Wirel. Commun., 18 (7): 3642-3657 (2019)