- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Table of Contents
International Journal of Distributed Sensor Networks
Volume 2011 (2011), Article ID 980953, 17 pages
Low-Complexity, Distributed Characterization of Interferers in Wireless Networks
1Network Systems Engineering, AT&T Labs, 2600 Camino Ramon, CA 94583, USA
2Robert Bosch LLC, Research and Technology Center North America, 4009 Miranda Avenue, Palo Alto, CA 94304, USA
3School of Electrical and Computer Engineering, Georgia Institute of Technology, 777 Atlantic Drive NW, Atlanta, GA 30332-0250, USA
Received 8 February 2011; Revised 21 May 2011; Accepted 25 May 2011
Copyright © 2011 Vibhav Kapnadak et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We consider a large-scale wireless network that uses sensors along its edge to estimate the characteristics of interference from neighboring networks or devices. Each sensor makes a noisy measurement of the received signal strength (RSS) from an interferer, compares its measurement to a threshold, and then transmits the resulting bit to a cluster head (CH) over a noisy communication channel. The CH computes the maximum likelihood estimate (MLE) of the distance to the interferer using these noise-corrupted bits. We propose and justify a low-complexity threshold design technique in which the sensors use nonidentical thresholds to generate their bits. This produces a dithering effect that provides better performance than previous techniques that use different non-identical thresholds or the case in which all the sensor motes use an identical non-optimal threshold. Our proposed technique is also shown (a) to be of low complexity compared to previous non-identical threshold approaches and (b) to provide performance that is very close to that obtained when all sensors use the identical, but unknown, optimal threshold. We derive the Cramér-Rao bound (CRB) and also show that the MLE using our dithered thresholds is asymptotically both efficient and consistent. Simulations are used to verify these theoretical results.
Large-scale deployments of wireless LANs in unlicensed RF bands are often subject to interference from many sources. We have encountered this problem in the e-Stadium wireless testbed , which enables football fans in the stadium at Purdue to access multimedia content related to the game  via 802.11b and 3G networks. The locations and coverage areas of the 802.11b access points (APs) in the stadium are shown in Figure 1. The two interfering APs also shown in the figure may disrupt eStadium services for fans sitting along the outer edge of the stands or in the tailgating area north of the stadium. The locations and settings of these interfering access points or devices change over time. The eStadium testbed must sense these changes and adapt its channel assignments and power levels to ensure that its users experience satisfactory Quality of Service (QoS).
The eStadium testbed includes clusters of wireless sensors that are distributed along the concourse area of the stadium . They currently gather and process information from this area and make it available to fans and security personnel during games. We propose that these sensors perform the additional task of characterizing the sources of interference with the 802.11b-based portion of the eStadium testbed.
The information gathered about interferers by these sensors is not directly available to the eStadium APs because of their directional antennas or shadowing by the stadium’s structure. A Smart WiFi system  would thus not be able to sense and adjust to the presence of these external interferers. This proposed use of the sensors, combined with algorithms to alter the 802.11b channel assignments and power settings, is thus a cognitive networking approach to enabling the coexistence of many systems in unlicensed bands.
The contributions of this paper include the following. (a)Analysis and improvement of MLE approaches in which sensors conserve energy by minimizing the amount of data they transmit. Each sensor thresholds its noisy measurement of the interferer’s signal strength, adds the resulting bit to a packet carrying other data, and transmits the packet to the CH via a noisy channel. We consider and justify the case in which each sensor uses a different threshold and compare it with cases in which every sensor uses the same threshold.(b)Proofs of the asymptotic efficiency and consistency of this new MLE approach and derivation of the Cramér-Rao bound (CRB). Given that the thresholds in our case are non-identical, the standard proofs of asymptotic consistency and efficiency do not hold.(c)Verification that the MLE based on the use of non-identical thresholds by the sensors performs: (i) as well as one based on the use of identical optimal thresholds, even when the number of sensors is small, (ii) significantly better than the one based on the use of identical non-optimal thresholds, and (iii) is of lower complexity and has a performance that is better than or as good as existing non-identical threshold techniques. Because the identical optimal threshold case requires prior knowledge of the true value of the unknown parameter, and existing non-identical techniques involve the solution of a complex optimization problem, our non-identical threshold approach is much more practical and of lower complexity in terms of the design of the thresholds.
In Section 2, we review the most relevant prior work in this area. Sections 3 and 4 describe the system model and the formulation of the sensor fusion problem. The performance of the algorithm is evaluated and compared with existing techniques in Section 5, and conclusions are provided in Section 7.
2. Related Work
In the context of transmitter location estimation for wireless networks, the authors in [5–7] propose expectation maximization (EM) algorithms to locate multiple transmitters using received power levels at arbitrarily placed receivers. The authors in  consider a cognitive wireless network in which secondary users measure signal strengths from primary users to estimate the distance to the primary users. They propose estimation algorithms under different channel fading conditions. In , the authors study an 802.11 cognitive mesh network (COMNET) in which mesh clients (MC) calculate their distances from the primary stations with triangulation-based localization techniques that use RSS measurements. These localization techniques assume that the MCs are synchronized and that they are located on the edge of the secondary 802.11 network; otherwise, they may not be able to detect the interference from the primary stations. In the above papers, the authors do not consider the use of thresholded measurements or the transmission of measurements over noisy channels.
In the context of distributed estimation in wireless sensor networks, the authors in [10, 11] consider 1-bit quantization using identical and non-identical thresholds and obtain the maximum-likelihood estimate of an unknown parameter. They account for measurement noise that is Gaussian or has an unknown distribution but do not consider other sources of error, such as noise in the communication channel. A similar situation is examined in , where multiple-bit quantized information is used to locate a target in a sensor field under error-free channel conditions. A nonparametric approach to density estimation using a sensor network was introduced in . The authors considered the case where 1-bit quantized data is transmitted to the CH using random thresholds from a pmf. As with the previous papers, however, processing by sensors and the wireless channel between the sensors and the CH are considered to be error free, which is typically not the case in realistic situations. In , the authors study channel aware target localization using 1-bit quantized data. They analyze the effects on the root mean squared error (RMSE) of the MLE due to communication channel impairments. They consider the BSC, Rayleigh fading with coherent reception and non-coherent reception. However, in their work, they do not address the design of the 1-bit quantization algorithm for transmission over noisy communication channels.
In [15, 16], the authors consider a 1-bit quantization framework for noisy Gaussian communication links. However, it is assumed that either all sensors use the same threshold or use one of two thresholds. More recently, in , the authors have proposed an MLE-based distributed estimation algorithm using 1-bit quantized data that is transmitted over a BSC. The context in which the estimation algorithm is analyzed is for secure data transmission in wireless sensor networks, but it is assumed that all the sensors use identical thresholds.
Several other papers, including [18–21], also study the distributed estimation problem, but their approach is based on the best linear unbiased estimate (BLUE) at the CH instead of the MLE. This approach is typically not appropriate or optimal when the received data at the CH is a nonlinear function of the unknown parameter.
Our approach is unique because it (a) exploits and justifies the use of different thresholds by the sensors when quantizing their noisy measurements and (b) accounts for noisy measurements by the sensors and error-prone processing and communications between the sensors and the CH. Our analysis of the MLE in this new approach will show that uniformly-spaced thresholds produces a dithering effect that leads to near-optimal performance when the only information available about the parameter being estimated is its support. This is very important because previous approaches based on the use of an identical threshold by all sensors work well only when the chosen threshold is either very near the unknown true value, or the number of sensors is very large. Furthermore, our non-identical threshold design algorithm is significantly less complex and performs as good as or better than existing non-identical threshold techniques, such as the one in .
3. System Model and Problem Motivation
3.1. System Characteristics and Considerations
The following characteristics of the wireless sensor network and sensor fusion algorithm are assumed in this paper. They are motivated by the eStadium project but are relevant to many other systems operating in unlicensed bands.
The system consists of a network of wireless APs and a single-hop cluster of spatially distributed wireless sensors deployed along the edge of the wireless network. Each sensor measures the RSS from an interfering AP, compares it to its threshold, and relays the resulting bit to the CH. The CH fuses the bits it receives to produce an estimate of the signal strength and distance to the interfering AP.
(b) Measurement Errors
Due to large-scale fading and shadowing effects, the RSS observed at sensor is assumed to be log normally distributed, as in [22, 23]. The mean of this distribution is a function of the distance from the transmitter to the receiver while the variance is independent of . We assume that follows a path-loss-exponent model; hence, where is the propagation law exponent, and is the close-in reference power, that is, the power very close to the transmitter. In rest of the paper, the symbol will be used interchangeably with . On a dB scale, the received RSS at the sensors can be expressed as where is the mean and is i.i.d. Gaussian noise that is independent of . The term is commonly referred to as the dB spread of the log-normal shadowing and is typically between 4 dB and 12 dB. We refer to this noise as the measurement noise because it corrupts the SNR measurement of each sensor, and we assume that its characteristics are known by the CH. Furthermore, we assume that the sensors are close enough to each other relative to the distance from the interferer that the received RSS at each sensor has the same mean; however, relative to each other, they are spaced far enough to ensure that the noise processes affecting different sensors are independent. The case of dependent noise is left for future work.
(c) Energy Limits
Energy efficiency is critical in the design of battery-powered sensor networks, so sensor thresholds the RSS value it observes to produce only one bit, denoted by , that is to be sent to the CH. The ’s are transmitted over a parallel access, noisy communication channel to the CH. These bits may be transmitted individually over the wireless channel or may be combined with other data into packets transmitted over an (ZigBee) channel .
(d) Communication Channel
The wireless channel between each sensor, and the CH is modeled as a binary symmetric Channel (BSC) with a crossover probability of . We assume that the value of is perfectly estimated at the CH; this can be achieved by the use of pilot training data transmitted by the sensors to the CH during the initialization process. We further assume that the communication channel is static for a period of seconds; hence, does not change during the estimation process. For completeness, in Section 5, we also analyze the performance degradation of our algorithms due to a mismatch between the estimated value of and the true value of . The choice of a symmetric channel is not required for our analysis but does simplify comparisons. Collisions of bits/packets in the communication channel are assumed to result in their loss and subsequent retransmission. The BSC model thus applies to transmitted bits/packets that are not involved in collisions. Alternatively, one could assume that the sensors’ transmissions are scheduled via a collision-free protocol, such as the one in , or that they use the TDMA-based frame that is available under the (ZigBee) protocol .
(e) Reliability and Trustworthiness
Noisy communications may not be the only source of errors affecting the sensors’ decisions before they reach the CH. The sensors may make processing or storage errors. They may be compromised and intentionally report incorrect results with some probability in order to compromise performance without being detected. These additional error sources can be aggregated with the communication errors, resulting in a larger crossover probability. These chapter’s results can thus be used to characterize the sensitivity of fusion algorithms to these error sources.
(f) Industrial, Scientific, and Medical (ISM) Band
The true mean value of the RSS distribution (see (b), above), denoted by , is an unknown parameter that lies in the interval . The lower bound, , corresponds to the maximum range at which the sensors are able to receive and decode a packet from the interferer. The upper bound, , is related to the maximum transmission power defined by the incumbent network’s communication standard. In the eStadium network, these bounds are determined by a typical 802.11b AP operating in the 2.4 GHz band. For a specific example, we use the specs of a Cisco Aironet 1200 series AP  with an omni-directional antenna. Its maximum transmission power of 100 mW at a distance of from the transmitter corresponds to the upper bound; that is, dB or dBm. For the lower bound, the maximum distance at which a typical commercial 802.11 device can receive and decode a packet from an Aironet AP is m, which corresponds to dB or dBm. Figure 2(b) shows the relationship between and for the signal received from a typical AP.
(g) Periodic Updates
We assume that the estimates and are updated every seconds to capture any changes in the set of interferers. is assumed to be greater than the time required for all sensors to collect a measurement and transmit their bits to the CH. In this paper, we focus on the performance of estimates for a single time period of length . The better the estimate produced in this period, the faster an iterative algorithm based on it will converge. An iterative algorithm that builds on the results is presented in .
In summary, sensor transmits a single bit of information where is the threshold used at sensor to quantize the RSS to one bit. The set of are transmitted to the CH, which uses them to estimate and then estimate via (1). Figure 3 shows the system model and the signal processing block diagram of the cluster of sensors.
3.2. Optimal Identical Threshold Design
The optimal threshold can be defined to be the threshold that minimizes the Cramér-Rao bound (CRB) for any unbiased estimator of . This optimization criteria is similar to that proposed in [10, 11] for the error-free communication scenario. In this case, all the sensor motes use the same optimal threshold derived by solving the optimization problem. The thresholds can be expressed as for , where denotes the optimal threshold. The CRB for any unbiased estimator , denoted by and derived in Section 5, is given by where is called the Fisher information (FI). As derived later in the paper, the FI is expressed as where is the FI for sensor , , is the true value of , and and are the complementary cumulative distribution function (ccdf) and pdf of the measurement noise , respectively. Due to lack of space, we only outline the general technique to obtain the critical points of the CRB function. Calculating the gradient of the r.h.s of (4) with respect to for , it can easily be shown that when for each , the equations are simultaneously equal to zero, and the Hessian of the CRB function is positive definite. Hence, the optimal threshold is . Note that this choice of threshold is not feasible because is not known in advance.
An interesting observation is that the optimal identical threshold choice does not depend on or . It is only a function of the true unknown value . Furthermore, the performance of the identical threshold scheme is very sensitive to the choice of threshold, as shown in Section 6. Even a slight deviation of the threshold value from the true value of can result in significant performance degradation. Hence, our goal is to design a quantization scheme which is independent of the true value of and has a performance comparable to the optimal identical threshold case.
3.3. Threshold Design for Dithered Quantization
Because use of the optimal identical threshold for the 1-bit quantization step requires prior knowledge of the unknown parameter, we propose a framework in which each sensor uses a different threshold. This ensures that at least a few thresholds will be close to the true value of the unknown parameter. Furthermore, using non-identical thresholds at the sensors for the 1-bit quantization produces a dithering effect that reduces the bias in the estimator (as shown in Section 5). We thus refer to this technique as dithered quantization. Since it is well known that the uniform distribution has maximum entropy among all continuous distributions with compact support , we assume that is uniformly distributed over the interval and hence space the quantization thresholds equally over this interval. This leads to the thresholds being assigned for sensor mote according to the following equation:
3.4. Binning-Based Nonidentical Threshold Design
Another approach to the use of non-identical threshold was proposed in . They consider designing the threshold vector and the associated frequency vector to minimize the weighted asymptotic variance. The frequency for threshold is defined as , where is the total number of sensors transmitting binary information using threshold , and is the total number of sensors in the network. Although the problem studied in  was for the error-free communication channel scenario, it can be modified for the BSC case. Hence, for our setup, this optimization problem for a uniform weighting function between denoted by can be formulated as the following second-order cone program (SOCP) with auxiliary variable as where , , is the number of thresholds, is the number of discrete points at which the function is evaluated, the function is given by
and is a matrix with its th entry given by
Using numerical techniques to approximate the numerator of , can be expressed as
For the rest of the paper, we refer to this technique as the binning-based non-identical threshold approach. In Section 5, we compare the performance of all three threshold design schemes.
3.5. Effect of Network Topology on Threshold Design
Wireless sensor networks change with time because sensors can fail as their batteries die, or new sensors may be added to an existing network. Our threshold design is robust to these changes, since when the number of sensors is large, the thresholds are densely distributed over the interval, the loss of a few sensors will not result in a significant loss of information. When the number of sensors is small, the thresholds are coarsely spread over the interval. A few failures might thus result in a significant decrease in the number of bits received by the CH. The CH can then reassign thresholds by communicating with the sensors over the wireless channel. When a new sensor joins the network, it can request a threshold from the CH, choose one based on its unique MAC address, or the CH can reassign all sensors’ thresholds according to the algorithm in Section 3.3. On the other hand, the binning-based non-identical threshold technique requires the solution to the optimization problem (8) each time the thresholds need to be assigned. Hence, compared to our proposed approach, the binning-based approach is of much higher computational complexity and therefore cannot easily adapt to changes in the network topology.
4. Sensor Fusion Algorithm
We use maximum-likelihood estimation (MLE) techniques to estimate and then use the invariance property of MLE’s  obtain an estimate for . For sensor mote , we denote to be the random variable (r.v) for the received bit and to be the value of the r.v. Since the received bits are independent, nonidentically distributed (i.n.i.d) Bernoulli random variables (rv’s), where is the complementary cumulative distribution function (ccdf) of the measurement noise . Denoting the likelihood function of each received bit by , the likelihood function for the received vector of observations becomes
Let , then the log-likelihood function is given by
Thus, the MLE is obtained by solving the following constrained maximization problem, and because the function relating to in (1) is one to one, the MLE can be obtained directly from . Note that we have assumed that the CH has perfect knowledge of the dB spread of the log-normal shadowing, that is, and the cross-over probability . The former can usually be obtained offline by conducting field measurements in the area of deployment and then performing regression analysis using the experimental data . As for , this is typically known a priori depending on the modulation and coding scheme used. For example, for transmission of information over fading channels, the probability of bit error () is well known when standard digital modulation (BSPK, QPSF, 64-QAM, etc.) schemes are used with error control coding strategies such as Turbo or LDPC codes. Hence, can be used as the value for .
5. Performance Analysis of Dithered Quantization Approach
This section contains (i) proofs of the asymptotic consistency and efficiency of the MLE for and using the proposed dithered quantization approach (ii) derivation of the Cramér-Rao bound (CRB) for the variance of any unbiased estimator for and , and (iii) Monte Carlo simulations that validate the asymptotic results and compare the performance of the dithered quantization technique with the identical threshold-based quantization approach. Since the constrained ML optimization in (15) is analytically intractable, there is no closed-form expression for the estimates or the distribution of the estimates. Hence, to study the bias of the MLE’s, we prove that the estimators are asymptotically strongly consistent and hence asymptotically unbiased. Furthermore, although the ’s are i.n.i.d Bernoulli r.v’s, we prove that MLE’s are asymptotically normally distributed and efficient. Monte Carlo simulations confirm these results and, as shown later, demonstrate that these desirable asymptotic behavior is effectively achieved with as few as sensors.
5.1. Asymptotic Properties
For the following results, we define , to be the MLE of and , respectively, obtained with sensors using the dithered quantization technique.
Proposition 1. The MLE is unique and asymptotically strongly consistent , where represents the true value of .
Proof. See Appendix A.
Proposition 2. is asymptotically efficient , where represents the true value of , is the Fisher information (FI), and means convergence in distribution.
Proof. See Appendix B.
The following two corollaries are immediate consequences of the invariance property of functions of MLE’s and the one-to-one mapping between and .
Corollary 1. The MLE is unique and asymptotically strongly consistent , where represents the true value of .
Corollary 2. is asymptotically efficient , where represents the true value of .
5.2. Cramér-Rao Bound
In this subsection, we derive the CRB for any unbiased estimator of denoted by . The MLE derived previously may be biased for small , but since we have proved that it is asymptotically unbiased, the CRB is useful as a lower bound of the variance of for medium-to-large numbers of sensor motes.
Theorem 1. The CRB for any unbiased estimator obtained using the dithered quantization technique with the BSC model is
Proof. See Appendix C.
Using the CRB for and observing that (1) is a one-to-one transformation, the CRB for any unbiased estimator of , denoted by , can be derived using the invariance property of MLE’s and functions of MLE’s. The following lemma relates the variance of to the variance of .
Lemma 1. If , then the variance of any unbiased estimate of is given by
Proof. A proof of this lemma can be found in [29, Chapter 3, Appendix ].
Corollary 3. The CRB for any unbiased estimator for using the dithered quantization technique with the BSC model is where is the FI.
Proof. Using Lemma 1 and the relationship between and given by , the result follows.
Figures 4(a) and 4(b) show the behavior of the square root of the CRB of when we vary the number of sensors, , and the crossover probability, , respectively. The CRB is a monotonically increasing function of for and, due to its symmetry about , is a monotonically decreasing function for . As the CRB tends to because, from (1), the Fisher information converges to 0. From Figure 4(a), we observe that the CRB is a monotonically decreasing function of , which is expected because more sensors means more observations, thus, lower CRB values. Although MLE’s tend to have a significant bias for small sample sizes, we have proved that the MLE for our scheme is asymptotically strongly consistent and efficient. Therefore, the analytic derivations above for the CRB for and hold in the asymptotic region. The simulation results in the following subsection show that the asymptotic behavior is achieved even with a small number of sensors.
5.3. Numerical Simulation Results
To evaluate the performance of the dithered quantization scheme and compare it with the identical and the binning-based non-identical threshold approaches, we now conduct numerical Monte Carlo simulations. In these simulations (i) the number of sensors is varied from 10 to 200 and (ii) both a low of 0.05 and a high of 0.1 are considered. The value of is set to 50 m, which corresponds to dB and is set to −10 dB, the maximum transmission power allowed for 802.11b. We use the typical value of 2.5 for the path-loss exponent . The standard deviation of the RSS distribution observed at the sensor motes is set to 4 dB; that is, dB.
The results obtained were averaged over 2000 realizations of the measurement noise process. It can easily be shown (see Appendix D) that the log-likelihood function is not a concave function of for both non-identical threshold-based approaches. Hence, we implemented an 1-dimensional iterated grid search algorithm  to locate an approximate maximal value of the log-likelihood function denoted by . We employed an equidistance grid of size points given as: Using the grid , the values are used in the grid search algorithm. An approximate local maximum is located by choosing the grid point that has the largest value for . Using this initialization point, we then used Matlab's sequential quadratic programming (SQP) method to perform the local optimization to determine the MLE.
To characterize the computational complexity of the optimization algorithm, we note that the local optimization using SQP has quadratic convergence rate. The computational complexity of the iterative grid search algorithm can be expressed as , where is the dimension of the parameter space, is the grid size, and is the number of iterations. In our simulation experiments, we found that with and a grid size of the algorithm converged to an approximate local maximal point quickly. Hence, the computational complexity of the grid search for our case is . In our Matlab implementation of the grid search algorithm, we were able to reduce the complexity to , by the use of sorting algorithms to find the grid point that would correspond to the largest value of the log-likelihood function . In a practical setting, the search grid will be precomputed, and the algorithm will be executed on the CH. Since the CH typically has more processing power than other motes, in a practical setting the convergence of the algorithm would be very fast.
The non-identical thresholds for the dithered quantization technique are generated using the technique described in Section 3, and, for the binning-based technique the SOCP 7 is solved in Matlab using cvx software . As mentioned in , the threshold spacing for the binning technique is set to , and hence we have dB, therefore the number of threshold bins . For the case where an identical threshold is used by all sensor motes, we consider two scenarios. In the first case, the optimal threshold is used; that is, , which corresponds to dB. In the second case, an identical nonoptimal threshold is used, this corresponds to choosing above/below the true mean value of the RSS distribution; that is, dB. For simulation purposes, we set ; this corresponds to dB. Similar simulation results are obtained for the case when .
In Figures 5(a) and 5(b), we plot the root mean squared error (RMSE) of for the low and high cases. We observe that the RMSE using the dithered quantization approach is lower for a small number of sensor motes compared to the non-optimal identical threshold approach and the binning-based non-identical approaches. As the number of sensor motes is increased the RMSE of the binning-based non-identical technique converges to the dithered quantization technique. This is expected since for the binning based approach as the number of sensor motes is increased the threshold frequency () increases which leads to the improvements in the performance.
Figures 6(a) and 6(b) show the bias of versus the number of sensor motes. We notice that the bias of the MLE using the dithered quantization technique is lower than the non-optimal estimators. Furthermore, we also observe that the bias decreases at an exponential rate with respect to the number of sensor motes and approaches close to 0 with about 100 sensor motes. Figures 5 and 6 also show that the asymptotic properties of the MLE are achievable with about 50 sensor motes for low values of and about 70 sensor motes for high values of .
In Figures 7(a) and 7(b), we compare the performance loss incurred using the different thresholding techniques. We define the , where CRBnon-opt is the CRB of any unbiased estimator using either the dithered quantization, binning-based or identical non-optimal thresholding techniques, and CRBopt is the CRB of any unbiased estimator using the optimal identical threshold. This metric serves as a good benchmark as, for large number of sensor motes, the MLE’s are unbiased, and hence the MSE is equal to the CRB. Figures 7(a) and 7(b) show the CRBLoss versus the number of sensors. We observe that for low and high values the loss is significantly less for the dithered quantization technique compared with the other schemes, particularly for a small number of sensor motes which is important from a practical point of view.
Figure 8 shows the robustness of our scheme due to a mismatch in the true value of and the value of used by the CH for the ML estimation. We notice that even if there is a mismatch, the performance degradation is not significant. The performance of having a perfectly estimated value of can be replicated using more sensor motes under the condition of a mismatch in . Furthermore, the gap between the performance between the perfectly estimated and the mismatched decreases as the number of sensor motes increases.
In a realistic situation in which the mean of the RSS distribution at the sensor nodes is unknown priori, there is no way to choose the optimal for the identical threshold case. It will thus be difficult to achieve good/reliable estimates using non-optimal identical thresholds. In this type of practical scenario, if both approaches (non-optimal identical and non-identical thresholds) use the same number of sensors, and each sensor samples the RSS once, then using the non-identical threshold approach would produce a much more accurate estimate.
Although both non-identical thresholding approaches require fewer sensors than the non-optimal identical threshold technique to achieve near-optimal performance, we observe that compared to the binning approach our thresholding scheme is of low complexity, as it does not involve solving any complex optimization problem to design the thresholds. Furthermore, the dithered quantization technique performs better in terms of having a lower RMSE, variance, and bias compared with the binning and non-optimal identical thresholding techniques, particularly when the number of sensors is small, which is the typical case in a practical scenario.
In summary, the dithered quantization technique has significant advantages over other techniques in terms of either the number of sensors required to achieve a given accuracy or the accuracy of estimates achievable with a fixed number of sensors.
6. Drawbacks of the Identical Threshold Approach
In this section, we study the disadvantages of using the identical threshold approach and the effect on using this technique. As observed in previous work [10, 11], with the error-free communication channel, the disadvantage of the identical threshold approach is that the CRB for grows exponentially with . A similar observation can be seen for the CRB of when the identical threshold is used under a BSC model. Using the tight Chernoff bound for the ccdf of the Gaussian distribution (i.e., ), the CRB for can be bounded as follows: where . Figure 9(a) shows the exponential increase with respect to for and for the CRB of . We notice that the Chernoff bound is tight and that a small deviation of from the true unknown value will result in a significant loss in performance. Although a similar result has previously been widely reported for the error-free channel case [10, 11], to the best of our knowledge, no one has studied the performance of the MLE’s in terms of the MSE and variance effects using the identical threshold approach. Hence, to further analyze the effects of using this technique, Figure 9(b) shows the MSE and variance plot as is varied. As with the CRB plot, the performance degradation in terms of the MSE is also exponential as deviates from . However, we notice the existence of multiple critical points. This effect is because the MSE can be decomposed into the and variance. The figure shows that for small deviations from the is nearly zero, and the variance increases exponentially; however, when , the variance starts to decrease, but the bias increases linearly with . These combined effects reiterate the fact that using identical thresholds could potentially result in estimators with very high bias and MSE.
In this paper, we proposed and analyzed a sensor fusion algorithm for interference characterization in wireless networks. To minimize energy usage, each wireless sensor in the network transmits only 1-bit of quantized, noisy RSS information to the FC over a BSC.
Unlike previous approaches that used identical thresholds for all sensors or use non-identical thresholds based on solving a complex optimization problem, we propose a simple and low complexity threshold design technique of uniformly distributing the thresholds over the range of possible values of the mean of the RSS distribution. This approach performs (i) as well as the optimal identical threshold approach and (ii) significantly better than the identical non-optimal threshold design approaches and has a performance that is more accurate or as good as previously proposed non-identical threshold techniques. The optimal identical threshold case is highly unrealistic because the optimal threshold cannot be known in advance; our non-identical threshold technique is much more practical, reliable, and of low complexity design compared to previously proposed techniques based on either using non-identical or identical non-optimal thresholds.
A. Asymptotic Consistency of MLE
Proof. We start with the following assumptions that are restated from [33, page 443-444] for completeness and are easy to verify the following. (A0)The distributions of the observations are distinct. (A1)The distributions have common support. (A2)The observations are , where the are independent with probability density with respect to the underlying probability measure. (A3)The parameter space contains an open set of which the true parameter value is an interior point.
Next, we prove the following lemma.Lemma 2. For the independent nonidentically distributed (i.n.i.d) random variables ’s we have where is the true value of .Proof. To prove the lemma, it is equivalent to prove the following: Next, we show that the strong law of large numbers (SLLNs) can be applied to the term . To show this, we check the Kolmogorov sufficient conditions for the SLLN to hold for independent r.v.’s. Let , , , and . We further assume w.l.o.g. that , and using (12) we have the following inequalities: Similar inequalities hold for and , respectively. The variance of can be bounded as follows: Therefore, , hence, the SLLN holds for ’s, and we have where represents the expectation using the pdf when . Now by Jensen’s inequality we have Using the result (A.6) in (A.5), statement (A.2) is proved, and hence the lemma follows.Next we consider a -neighborhood about such that and define and . Hence, by Lemma 2 we have, and, therefore, for all , there exists s.t. the likelihood function is maximized in the interval. Since for any small enough, there exists a sequence of roots to the equation s.t. . Next we choose a sequence which does not depend on , by observing that the likelihood function is a continuous function, and the limit of a sequence of roots is also another root of the equation . Therefore, there exists a root that is closest to ; hence, and since was arbitrary chosen the proposition follows.
B. Asymptotic Efficiency of MLE
Proof. The key step is to show that the central limit theorem (CLT) holds for the i.n.i.d log-likelihood functions of the ’s. As before, we state the following regularity conditions from [33, page 440-441] for completeness. (a)The parameter space is an open interval (not necessarily finite). (b)The distributions of have common support, so that the set is independent of . (c)For every , the density is twice differentiable with respect to , and the second derivative is continuous in (d) and . (e)The Fisher information . (f)For any given , there exists a positive number and a function (both of which may depend on ) s.t.
Since most of the conditions listed above are easy to verify, we provide proofs only for (d) and (f). To prove the first part of (d) we need to show that . Using the definitions for and from Appendix A, we have , , , and , where the notation and . Therefore, using (12), we have Similarly we have To check condition (f) using the result from Appendix D we have If we let , and hence Next we prove the CLT for independent nonidentically distributed (i.n.i.d) r.v.’s, which will be used to show the asymptotic efficiency result.
Lemma 3. For the independent, nonidentically distributed (i.n.i.d) log-likelihood function , we have where is the true value of , is the Fisher information matrix, , , and means convergence in distribution.Proof. For ease of notation let , , due to the regularity conditions, we have . Therefore, the l.h.s of (B.6) can be written as Since the ’s are not i.i.d., to apply the CLT we must verify the Lindeberg sufficiency condition. Hence we need to show that for all , where . It can be shown that , where and . Using this we have where (a) in (B.9) follows from the fact that for . Therefore, We observe that from (B.9) that hence where (B.11) follows from the fact that by the Lebesgue dominated convergence theorem. Hence, the Lindeberg conditions are satisfied and the result follows.For rest of the proof, let , . Then, by the mean value theorem, with for some such that : Since is the MLE, the l.h.s. of (B.12) is equal to 0. We thus obtain Now since is a strongly consistent estimator of , we have , where means convergence in probability. This implies , by the fact that if , then for a continuous function . Using arguments similar to those in Appendix A, it can be shown that the Kolmogorov sufficient conditions for the SLLN are satisfied for , hence . By the CLT proved earlier, we have (. Hence by Slutsky’s theorem, we thus have and the proposition follows.
C. Cramér-Rao Bound
D. Concavity of Log-Likelihood Function
Lemma 4. The log-likelihood function is not a concave function.
Proof. Let , where , , and w.l.o.g we assume that . From the properties of concave functions, we know that if and are concave and positive, then is concave. Consider the terms and , the first and second derivatives of these terms can be expressed as
Using the above equations, we can express the second derivative of the log-likelihood function as where , , , and . For to be concave, a sufficient condition is that , it can be seen from (D.2) that depending on the values of and the received bits the sufficiency condition may not be satisfied. For example, consider the scenario with in this case dB, and dB. With the received vector , the second derivative of the log-likelihood function can be expressed as An equivalent sufficiency condition to show that is concave is if . Using the definitions of and , we can obtain the following upper bounds Then can be upper bounded as follows: It can be seen from (D.5) that for the second derivative of the log-likelihood function and hence will not be concave for this range of . With , we have that for dB . Therefore, we can conclude that log-likelihood function is not concave for all .
- X. Zhong, H. H. Chan, T. J. Rogers, C. P. Rosenberg, and E. J. Coyle, “The development and eStadium testbeds for research and development of wireless services for large-scale sports venues,” in Proceedings of the 2nd International IEEE/Create-Net Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM '06), pp. 340–348, March 2006.
- A. Ault, J. V. Krogmeier, S. R. Dunlop, and E. J. Coyle, “eStadium: the mobile wireless football experience,” in Proceedings of the 3rd International Conference on Internet and Web Applications and Services (ICIW '08), pp. 644–649, June 2008.
- X. Zhong and E. J. Coyle, “eStadium: a wireless “living lab” for safety and infotainment applications,” in Proceedings of the 1st International Conference on Communications and Networking in China (ChinaCom '06), 2007.
- A. Hills, “Smart Wi-Fi,” Scientific American, vol. 285, no. 10, pp. 86–94, 2005.
- J. K. Nelson and M. R. Gupta, “An EM technique for multiple transmitter localization,” in Proceedings of the 41st Annual Conference on Information Sciences and Systems (CISS '07), pp. 610–615, March 2007.
- J. K. Nelson, M. U. Hazen, and M. R. Gupta, “Global optimization for multiple transmitter localization,” in Proceedings of the Military Communications Conference (MILCOM '06), pp. 1–7, October 2006.
- T. Roos, P. Myllymaki, and H. Tirri, “A statistical modeling approach to location estimation,” IEEE Transactions on Mobile Computing, vol. 1, no. 1, pp. 59–69, 2002.
- X. Liu and S. Shankar, “Sensing-based opportunistic channel access,” Mobile Networks and Applications, vol. 11, no. 4, pp. 577–591, 2006.
- K. R. Chowdhury and I. F. Akyildiz, “Cognitive wireless mesh networks with dynamic spectrum access,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 1, pp. 168–181, 2008.
- A. Ribeiro and G. B. Giannakis, “Bandwidth-constrained distributed estimation for wireless sensor networks—part I: gaussian case,” IEEE Transactions on Signal Processing, vol. 54, no. 3, pp. 1131–1143, 2006.
- A. Ribeiro and G. B. Giannakis, “Bandwidth-constrained distributed estimation for wireless sensor networks—part II: unknown probability density function,” IEEE Transactions on Signal Processing, vol. 54, no. 7, pp. 2784–2796, 2006.
- R. Niu and P. K. Varshney, “Target location estimation in sensor networks with quantized data,” IEEE Transactions on Signal Processing, vol. 54, no. 12, pp. 4519–4528, 2006.
- A. Dogandžić and B. Zhang, “Nonparametric probability density estimation for sensor networks using quantized measurements,” in Proceedings of the 41st Annual Conference on Information Sciences and Systems (CISS '07), pp. 759–764, March 2007.
- O. Ozdemir, R. Niu, and P. K. Varshney, “Channel aware target localization with quantized data in wireless sensor networks,” IEEE Transactions on Signal Processing, vol. 57, no. 3, pp. 1190–1202, 2009.
- T. C. Aysal and K. E. Barner, “Constrained decentralized estimation over noisy channels for sensor networks,” IEEE Transactions on Signal Processing, vol. 56, no. 4, pp. 1398–1410, 2008.
- T. C. Aysal and K. E. Barner, “Blind decentralized estimation for bandwidth constrained wireless sensor networks,” IEEE Transactions on Wireless Communications, vol. 7, no. 5, Article ID 4524301, pp. 1466–1471, 2008.
- T. C. Aysal and K. E. Barner, “Sensor data cryptography in wireless sensor networks,” IEEE Transactions on Information Forensics and Security, vol. 3, no. 2, Article ID 4470151, pp. 273–289, 2008.
- Z. Q. Luo, “Universal decentralized estimation in a bandwidth constrained sensor network,” IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 2210–2219, 2005.
- S. Cui, J. J. Xiao, A. J. Goldsmith, Z. Q. Luo, and H. V. Poor, “Estimation diversity and energy efficiency in distributed sensing,” IEEE Transactions on Signal Processing, vol. 55, no. 9, pp. 4683–4695, 2007.
- J. J. Xiao, S. Cui, Z. Q. Luo, and A. J. Goldsmith, “Power scheduling of universal decentralized estimation in sensor networks,” IEEE Transactions on Signal Processing, vol. 54, no. 2, pp. 413–422, 2006.
- J. J. Xiao and Z. Q. Luo, “Decentralized estimation in an inhomogeneous sensing environment,” IEEE Transactions on Information Theory, vol. 51, no. 10, pp. 3564–3575, 2005.
- E. Visotsky, S. Kuffher, and R. Peterson, “On collaborative detection of TV transmissions in support of dynamic spectrum sharing,” in Proceedings of the 1st IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN '05), pp. 338–345, 2005.
- A. Ghasemi and E. S. Sousa, “Asymptotic performance of collaborative spectrum sensing under correlated log-normal shadowing,” IEEE Communications Letters, vol. 11, no. 1, pp. 34–36, 2007.
- IEEE802.15.4, “Ieee standard 802 part 15.4 wireless medium access control (mac) and physical layer (phy) specifications for low rate wireless personal area networks (wpans),” 2006.
- T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 1991.
- S. Bandyopadhyay, Q. Tian, and E. J. Coyle, “Spatio-temporal sampling rates and enery efficiency in wireless sensor networks,” IEEE/ACM Transactions on Networking, vol. 13, no. 6, pp. 1339–1352, 2005.
- Cisco, “Cisco aironet 1200 series access point data sheet,” [Online], 2006, http://www.cisco.com/en/US/prod/collateral/wireless/ps5678/ps430/ps4076/product_data_sheet09186a00800937a6.html.
- V. Kapnadak, M. Senel, and E. J. Coyle, “Distributed iterative quantization for interference characterization in wireless networks,” Digital Signal Processing. In press.
- S. M. Kay, Fundamentals of Statistical Signal Processing-Estimation Theory, vol. 1, PrenticeHall PTR, Upper Saddle River, NJ, USA, 1993.
- T. S. Rappaport, Wireless Communications- Principles and Practices, PrenticeHall PTR, Upper Saddle River, NJ, USA, 2002.
- R. A. Thisted, Elements of Statistical Computing, vol. 1, Chapman and Hall, 1988.
- “Cvx: Matlab software for disciplined convex programming,” http://cvxr.com/cvx/.
- E. Lehmann and G. Casella, Theory of Point Estimation, Springer, 1998.