SearcharxivSearch

arXiv subjects

Samar Agnihotri

Publications and source records attributed to Samar Agnihotri.

At least 19 recordsLinked to original sources

Robust Representation Learning in Masked Autoencoders

Masked Autoencoders (MAEs) achieve impressive performance in image classification tasks, yet the internal representations they learn remain less understood. This work started as an attempt to understand the strong downstream classification performance of MAE. In this process we discover that representations learned with the pretraining and fine-tuning, are quite robust -- demonstrating a good classification performance in the presence of degradations, such as blur and occlusions. Through layer-wise analysis of token embeddings, we show that pretrained MAE progressively constructs its latent space in a class-aware manner across network depth: embeddings from different classes lie in subspaces that become increasingly separable. We further observe that MAE exhibits early and persistent global attention across encoder layers, in contrast to standard Vision Transformers (ViTs). To quantify feature robustness, we introduce two sensitivity indicators: directional alignment between clean and perturbed embeddings, and head-wise retention of active features under degradations. These studies help establish the robust classification performance of MAEs.

cs.LG

Pilot Assignment for Distributed Massive MIMO Based on Channel Estimation Error Minimization

Pilot contamination remains a major bottleneck in realizing the full potential of distributed massive MIMO systems. We propose two dynamic and scalable pilot assignment schemes designed for practical deployment in such networks. First, we present a low-complexity centralized scheme that sequentially assigns pilots to user equipments (UEs) to minimize the global channel estimation errors across serving access points (APs). This improves the channel estimation quality and reduces interference among UEs, enhancing the spectral efficiency. Second, we develop a fully distributed scheme that uses a priority-based pilot selection approach. In this scheme, each selected AP minimizes the channel estimation error using only local information and offers candidate pilots to the UEs. Every UE then selects a suitable pilot based on its AP priority. This approach ensures consistency and minimizes interference while significantly reducing pilot contamination. The method requires no global coordination, maintains low signaling overhead, and adapts dynamically to the UE deployment. Numerical simulations demonstrate the superiority of the proposed schemes in terms of network throughput when compared to the existing state-of-the-art schemes.

cs.NI

Adaptive Local Combining with Decentralized Decoding for Distributed Massive MIMO

Efficient uplink processing in distributed massive multiple-input multiple-output (D-mMIMO) systems requires both effective local combining and scalable decoding to significantly mitigate inter-user interference. Recent zero-forcing (ZF)-based combining schemes, such as partial full-pilot ZF (PFZF) and protected weak PFZF (PWPFZF), rely on heuristic threshold-based user grouping that may lead to inefficient utilization of spatial degrees of freedom across access points (APs). To address this limitation, we propose adaptive pilot-aware local combining strategies, generalized PFZF (G-PFZF) and generalized PWPFZF (G-PWPFZF), that dynamically allocate spatial degrees of freedom based on local channel conditions and replace heuristic grouping with a decentralized pilot-level optimization framework. Thus providing substantial performance gains over conventional PFZF and PWPFZF. Further, centralized decoding has recently emerged as a promising technique for interference suppression in D-mMIMO systems. However, it incurs substantial fronthaul overhead and computational costs. We develop a decentralized large-scale fading decoding (d-LSFD) scheme in which each AP computes LSFD weights using only locally available channel statistics. We derive a lower bound on the signal-to-interference-plus-noise ratio that explicitly quantifies the performance gap between the proposed d-LSFD scheme and centralized LSFD (c-LSFD), and identifies conditions under which the proposed decentralized solution approaches the centralized optimum. Numerical results demonstrate that the proposed generalized combining and the d-LSFD scheme together achieve significantly higher sum spectral efficiency in comparison to any combination of existing local combining and decoding schemes, while also substantially reducing the computational cost and fronthaul overhead.

cs.NI

Deterministic Scheduling over Wi-Fi 6 using Target Wake Time: An Experimental Approach

Wi-Fi networks traditionally use Distributed Coordination Function (DCF) that employs CSMA/CA along with the binary backoff mechanism for channel access. This causes unavoidable contention overheads and does not provide performance guarantees. In this work, we outline some issues that occur with the probabilistic channel access in highly congested scenarios and how those can be mitigated using deterministic scheduling. Towards this, we propose to use Target Wake Time (TWT) - a feature introduced in Wi-Fi 6 as a power-saving mechanism, to improve the performance of Wi-Fi. To gain insights into the workings of the TWT over commercially available off-the-shelf components and to analyze the factors that affect its performance, we carry out various experiments with it over our Wi-Fi 6 testbed. Using these insights and analysis, we formulate and solve an optimization problem to synthesize deterministic schedules and obtain the optimal values of various system parameters. Lastly, we configure our testbed with these optimal parameter values and show that the TWT based deterministic scheduling consistently results in better performance of the TWT-capable clients and overall system performance compared to traditional CSMA/CA based scheduling.

cs.NI

Latent Space Characterization of Autoencoder Variants

Understanding the latent spaces learned by deep learning models is crucial in exploring how they represent and generate complex data. Autoencoders (AEs) have played a key role in the area of representation learning, with numerous regularization techniques and training principles developed not only to enhance their ability to learn compact and robust representations, but also to reveal how different architectures influence the structure and smoothness of the lower-dimensional non-linear manifold. We strive to characterize the structure of the latent spaces learned by different autoencoders including convolutional autoencoders (CAEs), denoising autoencoders (DAEs), and variational autoencoders (VAEs) and how they change with the perturbations in the input. By characterizing the matrix manifolds corresponding to the latent spaces, we provide an explanation for the well-known observation that the latent spaces of CAE and DAE form non-smooth manifolds, while that of VAE forms a smooth manifold. We also map the points of the matrix manifold to a Hilbert space using distance preserving transforms and provide an alternate view in terms of the subspaces generated in the Hilbert space as a function of the distortion in the input. The results show that the latent manifolds of CAE and DAE are stratified with each stratum being a smooth product manifold, while the manifold of VAE is a smooth product manifold of two symmetric positive definite matrices and a symmetric positive semi-definite matrix.

cs.LG

Energy-and Spectral-Efficiency Trade-off in Distributed Massive-MIMO Networks

This paper investigates the energy efficiency (EE) and spectral efficiency (SE) trade-off in uplink distributed massive multiple-input multiple-output (D-mMIMO) systems. Unlike conventional approaches where power consumption focuses primarily on transmit power, we use a comprehensive system-level power consumption framework which incorporates consumption due to fronthaul signaling, distributed processing, and circuit level power, which are, themselves, critically influenced by the dynamic access point (AP) activation (ON-/OFF decisions), and AP-user equipment (UE) association strategies. Consequently, we analyze the EE-SE trade-off through the joint optimization of transmit power allocation, AP activation, and AP-UE association. We formulate an optimization problem that maximizes EE while satisfying sum-SE constraints, per-user minimum SE requirements, and fronthaul capacity limits. Our solution uses a fractional programming-based approach to simultaneously determine transmit power levels, dynamic AP-UE associations, and AP activation strategies. Numerical results demonstrate that dynamic AP activation and association substantially impact the EE-SE trade-off, revealing optimal operating points that balance spectral performance with energy consumption. The findings provide practical guidelines for energyefficient D-mMIMO deployment in next generation wireless networks, highlighting the importance of adaptive resource allocation in achieving sustainable high-performance communications.

cs.NI

Lossless Image Compression Using Multi-level Dictionaries: Binary Images

Lossless image compression is required in various applications to reduce storage or transmission costs of images, while requiring the reconstructed images to have zero information loss compared to the original. Existing lossless image compression methods either have simple design but poor compression performance, or complex design, better performance, but with no performance guarantees. In our endeavor to develop a lossless image compression method with low complexity and guaranteed performance, we argue that compressibility of a color image is essentially derived from the patterns in its spatial structure, intensity variations, and color variations. Thus, we divide the overall design of a lossless image compression scheme into three parts that exploit corresponding redundancies. We further argue that the binarized version of an image captures its fundamental spatial structure. In this first part of our work, we propose a scheme for lossless compression of binary images. The proposed scheme first learns dictionaries of $16\times16$, $8\times8$, $4\times4$, and $2\times 2$ square pixel patterns from various datasets of binary images. It then uses these dictionaries to encode binary images. These dictionaries have various interesting properties that are further exploited to construct an efficient and scalable scheme. Our preliminary results show that the proposed scheme consistently outperforms existing conventional and learning based lossless compression approaches, and provides, on average, as much as $1.5\times$ better performance than a common general purpose lossless compression scheme (WebP), more than $3\times$ better performance than a state of the art learning based scheme, and better performance than a specialized scheme for binary image compression (JBIG2).

cs.IT

Distributed Pilot Assignment for Distributed Massive-MIMO Networks

Pilot contamination is a critical issue in distributed massive MIMO networks, where the reuse of pilot sequences due to limited availability of orthogonal pilots for channel estimation leads to performance degradation. In this work, we propose a novel distributed pilot assignment scheme to effectively mitigate the impact of pilot contamination. Our proposed scheme not only reduces signaling overhead, but it also enhances fault-tolerance. Extensive numerical simulations are conducted to evaluate the performance of the proposed scheme. Our results establish that the proposed scheme outperforms existing centralized and distributed schemes in terms of mitigating pilot contamination and significantly enhancing network throughput.

cs.NI

Joint AP-UE Association and Power Factor Optimization for Distributed Massive MIMO

The uplink sum-throughput of distributed massive multiple-input-multiple-output (mMIMO) networks depends majorly on Access point (AP)-User Equipment (UE) association and power control. The AP-UE association and power control both are important problems in their own right in distributed mMIMO networks to improve scalability and reduce front-haul load of the network, and to enhance the system performance by mitigating the interference and boosting the desired signals, respectively. Unlike previous studies, which focused primarily on addressing these two problems separately, this work addresses the uplink sum-throughput maximization problem in distributed mMIMO networks by solving the joint AP-UE association and power control problem, while maintaining Quality-of-Service (QoS) requirements for each UE. To improve scalability, we present an l1-penalty function that delicately balances the trade-off between spectral efficiency (SE) and front-haul signaling load. Our proposed methodology leverages fractional programming, Lagrangian dual formation, and penalty functions to provide an elegant and effective iterative solution with guaranteed convergence. Extensive numerical simulations validate the efficacy of the proposed technique for maximizing sum-throughput while considering the joint AP-UE association and power control problem, demonstrating its superiority over approaches that address these problems individually. Furthermore, the results show that the introduced penalty function can help us effectively control the maximum front-haul load.

cs.NI

Performance Evaluation of Video Streaming Applications with Target Wake Time in Wi-Fi 6

The Target Wake Time (TWT) feature, introduced in Wi-Fi 6, was primarily meant as an advanced power save mechanism. However, it has some interesting applications in scheduling and resource allocation. TWT-based resource allocation can be used to improve the user experience for certain applications, e.g., VoIP, IoT, video streaming, etc. In this work, we analyze the packet arrival pattern for streaming traffic and develop a synthetic video streaming traffic generator that mimics real-world streaming traffic. We propose a two-stage approach where we calculate the TWT duty cycle in the first step. In the subsequent step, we determine the Multiplication Factor(MF), which jointly dictates the required TWT schedule for the synthetic traffic model. Initial testing shows that key QoS metrics can be met for sustained performance of synthetic traffic upon enabling TWT, even in the presence of peak background congestion in the network.

cs.NI

Distributed Resource Allocation for D2D Multicast in Underlay Cellular Networks

We address the problem of distributed resource allocation for multicast communication in device-to-device (D2D) enabled underlay cellular networks. The optimal resource allocation is crucial for maximizing the performance of such networks, which are limited by the severe co-channel interference between cellular users (CU) and D2D multicast groups. However, finding such optimal allocation for networks with large number of CUs and D2D users is challenging. Therefore, we propose a pragmatic scheme that allocates resources distributively, reducing signaling overhead and improving network scalability. Numerical simulations establish the efficacy of the proposed solution in improving the overall system throughout, compared to various existing schemes.

cs.NI

Multiple D2D Multicasts in Underlay Cellular Networks

Multicasting for disseminating popular data is an interesting solution for improving the energy and spectral efficiencies of cellular networks. To improve the achievable performance of such networks, underlay device-to-device (D2D) multicast communication offers a practical solution. However, despite significant potential for providing higher throughput and lower delay, implementing underlay D2D multicast communication poses several challenges, such as mutual interference among cellular users (CUs) and D2D multicast groups (MGs), and overhead signaling to provide channel state information, that may limit potential gains. We study a scenario where multiple D2D multicast groups may share a CU's uplink channel. We formulate an optimization problem to maximize the achievable system throughput while fulfilling quality of service (QoS) requirements of every CU and D2D MGs, subject to their corresponding maximum transmit power constraints. The formulated optimization problem is an instance of mixed integer non-linear programming (MINLP) problem, which is computationally intractable, in general. Therefore, to find a feasible solution, we propose a pragmatic two-step process of channel allocation and power allocation. In the first-step, we propose a channel allocation algorithm, which determines the subset of MGs that may share a channel subject to criteria based on two different parameters: interference and outage probabilities. Then, we propose an algorithm to allocate power to these MG subsets that maximizes the system throughput, while satisfying transmit power constraint. Numerical results show the efficacy of proposed approach in terms of higher achievable sum throughput and better spectrum efficiency with respect to various existing schemes.

cs.NI

D2D Multicast in Underlay Cellular Networks with Exclusion Zones

Underlay device-to-device (D2D) multicast communication has potential to improve performance of cellular networks. However, co-channel interference among cellular users (CUs) and D2D multicast groups (MGs) limits the gains of such communication. Allowing the CUs to have exclusion zones around them where no receiver of any MG can exist, is a realistic and pragmatic approach to reduce the co-channel interference of cellular transmission on D2D multicast reception. We use a stochastic geometry based approach to model this scenario. Specifically, we model the locations of CUs and D2D MG receivers with homogeneous Poisson Point Process (PPP), and Poisson Hole Process (PHP), respectively. We formulate the network sum throughput maximization problem in terms of a joint MG channel and power allocation problem with constraints on cellular and MG users maximum transmit and acceptable quality of service. We establish that the MG channel allocation problem has computational complexity that is exponential in both, the number of MGs and the number of available cellular channels. Then, we decompose this problem into two subproblems: subset selection problem and subset channel assignment problem. Based on observations and insights obtained from numerical analysis of the optimal solution of the subset selection problem in wide variety of scenarios, we propose a computationally efficient scheme that achieves almost optimal performance for the subset selection problem. We further provide a computationally efficient algorithm that achieves almost optimal performance for the subset channel assignment problem. Finally, combining these two schemes, we provide a computationally efficient and almost optimal scheme to solve the channel allocation problem, and various results and insights on the variation of the optimal system performance with respect to different system parameters

cs.NI

Energy- and Spectral- Efficiency Tradeoff for D2D-Multicasts in Underlay Cellular Networks

Underlay in-band device-to-device (D2D) multicast communication, where the same content is disseminated via direct links in a group, has the potential to improve the spectral and energy efficiencies of cellular networks. However, most of the existing approaches for this problem only address either spectral efficiency (SE) or energy efficiency (EE). We study the tradeoff between SE and EE in a single cell D2D integrated cellular network, where multiple D2D multicast groups (MGs) may share the uplink channel with multiple cellular users (CUs). We formulate the EE maximization problem with constraint on SE and maximum available transmission power. A power allocation algorithm is proposed to solve this problem and its efficacy is demonstrated via extensive numerical simulations. The tradeoff between SE and EE as a function of density of D2D MGs, and maximum transmission power of a MG is characterized.

cs.NI

Secure Analog Network Coding in Layered Networks

We consider a class of Gaussian layered networks where a source communicates with a destination through $L$ intermediate relay layers with $N$ nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions of the nodes in any one layer. The problem of maximum secrecy rate achievable with analog network coding for a unicast communication over such layered wireless relay networks with directed links is considered. A relay node performing analog network coding scales and forwards the signals received at its input. The key contribution of this work is a lemma that provides the globally optimal set of scaling factors for the nodes that maximizes the end-to-end secrecy rate for a class of layered networks. We also show that in the high-SNR regime, ANC achieves secrecy rates within a constant gap of the cutset upper bound on the secrecy capacity. To the best of our knowledge, this work offers the first characterization of the performance of secure ANC in multi-layered networks in the presence of an eavesdropper.

cs.IT

Network Simplification for Secure AF Relaying

We consider a class of Gaussian layered networks where a source communicates with a destination through L intermediate relay layers with N nodes in each layer in the presence of a single eavesdropper which can overhear the transmissions of the nodes in the last layer. For such networks we address the question: what fraction of maximum secure achievable rate can be maintained if only a fraction of available relay nodes are used in each layer? In particular, we provide upper bounds on additive and multiplicative gaps between the optimal secure AF when all N relays in each layer are used and when only k, 1 <= k < N, relays are used in each layer. We show that asymptotically (in source power), the additive gap increases at most logarithmically with ratio N/k and L, and the corresponding multiplicative gap increases at most quadratically with ratio N/k and L. To the best of our knowledge, this work offers the first characterization of the performance of network simplification in layered amplify-and-forward relay networks in the presence of an eavesdropper.

cs.IT

Secure Transmission in Amplify-and-Forward Diamond Networks with a Single Eavesdropper

Unicast communication over a network of $M$-parallel relays in the presence of an eavesdropper is considered. The relay nodes, operating under individual power constraints, amplify and forward the signals received at their inputs. The problem of the maximum secrecy rate achievable with AF relaying is addressed. Previous work on this problem provides iterative algorithms based on semidefinite relaxation. However, those algorithms result in suboptimal performance without any performance and convergence guarantees. We address this problem for three specific network models, with real-valued channel gains. We propose a novel transformation that leads to convex optimization problems. Our analysis leads to (i)a polynomial-time algorithm to compute the optimal secure AF rate for two of the models and (ii) a closed-form expression for the optimal secure rate for the other.

cs.IT

Analog Network Coding in Nonlinear Chains

The problem of characterizing the optimal rate achievable with analog network coding (ANC) for a unicast communication over general wireless relay networks is computationally hard. A relay node performing ANC scales and forwards its input signals. The source-destination channel in such communication scenarios is, in general, an intersymbol interference (ISI) channel which leads to the single-letter characterization of the optimal rate in terms of an optimization problem with nonconvex, non closed-form objective function and non-convex constraints. For a special class of such networks, called layered networks, a few key results and insights are however available. To gain insights into the nature of the optimal solution and to construct low-complexity schemes to characterize the optimal rate for general wireless relay networks, we need (1) network topologies that are regular enough to be amenable for analysis, yet general enough to capture essential characteristics of general wireless relay networks, and (2) schemes to approximate the objective function in closed-form without significantly compromising the performance. Towards these two goals, this work proposes (1) nonlinear chain networks, and (2) two approximation schemes. We show that their combination allows us to tightly characterize the optimal ANC rate with low computational complexity for a much larger class of general wireless relay networks than possible with existing schemes.

cs.IT