SearcharxivSearch

arXiv subjects

Nirwan Ansari

Publications and source records attributed to Nirwan Ansari.

At least 19 recordsLinked to original sources

Cognitive Graph Intelligence for Adaptive and Robust DDoS Attack Detection in Next Generation Networks

Distributed Denial-of-Service (DDoS) attacks threaten network availability, requiring a cognitive detection process that senses traffic, infers intent, and supports an adaptive response under severe class imbalance and non-stationary conditions. This paper proposes a Graph-based Generative Adversarial Network (GraphGAN) that serves as the cognitive detection engine for this task. GraphGAN captures the relational structure among traffic flows while addressing imbalance through adversarial generation of synthetic samples. Sequential flows are converted into $k$-nearest neighbor graphs using sliding windows to preserve feature-similarity and temporal dependencies among flows. The generator learns the distribution of DDoS attacks to synthesize realistic minority samples, while a Graph Convolutional Network (GCN)-based discriminator distinguishes real from synthetic graph data. A separate GCN classifier, trained on the balanced dataset, performs the final detection decision. Evaluations on four benchmark datasets show that GraphGAN achieves superior accuracy, precision, and recall compared to state-of-the-art approaches, particularly in data-scarce scenarios. By integrating temporal graph construction, adversarial augmentation, and GCN classification, GraphGAN effectively models coordinated attack behaviors and mitigates class imbalance, providing a robust and topology-aware solution for intrusion detection in data-constrained environments.

cs.AI

On Understanding, Identifying, and Mitigating Vulnerabilities in Agentic Large Language Models

Large Language Models (LLMs) have undergone a shift from stateless conversational interfaces to autonomous agents capable of multi-step planning, tool invocation, code execution, and maintaining persistent memory. When these agents operate with real-world privileges---calling APIs, modifying files, and querying databases---a compromised reasoning step can trigger unauthorized data access, irreversible state changes, or cascading failures, yet the security research community has not kept pace. To quantify the state of the field, we conducted a systematic literature review under PRISMA 2020 guidelines across six databases, screening 743 records and retaining 85 papers (2023--2025) on agentic LLM security. Attack research outpaces defense work by 3.9:1. Perception-layer vulnerabilities (prompt injection, jailbreaking, adversarial perturbations) dominate, accounting for 66\% of papers, while action-layer vulnerabilities (tool misuse, code injection, sandbox escape) appear in only 4.7\%, misaligned with real-world risk. Code execution security accounts for 3.5\%, and tool-augmented agents 12\%. We contribute a four-layer taxonomy mapping 13 vulnerability types across perception, brain, action, and interaction layers, and identify seven open problems centered on containment. Agentic LLM insecurity stems from architectural coupling, where weak isolation allows vulnerabilities to propagate across layers.

cs.CR

The Containment Gap: How Deployed Agentic AI Frameworks Fail Public-Facing Safety Requirements

Agentic large language model systems that autonomously invoke tools, maintain persistent memory, and execute multi-step plans are increasingly deployed in public-facing domains, including government services, healthcare triage, and financial advising. We ask whether the frameworks used to build these systems provide architectural-level structural safety guarantees. Applying six containment principles derived from a compositional model of agentic architectures, we audit three dominant frameworks (LangChain, AutoGPT, and OpenAI Agents SDK) and find no native compliance in any of them. Memory integrity, a defense against one of the most prevalent vulnerability classes, is not observed in any of the three evaluated frameworks. We validate these findings empirically: in a simulated government benefits agent built on LangChain, a single memory-poisoning write induces persistent targeted corruption across all tested seeds and backends, increasing the wrongful denial rate for targeted applicants to 88.9%. Under a complex five-factor policy, the same attack preserves aggregate accuracy while increasing targeted wrongful denials by 3.5x, rendering the corruption difficult to detect through standard monitoring. We then introduce two lightweight containment mechanisms: a memory integrity validator and a policy gate, which eliminate both attack vectors with sub-millisecond overhead (<0.2ms per call). We conclude that the current agentic framework ecosystem may not yet meet secure-by-default expectations for public-facing deployments and outline priority architectural interventions to enable trustworthy deployment in high-stakes, socially impactful applications.

cs.AI

ParkingTwin: Training-Free Streaming 3D Reconstruction for Parking-Lot Digital Twins

High-fidelity parking-lot digital twins provide essential priors for path planning, collision checking, and perception validation in Automated Valet Parking (AVP). Yet robot-oriented reconstruction faces a trilemma: sparse forward-facing views cause weak parallax and ill-posed geometry; dynamic occlusions and extreme lighting hinder stable texture fusion; and neural rendering typically needs expensive offline optimization, violating edge-side streaming constraints. We propose ParkingTwin, a training-free, lightweight system for online streaming 3D reconstruction. First, OSM-prior-driven geometric construction uses OpenStreetMap semantic topology to directly generate a metric-consistent TSDF, replacing blind geometric search with deterministic mapping and avoiding costly optimization. Second, geometry-aware dynamic filtering employs a quad-modal constraint field (normal/height/depth consistency) to reject moving vehicles and transient occlusions in real time. Third, illumination-robust fusion in CIELAB decouples luminance and chromaticity via adaptive L-channel weighting and depth-gradient suppression, reducing seams under abrupt lighting changes. ParkingTwin runs at 30+ FPS on an entry-level GTX 1660. On a 68,000 m^2 real-world dataset, it achieves SSIM 0.87 (+16.0%), delivers about 15x end-to-end speedup, and reduces GPU memory by 83.3% compared with state-of-the-art 3D Gaussian Splatting (3DGS) that typically requires high-end GPUs (RTX 4090D). The system outputs explicit triangle meshes compatible with Unity/Unreal digital-twin pipelines. Project page: https://mihoutao-liu.github.io/ParkingTwin/

cs.CV

Self-Supervised Learning for User Localization

Machine learning techniques have shown remarkable accuracy in localization tasks, but their dependency on vast amounts of labeled data, particularly Channel State Information (CSI) and corresponding coordinates, remains a bottleneck. Self-supervised learning techniques alleviate the need for labeled data, a potential that remains largely untapped and underexplored in existing research. Addressing this gap, we propose a pioneering approach that leverages self-supervised pretraining on unlabeled data to boost the performance of supervised learning for user localization based on CSI. We introduce two pretraining Auto Encoder (AE) models employing Multi Layer Perceptrons (MLPs) and Convolutional Neural Networks (CNNs) to glean representations from unlabeled data via self-supervised learning. Following this, we utilize the encoder portion of the AE models to extract relevant features from labeled data, and finetune an MLP-based Position Estimation Model to accurately deduce user locations. Our experimentation on the CTW-2020 dataset, which features a substantial volume of unlabeled data but limited labeled samples, demonstrates the viability of our approach. Notably, the dataset covers a vast area spanning over 646x943x41 meters, and our approach demonstrates promising results even for such expansive localization tasks.

eess.SP

Jamming Modulation: An Active Anti-Jamming Scheme

Providing quality communications under adversarial electronic attacks, e.g., broadband jamming attacks, is a challenging task. Unlike state-of-the-art approaches which treat jamming signals as destructive interference, this paper presents a novel active anti-jamming (AAJ) scheme for a jammed channel to enhance the communication quality between a transmitter node (TN) and receiver node (RN), where the TN actively exploits the jamming signal as a carrier to send messages. Specifically, the TN is equipped with a programmable-gain amplifier, which is capable of re-modulating the jamming signals for jamming modulation. Considering four typical jamming types, we derive both the bit error rates (BER) and the corresponding optimal detection thresholds of the AAJ scheme. The asymptotic performances of the AAJ scheme are discussed under the high jamming-to-noise ratio (JNR) and sampling rate cases. Our analysis shows that there exists a BER floor for sufficiently large JNR. Simulation results indicate that the proposed AAJ scheme allows the TN to communicate with the RN reliably even under extremely strong and/or broadband jamming. Additionally, we investigate the channel capacity of the proposed AAJ scheme and show that the channel capacity of the AAJ scheme outperforms that of the direct transmission when the JNR is relatively high.

cs.IT

AI in 6G: Energy-Efficient Distributed Machine Learning for Multilayer Heterogeneous Networks

Adept network management is key for supporting extremely heterogeneous applications with stringent quality of service (QoS) requirements; this is more so when envisioning the complex and ultra-dense 6G mobile heterogeneous network (HetNet). From both the environmental and economical perspectives, non-homogeneous QoS demands obstruct the minimization of the energy footprints and operational costs of the envisioned robust networks. As such, network intelligentization is expected to play an essential role in the realization of such sophisticated aims. The fusion of artificial intelligence (AI) and mobile networks will allow for the dynamic and automatic configuration of network functionalities. Machine learning (ML), one of the backbones of AI, will be instrumental in forecasting changes in network loads and resource utilization, estimating channel conditions, optimizing network slicing, and enhancing security and encryption. However, it is well known that ML tasks themselves incur massive computational burdens and energy costs. To overcome such obstacles, we propose a novel layer-based HetNet architecture which optimally distributes tasks associated with different ML approaches across network layers and entities; such a HetNet boasts multiple access schemes as well as device-to-device (D2D) communications to enhance energy efficiency via collaborative learning and communications.

cs.NI

Smart Traffic Monitoring System using Computer Vision and Edge Computing

Traffic management systems capture tremendous video data and leverage advances in video processing to detect and monitor traffic incidents. The collected data are traditionally forwarded to the traffic management center (TMC) for in-depth analysis and may thus exacerbate the network paths to the TMC. To alleviate such bottlenecks, we propose to utilize edge computing by equipping edge nodes that are close to cameras with computing resources (e.g. cloudlets). A cloudlet, with limited computing resources as compared to TMC, provides limited video processing capabilities. In this paper, we focus on two common traffic monitoring tasks, congestion detection, and speed detection, and propose a two-tier edge computing based model that takes into account of both the limited computing capability in cloudlets and the unstable network condition to the TMC. Our solution utilizes two algorithms for each task, one implemented at the edge and the other one at the TMC, which are designed with the consideration of different computing resources. While the TMC provides strong computation power, the video quality it receives depends on the underlying network conditions. On the other hand, the edge processes very high-quality video but with limited computing resources. Our model captures this trade-off. We evaluate the performance of the proposed two-tier model as well as the traffic monitoring algorithms via test-bed experiments under different weather as well as network conditions and show that our proposed hybrid edge-cloud solution outperforms both the cloud-only and edge-only solutions.

cs.CV

Machine Learning-based Signal Detection for PMH Signals in Load-modulated MIMO System

Phase Modulation on the Hypersphere (PMH) is a power efficient modulation scheme for the \textit{load-modulated} multiple-input multiple-output (MIMO) transmitters with central power amplifiers (CPA). However, it is difficult to obtain the precise channel state information (CSI), and the traditional optimal maximum likelihood (ML) detection scheme incurs high complexity which increases exponentially with the number of antennas and the number of bits carried per antenna in the PMH modulation. To detect the PMH signals without knowing the prior CSI, we first propose a signal detection scheme, termed as the hypersphere clustering scheme based on the expectation maximization (EM) algorithm with maximum likelihood detection (HEM-ML). By leveraging machine learning, the proposed detection scheme can accurately obtain information of the channel from a few of the received symbols with little resource cost and achieve comparable detection results as that of the optimal ML detector. To further reduce the computational complexity in the ML detection in HEM-ML, we also propose the second signal detection scheme, termed as the hypersphere clustering scheme based on the EM algorithm with KD-tree detection (HEM-KD). The CSI obtained from the EM algorithm is used to build a spatial KD-tree receiver codebook and the signal detection problem can be transformed into a nearest neighbor search (NNS) problem. The detection complexity of HEM-KD is significantly reduced without any detection performance loss as compared to HEM-ML. Extensive simulation results verify the effectiveness of our proposed detection schemes.

cs.IT

Backhaul-aware Uplink Communications in Full-Duplex DBS-aided HetNets

Drone-mounted base stations (DBSs) are promising solutions to provide ubiquitous connections to users and support many applications in the fifth generation of mobile networks while full duplex communications has the potential to improve the spectrum efficiency. In this paper, we have investigated the backhaul-aware uplink communications in a full-duplex DBS-aided HetNet (BUD) problem with the objective to maximize the total throughput of the network, and this problem is decomposed into two sub-problems: the DBS Placement problem (including the vertical dimension and horizontal dimensions) and the joint UE association, power and bandwidth assignment (Joint-UPB) problem. Since the BUD problem is NP-hard, we propose approximation algorithms to solve the sub-problems and another, named the AA-BUD algorithm, to solve the BUD problem with guaranteed performance. The performance of the AA-BUD algorithm has been demonstrated via extensive simulations, and it is superior to two benchmark algorithms with up to 45.8% throughput improvement.

cs.NI

Learning-Assisted Secure End-to-End Network Slicing for Cyber-Physical Systems

There is a pressing need to interconnect physical systems such as power grid and vehicles for efficient management and safe operations. Owing to the diverse features of physical systems, there is hardly a one-size-fits-all networking solution for developing cyber-physical systems. Network slicing is a promising technology that allows network operators to create multiple virtual networks on top of a shared network infrastructure. These virtual networks can be tailored to meet the requirements of different cyber-physical systems. However, it is challenging to design secure network slicing solutions that can efficiently create end-to-end network slices for diverse cyber-physical systems. In this article, we discuss the challenges and security issues of network slicing, study learning-assisted network slicing solutions, and analyze their performance under the denial-of-service attack. We also present a design and implementation of a small-scale testbed for evaluating the network slicing solutions.

cs.NI

Beam with Adaptive Divergence Angle in Free-Space Optical Communications for High-Speed Trains

In this paper, we propose an adaptive beam that adapts its divergence angle according to the receiver aperture diameter and the communication distance to improve the received power and ease the alignment between the communicating optical transceivers in a free-space optical communications (FSOC) system for high-speed trains (HSTs). We compare the received power, signal-to-noise ratio, bit error rate, and the maximum communication distance of the proposed adaptive beam with a beam that uses a fixed divergence angle of 1 mrad. The proposed adaptive beam yields a higher received power with an increase of 33 dB in average over the fixed-divergence beam under varying visibility conditions and distance. Moreover, the proposed adaptive divergence angle extends the communication distance of a FSOC system for HSTs to about three times under different visibility conditions as compared to a fixed divergence beam. We also propose a new ground transceiver placement that places the ground transceivers of a FSOC system for HSTs on gantries placed above the train passage instead of placing them next to track. The proposed transceiver placement provides a received-power increase of 3.8 dB in average over the conventional placement of ground-station transceivers next to the track.

eess.SP

NOMA Aided Narrowband IoT for Machine Type Communications with User Clustering

To support Machine Type Communications (MTC) in next generation mobile networks, NarrowBand-IoT (NB-IoT) has been released by the Third Generation Partnership Project (3GPP) as a promising solution to provide extended coverage and low energy consumption for low cost MTC devices. However, the existing Orthogonal Multiple Access (OMA) scheme in NB-IoT cannot provide connectivity for a massive number of MTC devices. In parallel with the development of NB-IoT, Non-Orthogonal Multiple Access (NOMA), introduced for the fifth generation wireless networks, is deemed to significantly improve the network capacity by providing massive connectivity through sharing the same spectral resources. To leverage NOMA in the context of NB-IoT, we propose a power domain NOMA scheme with user clustering for an NB-IoT system. In particular, the MTC devices are assigned to different ranks within the NOMA clusters where they transmit over the same frequency resources. Then, we formulate an optimization problem to maximize the total throughput of the network by optimizing the resource allocation of MTC devices and NOMA clustering while satisfying the transmission power and quality of service requirements. We prove the NP-hardness of the proposed optimization problem. We further design an efficient heuristic algorithm to solve the proposed optimization problem by jointly optimizing NOMA clustering and resource allocation of MTC devices. Furthermore, we prove that the reduced optimization problem of power control is a convex optimization task. Simulation results are presented to demonstrate the efficiency of the proposed scheme.

cs.NI

A Hybrid RF-VLC System for Energy Efficient Wireless Access

In this paper, we propose a new paradigm in designing and realizing energy efficient wireless indoor access networks, namely, a hybrid system enabled by traditional RF access, such as WiFi, as well as the emerging visible light communication (VLC). VLC facilitates the great advantage of being able to jointly perform illumination and communications, and little extra power beyond illumination is required to empower communications, thus rendering wireless access with almost zero power consumption. On the other hand, when illumination is not required from the light source, the energy consumed by VLC could be more than that consumed by the RF. By capitalizing on the above properties, the proposed hybrid RF-VLC system is more energy efficient and more adaptive to the illumination conditions than the individual VLC or RF systems. To demonstrate the viability of the proposed system, we first formulate the problem of minimizing the power consumption of the hybrid RF-VLC system while satisfying the users requests and maintaining acceptable level of illumination, which is NP-complete. Therefore, we divide the problem into two subproblems. In the first subproblems, we determine the set of VLC access points (AP) that needs to be turned on to satisfy the illumination requirements. Given this set, we turn our attention to satisfying the users' requests for real-time communications, and we propose a randomized online algorithm that, against an oblivious adversary, achieves a competitive ratio of $\log(N)\log(M)$ with probability of success $1 - \frac{1}{N}$, where $N$ is the number of users and $M$ is the number of VLC and RF APs. We also show that the best online algorithm to solve this problem can achieve a competitive ratio of $\log(M)$. Simulation results further demonstrate the advantages of the hybrid system.

cs.NI

Energy Efficient Resource Allocation in EH-enabled CR Networks for IoT

With the rapid growth of Internet of Things (IoT) devices, the next generation mobile networks demand for more operating frequency bands. By leveraging the underutilized radio spectrum, the cognitive radio (CR) technology is considered as a promising solution for spectrum scarcity problem of IoT applications. In parallel with the development of CR techniques, Wireless Energy Harvesting (WEH) is considered as one of the emerging technologies to eliminate the need of recharging or replacing the batteries for IoT and CR networks. To this end, we propose to utilize WEH for CR networks in which the CR devices are not only capable of sensing the available radio frequencies in a collaborative manner but also harvesting the wireless energy transferred by an Access Point (AP). More importantly, we design an optimization framework that captures a fundamental tradeoff between energy efficiency (EE) and spectral efficiency (SE) of the network. In particular, we formulate a Mixed Integer Nonlinear Programming (MINLP) problem that maximizes EE while taking into consideration of users' buffer occupancy, data rate fairness, energy causality constraints and interference constraints. We further prove that the proposed optimization framework is an NP-Hard problem. Thus, we propose a low complex heuristic algorithm, called INSTANT, to solve the resource allocation and energy harvesting optimization problem. The proposed algorithm is shown to be capable of achieving near optimal solution with high accuracy while having polynomial complexity. The efficiency of our proposal is validated through well designed simulations.

cs.NI

Hierarchical Capacity Provisioning for Fog Computing

The concept of fog computing is centered around providing computation resources at the edge of network, thereby reducing the latency and improving the quality of service. However, it is still desirable to investigate how and where at the edge of the network the computation capacity should be provisioned. To this end, we propose a hierarchical capacity provisioning scheme. In particular, we consider a two-tier network architecture consisting of shallow and deep cloudlets and explore the benefits of hierarchical capacity based on queueing analysis. Moreover, we explore two different network scenarios in which the network delay between the two tiers is negligible as well as the case that the deep cloudlet is located somewhere deeper in the network and thus the delay is significant. More importantly, we model the first network delay scenario with bufferless shallow cloudlets as well as the second scenario with finite-size buffer shallow cloudlets, and formulate an optimization problem for each model. We also use stochastic ordering to solve the optimization problem formulated for the first model and an upper bound based technique is proposed for the second model. The performance of the proposed scheme is evaluated via simulations in which we show the accuracy of the proposed upper bound technique as well as the queue length estimation approach for both randomly generated input and real trace data.

cs.NI

Distributed Energy and Resource Management for Full-Duplex Dense Small Cells for 5G

We consider a multi-carrier and densely deployed small cell network, where small cells are powered by renewable energy source and operate in a full-duplex mode. We formulate an energy and traffic aware resource allocation optimization problem, where a joint design of the beamformers, power and sub-carrier allocation, and users scheduling is proposed. The problem minimizes the sum data buffer lengths of each user in the network by using the harvested energy. A practical uplink user rate-dependent decoding energy consumption is included in the total energy consumption at the small cell base stations. Hence, harvested energy is shared with both downlink and uplink users. Owing to the non-convexity of the problem, a faster convergence sub-optimal algorithm based on successive parametric convex approximation framework is proposed. The algorithm is implemented in a distributed fashion, by using the alternating direction method of multipliers, which offers not only the limited information exchange between the base stations, but also fast convergence. Numerical results advocate the redesigning of the resource allocation strategy when the energy at the base station is shared among the downlink and uplink transmissions.

eess.SP

Energy-Aware Virtual Machine Management in Inter-datacenter Networks over Elastic Optical Infrastructure

Datacenters (DCs), deployed in a large scale to support the ever increasing demand for data processing applications, consume tremendous energy. Powering DCs with renewable energy can effectively reduce the brown energy consumption. Owing to geographically distributed deployment of DCs, the renewable energy generation and the data processing demands usually vary in different DCs. Migrating virtual machines (VMs) among DCs according to the availability of renewable energy helps match the energy demands and the renewable energy generation in DCs, and thus maximizes the utilization of renewable energy. We first elicit the renewable energy-aware inter-datacenter (inter-DC) VM migration problem in an inter-DC network over the elastic optical infrastructure, present it as a many-manycast communications problem, and then formulate it as an integer linear programming problem. The objective is to minimize the total cost of the brown energy consumption of DCs in such inter-DC network via VM migration. We use CVX and Gurobi to solve this problem for small network configurations, and we propose a few heuristic algorithms that approximate the optimal solution for large network configurations. Through extensive simulations, we show that the proposed algorithms, by migrating VM among DCs, can reduce up to 19.7% cost of the brown energy consumption.

cs.NI