Shanmuk Srinivas Amiripalli
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
Shanmuk Srinivas Amiripalli has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Sagiraju Venkata Siva Rama Raju
Abu Dhabi Polytechnic
4 shared publications Veeramallu Bobba
4 shared publications- Mukkamala Siva Naga Ventaka Jitendra
GST, GITAM Deemed to be University
3 shared publications - Saiprasad Potharaju
Department of CSE, Symbiosis Institute of Technology, Symbiosis International (Deemed University), Pune, India
3 shared publications G. S. Mallikarjuna Rao
Gayatri Vidya Parishad College of Engineering (Autonomous)
2 shared publications- Kanaka Raju Rajana
GITAM University
2 shared publications
Latest Publications
- 2 September 2026
- Published by Springer Nature
- p. 87-98
Performance Assessment of MANET Routing Protocols with Random Waypoint Mobility Model
- 2 September 2026
- Published by Springer Nature
- p. 87-98
Performance Assessment of MANET Routing Protocols with Random Waypoint Mobility Model
- Open Access
- 1 September 2026
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 15 (3) , 1047-1057
Design a Gaussian mixture-based clustering model for enhancing accuracy and robustness in smart homes
Nowadays, smart homes have become quite complicated systems. Thus, an appropriate technique for controlling all those devices is necessary, especially considering that certain nodes are likely to be broken. In that connection, we have proposed two algorithms related to Gaussian mixture models (GMM): GMM equal and GMM unequal. They were compared with graph neural network (GNN) equal, GNN unequal, and the LucasWheel algorithms. The peculiarity of the GMM equal algorithm consists in the fact that all clusters should have similar sizes and shapes, which is quite useful for routing and balancing purposes, while the clusters in the GMM unequal algorithm can have various sizes and shapes depending on the data distribution. All five models were analyzed using 843 nodes, where failure rates ranged from zero to fifty percent. The surprising outcome of this analysis is that GMM equal performed better than the other four models in every aspect. Efficiency was steady and steadily increased in accordance with the rising failure rate. The Wiener index gradually fell from its initial value to nearly zero, suggesting a dense connection among the nodes and an evenly spread-out network. Furthermore, GMM equal attained the highest modularity among the five models at every failure level. In combination, these results indicate that GMM equal is the most balanced topology, with the best balance between reliability, efficient communication, and scalability when applied to the internet of things and smart homes.
- 1 September 2026
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 15 (3) , 1047-1057
Open AccessDesign a Gaussian mixture-based clustering model for enhancing accuracy and robustness in smart homes
Nowadays, smart homes have become quite complicated systems. Thus, an appropriate technique for controlling all those devices is necessary, especially considering that certain nodes are likely to be broken. In that connection, we have proposed two algorithms related to Gaussian mixture models (GMM): GMM equal and GMM unequal. They were compared with graph neural network (GNN) equal, GNN unequal, and the LucasWheel algorithms. The peculiarity of the GMM equal algorithm consists in the fact that all clusters should have similar sizes and shapes, which is quite useful for routing and balancing purposes, while the clusters in the GMM unequal algorithm can have various sizes and shapes depending on the data distribution. All five models were analyzed using 843 nodes, where failure rates ranged from zero to fifty percent. The surprising outcome of this analysis is that GMM equal performed better than the other four models in every aspect. Efficiency was steady and steadily increased in accordance with the rising failure rate. The Wiener index gradually fell from its initial value to nearly zero, suggesting a dense connection among the nodes and an evenly spread-out network. Furthermore, GMM equal attained the highest modularity among the five models at every failure level. In combination, these results indicate that GMM equal is the most balanced topology, with the best balance between reliability, efficient communication, and scalability when applied to the internet of things and smart homes.
- Open Access
- 1 June 2026
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 15 (2) , 607-615
A novel Lucas-based adaptive sampling optimization for enhancing network lifetime
This paper introduced to enhance network lifetime using a novel Lucas based adaptive sampling methodology by sampling network condition to dynamically modifying sampling intervals using the Lucas sequence, this sequence not only used for sampling but also used to modify data collection, optimizing accuracy and energy efficiency. This technique aims to reduce superfluous data transmissions and conserve network resources by monitoring network utilization and adjusting sample with low medium and high rates. We enhance the network performance and longevity using Lucas based technique via simulation and demonstrating its potential. This may effectively approach novel address to challenges associated with constrained networks, particularly in the domain of IoT and wireless sensor networks (WSNs).
- 1 June 2026
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 15 (2) , 607-615
Open AccessA novel Lucas-based adaptive sampling optimization for enhancing network lifetime
This paper introduced to enhance network lifetime using a novel Lucas based adaptive sampling methodology by sampling network condition to dynamically modifying sampling intervals using the Lucas sequence, this sequence not only used for sampling but also used to modify data collection, optimizing accuracy and energy efficiency. This technique aims to reduce superfluous data transmissions and conserve network resources by monitoring network utilization and adjusting sample with low medium and high rates. We enhance the network performance and longevity using Lucas based technique via simulation and demonstrating its potential. This may effectively approach novel address to challenges associated with constrained networks, particularly in the domain of IoT and wireless sensor networks (WSNs).
- 22 May 2025
- Published by Springer Nature
- p. 69-76
Exploring Land Distribution Patterns and Network Structures in Indian Tribal Communities
- 22 May 2025
- Published by Springer Nature
- p. 69-76
Exploring Land Distribution Patterns and Network Structures in Indian Tribal Communities
- Open Access
- 1 December 2024
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 13 (3) , 380-387
A novel Hj-index based model to assess the researchers using scopus database
There are many factors that can influence the impact and influence of research, including the quality and originality of the research, relevance and importance of the research, clarity and effectiveness of the research communication, placement of the research in high-impact journals, collaboration and networking, and timing of the research. Identifying active genuine researcher is a sub problem of raising stars in a research area. This problem was addressed by enhancing H-index in Scopus database. Researchers should consider these factors when conducting and communicating their research to maximize its impact and influence. Additionally, there are several metrics used to evaluate the impact and influence of journals and researchers such as H-index, SNIP, CiteScore, and SJR. These metrics take into account different aspects of productivity and impact, and can provide a more comprehensive view of a journal or researcher's influence within their field. In addition to the above metrics, Hj-index was proposed and compared with the H-index to find active genuine researcher in a group.
- 1 December 2024
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 13 (3) , 380-387
Open AccessA novel Hj-index based model to assess the researchers using scopus database
There are many factors that can influence the impact and influence of research, including the quality and originality of the research, relevance and importance of the research, clarity and effectiveness of the research communication, placement of the research in high-impact journals, collaboration and networking, and timing of the research. Identifying active genuine researcher is a sub problem of raising stars in a research area. This problem was addressed by enhancing H-index in Scopus database. Researchers should consider these factors when conducting and communicating their research to maximize its impact and influence. Additionally, there are several metrics used to evaluate the impact and influence of journals and researchers such as H-index, SNIP, CiteScore, and SJR. These metrics take into account different aspects of productivity and impact, and can provide a more comprehensive view of a journal or researcher's influence within their field. In addition to the above metrics, Hj-index was proposed and compared with the H-index to find active genuine researcher in a group.
- Open Access
- 4 September 2024
- Published by Intelligence Science and Technology Press Inc. in Journal of Artificial Intelligence and Technology
Exploring the Effects of High Dimensionality and Imbalanced Data on Predictive Models for Colon Cancer Detection Using Tree, Rule, and Lazy Learning Techniques
Analyzing colon cancer data is essential for improving early detection, treatment outcomes, public health initiatives, research efforts, and overall patient care, ultimately leading to better outcomes and reduced burden associated with this disease. The prediction of any disease depends on the quality of the available dataset. Before applying the prediction algorithm it is important to analyze its characteristics. This research presented a comprehensive framework for addressing data imbalance in colon cancer datasets, which has been a significant challenge in previous studies in terms of imbalancing and high dimensionality for the prediction of colon cancer data. Both characters are important concepts of preprocessing. Imbalancing refers to the adjusting the data points in the proper portion of the class label. Feature selection is the process of selecting the strong feature from the available dataspace. This study aims to improve the performance of the popular tree, rule, lazy (KNN) classifiers and support vector machine algorithm(SVM) after addressing the imbalancing issue of data analysis and applying various feature selection methods such as Chi-Square, Symmetrical Uncertainty , CFS Subset and Classifier subset evaluators. The proposed research framework shows that after balancing the dataset, all the algorithms performed better with all applied feature selection methods. Out of all methods Jrip records 85.71% accuracy with Classifier subset evaluators, Ridor marks 84.52 % accuracy with CFS, J48 produces 83.33% accuracy with both CFS and Classifier subset evaluators, Simple Cart notices 84.52 % with Classifier subset evaluators, KNN records 91.66% accuracy with Chi and CFS and SVM produces 92.85% with Symmetrical Uncertainty.
- 4 September 2024
- Published by Intelligence Science and Technology Press Inc. in Journal of Artificial Intelligence and Technology
Open AccessExploring the Effects of High Dimensionality and Imbalanced Data on Predictive Models for Colon Cancer Detection Using Tree, Rule, and Lazy Learning Techniques
Analyzing colon cancer data is essential for improving early detection, treatment outcomes, public health initiatives, research efforts, and overall patient care, ultimately leading to better outcomes and reduced burden associated with this disease. The prediction of any disease depends on the quality of the available dataset. Before applying the prediction algorithm it is important to analyze its characteristics. This research presented a comprehensive framework for addressing data imbalance in colon cancer datasets, which has been a significant challenge in previous studies in terms of imbalancing and high dimensionality for the prediction of colon cancer data. Both characters are important concepts of preprocessing. Imbalancing refers to the adjusting the data points in the proper portion of the class label. Feature selection is the process of selecting the strong feature from the available dataspace. This study aims to improve the performance of the popular tree, rule, lazy (KNN) classifiers and support vector machine algorithm(SVM) after addressing the imbalancing issue of data analysis and applying various feature selection methods such as Chi-Square, Symmetrical Uncertainty , CFS Subset and Classifier subset evaluators. The proposed research framework shows that after balancing the dataset, all the algorithms performed better with all applied feature selection methods. Out of all methods Jrip records 85.71% accuracy with Classifier subset evaluators, Ridor marks 84.52 % accuracy with CFS, J48 produces 83.33% accuracy with both CFS and Classifier subset evaluators, Simple Cart notices 84.52 % with Classifier subset evaluators, KNN records 91.66% accuracy with Chi and CFS and SVM produces 92.85% with Symmetrical Uncertainty.
- 24 July 2024
- Published by Springer Nature
- p. 1-10
A Mathematical Approach to Prevent and Control COVID-19 Outbreaks: The Improved M-E Model
- 24 July 2024
- Published by Springer Nature
- p. 1-10
A Mathematical Approach to Prevent and Control COVID-19 Outbreaks: The Improved M-E Model
- 16 April 2024
- Published by Springer Nature
- p. 147-156
Comparative Analysis of Machine Learning Algorithms for COVID-19 Detection and Prediction
- 16 April 2024
- Published by Springer Nature
- p. 147-156
Comparative Analysis of Machine Learning Algorithms for COVID-19 Detection and Prediction
- 31 March 2024
- Published by Springer Nature
- p. 249-259
A Comparative Study on Social Behavior of Tribes and Non Tribes in ITDA Paderu by Using Network Science
- 31 March 2024
- Published by Springer Nature
- p. 249-259
A Comparative Study on Social Behavior of Tribes and Non Tribes in ITDA Paderu by Using Network Science
- 3 October 2023
- Published by Springer Nature
- p. 545-555
Analysis of Survivable Wireless IoT Meshes Using Graph Invariant Technique
- 3 October 2023
- Published by Springer Nature
- p. 545-555
Analysis of Survivable Wireless IoT Meshes Using Graph Invariant Technique