Thangadurai Arivoli
Thangadurai Arivoli has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
N. Weste
4 shared publications- Suthendran Kannan
Kalasalingam Academy of Research and Education
4 shared publications D.J. Skellern
3 shared publications- K. Anish Pon Yamini
Department of Electronics and Communication, Arunachala College of Engineering for Women, Manavilai, India
3 shared publications M. Bickerstaff
3 shared publicationsP.J. Ryan
3 shared publications
Latest Publications
- RetractionOpen Access
- 9 March 2026
- Published by Springer Nature in Wireless Personal Communications
- Vol. 146 (S1) , 79
Retraction Note: New Approach for Advanced Energy Efficiency in MANET (AEE-M) by Improving Optimized Link State Routing Protocol Version 2 (OLSRv2)
- 9 March 2026
- Published by Springer Nature in Wireless Personal Communications
- Vol. 146 (S1) , 79
RetractionOpen AccessRetraction Note: New Approach for Advanced Energy Efficiency in MANET (AEE-M) by Improving Optimized Link State Routing Protocol Version 2 (OLSRv2)
- Retracted
- 30 March 2022
- Published by Springer Nature in Wireless Personal Communications
- Vol. 125 (3) , 2369-2392
RETRACTED ARTICLE: New Approach for Advanced Energy Efficiency in MANET (AEE-M) by Improving Optimized Link State Routing Protocol Version 2 (OLSRv2)
- 30 March 2022
- Published by Springer Nature in Wireless Personal Communications
- Vol. 125 (3) , 2369-2392
RetractedRETRACTED ARTICLE: New Approach for Advanced Energy Efficiency in MANET (AEE-M) by Improving Optimized Link State Routing Protocol Version 2 (OLSRv2)
- Open Access
- 13 February 2018
- Published by River Publishers in Journal of Cyber Security and Mobility
- Vol. 7 (1) , 39-52
Handling Selfishness over Collaborative Mechanism in a Mobile Ad hoc Network
Major constraint of Mobile ad hoc networks is unpredictable mobility and limited resources like energy consumption which may ultimately end in failure of network connectivity and performance deterioration. Almost all of the suggested techniques presume that every nodes share their memory space with full collaboration. But in realism, few nodes selfishly decide either to cooperate partially only with other nodes, or not at all. Thus, a advanced collaborative mechanism based on dissemination of selfish node awareness is suggested. Numerical results reveal that such mechanism results in better improvement in performance.
- 13 February 2018
- Published by River Publishers in Journal of Cyber Security and Mobility
- Vol. 7 (1) , 39-52
Open AccessHandling Selfishness over Collaborative Mechanism in a Mobile Ad hoc Network
Major constraint of Mobile ad hoc networks is unpredictable mobility and limited resources like energy consumption which may ultimately end in failure of network connectivity and performance deterioration. Almost all of the suggested techniques presume that every nodes share their memory space with full collaboration. But in realism, few nodes selfishly decide either to cooperate partially only with other nodes, or not at all. Thus, a advanced collaborative mechanism based on dissemination of selfish node awareness is suggested. Numerical results reveal that such mechanism results in better improvement in performance.
- 25 November 2017
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 43 (12) , 7095-7111
A Novel M-ACA-Based Tumor Segmentation and DAPP Feature Extraction with PPCSO-PKC-Based MRI Classification
- 25 November 2017
- Published by Springer Nature in Arabian Journal for Science and Engineering
- Vol. 43 (12) , 7095-7111
A Novel M-ACA-Based Tumor Segmentation and DAPP Feature Extraction with PPCSO-PKC-Based MRI Classification
- 8 October 2015
- Published by Springer Nature
- p. 85-96
Hybrid Model with Fusion Approach to Enhance the Efficiency of Keystroke Dynamics Authentication
- 8 October 2015
- Published by Springer Nature
- p. 85-96
Hybrid Model with Fusion Approach to Enhance the Efficiency of Keystroke Dynamics Authentication
- 29 June 2015
- Published by World Scientific Pub Co Pte Ltd in Fluctuation and Noise Letters
- Vol. 14 (03)
Performance Comparison of Variable Step Size Techniques of Sato and Godard-Based Blind Equalizer
The modern digital high speed wireless communication system demands quick convergence rate and low steady state error. The balancing between the demands can be achieved by opting step size. Thus, it is essential to define new algorithms to equalize channels and mitigate noise in communications. It is renowned that time varying step size blind equalization technique can speed up the convergence rate and minimize the misadjustment. This work presents a variable step size (VSS) approach based on godard blind equalization algorithm to resolve the conflict between the convergence rate and precision of the fixed step-size godard algorithm. The results of this projected approach is compared with the existing variable step size sato algorithm for a pulse amplitude modulated (PAM) input symbol.
- 29 June 2015
- Published by World Scientific Pub Co Pte Ltd in Fluctuation and Noise Letters
- Vol. 14 (03)
Performance Comparison of Variable Step Size Techniques of Sato and Godard-Based Blind Equalizer
The modern digital high speed wireless communication system demands quick convergence rate and low steady state error. The balancing between the demands can be achieved by opting step size. Thus, it is essential to define new algorithms to equalize channels and mitigate noise in communications. It is renowned that time varying step size blind equalization technique can speed up the convergence rate and minimize the misadjustment. This work presents a variable step size (VSS) approach based on godard blind equalization algorithm to resolve the conflict between the convergence rate and precision of the fixed step-size godard algorithm. The results of this projected approach is compared with the existing variable step size sato algorithm for a pulse amplitude modulated (PAM) input symbol.
- 13 May 2015
- Published by Springer Nature in Wireless Personal Communications
- Vol. 87 (2) , 315-333
Lossy Image Compression Using Multiwavelet Transform for Wireless Transmission
- 13 May 2015
- Published by Springer Nature in Wireless Personal Communications
- Vol. 87 (2) , 315-333
Lossy Image Compression Using Multiwavelet Transform for Wireless Transmission
- 1 March 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Fusion approach on keystroke dynamics to enhance the performance of password authentication
We propose in this paper a novel technique to enhance the performance of password authentication using various fusion approach on keystroke dynamics. To strengthen the password authentication, introduce additional layer of keystroke patterns used for authentication. Firstly, extract keystroke features from our database. Then calculate mean and standard deviation of keystroke features to form the template. Hybrid model based on combination of Gaussian probability density function (GPDF) and Support Vector Machine (SVM) will convert test features into scores. Lastly, four fusion rules are applied to improve the final result by fusing the GPDF and SVM scores. Best result with equal error rate of 1.612% is obtained with our database.
- 1 March 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Fusion approach on keystroke dynamics to enhance the performance of password authentication
We propose in this paper a novel technique to enhance the performance of password authentication using various fusion approach on keystroke dynamics. To strengthen the password authentication, introduce additional layer of keystroke patterns used for authentication. Firstly, extract keystroke features from our database. Then calculate mean and standard deviation of keystroke features to form the template. Hybrid model based on combination of Gaussian probability density function (GPDF) and Support Vector Machine (SVM) will convert test features into scores. Lastly, four fusion rules are applied to improve the final result by fusing the GPDF and SVM scores. Best result with equal error rate of 1.612% is obtained with our database.
- 1 February 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Lossy image compression using multiwavelet transform coding
Multiwavelets are an advance of the well established wavelet theory. The performance of the wavelets in the field of image processing is well known. Multiwavelets take wavelets a step ahead in performance. In this work the performance of the Integer Multiwavelet Transform (IMWT) for Lossy compression has been studied. The IMWT shows good performance with reconstruction of the images. This work analyses the performance of the IMWT for lossy compression of images with Magnitude set coding. The Transform coefficients are coded using the Magnitude set coding and run length Encoding techniques. The Transform coefficient matrix is coded without taking into account of the sign by using the Magnitude Set - Variable Length Integer representation. The sign information of the coefficients is coded as bit plane with zero thresholds. The Bit plane so formed can be used as it is or coded to reduce the bpp. The Simulation was done in Mat lab.
- 1 February 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Lossy image compression using multiwavelet transform coding
Multiwavelets are an advance of the well established wavelet theory. The performance of the wavelets in the field of image processing is well known. Multiwavelets take wavelets a step ahead in performance. In this work the performance of the Integer Multiwavelet Transform (IMWT) for Lossy compression has been studied. The IMWT shows good performance with reconstruction of the images. This work analyses the performance of the IMWT for lossy compression of images with Magnitude set coding. The Transform coefficients are coded using the Magnitude set coding and run length Encoding techniques. The Transform coefficient matrix is coded without taking into account of the sign by using the Magnitude Set - Variable Length Integer representation. The sign information of the coefficients is coded as bit plane with zero thresholds. The Bit plane so formed can be used as it is or coded to reduce the bpp. The Simulation was done in Mat lab.
- 1 February 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Noise and skull removal of brain magnetic resonance image using curvelet transform and mathematical morphology
Improvement in detection and evaluation of brain tumour is an important task in medical field. MRI is a technology which enables the detection, diagnosis and evaluation. An automatic detection requires pre-processed image. Preprocessing makes the image segmentation more accurate. In preprocessing the noise removal, enhancement of image, artifact removal and skull stripping are carried out. Noise can be introduced by transmission errors and compression of the images. So it is essential to apply an efficient denoising technique to compensate such data corruption. Noise removal of an image still remains a challenge because noise removal introduces artifacts and causes blurring of the images. To remove noise from the MR image there are several techniques existing. Initially the noise is removed from the MR image using curve let transform. After the noise removal the skull stripping is carried out. MR image consists of both skull and brain tissue region. Usually the tumour will be found in brain region. So, for better evaluation the skull from MR image can be removed in skull stripping. This paper aims at providing the brain MR image segmentation process which makes the diagnosis and analysis of brain tumour easier.
- 1 February 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Noise and skull removal of brain magnetic resonance image using curvelet transform and mathematical morphology
Improvement in detection and evaluation of brain tumour is an important task in medical field. MRI is a technology which enables the detection, diagnosis and evaluation. An automatic detection requires pre-processed image. Preprocessing makes the image segmentation more accurate. In preprocessing the noise removal, enhancement of image, artifact removal and skull stripping are carried out. Noise can be introduced by transmission errors and compression of the images. So it is essential to apply an efficient denoising technique to compensate such data corruption. Noise removal of an image still remains a challenge because noise removal introduces artifacts and causes blurring of the images. To remove noise from the MR image there are several techniques existing. Initially the noise is removed from the MR image using curve let transform. After the noise removal the skull stripping is carried out. MR image consists of both skull and brain tissue region. Usually the tumour will be found in brain region. So, for better evaluation the skull from MR image can be removed in skull stripping. This paper aims at providing the brain MR image segmentation process which makes the diagnosis and analysis of brain tumour easier.