Due to the dynamic arrival of data packets and time-varying channel states, secure transmission opportunities will be wasted when there is no confidential message to transmit, and data packet transmission can be delayed while waiting for the next available secure transmission opportunity. In order to seize every precious secure transmission opportunity and reduce the data packet waiting time, we propose a secure transmission protocol in which the under-utilized secure transmission opportunities can be exploited to transmit key packets, and these key packets will encrypt the confidential messages in the subsequent transmissions. Following the above-mentioned principle, we first apply this protocol to a single-input single-output network, and optimally allocate the secure transmission opportunities for the key and data transmissions, such that the secrecy rate is maximized under the constraints of the minimum energy efficiency and queue stability requirements. In addition, the packet delay for the proposed protocol is investigated using a generating function approach and a closed-form expression of the packet delay is derived. Then, we extend our work to the multiple-input single-output network and utilize the key queue as well as the artificial noise to protect the confidential messages. Similarly, we also optimally allocate the transmission opportunities for the key and data transmissions to maximize the secrecy rate and study the data packet delay performance. Since all secrecy transmission opportunities are utilized in the proposed protocol, the full secrecy rate is achieved. Numerical results are demonstrated to verify the performance superiority of the proposed protocols when compared with the other key encrypted schemes in terms of the data packet delay and the secrecy rate.
Due to the dynamic arrival of data packets and time-varying channel states, secure transmission opportunities will be wasted when there is no confidential message to transmit, and data packet transmission can be delayed while waiting for the next available secure transmission opportunity. In order to seize every precious secure transmission opportunity and reduce the data packet waiting time, we propose a secure transmission protocol in which the under-utilized secure transmission opportunities can be exploited to transmit key packets, and these key packets will encrypt the confidential messages in the subsequent transmissions. Following the above-mentioned principle, we first apply this protocol to a single-input single-output network, and optimally allocate the secure transmission opportunities for the key and data transmissions, such that the secrecy rate is maximized under the constraints of the minimum energy efficiency and queue stability requirements. In addition, the packet delay for the proposed protocol is investigated using a generating function approach and a closed-form expression of the packet delay is derived. Then, we extend our work to the multiple-input single-output network and utilize the key queue as well as the artificial noise to protect the confidential messages. Similarly, we also optimally allocate the transmission opportunities for the key and data transmissions to maximize the secrecy rate and study the data packet delay performance. Since all secrecy transmission opportunities are utilized in the proposed protocol, the full secrecy rate is achieved. Numerical results are demonstrated to verify the performance superiority of the proposed protocols when compared with the other key encrypted schemes in terms of the data packet delay and the secrecy rate.
In this paper, we consider a single-user secure data communication system. Data packets arriving at the transmitter are enqueued at a data queue to be transmitted to the receiver over a block fading channel, securely from an eavesdropper that listens to the transmitter over another independent block fading channel. We address two separate problems, both of which involve the maximization of a long-term average utility, defined as a function of the number of secure packets transmitted in each time slot. We propose a transmission controller and an admission controller based on simple index policies that do not rely on any prior statistical information on the data arrival process. The former chooses a random key generation (and transmission) rate as well as the secure data transmission rate in each time slot. Part of the data is secured by the available secrecy rate while the other part is encrypted by the key bits, enqueued at both the transmitter and the receiver. The latter chooses the amount of data admitted by the transmitter to be enqueued in the data queue. We show that our controller pair has a provably efficient performance. Also, we illustrate via simulations that the use of a key queue reduces the queuing delay for the data packets, while serving packets that are admitted at the maximum admissible rate. To our best knowledge, this is the first work that addresses the queuing delay in the context of secrecy.
We consider a single-user secure data communication system. Data packets arriving at the transmitter are enqueued at a data queue to be transmitted to the receiver over a block fading channel, securely from an eavesdropper that listens to the transmitter over another independent block fading channel. Part of the data is secured by the available secrecy rate while the other part is encrypted by the key bits, enqueued at both the transmitter and the receiver. We first address two separate problems in this paper: (1) with an average power constraint, given any sample path of arrivals, how to admit the arrivals and allocate power such that the long term average secrecy rate is maximized and the maximum admission rate is achieved while the data queue is kept stable; (2) with infinite queue backlog, given any sample path of secrecy rate, how to control the data transmission rate and key generation such that a smooth transmission rate and then a small queueing delay are achieved. We propose a power controller, transmission controller and an admission controller based on simple index policies that do not rely on any prior statistical information on the data arrival process and channel conditions. We show that our controllers have a provably efficient performance and solve the above two problems simultaneously. Furthermore, for any given secrecy rate sample path and correspondingly admissible arrival, we provide a rate allocation policy which is sample-path queueing-delay optimal.
We consider a single-user, single-hop wireless communication system, in which data packets arrive at a data queue to be transmitted to a receiver over a block fading channel, privately from an eavesdropper. We assume that the eavesdropper listens to the transmitter over another independently fading channel and that the transmitter only has knowledge of the distribution of the eavesdropper's channel. We propose a joint secrecy rate, transmission, and admission controller based on a simple index policy that only relies on the distribution of the eavesdropper's channel rate. Given any arrival sample path, we show that our controller achieves the maximum possible data admission rate, while keeping the data queue stable as well as meeting an upper bound on the rate of secrecy outage, i.e., the fraction of data packets that are in part or fully decodable by the eavesdropper. While the solution is not unique, i.e., there are other schemes that can achieve the aforementioned performance, we show that our scheme also achieves a low queuing delay for the data packets enqueued at the data queue by striking the correct balance between direct secrecy encoding for data bits and secret key generation and utilization. To obtain this result, our transmission controller makes use of the secret key queue to smooth out the variations in the achievable secrecy rate of the associated fading wiretap channel.
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.
A wireless broadcast network model with secrecy constraints is investigated, in which a source node broadcastsKconfidential message flows toKuser nodes, with each message intended to be decoded accurately by one user and to be kept secret from all other users (who are thus considered to be eavesdroppers with regard to all other messages but their own). The source maintains a queue for each message flow if it is not served immediately. The channel from the source to theKusers is modeled as a fading broadcast channel, and the channel state information is assumed to be known to the source and the corresponding receivers. Two eavesdropping models are considered. For a collaborative eavesdropping model, in which the eavesdroppers exchange their outputs, the secrecy capacity region is obtained, within which each rate vector is achieved by using a time-division scheme and a source power control policy over channel states. A throughput optimal queue-length-based rate scheduling algorithm is further derived that stabilizes all arrival rate vectors contained in the secrecy capacity region. Moreover, the network utility function is maximized via joint design of rate control, rate scheduling, power control, and secure coding. More precisely, a source controls the message arrival rate according to its message queue, the rate scheduling selects a transmission rate based the queue length vector, and the rate vector is achieved by power control and secure coding. These components work jointly to solve the network utility maximization problem. For a noncollaborative eavesdropping model, in which eavesdroppers do not exchange their outputs, an achievable secrecy rate region is derived based on a time-division scheme, and the queue-length-based rate scheduling algorithm and the corresponding power control policy are obtained that stabilize all arrival rate vectors in this region. The network utility maximizing rate control vector is also obtained.
Future wireless communication systems are rapidly transforming to satisfy everincreasing and varying mobile user demands. Cross-layer networking protocols have the potential to play a crucial role in this transformation by jointly addressing the requirements of user applications together with the time-varying nature of wireless networking. As wireless communications becoming an integral and crucial part of our daily lives with many of our personal data is being shared via wireless transmissions, the issue of keeping personal transactions confidential is at the forefront of any network design. Wireless communications is especially prone to attacks due to its broadcast nature. The conventional cryptographical methods can only guarantee secrecy with the assumption that it is computationally prohibitive for the eavesdroppers to decode the messages. On the other hand, information-theoretical secrecy as defined by Shannon in his seminal work has the potential to provide perfect secrecy regardless of the computational power of the eavesdropper. Recent studies has shown that information-theoretical secrecy is possible over noisy wireless channels. In this thesis, we aim to design simple yet provably optimal cross-layer algorithms taking into account information-theoretical secrecy as a Quality of Service (QoS) requirement. Our work has the potential to improve our understanding the interplay between the secrecy and networking protocols. In most of this thesis, we consider a wireless cellular architecture, where all nodes participate in communication with a base station. When a node is transmitting a confidential messages, other legitimate nodes are considered as eavesdroppers, i.e., all eavesdroppers are internal. We characterize the region of achievable open and confidential data rate pairs for a single and then a multi-node scenario. We define the notion of confidential opportunistic scheduler, which schedules a node that has the largest instantaneous confidential information rate, with respect to the best eavesdropper node, which has the largest mean cross-channel rate. Having defined the operational limits of the system, we then develop dynamic joint scheduling and flow control algorithms when perfect and imperfect channel state information (CSI) is available. The developed algorithms are simple index policies, in which scheduling and flow control decisions are given in each time instant independently. In real networks, instantaneous CSI is usually unavailable due to computational and communication overheads associated with obtaining this information. Hence, we generalize our model for the case where only the distributions of direct- and crosschannel CSI are available at the transmitter. In order to provide end-to-end reliability, Hybrid Automatic Retransmission reQuest (HARQ) is employed. The challenge of using HARQ is that the dynamic control policies proposed in the preceding chapter are no longer optimal, since the decisions at each time instant are no longer independent. This is mainly due to the potential of re-transmitting a variant of the same message successively until it is decoded at the base station. We solve this critical issue by proposing a novel queuing model, in which the messages transmitted the same number of times previously are stored in the same queue with scheduler selecting a head-of-line message from these queues. We prove that with this novel queuing model, the dynamic control algorithms can still be optimal. We then shift our attention to providing confidentiality in multi-hop wireless networks, where there are multiple source-destination pairs communicating confidential messages, to be kept confidential from the intermediate nodes. For this case, we propose a novel end-to-end encoding scheme, where the confidential information is encoded into one very long message. The encoded message is then divided into multiple packets, to be combined at the ultimate destination for recovery, and being sent over different paths so that each intermediate node only has partial view of the whole message. Based on the proposed end-to-end encoding scheme, we develop two different dynamic policies when the encoded message is finite and asymptotically large, respectively. When the encoded message has finite length, our proposed policy chooses the encoding rates for each message, based on the instantaneous channel state information, queue states and secrecy requirements. Also, the nodes keep account of the information leaked to intermediate nodes as well the information reaching the destination in order to provide confidentiality and reliability. We demonstrate via simulations that our policy has a performance asymptotically approaching that of the optimal policy with increasing length of the encoded message. All preceding work assumes that the nodes are altruistic and/or well-behaved, i.e., they cooperatively participate into the communication of the confidential messages. In the final chapter of the thesis, we investigate the case with non-altruistic nodes, where non-altruistic nodes provide a jamming service to nodes with confidential communication needs and receiving in turn the right to access to the channel. We develop optimal resource allocation and power control algorithms maximizing the aggregate utility of both nodes with confidential communication needs as well as the nodes providing jamming service.