NRNiveditha Rajarethinam

Niveditha Rajarethinam

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Niveditha Rajarethinam has a total of 17 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Contextual Information Based Scheduling for Service Migration in Mobile Edge Computing

    by Sanchari Saha, Iyappan Perumal, Niveditha V R, Mohamed Abbas, I. Manimozhi, C.ROhith Bhat

    Mobile Edge Computing (MEC) is a distributed computing paradigm that delivers processing and data storage capabilities closer to the network edge, which is adjacent to mobile consumers and devices. MEC lowers latency, reduces data transmission times, and improves overall performance for mobile apps by relocating computing resources to the network’s edge. But, due to higher average load and longer elapsed time, modern end devices such as smartphones and tablets cause major load challenges in mobile computing networks. Furthermore, if smartphones cause unpredictable traffic patterns, it becomes impossible to model and forecast the nature of communication. Such confusing traffic figures are caused not just by bursty Internet traffic, but also by multitasking operating systems that allow users to swiftly switch between active apps. Mobility of users and end devices impose a difficult challenge to provide continuous services in mobile computing. In this paper, this issue is addressed using the Contextual Information Based Scheduling (CIBS) technique to optimally allocate resources and provide seamless service to the users. The proposed method is implemented with NS-3, an open-source network simulator that provides a comprehensive set of modules for Mobile Edge Computing (MEC) simulations, including mobility modelling support. The experimental results show that CIBS offers migration time of 97512ms, delay time of 372115ms, execution time of 1061328ms and downtime of 98715ms. The results are compared with the existing Mobility-Aware Joint Task Scheduling (MATS) approach. The obtained results show that CIBS outperforms MATS with regard to migration time, latency, execution time and downtime.


  • FedOPT: federated learning-based heterogeneous resource recommendation and optimization for edge computing

    by Syed Thouheed Ahmed, V. Vinoth Kumar, T. R. Mahesh, L. V. Narasimha Prasad, A. K. Velmurugan, V. Muthukumaran, V. R. Niveditha


  • Open Access

    High-Performance Technique for Item Recommendation in Social Networks using Multiview Clustering

    by U.V. Anbazhagu, V. R. Niveditha, C. Rohith Bhat, Mahesh T R, Vinoth Kumar V, B. Swapna

    Recommender Systems have been widely employed in information systems over the past few decades, making it easier for each user to choose their own products based on their past behaviour. Data mining tasks and visualization tools regularly use clustering techniques in the scientific and commercial arenas. It has been shown that clustering-based methods are effective and scalable to big data sets. The accuracy and coverage of clustering-based recommender systems are, however, somewhat low. In this paper, we suggest an improved multi-view clustering method for the recommendation of items in social networks to overcome these problems. To create better partitions, the artificial Bees colony optimization algorithm (ABC) is first used to improve the initial medoids’ selection. After that, users are clustered iteratively using views of both rating patterns as well as social information using multiview clustering (MVC) (i.e. trust and friendships). Ultimately, a framework is suggested for evaluating the various options. This research study suggests a novel MVC clustering approach using the ABC optimization technique. The proposed ABC-MVC algorithm’s usefulness in terms of enhancing accuracy is demonstrated by experimental findings performed on a real-world dataset and it is observed that it performs better than the pre-existing techniques and baselines.


  • Open Access

    Water Quality Prediction Based on Hybrid Deep Learning Algorithm

    by Bhagavathi Perumal, Niveditha Rajarethinam, Anusuya Devi Velusamy, Venkatesa Prabhu Sundramurthy

    Pollution from many different sources severely affects the quality of our water supply. Over the past few years, a large number of online water quality monitoring stations have been used to gather time series data on water quality monitoring. These numbers are the foundation for deep learning techniques for forecasting water quality. In particular, typical deep learning approaches struggle to accurately estimate water quality in the presence of net promoter system (NPS) contamination. To overcome this shortcoming, a new deep learning model called long short-term memory (LSTM)gray wolf optimization (GWO)fish swarm optimization (FSO) was developed to enhance the precision of water quality prediction with NPS pollution. The well-established model may remedy the mechanism models inability to foretell changes in water quality on a minute-by-minute basis. Thamirabarani river watershed was used for the models application. Based on experimental data, the suggested model outperformed the mechanism model and the LSTM model in predicting extreme values. Maximum relative errors in anticipated against observed dissolved oxygen, chemical oxygen demand, and NH3N values were 7.58, 18.45, and 22.25, respectively. In comparison to the artificial neural network (ANN), back propagation neural network (BPNN), and recurrent neural network (RNN) models, the created LSTMGWOFSO model was shown to have greater computational performance (RNN). LSTMGWOFSO outperformed ANN, BPNN, and RNN regarding R2 of 3.138.4 improvements. The suggested approach may provide a fresh perspective when predicting water quality in the presence of NPS contamination.