Lalit Kumar Awasthi

dblp:33/7489 · DBLP profile ↗
← Back
35ranked-venue papers
1as first author
24since 2021 · last 2025
0000-0001-8396-9025ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 14 · 9 since 2021Systems, architecture and hardware · 5 · 5 since 2021Artificial intelligence and machine learning · 4 · 2 since 2021Security and privacy · 4 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Enhancing IoT security: A comprehensive exploration of privacy, security measures, and advanced routing solutions
Azmera Chandu Naik, Lalit Kumar Awasthi, Priyanka R., T. P. Sharma, Aryan Verma
Comput. Networks2
2025 Adaptive Multi-Objective Virtual Machine Consolidation for Energy-Efficient Cloud Data Centers
Sahul Goyal, Lalit Kumar Awasthi
J. Grid Comput.2
2025 Security to text (S2T): multi-layered based security approaches for secret text content
Shamal Kashid, Lalit Kumar Awasthi, Krishan Berwal
Multim. Tools Appl.2
2025 VS-MSS: Visual saliency-based efficient and secure multi-secret sharing scheme over cloud storage
Arjun Singh Rawat, Maroti Deshmukh, Maheep Singh, Sandeep Chand Kumain, Lalit Kumar Awasthi
J. Supercomput.5
2024 Enhanced Hybrid Congestion Mitigation Strategy for '6LoWPAN-RPL based patient-centric IoHT'
Naveen Chauhan, Lalit Kumar Awasthi
Comput. Networks3
2024 EBWO-GE: An innovative approach to dynamic VM consolidation for cloud data centers
abstract
Summary Cloud data centers (CDCs) have revolutionized global computing by offering extensive storage and processing capabilities. Nevertheless, the environmental impact of these processes, including their substantial energy consumption and carbon emissions, calls for implementing more efficient techniques. Efficient virtual machine (VM) consolidation is crucial in optimizing resource utilization and reducing energy consumption. Current methods for enhancing energy efficiency often lead to issues such as service level agreements (SLAs) violations and quality of services (QoS) degradation. This study presents a novel approach to host selection using a grey‐extreme (GE) machine learning model, which accurately predicts over and underutilized hosts. In addition, a VM placement technique called enhanced black widow optimization (EBWO) utilizes black widow optimization heuristic techniques and a differential evolutionary approach to optimize VM placement. The proposed dynamic VM consolidation technique optimizes energy utilization while meeting strict SLA requirements and enhancing QoS metrics in CDCs. Extensive analyses were conducted using the Cloudsim toolkit to validate the approach's effectiveness. These analyses encompassed conditions such as random workloads in heterogeneous environments. The simulation results showed that GE‐EBWO outperforms other techniques and improves energy efficiency by 12%–15%. In addition, it significantly decreases VM migrations by 11%–14% compared to other advanced methods. The study validates the practicality of the proposed technique in moving towards environmentally friendly CDCs.
Sahul Goyal, Lalit Kumar Awasthi
Concurr. Comput. Pract. Exp.2
2024 Integrating semantic similarity with Dirichlet multinomial mixture model for enhanced web service clustering
Geeta Sikka, Lalit Kumar Awasthi
Knowl. Inf. Syst.3
2024 Query-based denormalization using hypergraph (QBDNH): a schema transformation model for migrating relational to NoSQL databases
Neha Bansal, Shelly Sachdeva, Lalit Kumar Awasthi
Knowl. Inf. Syst.3
2024 Machine learning in agriculture: a review of crop management applications
Ishana Attri, Lalit Kumar Awasthi, Teek Parval Sharma
Multim. Tools Appl.2
2024 Quantitative Evaluation of Extensive Vulnerability Set Using Cost Benefit Analysis
abstract
The significant expansion in network size to support new paradigms such as cloud computing, IoT (Internet of Things), etc. together with the exponential increase in vulnerabilities has challenged the existing security mechanisms greatly. These challenges have opened many avenues for research in network security. However, while attack graphs play an important role in analyzing vulnerabilities, analyzing large attack graphs itself is a major issue. Therefore, it is necessary to extract only the critical part of the attack graph. Although technologies have been developed for attack path characterization, there is a lack of hybrid technology that can differentiate between similar behavior attack paths. We have proposed a cost-based path characterization technique that takes the attack node's vulnerability complexity into account and significantly reduces the number of vulnerabilities that need to be patched to avoid the major segment of attack graph. Moreover, we have used a real network prototype to validate the performance of the proposed scheme. The proposed scheme works well in cases where some vulnerabilities have similar risk scores. To the best of our knowledge, this is the first time that a cost-effective approach for attack path analysis has been proposed.
Urvashi Bansal, Geeta Sikka, Lalit Kumar Awasthi, Bharat K. Bhargava
IEEE Trans. Dependable Secur. Comput.3
2024 Schema generation for document stores using workload-driven approach
Neha Bansal, Shelly Sachdeva, Lalit Kumar Awasthi
J. Supercomput.3
2023 Artificial Intelligence in Healthcare: Review, Ethics, Trust Challenges & Future Research Directions
Pranjal Kumar, Siddhartha Chauhan, Lalit Kumar Awasthi
Eng. Appl. Artif. Intell.3
2023 Candidate project selection in cross project defect prediction using hybrid method
Shailza Kanwar, Lalit Kumar Awasthi, Vivek Shrivastava
Expert Syst. Appl.2
2023 WGSDMM+GA: A genetic algorithm-based service clustering methodology assimilating dirichlet multinomial mixture model with word embedding
Geeta Sikka, Lalit Kumar Awasthi
Future Gener. Comput. Syst.3
2023 Underwater Wireless Sensor Networks: Enabling Technologies for Node Deployment and Data Collection Challenges
abstract
The development of underwater wireless sensor networks (UWSNs) has attracted great interest from many researchers and scientists to detect and monitor unfamiliar underwater domains. To achieve this goal, collecting data with an underwater network of sensors is primordial. Moreover, real-time information transmission needs to be achieved through efficient and enabling technologies for node deployment and data collection in UWSN. The Internet of Things (IoT) helps in real-time data transmission, and it has great potential in UWSN, i.e., the Internet of Underwater Things (IoUT). The IoUT is a modern communication ecosystem for undersea things in marine and underwater environments. Intelligent boats and ships, automatic maritime transportation, location and navigation, undersea discovery, catastrophe forecasting, and avoidance, as well as intelligent monitoring and security are all intertwined with the IoUT technology. In this article, the enabling technologies of UWSN along with several fundamental key aspects are scrupulously explained. The study aims to inquire about node deployment and data collection strategies, and then encourages researchers to lay the groundwork for new node deployment and advanced data collection techniques that enable effective underwater communication techniques. Besides different types of communication media, applications of UWSNs are also part of this article. Various existing data collection protocols based on the deployment models are simulated using network simulator (NS 2.30) to analyze and compare the performance of state-of-the-art techniques.
Monika Chaudhary, Nitin Goyal, Abderrahim Benslimane, Lalit Kumar Awasthi, Ayed Alwadain
IEEE Internet Things J.4
2023 A statistical analysis of SAMPARK dataset for peer-to-peer traffic and selfish-peer identification
Sarfaraj Alam Ansari, Kunwar Pal, Prajjval Govil, Mahesh Chandra Govil, Lalit Kumar Awasthi
Multim. Tools Appl.5
2022 Database Migration Tools: From RDB to NoSQL Database
abstract
Migration is a complex process and involves many challenges like correct schema mapping, correct data transfer, indexing, and error fixing. The objective of data migration is to enhance the overall quality and usefulness of the data. Database migration is difficult to do manually, and numerous tools have been developed to simplify the complicated task. This paper outlines the existing data migration tools present in the market. We have classified the tools into two categories: 1. Academic research-based tools, 2. Industry-driven tools. Academic researchers developed and proposed Academic research-based tools, whereas Industry-driven tools are produced by many popular organizations like Google, Amazon, IBM, and Microsoft. Thus, this study aims to contribute to the state-of-the-art database migration field, an active area of research over the past decade. Additionally, it serves as a foundation for selecting and developing relational-to-NoSQL data migration tools. This paper proposes future research directions to facilitate the broader adoption of migration tools in Academia and Industry.
Neha Bansal, Shelly Sachdeva, Lalit Kumar Awasthi
SoMeT3
2022 Ob-EID: Obstacle aware event information dissemination for SDN enabled vehicular network
Lalit Kumar Awasthi
Comput. Networks2
2022 Buffer-loss estimation to address congestion in 6LoWPAN based resource-restricted 'Internet of Healthcare Things' network
Naveen Chauhan, Narottam Chand, Lalit Kumar Awasthi
Comput. Commun.4
2022 A GA-Based Sustainable and Secure Green Data Communication Method Using IoT-Enabled WSN in Healthcare
abstract
This article proposes an optimized genetic algorithm (GA)-based sustainable and secure green data collection/transmission method for IoT-enabled WSN in healthcare by optimizing intracluster distance, systematic utilization of node’s energy, and reducing hop count. For secure transmission of data, the communication data is encrypted using stream cipher and a pseudo-randomly generated security key. Additionally, the proposed movable sink and data collection/transmission strategies shorten communication distance between sink and cluster head (CH) which diminishes the hotspot problem. The direct data collection helps in transmitting data directly to the sink, when the sinks are nearer to the sensor nodes with respect to CH. Further, the incorporated dynamic sensing range minimizes overlapping of sensing range with a significant decrement in the transmission energy. The simulation results show that the proposed protocol outperforms the existing protocols on the performance metrics, such as remaining energy, lifetime, stability period, throughput, and the number of clusters per rounds.
Samayveer Singh, Aridaman Singh Nandan, Aruna Malik, Rajeev Kumar 0007, Lalit Kumar Awasthi, Neeraj Kumar 0001
IEEE Internet Things J.5
2021 Learning-based hybrid routing for scalability in software defined networks
Amit Nayyer, Aman Kumar Sharma, Lalit Kumar Awasthi
Comput. Networks3
2021 Pr-CAI: Priority based-Context Aware Information scheduling for SDN-based vehicular network
Lalit Kumar Awasthi
Comput. Networks2
2021 An ensemble approach for optimization of penetration layout in wide area networks
Urvashi Garg, Geeta Sikka, Lalit Kumar Awasthi
Comput. Commun.3
2021 Empirical risk assessment of attack graphs using time to compromise framework
Urvashi Garg, Geeta Sikka, Lalit Kumar Awasthi
Int. J. Inf. Comput. Secur.3
2020 AdPS: Adaptive Priority Scheduling for Data Services in Heterogeneous Vehicular Networks
Lalit Kumar Awasthi
Comput. Commun.2
2020 Tunicate Swarm Algorithm: A new bio-inspired based metaheuristic paradigm for global optimization
Satnam Kaur, Lalit Kumar Awasthi, Amrit Lal Sangal, Gaurav Dhiman 0001
Eng. Appl. Artif. Intell.2
2020 Enhancing web service clustering using Length Feature Weight Method for service description document vector space representation
Geeta Sikka, Lalit Kumar Awasthi
Expert Syst. Appl.3
2020 Evaluation of web service clustering using Dirichlet Multinomial Mixture model based approach for Dimensionality Reduction in service representation
Geeta Sikka, Lalit Kumar Awasthi
Inf. Process. Manag.3
2019 Laman: A supervisor controller based scalable framework for software defined networks
Amit Nayyer, Aman Kumar Sharma, Lalit Kumar Awasthi
Comput. Networks3
2018 Empirical analysis of attack graphs for mitigating critical paths and vulnerabilities
Urvashi Garg, Geeta Sikka, Lalit Kumar Awasthi
Comput. Secur.3
2017 Incentive based scheme for improving data availability in vehicular ad-hoc networks
Brij Bihari Dubey, Naveen Chauhan, Narottam Chand, Lalit Kumar Awasthi
Wirel. Networks4
2016 Priority based efficient data scheduling technique for VANETs
Brij Bihari Dubey, Naveen Chauhan, Narottam Chand, Lalit Kumar Awasthi
Wirel. Networks4
2015 Analyzing and reducing impact of dynamic obstacles in vehicular ad-hoc networks
Brij Bihari Dubey, Naveen Chauhan, Narottam Chand, Lalit Kumar Awasthi
Wirel. Networks4
2013 A Proposal for SMS Security Using NTRU Cryptosystem
Ashok Kumar Nanda, Lalit Kumar Awasthi
QSHINE2
2007 A synchronous checkpointing protocol for mobile distributed systems: probabilistic approach
abstract
Coordinated checkpointing is a method that minimises number of processes to checkpoint for an initiation. It may require blocking of processes, extra synchronisation messages or useless checkpoints. We propose a minimum process coordinated checkpointing algorithm where the number of useless checkpoints and blocking are reduced using a probabilistic approach that computes an interacting set of processes on checkpoint initiation. A process checkpoints if the probability that it will get a checkpoint request in current initiation is high. A few processes may be blocked but they can continue their normal computation and may send messages. We also modified methodology to maintain exact dependencies.
Lalit Kumar Awasthi
Int. J. Inf. Comput. Secur.1