Aayush Agarwal
Research Subjects
Aayush Agarwal has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Arindam Dey
VIT-AP University
1 shared publication - Biplab Sikdar
National University of Singapore
1 shared publication - Frank Werner
Faculty of Mathematics, Otto-von-Guericke University, 39106 Magdeburg, Germany
1 shared publication - Hemantha Krishna Bharadwaj
Department of Electrical and Electronics Engineering, Birla Institute of Technology and Science (BITS), Pilani, India
1 shared publication - Hoang Viet Long
Division of Computational Mathematics and Engineering, Institute for Computational Science, Ton Duc Thang University, Ho Chi Minh City, Vietnam
1 shared publication - Le Hoang Son
Artificial Intelligence Research Center, VNU Information Technology Institute, Vietnam National University, Hanoi, Vietnam
1 shared publication
Latest Publications
- 8 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Trade-off analysis for different Sink locations in DEEC Protocol
Data collected from different sensors in a wireless sensor network is to be send to base station for storage and other utilities such as processing. The data is sent to the base station either as direct or multi-hop propagation based on distance of node to the base station. The location of base station may be inside or outside the sensor field based on the scenario at hand. This paper analyzes trade-off for different locations of base station for various levels of heterogeneity in DEEC protocol. The current work analyzes the standard network parameters such as field dimensions of 100x100 meters, 100 sensor nodes with similar compute ability but different amount of initial energies. On simulation of the network with respect to existing popular literature works, it is found that the placement of the base station at the center of the field lead to optimal utilization of network recourses.
- 8 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Trade-off analysis for different Sink locations in DEEC Protocol
Data collected from different sensors in a wireless sensor network is to be send to base station for storage and other utilities such as processing. The data is sent to the base station either as direct or multi-hop propagation based on distance of node to the base station. The location of base station may be inside or outside the sensor field based on the scenario at hand. This paper analyzes trade-off for different locations of base station for various levels of heterogeneity in DEEC protocol. The current work analyzes the standard network parameters such as field dimensions of 100x100 meters, 100 sensor nodes with similar compute ability but different amount of initial energies. On simulation of the network with respect to existing popular literature works, it is found that the placement of the base station at the center of the field lead to optimal utilization of network recourses.
- Top Cited PapersOpen Access
- 16 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 38859-38890
A Review on the Role of Machine Learning in Enabling IoT Based Healthcare Applications
The Internet of Things (IoT) is playing a vital role in the rapid automation of the healthcare sector. The branch of IoT dedicated towards medical science is at times termed as Healthcare Internet of Things (H-IoT). The key elements of all H-IoT applications are data gathering and processing. Due to the large amount of data involved in healthcare, and the enormous value that accurate predictions hold, the integration of machine learning (ML) algorithms into H-IoT is imperative. This paper aims to serve both as a compilation as well as a review of the various state of the art applications of ML algorithms currently being integrated with H-IoT. Some of the most widely used ML algorithms have been briefly introduced and their use in various H-IoT applications has been analyzed in terms of their advantages, scope, and possible improvements. Applications have been divided into the domains of diagnosis, prognosis and spread control, assistive systems, monitoring, and logistics. In healthcare, practical use of a model requires it to be highly accurate and to have ample measures against security attacks. The applications of ML algorithms in H-IoT discussed in this paper have shown experimental evidence of accuracy and practical usability. The constraints and drawbacks of each of these applications have also been described.
- 16 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 38859-38890
Top Cited PapersOpen AccessA Review on the Role of Machine Learning in Enabling IoT Based Healthcare Applications
The Internet of Things (IoT) is playing a vital role in the rapid automation of the healthcare sector. The branch of IoT dedicated towards medical science is at times termed as Healthcare Internet of Things (H-IoT). The key elements of all H-IoT applications are data gathering and processing. Due to the large amount of data involved in healthcare, and the enormous value that accurate predictions hold, the integration of machine learning (ML) algorithms into H-IoT is imperative. This paper aims to serve both as a compilation as well as a review of the various state of the art applications of ML algorithms currently being integrated with H-IoT. Some of the most widely used ML algorithms have been briefly introduced and their use in various H-IoT applications has been analyzed in terms of their advantages, scope, and possible improvements. Applications have been divided into the domains of diagnosis, prognosis and spread control, assistive systems, monitoring, and logistics. In healthcare, practical use of a model requires it to be highly accurate and to have ample measures against security attacks. The applications of ML algorithms in H-IoT discussed in this paper have shown experimental evidence of accuracy and practical usability. The constraints and drawbacks of each of these applications have also been described.
- 8 November 2019
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 37 (6) , 7831-7838
A genetic algorithm for total graph coloring
A genetic algorithm (GA) belongs to the class of evolutionary algorithms and it is one of the most studied heuristic algorithms to solve graph coloring problems. In this paper, we propose a new GA algorithm for the total graph coloring problem. To the best of our knowledge, no algorithm based on a GA exists in the literature for total graph coloring. In the proposed approach, a novel encoding scheme is introduced, where all the edges and vertices of the graph are represented in a chromosome without any repetition. For the initialization of the population, a greedy algorithm is used to determine the total number of colors required for a total coloring of the graph. The number of colors is used as the fitness value of a chromosome which depends on the sequence of vertices and edges representing the chromosome. We introduce a convergence criteria for GA based on the total coloring conjecture. A two-point crossover and mutation operations, suitable for total coloring, are suggested. The proposed algorithm is applied on some well-known and standard graphs. In our computational tests, graphs are used with a maximum number of 690 vertices and 6650 edges of the graph, respectively. The proposed algorithm determines an optimal solution for 21 graphs among the 27 graphs. The solution of remaining the 6 graphs is near optimal and differs by at most one unit from the optimal value. The results show the effectiveness of the proposed approach.
- 8 November 2019
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 37 (6) , 7831-7838
A genetic algorithm for total graph coloring
A genetic algorithm (GA) belongs to the class of evolutionary algorithms and it is one of the most studied heuristic algorithms to solve graph coloring problems. In this paper, we propose a new GA algorithm for the total graph coloring problem. To the best of our knowledge, no algorithm based on a GA exists in the literature for total graph coloring. In the proposed approach, a novel encoding scheme is introduced, where all the edges and vertices of the graph are represented in a chromosome without any repetition. For the initialization of the population, a greedy algorithm is used to determine the total number of colors required for a total coloring of the graph. The number of colors is used as the fitness value of a chromosome which depends on the sequence of vertices and edges representing the chromosome. We introduce a convergence criteria for GA based on the total coloring conjecture. A two-point crossover and mutation operations, suitable for total coloring, are suggested. The proposed algorithm is applied on some well-known and standard graphs. In our computational tests, graphs are used with a maximum number of 690 vertices and 6650 edges of the graph, respectively. The proposed algorithm determines an optimal solution for 21 graphs among the 27 graphs. The solution of remaining the 6 graphs is near optimal and differs by at most one unit from the optimal value. The results show the effectiveness of the proposed approach.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 49-52
Performance analysis of cloud based load balancing techniques
Cloud computing is a model for enabling ubiquitous, convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort or service provider interaction. In cloud computing, load balancing is one of the key issues. Load balancing is the process of apportioning the load among various nodes of a distributed system to improve both resource utilization and job response time while avoiding a situation where some of the nodes are heavily loaded while others are idle. This paper outlines an experimentation based comparative analysis of the load balancing algorithms for different scenario use cases.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 49-52
Performance analysis of cloud based load balancing techniques
Cloud computing is a model for enabling ubiquitous, convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort or service provider interaction. In cloud computing, load balancing is one of the key issues. Load balancing is the process of apportioning the load among various nodes of a distributed system to improve both resource utilization and job response time while avoiding a situation where some of the nodes are heavily loaded while others are idle. This paper outlines an experimentation based comparative analysis of the load balancing algorithms for different scenario use cases.