Yajamanam Kidambi Sundara Krishna
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yajamanam Kidambi Sundara Krishna has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Chinta Naga Manisha
Krishna University
2 shared publications - Donepudi Priyanka
Department of Computer Science, Krishna University, Machilipatnam, India
2 shared publications E. Sreenivasa Reddy
Acharya Nagarjuna University
2 shared publications- Arumbaka Srinivasa Rao
Assistant Professor, Department of Computer Science and Engineering, Geethanjali College of Engineering and Technology, Hyderabad, Telangana, India
1 shared publication - G. K. Mohan Devarakonda
Vishnu Institute of Technology
1 shared publication - Immidi Kali Pradeep
Vishnu Institute of Technology
1 shared publication
Latest Publications
- Open Access
- 8 April 2025
- Published by MECS Publisher in International Journal of Computer Network and Information Security
- Vol. 17 (2) , 1-18
Design of Congestion Prediction Model on Network Towers using Rough Set Theory for High Speed Low Latency Communication
Wireless communication for data and a variety of wireless interacted devices have increased dramatically in the past few years. Millimeter wave (mmWave) technology can serve the primary objectives of 5G networks, which include high data throughput and low latency. But mmWave signals for communications lacking substantial diffraction and are consequently more susceptible to obstruction by environmental physical objects, which could cause communication lines to be disrupted and congestion takes place. Wireless data transmission suffers from blockages and path loss, causes high latency as well as reduces the data transmission speed and degrades in quality performance. To overcome the limitations, Rough Set Theory with hypertuned SVM is implemented and designed the congestion prediction model based on the behaviour of network towers for low latency and high-speed data transmission. The data from the different towers is initially collected and created as a dataset. Super MICE is a technique to replace the missing data. Then, the Rough Set Theory is utilized to cluster the data into equivalent classes based on the behaviour of 5G, 4G and 3G wireless network. Hypertuned SVM with a Gazelle optimization algorithm is applied to predict the congestion level by accurately selecting the hyperparameter. By employing performance metrics, the proposed approach is examined and contrasted with existing techniques. The evaluation of performance measurements for the proposed method includes informedness attained as 91%, Adjusted Rand Index obtained value as 0.83, Jaccard as 0.737. Accuracy, precision, sensitivity, error, F1_score, and NPV are also achieved at 93%, 92%, 94%, 7%, 92%, and 90%, respectively. According to this evaluation, the proposed model is superior to perform than the earlier used existing methods.
- 8 April 2025
- Published by MECS Publisher in International Journal of Computer Network and Information Security
- Vol. 17 (2) , 1-18
Open AccessDesign of Congestion Prediction Model on Network Towers using Rough Set Theory for High Speed Low Latency Communication
Wireless communication for data and a variety of wireless interacted devices have increased dramatically in the past few years. Millimeter wave (mmWave) technology can serve the primary objectives of 5G networks, which include high data throughput and low latency. But mmWave signals for communications lacking substantial diffraction and are consequently more susceptible to obstruction by environmental physical objects, which could cause communication lines to be disrupted and congestion takes place. Wireless data transmission suffers from blockages and path loss, causes high latency as well as reduces the data transmission speed and degrades in quality performance. To overcome the limitations, Rough Set Theory with hypertuned SVM is implemented and designed the congestion prediction model based on the behaviour of network towers for low latency and high-speed data transmission. The data from the different towers is initially collected and created as a dataset. Super MICE is a technique to replace the missing data. Then, the Rough Set Theory is utilized to cluster the data into equivalent classes based on the behaviour of 5G, 4G and 3G wireless network. Hypertuned SVM with a Gazelle optimization algorithm is applied to predict the congestion level by accurately selecting the hyperparameter. By employing performance metrics, the proposed approach is examined and contrasted with existing techniques. The evaluation of performance measurements for the proposed method includes informedness attained as 91%, Adjusted Rand Index obtained value as 0.83, Jaccard as 0.737. Accuracy, precision, sensitivity, error, F1_score, and NPV are also achieved at 93%, 92%, 94%, 7%, 92%, and 90%, respectively. According to this evaluation, the proposed model is superior to perform than the earlier used existing methods.
- 26 November 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 139 (2) , 825-854
Enhancing TCP-PRN for Seamless Handoff Management in Wireless Networks Through Deep Learning and Hybrid Optimization
- 26 November 2024
- Published by Springer Nature in Wireless Personal Communications
- Vol. 139 (2) , 825-854
Enhancing TCP-PRN for Seamless Handoff Management in Wireless Networks Through Deep Learning and Hybrid Optimization
- 1 June 2017
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 227-235
Glyph Segmentation for Offline Handwritten Telugu Characters
- 1 June 2017
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 227-235
Glyph Segmentation for Offline Handwritten Telugu Characters
- Open Access
- 20 June 2016
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 9 (21)
A Multi-Class Based Algorithm for Finding Relevant Usage Patterns from Infrequent Patterns of Large Complex Data
Background/Objective: With the development of data mining techniques to analyze large amount of complex data has played an essential role in several areas like cloud computing, medical databases, geographical information retrieval, etc. The automatic evaluation of cloud patterns is a challenging task due to the large amount of interesting patterns can be extracted. However, how to find infrequent patterns is still an open issue in cloud computing. Methods: Conventional approaches are mainly depends on quantitative datasets with support and confidence measures. Due to the large amount of cloud storage data, it is very difficult to extract the weighted association rules based on the server usage statistics. Traditional techniques are implemented on the data samples with the same attribute type. Due to this fact, a multi-class algorithm is proposed to find relevant usage patterns of large complex data. Findings: Proposed approach does not rely on any probabilistic closure measures and quantitative data. This approach minimizes the database scans and optimizes the infrequent cloud patterns. Applications/Improvements: Experimental results show that, proposed work generates high quality cloud patterns compared to traditional quantitative rule mining techniques.
- 20 June 2016
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 9 (21)
Open AccessA Multi-Class Based Algorithm for Finding Relevant Usage Patterns from Infrequent Patterns of Large Complex Data
Background/Objective: With the development of data mining techniques to analyze large amount of complex data has played an essential role in several areas like cloud computing, medical databases, geographical information retrieval, etc. The automatic evaluation of cloud patterns is a challenging task due to the large amount of interesting patterns can be extracted. However, how to find infrequent patterns is still an open issue in cloud computing. Methods: Conventional approaches are mainly depends on quantitative datasets with support and confidence measures. Due to the large amount of cloud storage data, it is very difficult to extract the weighted association rules based on the server usage statistics. Traditional techniques are implemented on the data samples with the same attribute type. Due to this fact, a multi-class algorithm is proposed to find relevant usage patterns of large complex data. Findings: Proposed approach does not rely on any probabilistic closure measures and quantitative data. This approach minimizes the database scans and optimizes the infrequent cloud patterns. Applications/Improvements: Experimental results show that, proposed work generates high quality cloud patterns compared to traditional quantitative rule mining techniques.
- 6 February 2016
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 281-289
A Method of Baseline Correction for Offline Handwritten Telugu Text Lines
- 6 February 2016
- Published by Springer Nature in Advances in Intelligent Systems and Computing
- p. 281-289
A Method of Baseline Correction for Offline Handwritten Telugu Text Lines
- Open Access
- 8 July 2015
- Published by MECS Publisher in International Journal of Image, Graphics and Signal Processing
- Vol. 7 (8) , 50-57
Dual Transition Uniform Lbp Matrix for Efficient Image Retrieval
Texture image retrieval plays a significant and important role in these days, especially in the era of bigdata. The big-data is mainly represented by unstructured data like images, videos and messages etc. Efficient methods of image retrieval that reduces the complexity of the existing methods is need for the big-data era. The present paper proposes a new method of texture retrieval based on local binary pattern (LBP) approach. One of the main disadvantages of LBP is, it generates 256 different patterns on a 3x3 neighborhood and a method based on this for retrieval needs 256 comparisons which is very tedious and complex. The retrieval methods based on uniform LBP's which consists of 59 different patterns of LBP is also complex in nature. To overcome this, the present paper divided LBP into dual LBP's consisting four pixels. The present paper based on this dual LBP derived a 2-dimensional dual uniform LBP matrix (DULBPM) that contains only four entries. The texture image retrieval is performed using these four entries of DULBPM. The proposed method is evaluated on the animal fur, car, leaf and rubber textures.
- 8 July 2015
- Published by MECS Publisher in International Journal of Image, Graphics and Signal Processing
- Vol. 7 (8) , 50-57
Open AccessDual Transition Uniform Lbp Matrix for Efficient Image Retrieval
Texture image retrieval plays a significant and important role in these days, especially in the era of bigdata. The big-data is mainly represented by unstructured data like images, videos and messages etc. Efficient methods of image retrieval that reduces the complexity of the existing methods is need for the big-data era. The present paper proposes a new method of texture retrieval based on local binary pattern (LBP) approach. One of the main disadvantages of LBP is, it generates 256 different patterns on a 3x3 neighborhood and a method based on this for retrieval needs 256 comparisons which is very tedious and complex. The retrieval methods based on uniform LBP's which consists of 59 different patterns of LBP is also complex in nature. To overcome this, the present paper divided LBP into dual LBP's consisting four pixels. The present paper based on this dual LBP derived a 2-dimensional dual uniform LBP matrix (DULBPM) that contains only four entries. The texture image retrieval is performed using these four entries of DULBPM. The proposed method is evaluated on the animal fur, car, leaf and rubber textures.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 38-41
Path guiding algorithm for context based mobility model
Mobility models play key role in design and development of simulation tools that generate realistic mobility movements to study and develop algorithms and procedures for Next Generation Networks. Developing such simulation tools require a sophisticated mobility model that generates mobility patterns and a procedure for routing mobiles. This paper aims to develop path guiding algorithm in order to route a mobile from a selected source to a destination in a simulation environment to generate mobile load with appropriate mobile movements along various paths in the region/site selected for sample study. This paper also aims to build path information database which guides the mobile to appropriate paths at various junctions depends on the context of the mobile.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 38-41
Path guiding algorithm for context based mobility model
Mobility models play key role in design and development of simulation tools that generate realistic mobility movements to study and develop algorithms and procedures for Next Generation Networks. Developing such simulation tools require a sophisticated mobility model that generates mobility patterns and a procedure for routing mobiles. This paper aims to develop path guiding algorithm in order to route a mobile from a selected source to a destination in a simulation environment to generate mobile load with appropriate mobile movements along various paths in the region/site selected for sample study. This paper also aims to build path information database which guides the mobile to appropriate paths at various junctions depends on the context of the mobile.
- 18 September 2014
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 102 (8) , 5-11
Acknowledgment Time Delay Approach to Optimize TCP Performance in Hybrid Networked Systems
- 18 September 2014
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 102 (8) , 5-11
Acknowledgment Time Delay Approach to Optimize TCP Performance in Hybrid Networked Systems
- 18 April 2013
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 68 (7) , 20-25
Performance Evaluation of Routing Protocols in Wireless Mesh Networks
- 18 April 2013
- Published by Foundation of Computer Science in International Journal of Computer Applications
- Vol. 68 (7) , 20-25
Performance Evaluation of Routing Protocols in Wireless Mesh Networks