PVPramod Kumar Varshney

Pramod Kumar Varshney

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Pramod Kumar Varshney has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks

    by Hsuan-Yin Lin, Po-Ning Chen, Yunghsiang S. Han, Pramod K. Varshney

    In this work, we consider the general problem of distributed detection in the presence of Byzantines using wireless sensor networks. Instead of attempting to mitigate Byzantine attacks as a system designer, we investigate the issue from the perspective of a Byzantine attacker. The probability for each individual sensor to be compromised (compromising probability) required to blind the system operation is adopted as the attack measure. Under the system setting that the fusion center (FC) declares the most likely hypothesis to be true based on the M-ary data from N local sensors, a Byzantine attack policy that can blind the FC with the minimum compromising probability for each individual sensor is derived under the assumption that the Byzantine attacker knows the statistics of the local outputs. The closed-form expression for a blind-achieving Byzantine transition probability that is used to alter the statistics of the local outputs of compromised sensors is also established. Our results indicate that the statistics of the local outputs is essential for the minimization of an attacker's effort.


  • Road Network Conflation Based on Radar Tracks

    by Ruixin Niu, Pramod K. Varshney

    Using ground target radar tracks as building blocks, sophisticated road map estimation and fusion algorithms are developed. A maximum likelihood road estimator, as well as its corresponding Cramer-Rao lower bound, is derived. A track to road association approach is developed to align track segments to existing road segments. If a track is associated to any existing road segment, a track to road fusion algorithm is proposed to fuse the track with the corresponding road segment to improve the road map accuracy; otherwise, a new road is added to the road network. Numerical results are provided to demonstrate the effectiveness of the proposed road estimation and fusion approach.

  • Multi-Objective Evolutionary Algorithms for Sensor Network Design

    by Ramesh Rajagopalan, Chilukuri K. Mohan, Kishan G. Mehrotra, Pramod K. Varshney

    Many sensor network design problems are characterized by the need to optimize multiple conflicting objectives. However, existing approaches generally focus on a single objective (ignoring the others), or combine multiple objectives into a single function to be optimized, to facilitate the application of classical optimization algorithms. This restricts their ability and constrains their usefulness to the network designer. A much more appropriate and natural approach is to address multiple objectives simultaneously, applying recently developed multi-objective evolutionary algorithms (MOEAs) in solving sensor network design problems. This chapter describes and illustrates this approach by modeling two sensor network design problems (mobile agent routing and sensor placement), as multi-objective optimization problems, developing the appropriate objective functions and discussing the tradeoffs between them. Simulation results using two recently developed MOEAs, viz., EMOCA (Rajagopalan, Mohan, Mehrotra, & Varshney, 2006) and NSGA-II (Deb, Pratap, Agarwal, & Meyarivan, 2000), show that these MOEAs successfully discover multiple solutions characterizing the tradeoffs between the objectives.


  • Connectivity analysis of wireless sensor networks with regular topologies in the presence of channel fading

    by Ramesh Rajagopalan, Pramod K. Varshney

    This paper investigates the probabilistic connectivity of wireless sensor networks in the presence of channel fading. Due to the stochastic nature of wireless channels in sensor networks, the geometric disk shaped model widely used for connectivity analysis of sensor networks can be misleading. In this paper, we develop a mathematical model to evaluate the probabilistic connectivity of sensor networks which incorporates the characteristics of wireless channels, multi-access interference, the network topology and the propagation environment. We present an analytical framework for the computation of node isolation probability and network connectivity under different channel fading models. We also analyze the connectivity of sensor networks in the presence of unreliable sensors. We present numerical and simulation results that compare different regular topologies in terms of several metrics such as node isolation probability, end-to-end connectivity, and network connectivity.


  • Performance Analysis and Code Design for Minimum Hamming Distance Fusion in Wireless Sensor Networks

    by Chien Yao, Po-Ning Chen, Tsang-Yi Wang, Yunghsiang S. Han, Pramod K. Varshney

    Distributed classification fusion using error-correcting codes (DCFECC) has recently been proposed for wireless sensor networks operating in a harsh environment. It has been shown to have a considerably better capability against unexpected sensor faults than the optimal likelihood fusion. In this paper, we analyze the performance of a DCFECC code with minimum Hamming distance fusion. No assumption on identical distribution for local observations, as well as common marginal distribution for the additive noises of the wireless links, is made. In addition, sensors are allowed to employ their own local classification rules. Upper bounds on the probability of error that are valid for any finite number of sensors are derived based on large deviations technique. A necessary and sufficient condition under which the minimum Hamming distance fusion error vanishes as the number of sensors tends to infinity is also established. With the necessary and sufficient condition and the upper error bounds, the relation between the fault-tolerance capability of a DCFECC code and its pair-wise Hamming distances is characterized, and can be used together with any code search criterion in finding the code with the desired fault-tolerance capability. Based on the above results, we further propose a code search criterion of much less complexity than the minimum Hamming distance fusion error criterion adopted earlier by the authors. This makes the code construction with acceptable fault-tolerance capability for a network with over a hundred of sensors practical. Simulation results show that the code determined based on the new criterion of much less complexity performs almost identically to the best code that minimizes the minimum Hamming distance fusion error. Also simulated and discussed are the performance trends of the codes searched based on the new simpler criterion with respect to the network size and the number of hypotheses


  • Source Localization in Sensor Networks with Rayleigh Faded Signals

    by Ruixin Niu, Pramod K. Varshney

    Source localization is investigated for a sensor network with passive sensors. The signal emitted by the source endures Rayleigh fading during its propagation, and its average intensity is a function of the distance from the source. Maximum likelihood (ML) source location estimators that use the output, or its quantized version, of the non-coherent receiver is proposed. The ML estimators' Cramer-Rao lower bounds (CRLBs) are derived. Due to the fading effect, the proposed estimator's performance is degraded, compared to the ideal case without fading. However, it can still accurately estimate the source's position and intensity, and achieve its CRLB with relatively small amount of resources, namely small number of observations, sensors and quantization bits.


  • Bandwidth-Efficient Target Tracking In Distributed Sensor Networks Using Particle Filters

    by L. Zuo, K. Mehrotra, P.K. Varshney, C.K. Mohan

    This paper considers the problem tracking a moving target in a multisensor environment using distributed particle filters (DPFs). Particle filters have a great potential for solving highly nonlinear and non-Gaussian estimation problems, in which the traditional Kalman filter (KF) and extended Kalman filter (EKF) generally fail. How ever, in a sensor network, the implementation of distributed particle filters requires huge communications between local sensor nodes and the fusion center. To make the DPF approach feasible for real time processing and to reduce communication requirements, we approximate a posteriori distribution obtained from the local particle filters by a Gaussian mixture model (GMM). We propose a modified EM algorithm to estimate the parameters of GMMs obtained locally. These parameters are transmitted to the fusion center where the best linear unbiased estimator (BLUE) is used for fusion. Simulation results are presented to illustrate the performance of the proposed algorithm


  • Performance Evaluation of Decision Fusion in Wireless Sensor Networks

    by Ruixin Niu, Pramod K. Varshney

    For networked sensors that report binary local decisions to a fusion center, we use a fusion rule that employs the summation of these local decisions for hypothesis testing. Based on the assumption that the received signal power decays as the distance from the target increases, exact system level detection performance measures are derived analytically. The evaluation of the probability of detection involves multiple-fold integrations. Two approximations of the probability of detection, by using binomial distribution with or without ignoring the border effect of the region of interest (ROI), are presented. It is shown that for various system parameters we have explored, the approximation that takes into account the border effect provides a very accurate estimation of the probability of detection. To achieve a better system level detection performance, the local sensor level decision threshold is chosen such that it maximizes the Kullback Leibler distance of the distributions conditioned on the two hypotheses.


  • Joint Detection and Localization in Sensor Networks Based on Local Decisions

    by Ruixin Niu, Pramod K. Varshney

    A generalized likelihood ratio test (GLRT) based decision fusion method that uses quantized data from local sensors is proposed to jointly detect and localize a target in a wireless sensor field. The signal intensity is assumed to be inversely proportional to a power of the distance from the target. The GLRT, its corresponding maximum likelihood (ML) estimator, and the Cramer-Rao lower bound (CRLB) are derived. Simulation results show that this fusion rule has a significantly improved detection performance, compared with the counting rule (for hard local decisions) or the intuitive fusion rules based on the average of sensor data (for soft local decisions).


  • Open Access

    Scheduling Sleeping Nodes in High Density Cluster-based Sensor Networks

    by Jing Deng, Yunghsiang S. Han, Wendi B. Heinzelman, Pramod K. Varshney