Searcharxiv⌕ Search

arXiv subjects

Indrakshi Dey

Publications and source records attributed to Indrakshi Dey.

At least 55 records · Page 3Linked to original sources

Traffic Prioritization Mechanisms for Mission and Time Critical Applications in Industrial Internet of Things

Industrial Internet of Things (IIoT) promises to revolutionize industrial operations and productions through utilizing Machine-to-Machine (M2M) communications. Since each node in such environments generates various types of data with diverse service requirements, MAC protocol holds crucial importance to ensure efficient delivery. In this context, simple to complex MAC schemes are found in literature. This paper focuses on evaluating the performance of two major techniques "slot stealing" and "packet fragmentation" for the IIoT; representative protocols SS-MAC and FROG-MAC have been chosen from each category respectively. We conducted realistic simulations for the two protocols using Contiki. Delay and packet loss comparison for SS-MAC and FROG-MAC indicates the superiority of FROG-MAC due to reduction in the waiting time for urgent traffic. Thus, a simple fragmentation scheme could be deployed for efficient scheduling of heterogenous traffic in the industrial environments.

cs.NI↗

Auction-based Adaptive Resource Allocation Optimization in Dense and Heterogeneous IoT Networks

Efficient and reliable resource allocation within densely-deployed massive IoT networks remains a key challenge due to resource constraints among low-size, weight, and power (SWaP) IoT devices and within the network and limitations of conventional centralized methods under incomplete information. We propose a novel auction-based framework for adaptive resource allocation, combining space-time-frequency spreading (STFS) techniques with Bayesian Game approaches. We introduce novel modified Simultaneous Ascending Auction (mSAA) mechanism tailored to densely-deployed and low-complexity IoT networks, enabling distributed computation and reduced power consumption. By incorporating Bayesian game-based bidding strategies and optimizing dispersion matrices for signal transmission, the proposed approach ensures enhanced channel throughput and energy efficiency. Comparative analysis against traditional auction types, including First-Price and Second-Price Sealed-Bid Auctions, as well as the Vickery-Clarke-Groves (VCG) mechanism, demonstrates the superiority of mSAA in terms of surplus maximization, revenue efficiency, and robustness in risk-prone bidding environments. Simulation results validate the model's adaptability to heterogeneous IoT nodes and its potential for dense deployment across different environments and verticals.

cs.GT↗

Epistemology-Inspired Bayesian Games for Distributed IoT Uplink Power Control

Massive number of simultaneous Internet of Things (IoT) uplinks strain gateways with interference and energy limits, yet devices often lack neighbors' Channel State Information (CSI) and cannot sustain centralized Mobile Edge Computing (MEC) or heavy Machine Learning (ML) coordination. Classical Bayesian solvers help with uncertainty but become intractable as users and strategies grow, making lightweight, distributed control essential. In this paper, we introduce the first-ever, novel epistemic Bayesian game for uplink power control under incomplete CSI that operates while suppressing interference among multiple uplink channels from distributed IoT devices firing at the same time. Nodes run inter-/intra-epistemic belief updates over opponents' strategies, replacing exhaustive expected-utility tables with conditional belief hierarchies. Using an exponential-Gamma SINR model and higher-order utility moments (variance, skewness, kurtosis), the scheme remains computationally lean with a single-round upper bound of $O\!\left(N^{2} S^{2N}\right)$. Precise power control and stronger coverage amid realistic interference: with channel magnitude equal to $1$ and a signal-to-interference-plus-noise ratio (SINR) threshold of $-18$ dB, coverage reaches approximately $60\%$ at approximately $55\%$ of the maximum transmit power; mid-rate devices with a threshold of $-27$ dB achieve full coverage with less than $0.1\%$ of the maximum transmit power.Under $80\%$ interference, a fourth-moment policy cuts average power from approximately $52\%$ to approximately $20\%$ of the maximum transmit power with comparable outage, outperforming expectation-only baselines. These results highlight a principled, computationally lean path to optimal power allocation and higher network coverage under real-world uncertainty within dense, distributed IoT networks.

eess.SY↗

Edge-to-Cloud Computations-as-a-Service in Software-Defined Energy Networks for Smart Grids

Modern power grids face an acute mismatch between where data is generated and where it can be processed: protection relays, EV (Electric Vehicle) charging, and distributed renewables demand millisecond analytics at the edge, while energy-hungry workloads often sit in distant clouds leading to missed real-time deadlines and wasted power. We address this by proposing, to our knowledge, the first-ever SDEN (Software Defined Energy Network) for CaaS (Computations-as-a-Service) that unifies edge, fog, and cloud compute with 5G URLLC (Ultra-Reliable Low-Latency Communications), SDN (Software Defined Networking), and NFV (Network Functions Virtualization) to co-optimize energy, latency, and reliability end-to-end. Our contributions are threefold: (i) a joint task offloading formulation that couples computation placement with network capacity under explicit URLLC constraints; (ii) a feasibility preserving, lightweight greedy heuristic that scales while closely tracking optimal energy and latency trade-offs; and (iii) a tiered AI (Artificial Intelligence) pipeline-reactive at the edge, predictive in the fog, strategic in the cloud-featuring privacy-preserving, federated GNNs (Graph Neural Networks) for fault detection and microgrid coordination. Unlike prior edge-only or cloud-only schemes, SDEN turns fragmented grid compute into a single, programmable substrate that delivers dependable, energy-aware, real time analytics establishing a first-ever, software defined path to practical, grid-scale CaaS.

eess.SY↗

Notes on Degeneracy and Robustness

Degeneracy is the ability of structurally different elements to perform the same function or yield the same output under certain constraints. In contrast to redundancy, which implies identical backups, degeneracy allows diverse components to step in and perform the same or similar role. Mathematically, it is about mapping multiple distinct elements into the same function. In a degenerate system, failure in one part can be compensated by others not structurally linked. System functions are distributed within the system itself or the entire network. This renders faster and more adaptive recovery. In this work, we define and formulate several novel metrics for resource fungibility to address robustness in networks (static/mobile/dynamic).

cs.NI↗

Mitigating xApp conflicts for efficient network slicing in 6G O-RAN: a graph convolutional-based attention network approach

O-RAN (Open-Radio Access Network) offers a flexible, open architecture for next-generation wireless networks. Network slicing within O-RAN allows network operators to create customized virtual networks, each tailored to meet the specific needs of a particular application or service. Efficiently managing these slices is crucial for future 6G networks. O-RAN introduces specialized software applications called xApps that manage different network functions. In network slicing, an xApp can be responsible for managing a separate network slice. To optimize resource allocation across numerous network slices, these xApps must coordinate. Traditional methods where all xApps communicate freely can lead to excessive overhead, hindering network performance. In this paper, we address the issue of xApp conflict mitigation by proposing an innovative Zero-Touch Management (ZTM) solution for radio resource management in O-RAN. Our approach leverages Multi-Agent Reinforcement Learning (MARL) to enable xApps to learn and optimize resource allocation without the need for constant manual intervention. We introduce a Graph Convolutional Network (GCN)-based attention mechanism to streamline communication among xApps, reducing overhead and improving overall system efficiency. Our results compare traditional MARL, where all xApps communicate, against our MARL GCN-based attention method. The findings demonstrate the superiority of our approach, especially as the number of xApps increases, ultimately providing a scalable and efficient solution for optimal network slicing management in O-RAN.

cs.NI↗

Distributed Time Synchronization in NOMA-Assisted Ultra-Dense Networks

Ultra-dense networks (UDNs) represent a transformative access architecture for upcoming sixth generation (6G) systems, poised to meet the surging demand for high data rates. Achieving precise synchronization across diverse base stations (BSs) is critical in these networks to mitigate inter-cell interference (ICI). However, traditional centralized synchronization approaches face substantial challenges in dense urban, including limited access to Global Positioning System (GPS), dependence on reliable backhaul, and high signaling overhead demands. This study advances a low-complexity distributed synchronization solution. A primary focus is on assessing the algorithm's accuracy incorporating the effects of information exchange delays, which are pronounced in large-networks. Recognizing the pivotal role of neighbor-gathered information in the proposed approach, this research employs uplink Non-Orthogonal Multiple Access (NOMA) to reduce message-gathering delays between transmitters (TXs) and receivers (RXs). The proposed algorithm is evaluated to assess effectiveness under exchange delays, analyzing impact of system parameters like network connectivity, size, sub-bands, etc., on synchronization speed. The findings demonstrate that the NOMA-based information-gathering technique significantly accelerates network synchronization compared to orthogonal access schemes. This advancement is crucial for meeting the low-latency requirements of beyond fifth generation (5G) systems, underscoring the potential of distributed synchronization as a cornerstone for next-generation UDN deployments.

cs.MA↗

Optimized Topology Control for IoT Networks using Graph-based Localization

The key research question we are addressing in this paper, is how local distance information can be integrated into the global structure determination, in the form of network graphs realization for IoT networks. IoT networks will be pervading every walk of life over the next few years with the aim of improving quality of life and enhancing surrounding living conditions, while balancing available resources, like energy and computational power. As we deal with massive number of heterogeneous devices contributing to each IoT network, it is of paramount importance that the IoT network topology can be designed and controlled in such a way that coverage and throughput can be maximized using a minimum number of devices, while tackling challenges like poor link quality and interference. We tackle the above-mentioned problem of topology design and control through our designed graph-realization concept. End-nodes and gateways are identified and placed within neighborhood sub-graphs and their own coordinate system, which are stitched together to form the global graph. The stitching is done in a way that transmit power and information rate are optimized while reducing error probability.

eess.SY↗

Automated Music Therapy for Anxiety and Depression Management in Older People (AMITY)

The onset of old age brings physiological and mental changes, with anxiety and depression being common mental disorders that can trigger other health issues and reduce lifespan. However, due to a global shortage of mental health professionals, combined with a growing population and limited awareness, these disorders often go undiagnosed. Music therapy offers a reliable method to address psychological, emotional, and cognitive needs. This paper presents an approach that monitors anxiety and depression symptoms in real time using low-complexity body sensors, followed by automated personalised music therapy, reducing the dependence on therapists and improving mental health care accessibility.

eess.SY↗

Quantum Game Theory meets Quantum Networks

Classical game theory is a powerful tool focusing on optimized resource distribution, allocation and sharing in classical wired and wireless networks. As quantum networks are emerging as a means of providing true connectivity between quantum computers, it is imperative and crucial to exploit game theory for addressing challenges like entanglement distribution and access, routing, topology extraction and inference for quantum networks. Quantum networks provide the promising opportunity of employing quantum games owing to their inherent capability of generating and sharing quantum states. Besides, quantum games offer enhanced payoffs and winning probabilities, new strategies and equilibria, which are unimaginable in classical games. Employing quantum game theory to solve fundamental challenges in quantum networks opens a new fundamental research direction necessitating inter-disciplinary efforts. In this article, we introduce a novel game-theoretical framework for exploiting quantum strategies to solve, as archetypal example, one of the key functionality of a quantum network, namely, the entanglement distribution. We compare the quantum strategies with classical ones by showing the quantum advantages in terms of link fidelity improvement and latency decrease in communication. In future, we will generalize our game framework to optimize entanglement distribution and access over any quantum network topology. We will also explore how quantum games can be leveraged to address other challenges like routing, optimization of quantum operations and topology design.

cs.NI↗

A Distributed Edge FLISR Solution & Network Simulation Test Platform

The energy sector is experiencing a paradigm shift with the swift adoption of distributed energy sources, renewables, electric vehicles, and an evolving consumer-utility relationship. This necessitates the strategic integration of advanced Information and Communication Technologies (ICT) and the Internet of Things (IoT) to address the emerging challenges. Grid resilience is paramount, as a dependable energy supply is the cornerstone of societal well-being and economic activity. The primary contribution of this research is to investigate the implementation of a novel grid resiliency strategy for the Irish context, employing Fault Location, Isolation and Service Restoration (FLISR) techniques in conjunction with Edge Computing. Through a comprehensive review of existing literature, original research activities, and meticulous data analysis, we aim to develop a solution that bolsters grid resilience and mitigates the impact of service disruptions for both consumers and utilities. Additionally, our work delves into the specific context of the Irish energy grid, including relevant policies and regulations, to ensure the proposed FLISR strategy is not only effective but also readily implementable.

cs.DC↗

Testing Link Fidelity in a Quantum Network using Operational Form of Trace Distance with Error Bounds

Quantum state comparison, utilizing metrics like fidelity and trace distance, underpins the assessment of quantum networks within quantum information theory. While recent research has expanded theoretical understanding, incorporating error analysis and scalability considerations remains crucial for practical applications. The primary contribution of this letter is to address these gaps by deriving the novel operational trace distance for multi-node networks, establishing a trace distance vs. fidelity benchmark incorporating error bounds, and bridging quantum operations with tensor network analysis. We further explore the application of tensor network tools to quantum networks, offering new analytical avenues. This comprehensive approach provides a robust framework for evaluating quantum network performance under realistic error conditions, facilitating the development of reliable quantum technologies.

math.QA↗

Classical Capacity of Arbitrarily Distributed Noisy Quantum Channels

With the rapid deployment of quantum computers and quantum satellites, there is a pressing need to design and deploy quantum and hybrid classical-quantum networks capable of exchanging classical information. In this context, we conduct the foundational study on the impact of a mixture of classical and quantum noise on an arbitrary quantum channel carrying classical information. The rationale behind considering such mixed noise is that quantum noise can arise from different entanglement and discord in quantum transmission scenarios, like different memories and repeater technologies, while classical noise can arise from the coexistence with the classical signal. Towards this end, we derive the distribution of the mixed noise from a classical system's perspective, and formulate the achievable channel capacity over an arbitrary distributed quantum channel in presence of the mixed noise. Numerical results demonstrate that capacity increases with the increase in the number of photons per usage.

quant-ph↗

IoT Localization and Optimized Topology Extraction Using Eigenvector Synchronization

Internet-of-Things (IoT) devices are low size, weight and power (SWaP), low complexity and include sensors, meters, wearables and trackers. Transmitting information with high signal power is exacting on device battery life, therefore an efficient link and network configuration is absolutely crucial to avoid signal power enhancement in interference-rich environment and resorting to battery-life extending strategies. Efficient network configuration can also ensure fulfilment of network performance metrics like throughput, coding rate and spectral efficiency. We formulate a novel approach of first localizing the IoT nodes and then extracting the network topology for information exchange between the nodes (devices, gateway and sinks), such that overall network throughput is maximized. The nodes are localized using noisy measurements of a subset of Euclidean distances between two nodes. Realizable subsets of neighboring devices agree with their own position within the entire network graph through eigenvector synchronization. Using communication global graph-model-based technique, network topology is constructed in terms of transmit power allocation with the aim of maximizing spatial usage and overall network throughput. This topology extraction problem is solved using the concept of linear programming.

eess.SP↗

Wavelet Packet Division Multiplexing (WPDM)-Aided Industrial WSNs

Industrial Internet-of-Things (IIoT) involve multiple groups of sensors, each group sending its observations on a particular phenomenon to a central computing platform over a multiple access channel (MAC). The central platform incorporates a decision fusion center (DFC) that arrives at global decisions regarding each set of phenomena by combining the received local sensor decisions. Owing to the diverse nature of the sensors and heterogeneous nature of the information they report, it becomes extremely challenging for the DFC to denoise the signals and arrive at multiple reliable global decisions regarding multiple phenomena. The industrial environment represents a specific indoor scenario devoid of windows and filled with different noisy electrical and measuring units. In that case, the MAC is modelled as a large-scale shadowed and slowly-faded channel corrupted with a combination of Gaussian and impulsive noise. The primary contribution of this paper is to propose a flexible, robust and highly noise-resilient multi-signal transmission framework based on Wavelet packet division multiplexing (WPDM). The local sensor observations from each group of sensors are waveform coded onto wavelet packet basis functions before reporting them over the MAC. We assume a multi-antenna DFC where the waveform-coded sensor observations can be separated by a bank of linear filters or a correlator receiver, owing to the orthogonality of the received waveforms. At the DFC we formulate and compare fusion rules for fusing received multiple sensor decisions, to arrive at reliable conclusions regarding multiple phenomena. Simulation results show that WPDM-aided wireless sensor network (WSN) for IIoT environments offer higher immunity to noise by more than 10 times over performance without WPDM in terms of probability of false detection.

eess.SP↗

Transmit Power Optimization of IoT Devices over Incomplete Channel Information

Efficient resource allocation (RA) strategies within massive and dense Internet of Things (IoT) networks is one of the major challenges in the deployment of IoT-network based smart ecosystems involving heterogeneous power-constrained IoT devices operating in varied radio and environmental conditions. In this paper, we focus on the transmit power minimization problem for IoT devices while maintaining a threshold channel throughput. The established optimization literature is not robust against the fast-fading channel and the interaction among different transmit signals in each instance. Besides, realistically, each IoT node possesses incomplete channel state information (CSI) on its neighbors, such as the channel gain being private information for the node itself. In this work, we resort to Bayesian game theoretic strategies for solving the transmit power optimization problem exploiting incomplete CSIs within massive IoT networks. We provide a steady discussion on the rationale for selecting the game theory, particularly the Bayesian scheme, with a graphical visualization of our formulated problem. We take advantage of the property of the existence and uniqueness of the Bayesian Nash equilibrium (BNE), which exhibits reduced computational complexity while optimizing transmit power and maintaining target throughput within networks comprised of heterogeneous devices.

eess.SP↗

Entanglement Distribution and Quantum Teleportation in Higher Dimension over the Superposition of Causal Orders of Quantum Channels

Multiple photonic degrees of freedom can be explored to generate high-dimensional quantum states; commonly referred to as `qudits'. Qudits offer several advantages for quantum communications, including higher information capacity, noise resilience and data throughput, and lower information loss over different propagation mediums (free space, optical fibre, underwater) as compared to conventional qubits based communication system. However, qudits have been little exploited in literature, owing to their difficulty in transmission and detection. In this paper, for the first time, we develop and formulate the theoretical framework for transmission of classical information through entanglement distribution of qudits over two quantum channels in superposition of alternative causal order. For the first time we i) engineer quantum switch operation for 2-qudit systems and ii) formulate theoretical system model for entanglement distribution of qudits via quantum switch. Results show that entanglement distribution of a qudit provides a considerable gain in fidelity even with increase in noise.

quant-ph↗

Quantum Channel Modelling by Statistical Quantum Signal Processing

In this paper we are interested to model quantum signal by statistical signal processing methods. The Gaussian distribution has been considered for the input quantum signal as Gaussian state have been proven to a type of important robust state and most of the important experiments of quantum information are done with Gaussian light. Along with that a joint noise model has been invoked, and followed by a received signal model has been formulated by using convolution of transmitted signal and joint quantum noise to realized theoretical achievable capacity of the single quantum link. In joint quantum noise model we consider the quantum Poisson noise with classical Gaussian noise. We compare the capacity of the quantum channel with respect to SNR to detect its overall tendency. In this paper we use the channel equation in terms of random variable to investigate the quantum signals and noise model statistically. These methods are proposed to develop Quantum statistical signal processing and the idea comes from the statistical signal processing.

quant-ph↗