DJDevendra Jalihal

Devendra Jalihal

*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


Devendra Jalihal has a total of 76 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Sens-BERT: A BERT-Based Approach for Enabling Transferability and Re-Calibration of Calibration Models for Low-Cost Sensors Under Reference Measurements Scarcity

    by M. V. Narayana, Kranthi Kumar Rachavarapu, Devendra Jalihal, S. M. Shiva Nagendra

    Low-cost sensors (LCS) are crucial for high-resolution air quality monitoring, but their inherent noise poses challenges for wide-scale adoption. Typically, LCS are calibrated alongside reference stations to develop learning-based calibration models for accurate air quality estimation. However, existing learning-based calibration works are sensor and location-specific, requiring frequent re-calibration. The re-calibration also needs massive data, as required in the initial calibration, which is an unviable solution in practical scenarios. This work introduces Sens-BERT , a BERT-inspired deep learning approach for LCS calibration. It comprises two phases: self-supervised pre-training of Sens-BERT on LCS data alone to learn data features and embeddings and supervised fine-tuning of a neural network model for calibration. Sens-BERT offers several advantages: It requires paired data only for fine-tuning and is transferable across sensors of the same type without explicit training on them. We extensively tested our approach on diverse sensors using the CAIRSENSE and SensEURcity datasets. We demonstrated superior performance compared to traditional calibration models such as single-variable linear regression, multiple-variable linear regression, random forest, LSTM (long short-term memory), and a recently developed calibration model, estimated error augmented two-phase calibration ( EEATC ). Further, we empirically validate Sens-BERT ’s transferability and re-calibration capabilities under reference measurement scarcity, a required scenario to establish a sensor network in remote locations.


  • EEATC: A Novel Calibration Approach for Low-Cost Sensors

    by M. V. Narayana, Devendra Jalihal, S. M. Shiva Nagendra

    Low-cost sensors (LCS) are affordable, compact, and often portable devices designed to measure various environmental parameters, including air quality. These sensors are intended to provide accessible and cost-effective solutions for monitoring pollution levels in different settings, such as indoor, outdoor and moving vehicles. However, the data produced by LCS is prone to various sources of error that can affect accuracy. Calibration is a well-known procedure to improve the reliability of the data produced by LCS, and several developments and efforts have been made to calibrate the LCS. This work proposes a novel Estimated Error Augmented Two-phase Calibration ( EEATC ) approach to calibrate the LCS in stationary and mobile deployments. In contrast to the existing approaches, the EEATC calibrates the LCS in two phases, where the error estimated in the first phase calibration is augmented with the input to the second phase, which helps the second phase to learn the distributional features better to produce more accurate results. We show that the EEATC outperforms well-known single-phase calibration models such as linear regression models (single variable linear regression (SLR) and multiple variable linear regression (MLR)) and Random forest (RF) in stationary and mobile deployments. To test the EEATC in stationary deployments, we have used the Community Air Sensor Network (CAIRSENSE) data set approved by the United States Environmental Protection Agency (USEPA), and the mobile deployments are tested with the real-time data obtained from SensurAir, an LCS device developed and deployed on moving vehicle in Chennai, India.


  • Open Access

    Establishing A Sustainable Low-Cost Air Quality Monitoring Setup: A Survey of the State-of-the-Art

    by Mannam Veera Narayana, Devendra Jalihal, S. M. Shiva Nagendra

    Low-cost sensors (LCS) are becoming popular for air quality monitoring (AQM). They promise high spatial and temporal resolutions at low-cost. In addition, citizen science applications such as personal exposure monitoring can be implemented effortlessly. However, the reliability of the data is questionable due to various error sources involved in the LCS measurement. Furthermore, sensor performance drift over time is another issue. Hence, the adoption of LCS by regulatory agencies is still evolving. Several studies have been conducted to improve the performance of low-cost sensors. This article summarizes the existing studies on the state-of-the-art of LCS for AQM. We conceptualize a step by step procedure to establish a sustainable AQM setup with LCS that can produce reliable data. The selection of sensors, calibration and evaluation, hardware setup, evaluation metrics and inferences, and end user-specific applications are various stages in the LCS-based AQM setup we propose. We present a critical analysis at every step of the AQM setup to obtain reliable data from the low-cost measurement. Finally, we conclude this study with future scope to improve the availability of air quality data.


  • Variable Length Coding for Asynchronous Communication

    by Vidyalaxmi Dani, Devendra Jalihal, Venkatesh Ramaiyan

    We consider a problem of asynchronous communication over a discrete memoryless channel (DMC). A transmitter seeks to communicate B bits of information to a receiver at a random time V. For a general distribution of V, we propose an asymptotically error-free variable length coding scheme that adapts the codeword length and distribution based on the arrival probabilities in a slot. For a simple class of L-step arrival distributions, we characterize the capacity of the DMC, and also show that the variable length coding scheme achieves higher rates and lower cost of communication in comparison with the fixed length coding scheme studied in prior works. Using numerical work, we illustrate our results for a binary symmetric channel in a number of interesting scenarios.


  • Optimal Frame Synchronization Under General Arrivals

    by Meenakshi Sundaram Ramamoorthy, Devendra Jalihal, Venkatesh Ramaiyan

    We study a problem of frame synchronization over a discrete memoryless channel (DMC) in an asynchronous setup. A sync frame is transmitted at a random time V with a known distribution {av} and entropy H. We seek to characterize the minimum average length or energy of the sync frame necessary for error-free frame synchronization, as H tends to infinity. We present a variable length sync frame, where the length of the sync frame is adapted based on H and {av}, for the general arrival distribution and show error-free frame synchronization when the average sync frame length N scales as Ω(H/α(Q)), where α(Q) is the synchronization threshold of the DMC. We then generalize the framework and study a tradeoff between N and α(Q) for optimal frame synchronization and characterize the scaling needed of both N and α(Q) with H. We illustrate our results with the AWGN channel and discuss adapting sync frame length and symbol power for optimal frame synchronization. Finally, using numerical work and simulations, we evaluate the results under relaxed assumptions including imperfect knowledge of arrival distribution and symbol timing error.


  • On sequential frame synchronization with clock misalignment

    by Vidyalaxmi Dani, Chirag Gupta, Devendra Jalihal, Venkatesh Ramaiyan

    We study one shot frame synchronization in a discrete memoryless channel where, a sync frame of known length N v symbols is transmitted at a random time v. For a random misalignment 7 between the transmitter clock and the receiver clock, we seek to characterize the sync frame (length) necessary for error-free frame synchronization. We assume that the random times v and 7 are independent and have a general distribution. Using a variable length sync word and a multi-stage sequential decoder for the setup, we derive necessary and sufficient scaling of the average sync frame length for asymptotic error-free frame synchronization. In particular, we show that the average sync frame length must scale with the entropy of v and/or logarithm of cardinality of the sample space of 7. We illustrate our results for the AWGN channel and also derive the scaling needed of the sync frame energy for the asynchronous setup.

  • Optimal frame synchronization over a finite state Markov channel

    by R M Sundaram, Arup Kumar Das, Devendra Jalihal, Venkatesh Ramaiyan

    We study a problem of sequential frame detection over a finite state Markov channel (FSMC). We consider an asynchronous framework where a sync frame of length N symbols is transmitted uniformly over a large interval of known size A slots. In this setup, we study the scaling needed of the sync frame length N with the asynchronism interval length A for error-free frame synchronization. We study the problem when channel state information (CSI) is known at the transmitter and the receiver, and compute a synchronization threshold, α, that relates the average sync frame length N and A as N > log 2 (A)/α for asymptotic frame synchronization. Our discussion includes the description of a variable length and adaptive code word for FSMC that achieves the optimal delay performance.


  • Finite-SNR outage analysis for MIMO channels with imperfect channel state information

    by Nandita Lavanis, Devendra Jalihal, Arun Pachai Kannu, Srikrishna Bhashyam


  • Open Access

    Performance of p-Norm Detector in Cognitive Radio Networks with Cooperative Spectrum Sensing in Presence of Malicious Users

    by Nandita Lavanis, Devendra Jalihal

    A cognitive radio network (CRN) with a cooperative spectrum sensing scheme is considered. This CRN has a primary user and multiple secondary users, some of which are malicious secondary users (MSUs). Energy detection at each SU is performed using a p-norm detector with p≥2, where p=2 corresponds to the standard energy detector. The MSUs are capable of perpetrating spectrum sensing data falsification (SSDF) attacks. At the fusion center (FC), an algorithm is used to suppress these MSUs which could be either an adaptive weighing algorithm or one of the following: Tietjen-Moore (TM) test or Peirce’s criterion. This is followed by computation of a test statistic (TS) which is a random variable. In this paper, we assume TS to have either a Gamma or a Gaussian distribution and calculate the threshold accordingly. We provide closed-form expressions of probability of false alarm and probability of miss-detection under both assumptions. We show that Gaussian assumption of TS is more suited in presence of an SSDF attack when compared with the Gamma assumption. We also compare the detection performance for various values of p and show that p=3 along with the Gaussian assumption is the best amongst all the cases considered.