SSShamik Sarkar

Shamik Sarkar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Shamik Sarkar has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Review of: "Deep Learning-Based CKM Construction with Image Super-Resolution"

    by Shamik Sarkar

    STRENGTHS: * The paper has drawn an interesting analogy between CKM construction from sparse data and image super-resolution. It adapts the SRResNet architecture for CKM construction. * The same method has been applied to path loss maps and angle...

  • RadYOLOLet: Radar Detection and Parameter Estimation Using YOLO and WaveLet

    by Shamik Sarkar, Dongning Guo, Danijela Cabric

    In emerging and future shared-spectrum wireless networks like Citizens Broadband Radio Service (CBRS), the ability to detect radar signals without assistance from the radar transmitter is of paramount importance. This paper presents RadYOLOLet, a novel supervised deep learning-based spectrum sensing approach designed to detect low-power radar signals in the presence of interference and estimate the radar signal parameters. RadYOLOLet employs two independently trained convolutional neural networks, RadYOLO and Wavelet-CNN. RadYOLO operates on spectrograms and provides most of the capabilities of RadYOLOLet unless the signal-to-noise-and-interference ratio (SINR) is very low. In such cases, Wavelet-CNN is utilized to operate on the continuous wavelet transform of the captured signals, enhancing the detection outcome. The performance of RadYOLOLet is evaluated through various experiments using different types of interference signals. The results indicate that RadYOLOLet maintains accurate radar detection performance for SINRs of 16 dB or higher for all five types of radar signals considered, which surpasses the capabilities of other comparable methods.


  • Joint User Association and Beam Scheduling With Interference Management in Dense Millimeter-Wave Networks

    by Veljko Boljanovic, Shamik Sarkar, Danijela Cabric

    Hybrid arrays enable millimeter-wave (mmW) base stations and users to steer multiple beams simultaneously. However, in dense mmW networks with small inter-site distances and many users, a large number of serving beams can lead to significant inter- and intra-cell interference that prevents data-hungry users from satisfying their rate requirements. In this work, we address this problem by designing a linear multi-step optimization framework for user association and beam scheduling with interference management. In the first step, the framework aims to maximize the number of users with fully satisfied rate requirements by scheduling a minimal number of non-interfering beams. In the second step, any remaining non-interfering beams are distributed among other users to maximize the number of them with at least partially satisfied requirements. Hybrid precoders and combiners are then designed to remove any excess sidelobe interference among the scheduled beams. Finally, power allocation is optimized on a network level to boost the data rates of the partially satisfied users. Given that the framework includes NP-hard optimization problems, we propose an algorithm that attains a sub-optimal solution in polynomial-time. The proposed framework is numerically evaluated in realistic mmW channels and the results reveal its advantages over the baseline user association schemes.


  • Open Access

    REM-U-Net: Deep Learning Based Agile REM Prediction With Energy-Efficient Cell-Free Use Case

    by Hazem Sallouha, Shamik Sarkar, Enes Krijestorac, Danijela Cabric

    Radio environment maps (REMs) hold a central role in optimizing wireless network deployment, enhancing network performance, and ensuring effective spectrum management. Conventional REM prediction methods are either excessively time-consuming, e.g., ray tracing, or inaccurate, e.g., statistical models, limiting their adoption in modern inherently dynamic wireless networks. Deep learning-based REM prediction has recently attracted considerable attention as an appealing, accurate, and time-efficient alternative. However, existing works on REM prediction using deep learning are either confined to 2D maps or use a relatively small dataset. In this paper, we introduce a runtime-efficient REM prediction framework based on U-Nets, trained on a large-scale 3D maps dataset. In addition, data preprocessing steps are investigated to further refine the REM prediction accuracy. The proposed U-Net framework, along with preprocessing steps, are evaluated in the context of the 2023 IEEE ICASSP Signal Processing Grand Challenge, namely, the First Pathloss Radio Map Prediction Challenge . The evaluation results demonstrate that the proposed method achieves an average normalized root-mean-square error (RMSE) of 0.045 with an average of 14 milliseconds (ms) runtime. Finally, we position our achieved REM prediction accuracy in the context of a relevant cell-free massive multiple-input multiple-output (CF-mMIMO) use case. We demonstrate that one can obviate consuming energy on large-scale fading LSF measurements and rely on predicted REM instead to decide which sleep access points (APs) to switch on in a CF-mMIMO network that adopts a minimum propagation loss AP switch ON/OFF strategy.


  • On Passive Privacy-Preserving Exposure Notification Using Hash Collisions

    by Phillip Smith, Shamik Sarkar, Neal Patwari, Sneha Kasera

    Even as the COVID-19 pandemic drove advances in contact tracing and exposure notification systems, user privacy challenges continue to plague otherwise promising approaches to contain contagions. We propose a novel, scalable approach to address privacy in contact tracing that improves utility. We apply passive WiFi scan data using two metrics suitable for estimating contact between users. We support this with real world experimental data captured across a range of environments relevant to contact tracing. To preserve privacy, we leverage properties of truncated cryptographic hashes in an adaptation unique to contact tracing. This hash collision filter allows users to share information about potential contacts with a central server without revealing sensitive information. Using an aggressive threat model, including adversarial users and a malicious server, we share how this technique can improve utility while still providing strong security protections compared to other approaches using, for example, only Bluetooth (BT) or global navigation satellite systems (GNSSs). Finally, we discuss a capability of this approach that allows notification for asynchronous co-location from past contacts.


  • GAN-RXA: A Practical Scalable Solution to Receiver-Agnostic Transmitter Fingerprinting

    by Tianyi Zhao, Shamik Sarkar, Enes Krijestorac, Danijela Cabric

    Radio frequency fingerprinting has been proposed for device identification. However, experimental studies also demonstrated its sensitivity to deployment changes. Recent works have addressed channel impacts by developing robust algorithms accounting for time and location variability, but the impacts of receiver impairments on transmitter fingerprints are yet to be solved. In this work, we investigate the receiver-agnostic transmitter fingerprinting problem, and propose a novel two-stage supervised learning framework (RXA) to address it. In the first stage, our approach calibrates a receiver-agnostic transmitter feature-extractor. We also propose two deep-learning approaches (SD-RXA and GAN-RXA) in this first stage to improve the receiver-agnostic property of the RXA framework. In the second stage, the calibrated feature-extractor is utilized to train a transmitter classifier with only one receiver. We evaluate the proposed approaches on the transmitter identification problem using a large-scale WiFi dataset. We show that when a trained transmitter-classifier is deployed on new receivers, the RXA framework can improve the classification accuracy by 19.5%, and the outlier detection ROC AUC by 12.0% compared to a naive approach without calibration. Moreover, GAN-RXA can further increase the closed-set classification accuracy by 5.0%, and the outlier detection ROC AUC by 12.5% compared to the RXA approach.


  • Open Access

    Fingerprinting IoT Devices Using Latent Physical Side-Channels

    by Justin Feng, Tianyi Zhao, Shamik Sarkar, Dominic Konrad, Timothy Jacques, Danijela Cabric, Nader Sehatbakhsh

    The proliferation of low-end low-power internet-of-things (IoT) devices in "smart" environments necessitates secure identification and authentication of these devices via low-overhead fingerprinting methods. Previous work typically utilizes characteristics of the device's wireless modulation (WiFi, BLE, etc.) in the spectrum, or more recently, electromagnetic emanations from the device's DRAM to perform fingerprinting. The problem is that many devices, especially low-end IoT/embedded systems, may not have transmitter modules, DRAM, or other complex components, therefore making fingerprinting infeasible or challenging. To address this concern, we utilize electromagnetic emanations derived from the processor's clock to fingerprint. We present Digitus, an emanations-based fingerprinting system that can authenticate IoT devices at range. The advantage of Digitus is that we can authenticate low-power IoT devices using features intrinsic to their normal operation without the need for additional transmitters and/or other complex components such as DRAM. Our experiments demonstrate that we achieve ≥ 95% accuracy on average, applicability in a wide range of IoT scenarios (range ≥ 5m, non-line-of-sight, etc.), as well as support for IoT applications such as finding hidden devices. Digitus represents a low-overhead solution for the authentication of low-end IoT devices.


  • Uncoordinated Spectrum Sharing in Millimeter Wave Networks Using Carrier Sensing

    by Shamik Sarkar, Xiang Zhang, Arupjyoti Bhuyan, Mingyue Ji, Sneha Kumar Kasera

    We propose using Carrier Sensing (CS) for distributed interference management in millimeter-wave (mmWave) cellular networks where spectrum is shared by multiple operators that do not coordinate among themselves. In addition, even the base station sites can be shared by the operators. We describe important challenges in using traditional CS in this setting and propose enhanced CS protocols to address these challenges. Using stochastic geometry, we develop a general framework for downlink coverage probability analysis of our shared mmWave network in the presence of CS and derive the downlink coverage probability expressions for several CS protocols. Our work is the first to investigate and analyze (using stochastic geometry) CS for mmWave networks with spectrum and BS sites shared among non-coordinating operators. We evaluate the downlink coverage probability of our shared mmWave network using simulations as well as numerical examples based on our analysis. Our evaluations show that our proposed approach leads to an improvement in coverage probability, compared to the coverage probability with no CS, for higher values of signal-to-interference and noise ratio (SINR). Interestingly, our evaluations also reveal that for lower values of SINR, not using any CS is the best strategy in terms of the downlink coverage probability.


  • A Novel Software Defined Radio for Practical, Mobile Crowd-sourced Spectrum Sensing

    by Phillip Smith, Anh Luong, Shamik Sarkar, Harsimran Singh, Aarti Singh, Neal Patwari, Sneha Kumar Kasera, Kurt Derr

    Software defined radios (SDRs) are often used in the experimental evaluation of next-generation wireless technologies. While crowdsourced spectrum monitoring is an important component of future spectrum-agile technologies, there is no clear way to test it in the real world, i.e., with hundreds of users each carrying an SDR while uploading data to a cloud-based controller. Current fully functional SDRs are bulky, with components connected via wires, and last at most hours on a single battery charge. To address these needs, we design and develop a compact, portable, untethered, and inexpensive SDR we call Sitara. Our SDR interfaces with a mobile device over Bluetooth 5 and can function standalone or as a client to a central command and control server. It transmits and receives common waveforms, uploads IQ samples or processed receiver data through a mobile device to a server for remote processing and performs spectrum sensing functions. We present results from a user study involving more than 100 participants to evaluate Sitara in a hypothetical large-scale crowdsourced spectrum monitoring application. We also present a comparative analysis of Sitara to related crowdsensing systems with a particular emphasis on the role of incentives and user participation.


  • A Non-Cooperative Game-Based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks

    by Xiang Zhang, Shamik Sarkar, Arupjyoti Bhuyan, Sneha Kumar Kasera, Mingyue Ji

    This paper studies the problem of distributed beam scheduling for 5G millimeter-Wave (mm-Wave) cellular networks where base stations (BSs) belonging to different operators share the same spectrum without centralized coordination among them. Our goal is to design efficient distributed scheduling algorithms to maximize the network utility, which is a function of the achieved throughput by the user equipment (UEs), subject to the average and instantaneous power consumption constraints of the BSs. We propose a Media Access Control (MAC) and a power allocation/adaptation mechanism utilizing the Lyapunov stochastic optimization framework and non-cooperative games. In particular, we first decompose the original utility maximization problem into two sub-optimization problems for each time frame, which are a convex optimization problem and a non-convex optimization problem, respectively. By formulating the distributed scheduling problem as a non-cooperative game where each BS is a player attempting to optimize its own utility, we provide a distributed solution to the non-convex sub-optimization problem via finding the Nash Equilibrium (NE) of the game whose weights are determined optimally by the Lyapunov optimization framework. Finally, we conduct simulation under various network settings to show the effectiveness of the proposed game-based beam scheduling algorithm in comparison to that of several reference schemes.