In this paper, we present a practical and provably secure two-way wireless communication scheme in the presence of a passive eavesdropper. The scheme implements a randomized scheduling and power allocation mechanism, where each legitimate node transmits in random time slots and with random transmit power. Such randomization results in ambiguity at the eavesdropper with regard to the origin of each transmitted frame. The scheme is analyzed in a time-varying binary block erasure channel model and secrecy outage probabilities are derived and empirically evaluated. The scheme is implemented over an IEEE 802.15.4-enabled Sun SPOT sensor motes. The results show that the proposed scheme achieves significant secrecy gains with a vanishing outage probability, at the expense of slight decrease in throughput, even when the eavesdropper is equipped with a receive power based classifier and is located too close to the transmitter node.
In this paper, we present a practical and provably secure two-way wireless communication scheme in the presence of a passive eavesdropper. The scheme implements a randomized scheduling and power allocation mechanism, where each legitimate node transmits in random time slots and with random transmit power. Such randomization results in ambiguity at the eavesdropper with regard to the origin of each transmitted frame. The scheme is analyzed in a time-varying binary block erasure channel model and secrecy outage probabilities are derived and empirically evaluated. The scheme is implemented over an IEEE 802.15.4-enabled Sun SPOT sensor motes. The results show that the proposed scheme achieves significant secrecy gains with a vanishing outage probability, at the expense of slight decrease in throughput, even when the eavesdropper is equipped with a receive power based classifier and is located too close to the transmitter node.
This paper develops a new physical layer framework for secure two-way wireless communication in the presence of a passive eavesdropper, i.e., Eve. Our approach achieves perfect information theoretic secrecy via a novel randomized scheduling and power allocation scheme. The key idea is to allow Alice and Bob to send symbols at random time instants. While Alice will be able to determine the symbols transmitted by Bob, Eve will suffer from ambiguity regarding the source of any particular symbol. This desirable ambiguity is enhanced, in our approach, by randomizing the transmit power level. Our theoretical analysis, in a 2-D geometry, reveals the ability of the proposed approach to achieve relatively high secure data rates under mild conditions on the spatial location of Eve. These theoretical claims are then validated by experimental results using IEEE 802.15.4-enabled sensor boards in different configurations, motivated by the spatial characteristics of Wireless Body Area Networks (WBAN).
We present a practical and provably-secure multinode communication scheme in the presence of a passive eavesdropper. The scheme is based on a random scheduling approach that hides the identity of the transmitter from the eavesdropper. This random scheduling leads to ambiguity at the eavesdropper with regard to the origin of the transmitted frame. Implementation of the scheme over Crossbow Telosb motes, equipped with CC2420 radio chips, shows that the scheme can achieve significant secrecy gain with vanishing outage probability. In addition, it has significant overhead advantage over direct extensions to two-nodes schemes. The technique also has the advantage of allowing inactive nodes to leverage sleep mode to further save energy.
This work considers the two way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks; in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards to validate our theoretical analysis. Using this testbed, it is shown that one can exploit the two way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve. To the best of our knowledge, this is one of the first attempts aiming towards building practical secrecy protocols inspired by information theoretic principles.
This work considers the two-way wiretap channel in which two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, we obtain new achievable secrecy rate regions based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half-duplex case, where a user can only transmit or receive on any given degree of freedom, we introduce the idea of randomized scheduling and establish the significant gain it offers in terms of the achievable secrecy sum-rate. We further develop an experimental setup based on a IEEE 802.15.4-enabled sensor boards, and use this testbed to show that one can exploit the two-way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve.
The two-way wiretap channel is considered in this paper. Two legitimate users, Alice and Bob, wish to exchange messages securely in the presence of a passive eavesdropper Eve. In the full-duplex scenario, where each node can transmit and receive simultaneously, new achievable secrecy rate regions are obtained based on the idea of allowing the two users to jointly optimize their channel prefixing distributions and binning codebooks in addition to key sharing. The new regions are shown to be strictly larger than the known ones for a wide class of discrete memoryless and Gaussian channels. In the half-duplex case, where a user can only transmit or receive on any given degree of freedom, the idea of randomized scheduling is introduced and shown to offer a significant gain in terms of the achievable secrecy sum-rate. A practical setup is further developed based on a near field wireless communication scenario, and it is shown that one can exploit the two-way nature of the communication, via appropriately randomizing the transmit power levels and transmission schedule, to introduce significant ambiguity at a noiseless Eve.
This work investigates the secure transmission in the wireless information and power transfer system where a source node communicates with a wireless-powered full-duplex destination node in the presence of a passive eavesdropper. In particular, we propose such a two-phase time-sharing (TS) secure communication protocol: in the first phase, energy harvesting is conducted from the source node to the destination node, while in the second phase, the source node transmits information-bearing signal under the protection of artificial noise sent from the destination node. It is worth to mention that the energy of this artificial noise at the destination node is converted from the harvested energy in the first phase and self-interference exists at the destination in the second phase. We derive the closed-form expressions for the connection outage probability (COP), the secrecy outage probability (SOP) and the transmission outage probability (TOP), based on which the secrecy throughput is formulated. Further, we determine the optimal time allocation factor and the optimal codeword transmission rate to maximize the secrecy throughput with dual outage constraints. Finally, numerical results verifies our results and exams the effect of the time allocation factor and the codeword transmission rate on the performance.