Rahul Yadav
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Rahul Yadav has a total of 74 co-authors. Here are the top co-authors by number of shared publications:
- Weizhe Zhang
Harbin Institute of Technology
11 shared publications - Asif Ali Laghari
Department of Computer Science, Sindh Madressatul Islam University, Karachi, Pakistan
4 shared publications - Chen Ling
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
3 shared publications - Ibrahim A. Elgendy
IRC for Finance and Digital Economy, KFUPM Business School, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
3 shared publications - Wei Li
Harbin Engineering University
3 shared publications - Guozhong Dong
Department of New Networks, PengCheng Laboratory, Shenzhen, China
2 shared publications
Latest Publications
- 8 April 2026
- Published by Elsevier in Information Sciences
- Vol. 747
Patch-HGST: Hierarchical graph spatio-temporal networks with data-driven adaptive patch partition for traffic prediction
- 8 April 2026
- Published by Elsevier in Information Sciences
- Vol. 747
Patch-HGST: Hierarchical graph spatio-temporal networks with data-driven adaptive patch partition for traffic prediction
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18  (6) , 3635-3648
Data Offloading for Edge-Enabled Smart City Services via Location-Functionality Correlation Analysis
Mobile edge computing significantly reduces the delay for smart city services by offloading the related datasets on the edge server. The correlation among smart city datasets regarding their location and functionality plays a crucial role in determining the data offloading strategy. The more closely related these datasets are, the higher the probability they will be requested simultaneously. However, most existing methods often ignore the impact of location-functionality correlation on the datasets' access frequencies. If datasets with high correlation are offloaded on separate edge servers, it will increase cross-server delay. Therefore, we proposed a method to analyze location-functionality correlation among smart city datasets and optimize data offloading strategy. Then, we formalize a data offloading model to optimize the total expected profits, which is an NP-hard problem. To solve this problem, we propose a pruned Q-learning for data offloading algorithm that learns the location-functionality correlation among the datasets. To validate its effectiveness, we first conduct simulation experiments to validate the offloading strategy under both complex service scenarios and large-scale datasets. Furthermore, we implement a data offloading architecture based on SuperMap iServer. The experimental results demonstrate that our algorithm reduces the delay and energy consumption by 34.65% and 25.54%, respectively, compared to the baseline algorithms.
- 20 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Services Computing
- Vol. 18  (6) , 3635-3648
Data Offloading for Edge-Enabled Smart City Services via Location-Functionality Correlation Analysis
Mobile edge computing significantly reduces the delay for smart city services by offloading the related datasets on the edge server. The correlation among smart city datasets regarding their location and functionality plays a crucial role in determining the data offloading strategy. The more closely related these datasets are, the higher the probability they will be requested simultaneously. However, most existing methods often ignore the impact of location-functionality correlation on the datasets' access frequencies. If datasets with high correlation are offloaded on separate edge servers, it will increase cross-server delay. Therefore, we proposed a method to analyze location-functionality correlation among smart city datasets and optimize data offloading strategy. Then, we formalize a data offloading model to optimize the total expected profits, which is an NP-hard problem. To solve this problem, we propose a pruned Q-learning for data offloading algorithm that learns the location-functionality correlation among the datasets. To validate its effectiveness, we first conduct simulation experiments to validate the offloading strategy under both complex service scenarios and large-scale datasets. Furthermore, we implement a data offloading architecture based on SuperMap iServer. The experimental results demonstrate that our algorithm reduces the delay and energy consumption by 34.65% and 25.54%, respectively, compared to the baseline algorithms.
- 15 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28  (12) , 1-13
Federated deep learning for malware detection and data protection in edge-enabled IoMT
- 15 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28  (12) , 1-13
Federated deep learning for malware detection and data protection in edge-enabled IoMT
- 25 July 2025
- Published by Springer Nature
- p. 437-449
GASNet: Geometric Robust Adaptive Spatial-Enhanced Network for Building Extraction
- 25 July 2025
- Published by Springer Nature
- p. 437-449
GASNet: Geometric Robust Adaptive Spatial-Enhanced Network for Building Extraction
- Open Access
- 11 July 2025
- Published by Springer Nature in Research Square
A Hybrid Metaheuristic Approach for Multi-Objective Load Balancing in Digital Twin-Enabled Cloud Environment
The rapid growth of digital twin services is pushing computational resources requirements to unprecedented levels. While cloud computing provides the scalable infrastructure needed to support these computational demands. However, the critical challenge lies in intelligently distributing workloads across distributed cloud environments through advanced load balancing techniques, where traditional deterministic approaches struggle to find optimal solutions within polynomial time. Therefore, addressing such challenges this paper proposes an efficient service placement approach based on Modified Cuckoo Search Optimization called CSOT-PM to optimize dynamic resource allocation in cloud computing which supporting digital twin services. The proposed work is benchmarked against established algorithms like the Genetic Algorithm (GA) and Ant Colony Optimization (ACO), using performance metrics such as makespan time, resource utilization, energy consumption, and Service Level Agreement (SLA) violations. The proposed algorithm achieves a 30% reduction in energy consumption and an 11% improvement in SLA.
- 11 July 2025
- Published by Springer Nature in Research Square
Open AccessA Hybrid Metaheuristic Approach for Multi-Objective Load Balancing in Digital Twin-Enabled Cloud Environment
The rapid growth of digital twin services is pushing computational resources requirements to unprecedented levels. While cloud computing provides the scalable infrastructure needed to support these computational demands. However, the critical challenge lies in intelligently distributing workloads across distributed cloud environments through advanced load balancing techniques, where traditional deterministic approaches struggle to find optimal solutions within polynomial time. Therefore, addressing such challenges this paper proposes an efficient service placement approach based on Modified Cuckoo Search Optimization called CSOT-PM to optimize dynamic resource allocation in cloud computing which supporting digital twin services. The proposed work is benchmarked against established algorithms like the Genetic Algorithm (GA) and Ant Colony Optimization (ACO), using performance metrics such as makespan time, resource utilization, energy consumption, and Service Level Agreement (SLA) violations. The proposed algorithm achieves a 30% reduction in energy consumption and an 11% improvement in SLA.
- 14 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73  (7) , 10554-10571
QoS and Fairness Oriented Dynamic Computation Offloading in the Internet of Vehicles Based on Estimate Time of Arrival
The rapid development of Internet of Vehicles (IoV) and Mobile Edge Computing (MEC) enables vehicles to offload their applications to Roadside Units (RSU). However, without knowledge of vehicles' future locations, wireless connections between vehicles and RSUs are too vulnerable to finish offloading processes. Most existing methods allocate computation tasks statically, ignoring latency between task reception and processing in real IoV environments. Moreover, multiple services running on RSUs limit the availability of resources for offloading which require an efficient allocation of limited available resources. Therefore, this paper addresses the vehicular computation offloading problem by predicting vehicle mobility. We first introduce the Estimated Time of Arrival service into the vehicular MEC architecture to predict vehicles' driving state. Second, we formulate vehicular computation offloading as a dynamic process that efficiently selects the offloading location for each computation task and satisfies the constraints of limited available resources to balance QoS and response fairness. Thirdly, the cooperation among RSUs in our work optimizes the task QoS, but it increases the search space causing a high time consumption. We use the Dynamic Programming algorithm to optimize QoS and response fairness in the cooperative computation offloading problem and propose two offloading algorithms. To obtain the performance of our algorithms close to real IoV environments, we propose a fine-grained simulation method based on Veins. We evaluate our and existing algorithms based on real datasets from Erlangen, Germany, and Shenzhen, China.
- 14 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73  (7) , 10554-10571
QoS and Fairness Oriented Dynamic Computation Offloading in the Internet of Vehicles Based on Estimate Time of Arrival
The rapid development of Internet of Vehicles (IoV) and Mobile Edge Computing (MEC) enables vehicles to offload their applications to Roadside Units (RSU). However, without knowledge of vehicles' future locations, wireless connections between vehicles and RSUs are too vulnerable to finish offloading processes. Most existing methods allocate computation tasks statically, ignoring latency between task reception and processing in real IoV environments. Moreover, multiple services running on RSUs limit the availability of resources for offloading which require an efficient allocation of limited available resources. Therefore, this paper addresses the vehicular computation offloading problem by predicting vehicle mobility. We first introduce the Estimated Time of Arrival service into the vehicular MEC architecture to predict vehicles' driving state. Second, we formulate vehicular computation offloading as a dynamic process that efficiently selects the offloading location for each computation task and satisfies the constraints of limited available resources to balance QoS and response fairness. Thirdly, the cooperation among RSUs in our work optimizes the task QoS, but it increases the search space causing a high time consumption. We use the Dynamic Programming algorithm to optimize QoS and response fairness in the cooperative computation offloading problem and propose two offloading algorithms. To obtain the performance of our algorithms close to real IoV environments, we propose a fine-grained simulation method based on Veins. We evaluate our and existing algorithms based on real datasets from Erlangen, Germany, and Shenzhen, China.
- Open Access
- 6 February 2023
- Published by Elsevier in Telematics and Informatics Reports
- Vol. 9
6G networks for artificial intelligence-enabled smart cities applications: A scoping review
- 6 February 2023
- Published by Elsevier in Telematics and Informatics Reports
- Vol. 9
Open Access6G networks for artificial intelligence-enabled smart cities applications: A scoping review
- 5 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72  (4) , 5224-5239
An Edge Server Placement Algorithm Based on Graph Convolution Network
Efficient edge server placement techniques select optimal locations for edge servers to improve network and energy performance. However, without prior knowledge of users' resource demands, the possibilities of optimal location for these edge servers within a network are vast, which is a challenging problem. On the other hand, most existing techniques ignore the influence of user mobility on user's resources demand, violation of low-latency, and high energy consumption of 5 G networks. Therefore, this article addresses the edge server placement problem using network traffic to estimate the user resource demands. We first use a network traffic prediction model based on Graph Convolution Network to generate network traffic distribution. Second, the problem of edge server placement is formulated as a constraint optimization problem that places edge servers strategically to balance energy and latency. Searching randomly through many possible solutions and selecting the most descriptive optimal solutions can be time-consuming. Therefore, we used the particle swarm optimization (PSO) algorithm to optimize network delay and energy consumption, especially for high mobility areas. Experimental results are obtained to compare the performance of the proposed algorithm with existing methods. We evaluate the algorithm based on the real dataset from Shenzhen, Futian District. The results show our proposed algorithm averagely reduces edge servers' total cost and overloaded numbers by 23.98% and 52.71%, respectively.
- 5 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72  (4) , 5224-5239
An Edge Server Placement Algorithm Based on Graph Convolution Network
Efficient edge server placement techniques select optimal locations for edge servers to improve network and energy performance. However, without prior knowledge of users' resource demands, the possibilities of optimal location for these edge servers within a network are vast, which is a challenging problem. On the other hand, most existing techniques ignore the influence of user mobility on user's resources demand, violation of low-latency, and high energy consumption of 5 G networks. Therefore, this article addresses the edge server placement problem using network traffic to estimate the user resource demands. We first use a network traffic prediction model based on Graph Convolution Network to generate network traffic distribution. Second, the problem of edge server placement is formulated as a constraint optimization problem that places edge servers strategically to balance energy and latency. Searching randomly through many possible solutions and selecting the most descriptive optimal solutions can be time-consuming. Therefore, we used the particle swarm optimization (PSO) algorithm to optimize network delay and energy consumption, especially for high mobility areas. Experimental results are obtained to compare the performance of the proposed algorithm with existing methods. We evaluate the algorithm based on the real dataset from Shenzhen, Futian District. The results show our proposed algorithm averagely reduces edge servers' total cost and overloaded numbers by 23.98% and 52.71%, respectively.
- RetractedOpen Access
- 29 March 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-9
OWGC-HMC: An Online Web Genre Classification Model Based on Hierarchical Multilabel Classification
Web genre plays an important role in focused crawling, web link analysis, and contextual advertising. In this paper, web genre is defined as the functional purpose and the information type contained in the website. The intelligent classification of web genre can predict the content and functional type of website. However, there are several critical challenges to solve the web genre classification problem: lack of web genre classification dataset and efficient web genre classification mechanism. To improve web genre classification performance, we crawled Chinese websites of different web genres and converted crawled data into a hierarchical multilabel classification dataset. A website knowledge graph is constructed based on the relationship of website and meta tag features. Using entity features extracted from the knowledge graph, we propose an online web genre classification model based on hierarchical multilabel classification (OWGC-HMC) to mine the functional purpose of the corresponding website. Experimental results show that our OWGC-HMC model can mine hierarchical multilabel structure of web genre and outperform other web genre classification methods.
- 29 March 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-9
RetractedOpen AccessOWGC-HMC: An Online Web Genre Classification Model Based on Hierarchical Multilabel Classification
Web genre plays an important role in focused crawling, web link analysis, and contextual advertising. In this paper, web genre is defined as the functional purpose and the information type contained in the website. The intelligent classification of web genre can predict the content and functional type of website. However, there are several critical challenges to solve the web genre classification problem: lack of web genre classification dataset and efficient web genre classification mechanism. To improve web genre classification performance, we crawled Chinese websites of different web genres and converted crawled data into a hierarchical multilabel classification dataset. A website knowledge graph is constructed based on the relationship of website and meta tag features. Using entity features extracted from the knowledge graph, we propose an online web genre classification model based on hierarchical multilabel classification (OWGC-HMC) to mine the functional purpose of the corresponding website. Experimental results show that our OWGC-HMC model can mine hierarchical multilabel structure of web genre and outperform other web genre classification methods.
- 23 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 18  (11) , 7525-7536
Two-Phase Industrial Manufacturing Service Management for Energy Efficiency of Data Centers
Data-driven industrial manufacturing services are proliferating. They use large amounts of data generated from Industrial-Internet-of-Things (IIoT) devices for intelligent services to end-service-users. However, cloud data centers hosting these services consume a huge amount of energy, resulting in a high operational cost. To address this issue, an energy-efficient resource allocation framework is proposed in this article for cloud services. It operates in two phases. First, a multithreshold-based host CPU utilization classification scheme is developed to classify hosts into four groups for improved CPU resource allocation. It is designed through analyzing CPU utilization data by using the least median squares regression technique. Thereby, the scheme limits search space, thus reducing time complexity. In the second phase, with a metaheuristic search, an energy- and thermal-aware resource allocation method is developed to find an energy-efficient host for allocating resources to services. From real data center workload traces, extensive experiments show that our framework outperforms existing baseline approaches with 6.9%, 33.75%, and 34.1% on average in terms of temperature, energy consumption, and service-level-agreement violation, respectively.
- 23 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 18  (11) , 7525-7536
Two-Phase Industrial Manufacturing Service Management for Energy Efficiency of Data Centers
Data-driven industrial manufacturing services are proliferating. They use large amounts of data generated from Industrial-Internet-of-Things (IIoT) devices for intelligent services to end-service-users. However, cloud data centers hosting these services consume a huge amount of energy, resulting in a high operational cost. To address this issue, an energy-efficient resource allocation framework is proposed in this article for cloud services. It operates in two phases. First, a multithreshold-based host CPU utilization classification scheme is developed to classify hosts into four groups for improved CPU resource allocation. It is designed through analyzing CPU utilization data by using the least median squares regression technique. Thereby, the scheme limits search space, thus reducing time complexity. In the second phase, with a metaheuristic search, an energy- and thermal-aware resource allocation method is developed to find an energy-efficient host for allocating resources to services. From real data center workload traces, extensive experiments show that our framework outperforms existing baseline approaches with 6.9%, 33.75%, and 34.1% on average in terms of temperature, energy consumption, and service-level-agreement violation, respectively.