Sharif Digital Repository

We investigate the multiple use of a ferromagnetic spin chain for quantum and classical communications without resetting. We find that the memory of the state transmitted during the first use makes the spin chain a qualitatively different quantum channel during the second transmission, for which we find the relevant Kraus operators. We propose a parameter to quantify the amount of memory in the channel and find that it influences the quality of the channel, as reflected through fidelity and entanglement transmissible during the second use. For certain evolution times, the memory allows the channel to exceed the memoryless classical capacity (achieved by separable inputs) and in some cases it... 

We introduce a 'high probability' framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high probability counterpart of the classical result of Mertens and Zamir for the zero-sum repeated games. Any payoff that can be guaranteed with high probability can be guaranteed in expectation, but the reverse is not true. Hence, unlike the average payoff case where the payoff guaranteed by each player is the negative of the payoff by the other player, the two guaranteed payoffs would differ in the high probability framework. One motivation for this framework... 

In this paper, we investigate the secrecy throughput for a full-duplex wireless powered communication network. A multi-antenna base station (BS) transmits energy towards nodes all the time and each node harvests energy prior to its transmission time slot. Nodes sequentially transmit their confidential information to the BS in presence of other nodes which are considered as potential eavesdroppers. We derive the secrecy rate and formulate the sum secrecy throughput optimization of all nodes. The optimization variables are the time slot duration and the BS beamforming during different transmission phases. The problem is non-convex and non-trivial. We propose a suboptimal approach in which the... 

Nanonetworking indicates new solutions for many applications in biomedical and industrial fields. In this paper, we examine the diffusion-based molecular communication for information transmission in nano-networks. Design of practical decoders for resource-limited nano-networks requires an understanding the fundamental performance limits of memory-limited decoders. While some existing works in the literature do consider decoders with limited memory, to best of our knowledge, the tradeoff between memory and probability of error has not been studied in the literature. In this paper we make a first step by studying this tradeoff for a particular molecular communication channel between two... 

We introduce a 'high-probability' framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high-probability counterpart of the classical result of Mertens and Zamir for the zero-sum repeated games. Any payoff that can be guaranteed with high probability can be guaranteed in expectation, but the reverse is not true. Hence, unlike the average payoff case where the payoff guaranteed by each player is the negative of the payoff by the other player, the two guaranteed payoffs would differ in the high-probability framework. One motivation for this framework... 

In this paper, we show how time-sharing method may reduce transmission delay in the dynamic index coding scenario. We propose a novel time-shared dynamic index coding transmission scheme that achieves the maximum index coding gain for a complete bi-directional side information graph and formulate a constrained optimization problem to tune the transmission scheme for the minimum transmission delay. A closed-form solution is presented for the special case of two-user. We also use analytical and simulation results to provide graphical intuition for the obtained results  

In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for Internet of Things (IoT). The WPCN consists of a full-duplex multiantenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests energy prior to its transmission time slot. The nodes sequentially transmit their confidential information to the BS, and the other nodes are considered as potential eavesdroppers. We first aim to optimize the sum secrecy throughput of the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The optimization problem is shown to... 

This paper introduces a cyber-physical system for building automation and control that is developed based on a distributed model predictive control. The implemented distributed method significantly reduces computation overhead with respect to the centralized methods. However, continuous data transfer between subsystems, which are often far from each other, is required when using this method. Information transmission between subsystems is very often subject to the limitations of transmission bandwidth and/or short communication range resulting in significant communication overhead. This causes significant time latency between making measurements and applying control commands, which adversely...