This paper investigates the achievable secrecy throughput of an inhomogeneous wireless sensor network. We consider the impact of topology heterogeneity and the secrecy constraint on the throughput. For the topology heterogeneity, by virtue of percolation theory, a set of connected highways and information pipelines is established; while for the secrecy constraint, the concept of secrecy zone is...

The security in cognitive radio networks (CRNs) has attracted recently a significant attention due to the open environment of the spectrum sharing networks, which make them more vulnerable to wireless attacks. In this paper, we consider the problem of physical layer security in CRNs. Our objective is to enhance the secrecy performance of the secondary user (SU) in the presence of passive eavesd...

Anonymous monitoring of transmissions in a wireless network by eavesdroppers can provide critical information about the data flows in the network. It is, therefore, necessary to design network protocols that maintain secrecy of routes from eavesdroppers. In this work, we present a mathematical formulation of route secrecy when eavesdroppers observe transmission epochs of nodes. We propose a sch...

In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at transmitter, fully or partially. However, under perfect secrecy constraint the eavesdropper may not be motivated to feedback any correct CSI. In this paper we consider a more feasible problem for the transmitter to have eavesdropper's CSI. That is, the fast fading multiple-antenna Gaussian ...

With the growth of wireless networks, security has become a fundamental issue in wireless communications due to the broadcast nature of these networks. In this work, we consider MIMO wiretap channels in a fast fading environment, for which the overall performance is characterized by the ergodic MIMO secrecy rate. Unfortunately, the direct solution to finding ergodic secrecy rates is prohibitive...

Discrete memoryless interference and broadcast channels in which independent confidential messages are sent to two receivers are considered. Confidential messages are transmitted to each receiver with perfect secrecy, as measured by the equivocation at the other receiver. In this paper, we derive inner and outer bounds for the achievable rate regions for these two communication systems.

In this work, lossy distributed compression of a pair correlated sources is considered. Conventionally, Shannon's random coding arguments - using randomly generated unstructured codebooks whose blocklength taken to be asymptotically large are used derive achievability results. However, in some multi-terminal communications scenarios, codes with constant finite certain architectures leads improv...

The growth of wireless networks has been considerable over the last decades. Due to the broadcast nature of these networks, security issues have taken a critical role in today’s communications. A promising direction towards achieving secure communications is information theoretic secrecy, which is an approach exploiting the randomness of the channels to ensure secrecy. Based on this approach, t...

This paper investigates joint source-channel secrecy for Gaussian broadcast communication in Shannon cipher system. We use a recently proposed secrecy measure, list secrecy, to measure secrecy, in which an eavesdropper is allowed to produce a list of reconstruction sequences and the secrecy is measured by the minimum distortion over the entire list. For achievability part, we propose a novel jo...

The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information theoretic secrecy to this model and consider the many-to-one interference channel with confidential messages, in which each receiver, in particular, the one subjec...