Modern smart grids, by and large, merge physical interconnections and cyber controllers. Invariably, this tight coupling results in cyber commands manifesting in the physical layer as observable changes, leading to po...
详细信息
Modern smart grids, by and large, merge physical interconnections and cyber controllers. Invariably, this tight coupling results in cyber commands manifesting in the physical layer as observable changes, leading to possible disclosure of sensitive system settings. Thus, cyber event confidentiality of the smart grid is violated. Attacks on confidentiality can ultimately lead to integrity and availability attacks;with adequate knowledge of the system topology, internal settings, and how the physical layer responds to cyber commands, a malicious adversary gains knowledge to attack the system. This work shows how to develop self-obfuscating systems based on information flow security properties that can mitigate event confidentiality violations in smart grids.
We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to N identical and independent sensors generating binary messages. The root of the tre...
详细信息
We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to N identical and independent sensors generating binary messages. The root of the tree is a fusion center making an overall decision. Every other node is a relay node that aggregates the messages received from its child nodes into a new message and sends it up toward the fusion center. We derive upper and lower bounds for the total error probability P-N as explicit functions of N in the case where nodes and links fail with certain probabilities. These characterize the asymptotic decay rate of the total error probability as N goes to infinity. Naturally, this decay rate is not larger than that in the non-failure case, which is root N. However, we derive an explicit necessary and sufficient condition on the decay rate of the local failure probabilities p(k) (combination of node and link failure probabilities at each level) such that the decay rate of the total error probability in the failure case is the same as that of the non-failure case. More precisely, we show that log P-N(-1) = Theta(root N) if and only if log p(k)(-1) = Omega(2(k/2)).
Proper Power allocation can improve energy efficiency in wireless sensor networks (WSNs). Previous works considered only the channel statistics and did not take the instantaneous observations into consideration. Apply...
详细信息
ISBN:
(纸本)9781424425167
Proper Power allocation can improve energy efficiency in wireless sensor networks (WSNs). Previous works considered only the channel statistics and did not take the instantaneous observations into consideration. Applying the instantaneous quality of an observation to the transmission power control of a node can improve the overall energy efficiency. In this work, we proposed nearly optimal power allocation schemes based on the instantaneous observation quality in each node for distributed detection in WSNs. The instantaneous quality of an observation is related to the log-likelihood ratio (LLR) of the signal observed by a node. According to the simulation results, at least 20% of energy can be saved when compared to the equal power allocation scheme.
This paper presents a new approach for distributed target detection in wireless sensor networks (WSNs). Contrary to the conventional practice where every sensor uses an identical threshold for decision-making, an uneq...
详细信息
This paper presents a new approach for distributed target detection in wireless sensor networks (WSNs). Contrary to the conventional practice where every sensor uses an identical threshold for decision-making, an unequal and dynamic local sensor threshold selection scheme is proposed. This threshold selection scheme is based on a recently proposed statistical metric for multiple testing problems called the False Discovery Rate (FDR). Assuming a signal attenuation model, where the received signal power decays as the distance from the target increases, various performance indices like the system level probability of detection and the probability of false alarm are studied. Simulation results are provided to demonstrate the effectiveness of this approach.
distributed detection of information flows is considered in which traffic sensors at different locations of a network observe transmission epochs. The traffic sensors communicate their measurements to a fusion center ...
详细信息
distributed detection of information flows is considered in which traffic sensors at different locations of a network observe transmission epochs. The traffic sensors communicate their measurements to a fusion center via channels with rate constraints, and the fusion center performs hypothesis testing for information flow detection. Under a nonparametric flow model where relayed packets can be perturbed up to bounded delays and multiplexed with chaff noise, flow detectability is characterized through a notion called consistency-rate function that shows the level of detectable flows under capacity constraints on the fusion channels. Achievability results are presented by constructing detection systems consisting of quantization, data transmission, and detection subsystems. In particular, slot-by-slot quantization schemes at the local sensors and threshold detection schemes at the fusion center are proposed to provide consistent detection with quantifiable performance.
In this paper, the problem of dynamic event region detection and reconstruction using a wireless sensor network is studied. T he spatiotemporal relationship of the evolving field is assumed and modeled by dynamic Mark...
详细信息
ISBN:
(纸本)9781479904631
In this paper, the problem of dynamic event region detection and reconstruction using a wireless sensor network is studied. T he spatiotemporal relationship of the evolving field is assumed and modeled by dynamic Markov random fields. Observations are collected from a network of sensors distributed in the field. To meet the stringent bandwidth and energy constraints in wireless sensor networks, only quantized observations from a subset of sensor nodes are allowed to be transmitted to the center. To reconstruct and track the field state map at a control center at each time step, a processing framework including sensor selection, local observation quantization and central processing is proposed. T he performance of the proposed processing framework is analyzed through simulations and the effectiveness and efficiency is demonstrated by comparing with other methods.
In the past decades, physical layer security has been extensively studied to exploit fundamental capabilities of physical layer such as randomness in wireless channels, signal-to-noise ratio gap, intended jamming, etc...
详细信息
ISBN:
(纸本)9781467362351
In the past decades, physical layer security has been extensively studied to exploit fundamental capabilities of physical layer such as randomness in wireless channels, signal-to-noise ratio gap, intended jamming, etc., for secure wireless communications. The notion of secrecy rate plays a crucial role in quantifying the transmission rate for secure communications in the presence of an eavesdropper. Wireless sensor networks (WSNs) often require secure communications as the transmissions from sensors to a fusion center are vulnerable to eavesdropping. Although the application of cryptography schemes has been considered in WSNs, most schemes would be too expensive for sensors in terms of computation and energy cost. Thus, it might be necessary to devise physical layer security schemes that exploit properties of wireless channels to avoid eavesdropping with much less computation and energy cost. In this paper, we discuss physical layer security techniques for the WSNs that perform distributed detection. Since the notion of secrecy rate may not be useful in WSNs, we employ the notion of the maximum equivocation in distributed detection to see whether or not perfect secrecy is achievable.
Many of today's wireless sensor networks operate under the strict requirement that only a single sensor transmits data at a time. One way to guarantee this is to use protocols that detect and prevent package colli...
详细信息
ISBN:
(纸本)9781479903566
Many of today's wireless sensor networks operate under the strict requirement that only a single sensor transmits data at a time. One way to guarantee this is to use protocols that detect and prevent package collisions on the MAC layer. These, however, come at the cost of increased transmission delays, reduced throughput and higher energy consumption. We propose a PHY layer approach to collision avoidance that is based on sequential detection and significantly reduces the risk of collisions while simultaneously minimizing the transmission delay. For this approach, a performance analysis is given whose results are shown to closely match numerical simulations.
Spectrum sensing is a critical and challenging issue in cognitive radio networks. Prior research has demonstrated that using spatial diversity or temporal diversity can lead to more efficient spectrum sensing. Based o...
详细信息
ISBN:
(纸本)9781467356978;9781467356992
Spectrum sensing is a critical and challenging issue in cognitive radio networks. Prior research has demonstrated that using spatial diversity or temporal diversity can lead to more efficient spectrum sensing. Based on Neyman-Pearson criterion, this paper derives a novel spectrum sensing algorithm which exploits spatial diversity among multiple cognitive sensors and temporal diversity among consecutive time slots jointly. The numerical results not only verify the improvement of the sensing performance comparing with singular (spatial or temporal) diversity is applied, but also show the reduction of sensing overhead in low signal-noise-ratio (SNR) regime.
The ant colony optimization algorithm is good at solving multidimensional optimization problem. The allocation of power resource of a node in wireless sensor networks should make the detection performance of the whole...
详细信息
ISBN:
(纸本)9783037855744
The ant colony optimization algorithm is good at solving multidimensional optimization problem. The allocation of power resource of a node in wireless sensor networks should make the detection performance of the whole network maximum, which is complex due to the detection probability of the whole system cannot be expressed explicitly. Therefore, continuous ant colony system (CACS) is adopted to optimize the allocation of each node's power between sensing and communications. The results show that it can lead to a good power allocation. At the same time, the scheme that all sensor nodes have identical power assignment can achieve nearly the same detection performance as compared that achieved by the best scheme searched by CACS. As a result, particularly for a large number of sensors, an identical power allocation scheme for each node can be employed to achieve nearly the best detection performance.
暂无评论