2,785 research outputs found
Fusion Rules for Distributed Detection in Clustered Wireless Sensor Networks with Imperfect Channels
In this paper we investigate fusion rules for distributed detection in large random clustered-wireless sensor networks (WSNs) with a three-tier hierarchy; the sensor nodes (SNs), the cluster heads (CHs) and the fusion center (FC). The CHs collect the SNs' local decisions and relay them to the FC that then fuses them to reach the ultimate decision. The SN-CH and the CH-FC channels suffer from additive white Gaussian noise (AWGN). In this context, we derive the optimal log-likelihood ratio (LLR) fusion rule, which turns out to be intractable. So, we develop a sub-optimal linear fusion rule (LFR) that weighs the cluster's data according to both its local detection performance and the quality of the communication channels. In order to implement it, we propose an approximate maximum likelihood based LFR (LFR-aML), which estimates the required parameters for the LFR. We also derive Gaussian-tail upper bounds for the detection and false alarms probabilities for the LFR. Furthermore, an optimal CH transmission power allocation strategy is developed by solving the Karush-Kuhn-Tucker (KKT) conditions for the related optimization problem. Extensive simulations show that the LFR attains a detection performance near to that of the optimal LLR and confirms the validity of the proposed upper bounds. Moreover, when compared to equal power allocation, simulations show that our proposed power allocation strategy achieves a significant power saving at the expense of a small reduction in the detection performance
Data Transmission with Reduced Delay for Distributed Acoustic Sensors
This paper proposes a channel access control scheme fit to dense acoustic
sensor nodes in a sensor network. In the considered scenario, multiple acoustic
sensor nodes within communication range of a cluster head are grouped into
clusters. Acoustic sensor nodes in a cluster detect acoustic signals and
convert them into electric signals (packets). Detection by acoustic sensors can
be executed periodically or randomly and random detection by acoustic sensors
is event driven. As a result, each acoustic sensor generates their packets
(50bytes each) periodically or randomly over short time intervals
(400ms~4seconds) and transmits directly to a cluster head (coordinator node).
Our approach proposes to use a slotted carrier sense multiple access. All
acoustic sensor nodes in a cluster are allocated to time slots and the number
of allocated sensor nodes to each time slot is uniform. All sensor nodes
allocated to a time slot listen for packet transmission from the beginning of
the time slot for a duration proportional to their priority. The first node
that detect the channel to be free for its whole window is allowed to transmit.
The order of packet transmissions with the acoustic sensor nodes in the time
slot is autonomously adjusted according to the history of packet transmissions
in the time slot. In simulations, performances of the proposed scheme are
demonstrated by the comparisons with other low rate wireless channel access
schemes.Comment: Accepted to IJDSN, final preprinted versio
Distributed detection and estimation in wireless sensor networks: resource allocation, fusion rules, and network security
This thesis addresses the problem of detection of an unknown binary event. In particular, we consider centralized detection, distributed detection, and network security in wireless sensor networks (WSNs). The communication links among SNs are subject to limited SN transmit power, limited bandwidth (BW), and are modeled as orthogonal channels with path loss, flat fading and additive white Gaussian noise (AWGN). We propose algorithms for resource allocations, fusion rules, and network security.
In the first part of this thesis, we consider the centralized detection and calculate the optimal transmit power allocation and the optimal number of quantization bits for each SN. The resource allocation is performed at the fusion center (FC) and it is referred as a centralized approach. We also propose a novel fully algorithm to address this resource allocation problem. What makes this scheme attractive is that the SNs share with their neighbors just their individual transmit power at the current states. Finally, the optimal soft fusion rule at the FC is derived. But as this rule requires a-priori knowledge that is difficult to attain in practice, suboptimal fusion rules are proposed that are realizable in practice.
The second part considers a fully distributed detection framework and we propose a two-step distributed quantized fusion rule algorithm where in the first step the SNs collaborate with their neighbors through error-free, orthogonal channels. In the second step, local 1-bit decisions generated in the first step are shared among neighbors to yield a consensus. A binary hypothesis testing is performed at any arbitrary SN to optimally declare the global decision. Simulations show that our proposed quantized two-step distributed detection algorithm approaches the performance of the unquantized centralized (with a FC) detector and its power consumption is shown to be 50% less than the existing (unquantized) conventional algorithm.
Finally, we analyze the detection performance of under-attack WSNs and derive attacking and defense strategies from both the Attacker and the FC perspective. We re-cast the problem as a minimax game between the FC and Attacker and show that the Nash Equilibrium (NE) exists. We also propose a new non-complex and efficient reputation-based scheme to identify these compromised SNs. Based on this reputation metric, we propose a novel FC weight computation strategy ensuring that the weights for the identified compromised SNs are likely to be decreased. In this way, the FC decides how much a SN should contribute to its final decision. We show that this strategy outperforms the existing schemes
Distributed Detection over Gaussian Multiple Access Channels with Constant Modulus Signaling
A distributed detection scheme where the sensors transmit with constant
modulus signals over a Gaussian multiple access channel is considered. The
deflection coefficient of the proposed scheme is shown to depend on the
characteristic function of the sensing noise and the error exponent for the
system is derived using large deviation theory. Optimization of the deflection
coefficient and error exponent are considered with respect to a transmission
phase parameter for a variety of sensing noise distributions including
impulsive ones. The proposed scheme is also favorably compared with existing
amplify-and-forward and detect-and-forward schemes. The effect of fading is
shown to be detrimental to the detection performance through a reduction in the
deflection coefficient depending on the fading statistics. Simulations
corroborate that the deflection coefficient and error exponent can be
effectively used to optimize the error probability for a wide variety of
sensing noise distributions.Comment: 30 pages, 12 figure
Cooperative sensing of spectrum opportunities
Reliability and availability of sensing information gathered from local spectrum sensing (LSS) by a single Cognitive Radio is strongly affected by the propagation conditions, period of sensing, and geographical position of the device. For this reason, cooperative spectrum sensing (CSS) was largely proposed in order to improve LSS performance by using cooperation between Secondary Users (SUs).
The goal of this chapter is to provide a general analysis on CSS for cognitive radio networks (CRNs). Firstly, the theoretical system model for centralized CSS is introduced, together with a preliminary discussion on several fusion rules and operative modes. Moreover, three main aspects of CSS that substantially differentiate the theoretical model from realistic application scenarios are analyzed: (i) the presence of spatiotemporal correlation between decisions by different SUs; (ii) the possible mobility of SUs; and (iii) the nonideality of the control channel between the SUs and the Fusion Center (FC). For each aspect, a possible practical solution for network organization is presented, showing that, in particular for the first two aspects, cluster-based CSS, in which sensing SUs are properly chosen, could mitigate the impact of such realistic assumptions
- …