Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Abhishek Verma 0003

dblp:54/3512-3 · DBLP profile ↗
← Back
10ranked-venue papers
2as first author
9since 2021 · last 2025
0000-0001-6687-4809ORCID · conflict

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

Computer networks · 4 · 4 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Network security · 77% Hardware security and side channels · 23%
Computer networks
1 paper
Internet of things and sensor networks · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › low-power wireless › low-power and lossy networks
6LoWPAN
0.912025
LiSec-RTF: Reinforcing RPL Resilience Against Routing Table Falsification Attack in 6LoWPAN · IEEE Trans. Mob. Comput. 2025
Network security › routing security
routing attacks
0.912025
LiSec-RTF: Reinforcing RPL Resilience Against Routing Table Falsification Attack in 6LoWPAN · IEEE Trans. Mob. Comput. 2025
Hardware security and side channels › hardware security primitives
physical unclonable function
0.312025
LiSec-RTF: Reinforcing RPL Resilience Against Routing Table Falsification Attack in 6LoWPAN · IEEE Trans. Mob. Comput. 2025

Methods — techniques the papers use, named apart from their topics

physical unclonable function · 1.7
YearPublicationVenuePosition
2025 Towards Adaptive Rule Replacement for Mitigating Inference Attacks in Serverless SDN Framework
abstract
In the rapidly evolving landscape of Software-Defined Networking (SDN), the enhancement of security measures against sophisticated cyber threats is paramount. Among these threats, inference attacks pose a significant risk by allowing adversaries to deduce the configurations and policies of SDN switches, thereby undermining the integrity and confidentiality of the network infrastructure. To address this critical issue, we introduce a novel dynamic rule replacement policy for SDN switches, leveraging the capabilities of a Support Vector Machine (SVM) for its implementation. Our approach utilizes a comprehensive set of statistical features, including duration analysis of flow rules, dispersion of packet match fields, and frequency of packet arrivals to identify patterns indicative of potential inference attacks. By dynamically adjusting the rules within SDN switches based on the analysis of these features, our policy significantly enhances the resilience of the network against such attacks. To accelerate the innovation and development of network services, this study proposes an integrated SDN architecture deployed over a serverless framework. This work serves as a starting point to enable researchers to realize the concept of modular serverless functions over traditional SDN environments. We show during inference attacks how a serverless framework improves the latency and resource utilization of the network compared to a traditional SDN framework. This study demonstrates an improvement in preventing inference attacks without compromising the performance and efficiency of the SDN infrastructure.
Ankur Mudgal, Munesh Singh, Abhishek Verma 0003, Kshira Sagar Sahoo, Paul Townend, Monowar Bhuyan
NOMS3
2025 An Intelligent Multi-Depot Vehicle Routing and Management Model for Smart Cities
abstract
In the era of crowd delivery vehicle routing and traffic management in smart cities, a complex challenge appears indistinctly, affecting both developed and developing nations worldwide. This challenging problem involves optimizing multi-depot routes while addressing various hurdles: minimizing travel time, distance, fuel consumption, and carbon emissions, all while navigating dynamic traffic congestion across diverse pathways. Existing approaches often focus on isolated aspects like shortest paths, carbon emissions, or traffic prediction, leaving the comprehensive multi-depot traffic management problem unaddressed. In response, this research work proposes an Intelligent Multi-Depot Vehicle Routing and Management (IM-VRM) model which provides a comprehensive and holistic solution. It employs a Graph Neural Network (GNN) learning-based routing with a greedy optimization to establish initial optimal pathways for multi-depot journeys. Subsequently, the IM-VRM model integrates traffic congestion prediction with green parameter computation, engaging the Dijkstra algorithm to select the most admissible routes. This consecutive steps-based travel route guidance process optimizes routing for heterogeneous vehicles, including both heavy-duty and light-duty types. It accounts for load-dependent fuel consumption, velocity, and carbon emissions. By doing so, it simplifies the complexities of multi-depot traffic routing and management. The proposed model has been rigorously evaluated using a real-world multi-depot traffic dataset, demonstrating its practical viability. Notably, IM-VRM model achieves a remarkable improvement in fuel savings, reduced carbon emissions, and shorter travel time outperforming previous state-of-the-art methods in both efficiency and precision.
Deepika Saxena, Niharika Singh, Kishu Gupta, Abhishek Verma 0003, Vinaytosh Mishra, Jitendra Kumar 0003, Ishu Gupta, Sakshi Patni, Jatinder Kumar, Ashutosh Kumar Singh 0001
IEEE Trans. Intell. Transp. Syst.4
2025 LiSec-RTF: Reinforcing RPL Resilience Against Routing Table Falsification Attack in 6LoWPAN
abstract
Routing Protocol for Low-Power and Lossy Networks (RPL) is an energy-efficient routing solution for IPv6 over Low-Power Wireless Personal Area Networks (6LoWPAN), recommended for resource-constrained devices. While RPL offers significant benefits, its security vulnerabilities pose challenges, particularly due to unauthenticated control messages used to establish and maintain routing information. These messages are susceptible to manipulation, enabling malicious nodes to inject false routing data. A notable security concern is the Routing Table Falsification (RTF) attack, where attackers forge Destination Advertisement Object (DAO) messages to promote fake routes via a parent node's routing table. Experimental results indicate that RTF attacks significantly reduce packet delivery ratio, increase end-to-end delay, and leverage power consumption. Currently, no effective countermeasures exist in the literature, reinforcing the need for a security solution to prevent network disruption and protect user applications. This paper introduces aLightweightSecurity Solution againstRoutingTableFalsification Attack (LiSec-RTF), leveraging Physical Unclonable Functions (PUFs) to generate unique authentication codes, termed “Licenses.” LiSec-RTF mitigates RTF attack impact while considering the resource limitations of 6LoWPAN devices in both static and mobile scenarios. Our testbed experiments indicate that LiSec-RTF significantly improves network performance compared to standard RPL under RTF attacks, thereby ensuring reliable and efficient operation.
Shefali Goel, Vinod Kumar Jain, Abhishek Verma 0003
IEEE Trans. Mob. Comput.3
2024 Li-MSD: A lightweight mitigation solution for DAO insider attack in RPL-based IoT
Abhishek Verma 0003, Sachin Kumar Verma, Avinash Chandra Pandey, Jyoti Grover, Girish Sharma
Future Gener. Comput. Syst.1
2024 FloRa: Flow Table Low-Rate Overflow Reconnaissance and Detection in SDN
abstract
SDN has evolved to revolutionize next-generation networks, offering programmability for on-the-fly service provisioning, primarily supported by the OpenFlow (OF) protocol. The limited storage capacity of Ternary Content Addressable Memory (TCAM) for storing flow tables in OF switches introduces vulnerabilities, notably the Low-Rate Flow Table Overflow (LOFT) attacks. LOFT exploits the flow table’s storage capacity by occupying a substantial amount of space with malicious flow, leading to a gradual degradation in the flow-forwarding performance of OF switches. To mitigate this threat, we propose FloRa, a machine learning-based solution designed for monitoring and detecting LOFT attacks in SDN. FloRa continuously examines and determines the status of the flow table by closely examining the features of the flow table entries. When suspicious activity is identified, FloRa promptly activates the machine-learning based detection module. The module monitors flow properties, identifies malicious flows, and blacklists them, facilitating their eviction from the flow table. Incorporating novel features such as Packet Arrival Frequency, Content Relevance Score, and Possible Spoofed IP along with Cat Boost employed as the attack detection method. The proposed method reduces CPU overhead, memory overhead, and classification latency significantly and achieves a detection accuracy of 99.49% which is more than the state-of-the-art methods to the best of our knowledge. This approach not only protects the integrity of the flow tables but also guarantees the uninterrupted flow of legitimate traffic. Experimental results indicate the effectiveness of FloRa in LOFT attack detection, ensuring uninterrupted data forwarding and continuous availability of flow table resources in SDN.
Ankur Mudgal, Abhishek Verma 0003, Munesh Singh, Kshira Sagar Sahoo, Erik Elmroth, Monowar Bhuyan
IEEE Trans. Netw. Serv. Manag.2
2023 A Defense Solution to Secure Low-Power and Lossy Networks Against DAO Insider Attacks
abstract
The Low-Power and Lossy Network (LLN) is the most important building block in the Internet of Things (IoT), comprising numerous tiny sensor nodes connected together. The Routing Protocol for Low-Power and Lossy Networks (RPL) is an IPv6-based protocol developed by the Internet Engineering Task Force (IETF) to facilitate routing for LLN devices. The Destination Advertisement Objects (DAOs) are transmitted from RPL nodes in the network toward the root node to construct downward routes. The malicious node exploits the DAO transmission mechanism to replay the DAO with a fixed time interval in the network in order to launch the DAO Insider attack. The DAO Insider attack causes a large number of DAO, which contributes to network congestion; as a result, data packets are delayed, and network performance is degraded. This paper proposes a defense solution that monitors DAO timestamps between child and parent nodes, flagging suspicious nodes that exceed a threshold within a time interval, blacklisting, and discarding DAOs from identified malicious nodes. Moreover, it limits the number of DAO transmitted by a child node within a specified time interval to mitigate the impact of an attack. The experiments show that the DAO insider attack has a negative impact on network performance (packet delivery ratio, average end-to-end delay, and throughput) at various DAO replay intervals. The proposed defense solution restores optimal network performance with a high detection rate.
Anil Kumar Prajapati, Emmanuel S. Pilli, Ramesh Babu Battula, Abhishek Verma 0003
TENCON4
2023 QSec-RPL: Detection of version number attacks in RPL based mobile IoT using Q-Learning
Girish Sharma, Jyoti Grover, Abhishek Verma 0003
Ad Hoc Networks3
2023 Performance evaluation of mobile RPL-based IoT networks under version number attack
Girish Sharma, Jyoti Grover, Abhishek Verma 0003
Comput. Commun.3
2023 CRA-RPL: A Novel Lightweight challenge-Response authentication-based technique for securing RPL against dropped DAO attacks
Shefali Goel, Abhishek Verma 0003, Vinod Kumar Jain
Comput. Secur.2
2019 Addressing Flooding Attacks in IPv6-based Low Power and Lossy Networks
abstract
In the RPL routing protocol, DODAG Information Solicitation (DIS) control messages are sent by nodes to join the network. In turn, the receiver node replies with DODAG Information Object (DIO) control message after resetting its trickle timer. A malicious node can utilize this RPL protocol behavior to perform the DIS flooding attack by sending illegitimate DIS frequently which forces normal nodes to reset their trickle timers and flood the network with DIO messages. In this study, we show that such attacks can severely degrade the performance of Low Power and Lossy Networks (LLNs) because of the increase in control packet overhead and power consumption. To address DIS flooding attacks, we propose a lightweight mitigation scheme that detects and mitigate such attacks in order to improve LLNs performance.
Abhishek Verma 0003, Virender Ranga
TENCON1