This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers, without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical layer message authentication is also briefly introduced. The survey concludes with observations on potential research directions in this area.

/pdf/principles-of-physical-layer-security-in-multiuser-wireless-3w4jvwpgy4.pdf

Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

(1987). Applied Probability and Queues. Journal of the Operational Research Society: Vol. 38, No. 11, pp. 1095-1096.

https://link.springer.com/content/pdf/10.1057%2Fjors.1987.184.pdf

Applied Probability and Queues

Thank you for downloading linear and nonlinear programming. As you may know, people have search numerous times for their favorite novels like this linear and nonlinear programming, but end up in malicious downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they juggled with some infectious bugs inside their desktop computer. linear and nonlinear programming is available in our book collection an online access to it is set as public so you can download it instantly. Our digital library spans in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the linear and nonlinear programming is universally compatible with any devices to read.

Linear And Nonlinear Programming

The Internet of Things (IoT) will feature pervasive sensing and control capabilities via a massive deployment of machine-type communication (MTC) devices. The limited hardware, low-complexity, and severe energy constraints of MTC devices present unique communication and security challenges. As a result, robust physical-layer security methods that can supplement or even replace lightweight cryptographic protocols are appealing solutions. In this paper, we present an overview of low-complexity physical-layer security schemes that are suitable for the IoT. A local IoT deployment is modeled as a composition of multiple sensor and data subnetworks, with uplink communications from sensors to controllers, and downlink communications from controllers to actuators. The state of the art in physical-layer security for sensor networks is reviewed, followed by an overview of communication network security techniques. We then pinpoint the most energy-efficient and low-complexity security techniques that are best suited for IoT sensing applications. This is followed by a discussion of candidate low-complexity schemes for communication security, such as on–off switching and space-time block codes. The paper concludes by discussing open research issues and avenues for further work, especially the need for a theoretically well-founded and holistic approach for incorporating complexity constraints in physical-layer security designs.

Physical-Layer Security in the Internet of Things: Sensing and Communication Confidentiality Under Resource Constraints

This paper develops a tractable framework for exploiting the potential benefits of physical layer security in three-tier wireless sensor networks (WSNs) using stochastic geometry. In such networks, the sensing data from the remote sensors are collected by sinks with the help of access points, and the external eavesdroppers intercept the data transmissions. We focus on the secure transmission in two scenarios: 1) the active sensors transmit their sensing data to the access points and 2) the active access points forward the data to the sinks. We derive new compact expressions for the average secrecy rate in these two scenarios. We also derive a new compact expression for the overall average secrecy rate. Numerical results corroborate our analysis and show that multiple antennas at the access points can enhance the security of three-tier WSNs. Our results show that increasing the number of access points decreases the average secrecy rate between the access point and its associated sink. However, we find that increasing the number of access points first increases the overall average secrecy rate, with a critical value beyond which the overall average secrecy rate then decreases. When increasing the number of active sensors, both the average secrecy rate between the sensor and its associated access point, and the overall average secrecy rate decrease. In contrast, increasing the number of sinks improves both the average secrecy rate between the access point and its associated sink, and the overall average secrecy rate.

/pdf/physical-layer-security-in-three-tier-wireless-sensor-3papjw1cwj.pdf

Physical Layer Security in Three-Tier Wireless Sensor Networks: A Stochastic Geometry Approach

We consider the problem of secure detection in wireless sensor networks operating over insecure links. It is assumed that an eavesdropping fusion center (EFC) attempts to intercept the transmissions of the sensors and to detect the state of nature. The sensor nodes quantize their observations using a multilevel quantizer. Before transmission to the ally fusion center (AFC), the senor nodes encrypt their data using a probabilistic encryption scheme, which randomly maps the sensor's data to another quantizer output level using a stochastic cipher matrix (key). The communication between the sensors and each fusion center is assumed to be over a parallel access channel with identical and independent branches, and with each branch being a discrete memoryless channel. We employ J-divergence as the performance criterion for both the AFC and EFC. The optimal solution for the cipher matrices is obtained in order to maximize J-divergence for AFC, whereas ensuring that it is zero for the EFC. With the proposed method, as long as the EFC is not aware of the specific cipher matrix employed by each sensor, its detection performance will be very poor. The cost of this method is a small degradation in the detection performance of the AFC. The proposed scheme has no communication overhead and minimal processing requirements making it suitable for sensors with limited resources. Numerical results showing the detection performance of the AFC and EFC verify the efficacy of the proposed method.

Optimal Probabilistic Encryption for Secure Detection in Wireless Sensor Networks

The problem of binary hypothesis testing is considered in a bandwidth-constrained densely populated low-power wireless sensor network operating over insecure links. Observations of the sensors are quantized and encrypted before transmission. The encryption method maps the output of the quantizer to one of the possible quantizer output levels randomly according to a probability matrix. The intended (ally) fusion center (AFC) is aware of the encryption keys (probabilities) while the unauthorized (third party) fusion center (TPFC) is not. A constrained optimization problem is formulated from the point of view of AFC in order to design its decision rule along with the encryption probabilities. The objective function to be minimized is the error probability of AFC and the constraint is a lower bound on the error probability of TPFC. In the binary case the optimal solution is found and in the nonbinary case a good suboptimal solution is analytically obtained. Numerical results are presented to show that it is possible to degrade the error probability of TPFC significantly and still achieve very low probability of error for AFC. The proposed method which may be considered a PHY-layer security scheme is highly scalable since it does not increase the packet overhead or transmit power of the sensors and has very low computational complexity. A scheme is described to randomize the keys so as to defeat any key space exploration attack.

/pdf/scalable-phy-layer-security-for-distributed-detection-in-20clnzg3jb.pdf

Scalable PHY-Layer Security for Distributed Detection in Wireless Sensor Networks

In this paper, we consider the problem of spectrum sensing in cognitive radios (CRs) when the receiver of the secondary user (SU) is equipped with a multiantenna system. Using an estimate of the cross correlation among the signals received at different antenna elements, we propose a blind detection method, which assumes no prior knowledge of the signaling scheme used by the PU, the noise power, or the channel path coefficients. The cross correlation among the received signals is a result of the correlation among the channel path coefficients from the primary user (PU) transmitter to different antenna elements of the secondary receiver. The detection and false alarm probabilities of the proposed algorithms are evaluated using an asymptotic analysis, and the results are compared with simulation results. It is shown that the proposed methods outperform several recently proposed blind-sensing techniques for CRs using multiple antennas.

Blind Spectrum Sensing Using Antenna Arrays and Path Correlation

The problem of binary hypothesis testing is considered in a bandwidth-constrained low-power wireless sensor network operating over insecure links. Observations of the sensors are quantized and encrypted before transmission. The encryption method we propose maps the output of the quantizer to one of the possible quantizer output levels randomly according to a probability matrix. This operation is similar to that of a discrete memoryless channel. The intended (ally) fusion center (AFC) is aware of the encryption keys (probabilities) while the unauthorized (third party) fusion center (TPFC) is not. A constrained optimization problem is formulated from the point of view of AFC in order to design its decision rule along with the encryption probabilities. The objective function to be minimized is the error probability of AFC and the constraint is a lower bound on the error probability of TPFC. A good suboptimal solution to this problem is found. Numerical results are presented to show that it is possible to degrade the error probability of TPFC significantly and still achieve very low probability of error for AFC. As the number of levels in the quantizer increases the performance loss of the secure system compared to insecure system is reduced. Compared to the existing data encryption methods, the proposed method is highly scalable since it does not increase the packet overhead or transmit power of the sensors and has very low computational complexity. A scheme is described to randomize the keys so as to defeat any key space exploration attack.

/pdf/scalable-phy-layer-security-for-distributed-detection-in-1r6c3770pa.pdf

In this paper, a cross-layer analytical model is proposed to estimate Quality of Service (QoS) metrics such as delay, throughput and jitter in multi-hop wireless adhoc networks operating on IEEE 802.11-based MAC with CSMA/CA. The proposed model is useful for both evaluating quality of service or designing more efficient model-based control and management schemes. The model is developed in queuing theory paradigm which well investigates the stochastic behavior of data transmission in wireless adhoc networks. Unlike the existing works in literature, network layer processing time and advanced queue management schemes are included in the modeling process. Accuracy of the model is verified for both single and multi-hop scenarios by packet-level event-based simulations.

Reza Soosahabi

Papers

Optimal Probabilistic Encryption for Secure Detection in Wireless Sensor Networks

Scalable PHY-Layer Security for Distributed Detection in Wireless Sensor Networks

Blind Spectrum Sensing Using Antenna Arrays and Path Correlation

Scalable PHY-Layer Security for Distributed Detection in Wireless Sensor Networks

An analytical QoS model for IEEE 802.11-based single and multihop wireless networks