Sharif Digital Repository

As the achievability of higher rates in wireless channels is a challenging issue, analysis of efficient and practical power allocation policies for different wireless channels such as Multiple Access Channel(MAC), Relay Channel, Interference Channel is one of the research interests for many years. Convex optimization or generally optimization is one of the important problems in communication science. Optimum power allocations are also a discussing argument in information theory which in these problems the objective function is usually the transmitting rate and the problem's constraints are power constraints which must be satisfied. In this thesis, first we investigate convex optimization... 

Interference management is one of the key issues in wireless networks wherein multiple source-destination pairs share the same medium and frequency band and interfere with each other. The exponentially growth in the number of wireless systems and services results in the spectrum shortage which has emerged the technologies that increase the spectral efficiency. Providing the users with cognition equipments in these networks enables them to sense the medium and use the obtained data to adapt their transmissions to cooperate with other users and improve their own rates as well as the others which results in the cognitive radio technology. In order to access the full potential of this technology,... 

Regarding to the emergence of quantum computers and advances in the large scale implementation of them, exploiting hard problems of coding theory is of great importance.This family of problems, like those of lattices, has an acceptable resistance against classic and quantum attacks. Thus, they can be replaced with hard problems in number theory and algebra. Increasing dominance of cyberspace made us highly dependent to it. Consequently, preparing tools and methods to mitigate future threats is necessary. Digital signatures constitute an important family of cryptographic primitives. Code-based digital signatures are mostly suffering from two main drawbacks: large public key and long time of... 

First, we review in an appropriate way the researches regarding building blocks of a wireless network (Shannon channel, multiple access channel, broadcast channel, interference channel, relay channel) and then: • We consider two cases for a relay and describe the essential role of the relay with three Markovity conditions; define Almost General Relay Channel with Decode-And-Forward (AGRCDAF) strategy and determine its capacity. Then, we prove that our capacity theorem not only includes all known capacity theorems as its special cases but also potentially is applicable to other relay channels and is validated by its consistency with previous results related to special cases of broadcast and... 

“Decode and Forward” is one of coding strategies used in relay channel and networks in which each relay in the network decodes the transmitted message by the sender and other relays in the network and then re-encode and transmit it to the other relays and the receiver in the network. This process results in the cooperation between the relays and the sender to remove the uncertainty of the receiver about the transmitted message. “irregular encoding-successive decoding”, “regular encoding-backward decoding” and “regular encoding-sliding window decoding” are different methods usually used in “Decode and Forward” strategy. “partial decode and forward” is a generalized form of “decode and... 

In this thesis, we study the role of cooperation and security in multi-user channel from an information theoretic point of view. First, we review the wiretap channel as a fundamental model for the study of confidentiality in information theoretic security. To do this, we first introduce two measures for measuring the level of secrecy of confidential message, namely, average equivocation rate (AER) and equivocation rate in probability (ERP). By using a new proof, based on random covering, we show that the capacity-equivocation region of wiretap channel under AER and ERP is the same. To study cooperation in multi-user channel, we introduce the cooperative network in which each user can... 

In this dissertation, different information networks such as Multiple-Access-Relay Network (MARN) and Broadcast-Relay Network (BRN) are introduced. MARN has one receiver, many relays and many senders. An achievable rate region is obtained for the MARN, using Partial Decode-and-Forward (PDF) strategy. In the case of semi-deterministic MARN, an outer bound and an inner bound to the capacity region are derived. BRN is a model with one sender, two relays and two receivers. Two different types of cooperation are considered for BRN: full cooperation and partial cooperation between relays. Inner bounds on the capacity region of BRN are obtained and compared with previous works. The main idea of the... 

Wireless Sensor Networks (WSNs) are comprised of small sensor nodes with very limitedstorage, power and computational capabilities. The nodes in wireless sensor networks should be able to communicate with each other in order to accumulate information and to relay it to a base station in a secure manner. Since this communication often takes place in a hostile environment, encryption and/or authentication should be used. This requires the establishment of secure keys between the sensor nodes in the WSN. The constraints of such a lightweight distributed computing environment lend itself to the use of symmetric cryptography to provide security services. The lack of central infrastructure after... 

Due to the remarkable growth in using communication networks such as ad-hoc, wireless and sensor networks, studying the building blocks of these networks (e.g., relay channel and interference channel) from information theoretic viewpoint and investigating cooperative strategies have recently received considerable attention. Also, owing to wide range of applications, state-dependent channels have been widely studied. In this dissertation, at first, we consider a state-dependent relay channel (SD-RC). For the cases wherein channel states are available causally or non-causally at different nodes, we propose new achievable rates for this channel using compress-and-forward strategy. Also we... 

User cooperation is an important concept in wireless networks to achieve best performance subject to low cost. Dynamic and broadcast natures of wireless networks are two indispensable characteristics of these networks. Therefore, when a user transmits his signal to the receiver, other users in his neighborhood may receive the signal as well. Hence, these neighbors can decide to cooperate with each other in transmitting their messages to the receiver. On the other hand, due to the dynamic nature of the wireless networks, one can assume that each user has some knowledge about the interference signals or the fading coefficient that are not known to the other users. Therefore by utilizing user... 

Two new frameworks for achievability proof in network information theory (NIT) are introduced . The first framework which we call it OSRB (Output Statistics of Random Binning) framework, uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the OSRB framework uses pmf approximation arguments instead of counting and typicality which are used widely in conventional achievability proofs in NIT. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the distribution of random variables need to be satisfied. These statistical conditions include independence between messages and... 

In this thesis, the problem of secret key agreement in the channel model with side information is studiedx. In order to investigate the problem, we consider three models according to the different ways of side information availability which are the state-dependent broadcast channel; the state-dependent broadcast channel in presence of public channel and the state-dependent wiretap channel with degraded versions of the channel state information.For the problem of secret key agreement in broadcast channels, two models, the state-dependent wiretap channel and state-dependent three receivers broadcast channel, are considered. We obtain inner and outer bounds of the secret key capacity region for... 

In this thesis, we first review the concept of the game theory and describe the framework of the problems defined in this area. We use these concepts in introducing the Nash Equilibrium. Then, we analyze some communication channels such as the relay channels and the interference channels from the view point of the game theory. Also, we review some recent works related to the discussed topics. Afterwards, we consider a two-user interference channel with secrecy conditions and model selfish and possible adversarial behavior of the users of this channel in the framework of game theory. In other words, we consider a channel in which the users compete against each other to increase their payoff... 

Two new frameworks for achievability proof in network information theory (NIT) are introduced . The first framework which we call it OSRB (Output Statistics of Random Binning) framework, uses random binning arguments and is based on a duality between channel and source coding problems. Furthermore, the OSRB framework uses pmf approximation arguments instead of counting and typicality which are used widely in conventional achievability proofs in NIT. This allows for proving coordination and strong secrecy problems, where certain statistical conditions on the
distribution of random variables need to be satisfied. These statistical conditions include independence between messages and... 

Nowadays, Internet of Things is considered as a global infrastructure to establish communication between physical world and virtual world by using existing technologies. Its purpose is enabling things to establish communication with anything and any person in any time and any place by using existing networks and services. This technology makes different aspects of people's life smarter, facilitates doing works, and increases the quality of people's life. But, the development of Internet of Things faces to fundamental challenges that one of the most important of them is security and privacy preserving of users. According to the projects of European Research Cluster on the Internet of Things... 

In this thesis the problem of simultaneously generating multiple keys among multiple terminals is investigated. After providing a survey on the related works and exploiting the problem of sharing a common secret key and a private key among three terminals, we introduce a new source model which we call it the Four-Terminal model. We consider the problem of generating three kinds of keys among legitimate terminals and investigate the problem under two different scenarios, Backward and Forward scenarios, which depend on the kind of restrictions imposed on the usage of the public channel. We derive an achievable region for the backward scenario, using the combination of superposition coding and... 

In order to utilize cooperative resources of a network, we have to investigate cooperative networks and strategies. Information theory, by introducing different concepts such as coordination and common information, gives us a suitable tool to study cooperative networks and using their resources. In this thesis, we investigate coordination and secret key agreement in cooperative networks. Our study consists of two parts. In the first part, we consider coordination and its applications in cooperative networks. For this purpose, we introduce the triangular multiterminal network as a proper model for studying empirical coordination in multiterminal networks and establish an inner and outer... 

Reliable and secure communication requires low error probability and low information leakage, respectively. But there are different metrics for error probability and information leakage. Two important reliability metrics are ϵ or zero probability of error. An ϵ-error criterion requires the (average or maximal) error probability to vanish as the blocklength increases, while a zero-error criterion, demands the error to be exactly zero for every given bloklength. Three important security metrics are weak, strong, or perfect secrecy. A weak notion of secrecy requires the percentage of the message that is leaked to vanish as the code blocklength increases, while a strong notion of secrecy... 

The main problem in network information theory is how to send some sources in a network with multiple transmitters and receivers, in the presence of the noise and the interference.This problem is not solved in its general form and it needs source coding and channel coding. With the increase of users in a network, the secrecy becomes a challenging issue. The information-theoretic security is independent of the computational complexity.In this thesis, we investigate the transmission of correlated sources over information theoretic networks and study secrecy constraints in these networks. First, we study the secrecy of a one-receiver, two-eavesdropper broadcast channel with three degraded... 

Energy Harvesting has been appeared as an approach in order to make the green communications possible. In Energy Harvesting systems, nodes extract energy from the nature to extend their lifetimes. The harvested energy can also be used for the purpose of communication and specially for the transmission process. Compared to the conventional batterypowered systems, the Energy Harvesting systems have access to an unbounded source of energy (like vibration absorption devices, water mills, wind turbines, microbial fuel cells, solar cells, thermo-electric generators, piezoelectric cells, etc). However, the diffused nature of this energy makes it difficult to be used for communication. In this work,...