Kanaka Raju Rajana
GITAM University

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

A novel Lucas-based adaptive sampling optimization for enhancing network lifetime Kanaka Raju Rajana; Shanmuk Srinivas Amiripalli
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 15, No 2: June 2026
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijict.v15i2.pp607-615

Abstract

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).
Design a Gaussian mixture-based clustering model for enhancing accuracy and robustness in smart homes Kanaka Raju Rajana; Shanmuk Srinivas Amiripalli
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 15, No 3: September 2026
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijict.v15i3.pp1047-1057

Abstract

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.