Veni Sundaram
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Veni Sundaram has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- A. P. Nirmala
New Horizon College of Engineering, Bangalore 560103, Karnataka
1 shared publication Divya Bharathi Selvaraj
Karpagam Academy of Higher Education
1 shared publication- Jissy Ann George
College of Administrative and Financial Services Department of Computer Science AMA International University Karpagam University Kingdom of Bahrain Coimbatore Tamil Nadu
1 shared publication - K. A. Ashika
Karpagam Academy of Higher Education
1 shared publication - P. Tamil Selvan
Karpagam Academy of Higher Education, India
1 shared publication - S. Joyce
Department of Computer Science, Karpagam Academy of Higher Education
1 shared publication
Latest Publications
- 1 April 2026
- Published by Springer Nature
- p. 185-200
Optimizing Data Augmentation, Class Weighting, and Fine-Tuning in MobileNetV3 for Indian Medicinal Leaf Classification
- 1 April 2026
- Published by Springer Nature
- p. 185-200
Optimizing Data Augmentation, Class Weighting, and Fine-Tuning in MobileNetV3 for Indian Medicinal Leaf Classification
- Open Access
- 1 March 2026
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 15 (1) , 428-437
Reputation-enhanced two-way hybrid algorithm for detecting attacks in WSN
Wireless sensor networks (WSNs) are susceptible to a variety of attacks, such as data tampering attacks, blackhole attacks, and grayhole attacks, that can affect the reliability of communication. We proposed a reputationenhanced two-way hybrid algorithm (RCHA) that uses cryptographic hash functions and reputation-based trust management to detect and de-escalate attacks accurately. The RCHA algorithm implements two hash functions RACE integrity primitives’ evaluation message digest (RIPEMD) and secure hash algorithm (SHA-3), to initiate the integrity check for the entire packet sent across the network. Every node in the WSN tracks a reputation score for each neighbor the node is connected to, and this score is dynamically updated based on the behavior of each neighbor. If a neighboring node’s reputation drops below a threshold, the node is sent a maliciousness designation. At that time, the node will broadcast an alert message to its neighboring nodes and begin to reroute its data through one of its trusted neighbors to ensure the reliability of the communication. The simulation results reported that the RCHA algorithm improved the accuracy of the attack detection rate and the number of packets delivered compared to traditional attack detection methods. The RCHA algorithm was able to maintain low computational and energy overhead for the WSN, making it an attractive option for a resource-constrained application in a WSN. Given the trends towards more collaborative networks, the reputation mechanism in the RCHA algorithm improves the overall reliability and capabilities of the WSN, regardless of adversaries.
- 1 March 2026
- Published by Institute of Advanced Engineering and Science in International Journal of Informatics and Communication Technology (IJ-ICT)
- Vol. 15 (1) , 428-437
Open AccessReputation-enhanced two-way hybrid algorithm for detecting attacks in WSN
Wireless sensor networks (WSNs) are susceptible to a variety of attacks, such as data tampering attacks, blackhole attacks, and grayhole attacks, that can affect the reliability of communication. We proposed a reputationenhanced two-way hybrid algorithm (RCHA) that uses cryptographic hash functions and reputation-based trust management to detect and de-escalate attacks accurately. The RCHA algorithm implements two hash functions RACE integrity primitives’ evaluation message digest (RIPEMD) and secure hash algorithm (SHA-3), to initiate the integrity check for the entire packet sent across the network. Every node in the WSN tracks a reputation score for each neighbor the node is connected to, and this score is dynamically updated based on the behavior of each neighbor. If a neighboring node’s reputation drops below a threshold, the node is sent a maliciousness designation. At that time, the node will broadcast an alert message to its neighboring nodes and begin to reroute its data through one of its trusted neighbors to ensure the reliability of the communication. The simulation results reported that the RCHA algorithm improved the accuracy of the attack detection rate and the number of packets delivered compared to traditional attack detection methods. The RCHA algorithm was able to maintain low computational and energy overhead for the WSN, making it an attractive option for a resource-constrained application in a WSN. Given the trends towards more collaborative networks, the reputation mechanism in the RCHA algorithm improves the overall reliability and capabilities of the WSN, regardless of adversaries.
- Open Access
- 28 March 2023
- Published by Faculty of Electrical Engineering, Computer Science and Information Technology Osijek in International journal of electrical and computer engineering systems
- Vol. 14 (3) , 259-266
Iris Biometric Watermarking for Authentication Using Multiband Discrete Wavelet Transform and Singular-Value Decomposition
The most advanced technology, watermarking enables intruders to access the database. Various techniques have been developed for information security. Watermarks and histories are linked to many biometric techniques such as fingerprints, palm positions, gait, iris and speech are recommended. Digital watermarking is the utmost successful approaches among the methods available. In this paper the multiband wavelet transforms and singular value decomposition are discussed to establish a watermarking strategy rather than biometric information. The use of biometrics instead of conservative watermarks can enhance information protection. The biometric technology being used is iris. The iris template can be viewed as a watermark, while an iris mode of communication may be used to help information security with the addition of a watermark to the image of the iris. The research involves verifying authentication against different attacks such as no attacks, Jpeg Compression, Gaussian, Median Filtering and Blurring. The Algorithm increases durability and resilience when exposed to geometric and frequency attacks. Finally, the proposed framework can be applied not only to the assessment of iris biometrics, but also to other areas where privacy is critical.
- 28 March 2023
- Published by Faculty of Electrical Engineering, Computer Science and Information Technology Osijek in International journal of electrical and computer engineering systems
- Vol. 14 (3) , 259-266
Open AccessIris Biometric Watermarking for Authentication Using Multiband Discrete Wavelet Transform and Singular-Value Decomposition
The most advanced technology, watermarking enables intruders to access the database. Various techniques have been developed for information security. Watermarks and histories are linked to many biometric techniques such as fingerprints, palm positions, gait, iris and speech are recommended. Digital watermarking is the utmost successful approaches among the methods available. In this paper the multiband wavelet transforms and singular value decomposition are discussed to establish a watermarking strategy rather than biometric information. The use of biometrics instead of conservative watermarks can enhance information protection. The biometric technology being used is iris. The iris template can be viewed as a watermark, while an iris mode of communication may be used to help information security with the addition of a watermark to the image of the iris. The research involves verifying authentication against different attacks such as no attacks, Jpeg Compression, Gaussian, Median Filtering and Blurring. The Algorithm increases durability and resilience when exposed to geometric and frequency attacks. Finally, the proposed framework can be applied not only to the assessment of iris biometrics, but also to other areas where privacy is critical.
- Open Access
Improving Privacy and Trust in Federated Identity Using SAML with Hash Based Encryption Algorithm
Cloud computing is an upcoming technology that has been designed for commercial needs. One of the major issues in cloud computing is the difficulty to manage federated identities and the trust between the user and the service providers. This paper focuses on how security can be provided between the user and the service provider and how the user information can be authenticated. For the purpose of providing privacy and authentication, Security Assertion Markup Language (SAML) based Single Sign-On is used. Security is provided by using Hash based Encryption algorithm (HBE). HBE algorithm works with the help of Key Exchange Protocol which contains poly hash function. In the algorithm, Identity providers maintain user directory and authenticates user information; service provider provides the service to users. The user has to register their details with the identity provider prior to this. During this stage, Hash based Encryption algorithm is used to provide secure communication between the identity provider and the user. In this paper we suggest that higher security can be given to user login by using an additional cryptographic technique, i.e. Hash based Encryption algorithm with the help of the Key Exchange Protocol.
Open AccessImproving Privacy and Trust in Federated Identity Using SAML with Hash Based Encryption Algorithm
Cloud computing is an upcoming technology that has been designed for commercial needs. One of the major issues in cloud computing is the difficulty to manage federated identities and the trust between the user and the service providers. This paper focuses on how security can be provided between the user and the service provider and how the user information can be authenticated. For the purpose of providing privacy and authentication, Security Assertion Markup Language (SAML) based Single Sign-On is used. Security is provided by using Hash based Encryption algorithm (HBE). HBE algorithm works with the help of Key Exchange Protocol which contains poly hash function. In the algorithm, Identity providers maintain user directory and authenticates user information; service provider provides the service to users. The user has to register their details with the identity provider prior to this. During this stage, Hash based Encryption algorithm is used to provide secure communication between the identity provider and the user. In this paper we suggest that higher security can be given to user login by using an additional cryptographic technique, i.e. Hash based Encryption algorithm with the help of the Key Exchange Protocol.
- Open Access
- 25 January 2017
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 9 (48)
An Enhanced Approach for Performance Improvement using Hybrid Optimization Algorithm with K-means++ in a Virtualized Environment
An Enhanced Approach for Performance Improvement using Hybrid Optimization Algorithm with K-means++ in a Virtualized Environment
- 25 January 2017
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 9 (48)
Open AccessAn Enhanced Approach for Performance Improvement using Hybrid Optimization Algorithm with K-means++ in a Virtualized Environment
An Enhanced Approach for Performance Improvement using Hybrid Optimization Algorithm with K-means++ in a Virtualized Environment
- Open Access
- 5 February 2016
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 9 (2)
Social Ant based Sensitive Item Hiding with Optimal Side Effects for Data Publishing
Background/Objectives: This paper proposes an Optimized Social Ant Based Sensitive Item Hiding (OSA-SIH) technique and expands the scope of quality privacy preservation for distributed data mining with optimal side effects on the original dataset. Methods/Statistical Analysis: in OSA-SIH technique, initially sensitive items for the given distributed dataset are evaluated using the social ant based relative item set distribution. Based on the evaluated dataset, optimal hiding of sensitive item is arrived with social ant based relative item set distribution even for larger item sets, ensuring time for optimal hiding. Next, sensitive item hiding is performed through multiplicative and transformational data perturbation. This data perturbation is based on socially cohesive relational rate between sensitive and non sensitive item sets, ensuring privacy preservation accuracy. The side effects on the modified dataset are checked for several users' requested item set distribution. Findings: The experimental results demonstrated that proposed technique out performed than the existing state of the art works in terms of privacy preservation accuracy, rate of side effects on the modified dataset, and time for optimal hiding. Improvement/Application: Experiments revealed that the proposed OSA-SIH technique
- 5 February 2016
- Published by Indian Society for Education and Environment in Indian Journal of Science and Technology
- Vol. 9 (2)
Open AccessSocial Ant based Sensitive Item Hiding with Optimal Side Effects for Data Publishing
Background/Objectives: This paper proposes an Optimized Social Ant Based Sensitive Item Hiding (OSA-SIH) technique and expands the scope of quality privacy preservation for distributed data mining with optimal side effects on the original dataset. Methods/Statistical Analysis: in OSA-SIH technique, initially sensitive items for the given distributed dataset are evaluated using the social ant based relative item set distribution. Based on the evaluated dataset, optimal hiding of sensitive item is arrived with social ant based relative item set distribution even for larger item sets, ensuring time for optimal hiding. Next, sensitive item hiding is performed through multiplicative and transformational data perturbation. This data perturbation is based on socially cohesive relational rate between sensitive and non sensitive item sets, ensuring privacy preservation accuracy. The side effects on the modified dataset are checked for several users' requested item set distribution. Findings: The experimental results demonstrated that proposed technique out performed than the existing state of the art works in terms of privacy preservation accuracy, rate of side effects on the modified dataset, and time for optimal hiding. Improvement/Application: Experiments revealed that the proposed OSA-SIH technique