TWTanuj Wala

Tanuj Wala

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Tanuj Wala has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • NurtureNest: an IoT–wearable predictive analytics framework for real-time maternal risk assessment

    by Deepa Rani, Tanuj Wala, Rajeev Kumar, Naveen Chauhan

    Pregnancy-related complications are increasing globally, necessitating timely and accurate risk prediction for effective clinical intervention. This paper presents NurtureNest, an internet of things-enabled machine learning framework for automated pregnancy risk assessment. The system integrates wearable sensor data from smartwatches with user-provided clinical parameters via a mobile application, enabling continuous remote monitoring. Historical clinical data are used to train multiple machine learning models for multi-class classification of pregnancy risk into low-, medium-, and high-risk categories. Ensemble learning techniques are independently trained and evaluated alongside conventional machine learning classifiers to assess their effectiveness in pregnancy risk prediction. Experimental results show that LightGBM achieves the highest performance with 92.86% test accuracy and 95.04% cross-validation accuracy. Model performance is validated using ROC analysis and feature importance evaluation. The proposed framework enables early risk detection and supports timely clinical decision-making, improving maternal healthcare outcomes.


  • Enhancing Malware Detection Accuracy Exploring Advanced Machine Learning Strategies

    by Akshat Negi, Tanuj Wala, Rajeev Kumar, Naveen Chauhan

  • DDC‐OMDC: Deadline‐based data collection using optimal mobile data collectors in Internet of Things

    by Tanuj Wala, Rajeev Kumar, Naveen Chauhan, Ajay K. Sharma

    Summary: Mobile data collectors (MDCs) are very efficient for data collection in internet of things (IoT) sensor networks. These data collectors collect data at rendezvous points to reduce data collection latency. It is paramount to determine these points in an IoT network to collect data in real time. It is important to consider IoT network characteristics to collect data on a specific deadline. First, the disconnected IoT sensor network is a real challenge in IoT applications. Second, it is essential to determine optimal data collection points (DCPs) and MDCs simultaneously to collect data in real time. In this study, Deadline‐based Data Collection using Optimal Mobile Data Collectors (DDC‐OMDC) scheme is proposed that aims to collect data in a disconnected network with the optimal number of mobile data collectors in a specific deadline for delay‐intolerant applications. DDC‐OMDC works in two phases. In the first phase, the optimal number of MDCs is determined to collect data at the optimal data collection points to guarantee one‐hop data collection from each cluster. The optimal mobile data collectors are determined using optimal DCPs, data collection stopping time, and a specific deadline. In the second phase, the optimal data collection trajectory is determined for each MDC using the nearest neighbor heuristic algorithm to collect data in real time. The simulation results show that the proposed scheme outperforms in collecting data in real time and determines optimal mobile data collectors and optimal data collection trajectory to collect data in a specific deadline for delay‐intolerant applications.


  • Identification of optimal location points for efficient data gathering in IoT environment

    by Tanuj Wala, Narottam Chand, Ajay K. Sharma

    Summary: Recent development in sensor technologies encourages the adoption of mobile data collectors (MDCs), that is, vehicles or robots, to collect data in the Internet of Things (IoT) environment. However, the slow travel speed of the MDCs leads to significant delays in the transmission of data. This work proposes an optimal region location point based route planning (ORLP‐RP) scheme to construct a shorter tour with minimized data delivery latency. Primary goal of the work is to distinguish the overlapped wireless sensor network (WSN) clusters and specify the overlapped regions to find optimal location points within each identified region to ensure one‐hop data gathering from each cluster. Thereafter, MDC trajectory is formed by using the nearest‐neighbor (NN) heuristic approach that generates a near optimal solution. In performance evaluation, the ORLP‐RP scheme has been compared with the existing algorithms such as EAPC, RDP, MOPSO, and NDCMC for data collection in terms of the number of optimal location points, total path length, data gathering latency, network lifespan, energy consumption, and data gathering ratio. Simulation results demonstrate the effectiveness of the proposed approach by improving the number of optimal location points with an average up to 58%, total path length improvement by 17%, energy consumption and network lifespan improvement on average by 18% and 12%, data gathering ratio by the MDC up to 9%, and reducing the delay of the MDC path by 21% compared with considered approaches. Thus, simulation results indicate better performance of the proposed scheme at all the indices listed above.


  • Efficient Data Collection using Mobile Sink Scheme in IoT

    by Tanuj Wala, Narottam Chand, Ajay K. Sharma

    Wireless sensor networks (WSNs) have become increasingly important in the informative development of communication technology. The growth of Internet of Things (IoT) has increased the use of WSNs in association with large scale industrial applications. The integration of WSNs with IoT is the pillar for the creation of an inescapable smart environment. A huge volume of data is being generated every day by the deployment of WSNs in smart infrastructure. The collaboration is applicable to environmental surveillance, health surveillance, transportation surveillance and many more other fields. A huge quantity of data which is obtained in various formats from varied applications is called big data. The Energy efficient big data collection requires new techniques to gather sensor-based data which is widely and densely distributed in WSNs and spread over wider geographical areas. In view of the limited range of communication and low powered sensor nodes, data gathering in WSN is a tedious task. The energy hole is another considerable issue that requires attention for efficient handling in WSN. The concept of mobile sink has been widely accepted and exploited, since it is able to effectively alleviate the energy hole problem. Scheduling a mobile sink with energy efficiency is still a challenge in WSNs time constraint implementation due to the slow speed of the mobile sink. The paper addresses the above issues and the proposal contains four-phase data collection model; the first phase is the identification of network subgroups, which are formed due to a restricted range of communication in sensor nodes in a wide network, second is clustering which is addressed on each identified subgroup for reducing energy consumption, third is efficient route planning and fourth is based on data collection. The two time-sensitive route planning schemes are presented to build a set of trajectories which satisfy the deadline constraint and minimize the overall delay. We have evaluated the performance of our schemes through simulation and compared them with the generic enhanced expectation-maximization (EEM) mobility based scenario of data collection. Simulation results reveal that our proposed schemes give much better results as compared to the generic EEM mobility approach in terms of selected performance metrics such as energy consumption, delay, network lifetime and packet delivery ratio.


  • Group Head Selection in WSN using EM Algorithm

    by Tanuj Wala, Narottam Chand, Ajay K. Sharma

    Recently wireless sensor network has become attractive field of research. A wireless sensor network (WSN) contains plenty of sensor nodes (SNs) that continuously monitor the physical phenomenon. The sensed data is cooperatively transferred through the network towards sink. In large wireless sensor network numerous nodes are deployed together to perform a task. The nodes have sensing, computing and communication features. Since the nodes are constrained in power, storage and computation, so it is necessary to deal with these issues efficiently. Therefore, a greater challenge is involved in saving energy and enhancing the lifespan of the network. Connectivity among the sensor nodes is another critical challenge in WSN due to limited communication range of sensor nodes. As a result, there arises the problem of network disconnection and huge energy consumption. The issues have been addressed in this paper and the proposal contains two phase scheme. In first phase, SGP (Spectral Graph Partitioning) technique is applied for the identification of disconnected portion of the network. Second phase is based on the improved EM (Expectation Maximization) clustering scheme for efficient cluster head and group head selection to diminish the energy consumption in the network.

  • Identification of Disconnected Components in WSN for Secure Big Data Gathering

    by Tanuj Wala, Narottam Chand, Ajay K. Sharma

    Recent technological advancements have enabled a significant evolution and grouping of wireless sensor networks (WSNs). These webs of networks are key player in Internet of Things (IoT) that generate huge amount of exponentially increasing data popularly called as big data. Gathering secure big data with energy efficiency for widely and densely distributed wireless sensor networks is mind triggering task due to restrained wireless communication range and low power nature of sensor nodes. Connectivity of sensor nodes is an important issue in wide and distributed wireless sensor network. Also the mechanism of multihop routing does not support such networks due to the problem of long transmission delays and existence of disconnectivity in networks. Due to this, there arises the problem of data loss and huge consumption of power. This paper considers the problem of identification of disconnected components in wireless sensor network. To achieve the objective Spectral Graph Partitioning (SGP) technique is used. SGP technique calculates the eigenvalues and eigenvectors for network as per the Laplacian matrix of the network graph. To detect the disconnected components in the network SGP observes the lowest eigenvalues. The given example illustrates the concept and findings of the technique being implemented to achieve the solution.