Sharif Digital Repository

In this paper, we investigate the problem of the empirical coordination in a triangular multiterminal network. A triangular multiterminal network consists of three terminals where two terminals observe two external i.i.d correlated sequences. The third terminal wishes to generate a sequence with desired empirical joint distribution. For this problem, we derive inner and outer bounds on the empirical coordination capacity region. It is shown that the capacity region of the degraded source network and the inner and outer bounds on the capacity region of the cascade multiterminal network can be directly obtained from our inner and outer bounds. For a cipher system, we establish key distribution... 

In this paper, we argue that in many basic algorithms for machine learning, including support vector machine (SVM) for classification, principal component analysis (PCA) for dimensionality reduction, and regression for dependency estimation, we need the inner products of the data samples, rather than the data samples themselves.Motivated by the above observation, we introduce the problem of private inner product retrieval for distributed machine learning, where we have a system including a database of some files, duplicated across some non-colluding servers. A user intends to retrieve a subset of specific size of the set of the inner product of every pair of data items in the database with... 

In this paper, we propose a new packet prioritization scheme in order to exploit the full-duplex (FD) capability of the access point (AP) more efficiently, in an asymmetric IEEE 802.11-based WLAN, i.e., only the AP has the in-band FD communications capability. In this respect, we consider a modified version of IEEE 802.11 MAC protocol such that at any transmission opportunity in which AP has the role of the transmitter or the receiver, it does the best to select a partner packet to be simultaneously received or transmitted, respectively. The key feature of our proposed partner packet selection scheme is to reduce the idle time intervals that in an FD transmission opportunity, due to... 

The widespread use of cloud computing services raises the question of how one can delegate the processing tasks to the untrusted distributed parties without breaching the privacy of its data and algorithms. Motivated by the algorithm privacy concerns in a distributed computing system, in this paper, we introduce the private function retrieval (PFR) problem, where a user wishes to efficiently retrieve a linear function of K messages from N non-communicating replicated servers while keeping the function hidden from each individual server. The goal is to find a scheme with minimum communication cost. To characterize the fundamental limits of the communication cost, we define the capacity of PFR... 

In wireless network virtualization, by separating services and infrastructure, and due to new network components, some new challenges appear. In this paper, we consider the competition among multiple mobile virtual network operators (MVNOs) for provisioning the required rates for users subscribed to a service provider (SP). To realize this competition, we consider an SP as a beneficiary decision maker component, who can choose which users to be serviced by each MVNO. Since the states between each user and different channels of each MVNO are distinct, MVNOs compete to serve the users with good channel conditions to minimize their costs. Using a multiple non-identical object procurement... 

We evaluate the performance of the internally coded partial-band DS-CDMA scheme first introduced in [1], in a multipath Rayleigh fading channel. The scheme of [1] is based on frequency-hopping (FH) and direct-sequence (DS) spread spectrum techniques. The total bandwidth is divided into Ns subbands. The output of a super-orthogonal encoder and a pseudorandom (PN) sequence selects one subband, in which the user's data is sent in the form of DS-CDMA signal using the second PN sequence. We consider soft detection at the receiver front end. We obtain the upper and lower bounds on the bit error rate. For comparison, we also consider the conventional DS-CDMA system. It is shown that for the same... 

We propose a new partial-band DS-CDMA scheme for UWB communication systems, which is based on frequency-hopping (FH) and direct-sequence (DS) spread spectrum techniques. The total bandwidth is divided into Ns subbands. The output of a superorthogonal encoder and a pseudorandom (PN) sequence select one subband, in which the user's data is sent in the form of DS-CDMA signal using the second PN sequence. We consider soft detection at the receiver front end. We obtain the upper and lower bounds on the bit error rate for the proposed method. For comparison, we also consider the conventional DS-CDMA system. It is shown that the proposed multiple access method outperforms the conventional DS-CDMA... 

One of the foremost challenges in modulation scheme for molecular communication is positivity of the transmission signal (only a positive concentration of molecules can be released in the environment). This restriction makes handling of the InterSymbol Interference (ISI) a challenge for molecular communication. In this paper, a novel modulation is proposed which introduces use of negative signals to ameliorate the transmission link performance. A precoder scheme based on the diffusion channel model is proposed and shown to have a significant improvement compared to previous modulation schemes such as CSK and MCSK  

Energy harvesting has been developed as an effective technology for communication systems in order to extend the lifetime of these systems. In this work, we consider a single-user energy harvesting wireless communication system, in which both of the arrival data and the harvested energy curves are modeled as continuous functions. Our goal is to find an offline algorithm, which maximizes the amount of data which is transmitted to the receiver node by a given deadline. If more than one scheme exist that transmit the maximum data, we choose the one with minimum utilized energy at the transmitter node  

While ISI is a common issue in classical communications, it is more challenging and prominent in the context of molecular communication, because one cannot readily combat ISI with classical channel equalization techniques. This is due to the fact that transmitter can only release a positive amount of concentration of a specific molecule into the medium. Previous works have proposed use of chemical reactions to remove molecules from the environment, and to effectively simulate negative signals. However, the differential equation describing a diffusion-reaction process is non-linear. This precludes the possibility of using Fourier transform tools. In this paper, a solution for simulating... 

In non-orthogonal multiple access (NOMA) systems, serving multiple users in shared resource blocks can allow untrusted users to overhear the messages of other users. In this context, we study a network consisting of a base station (BS), a near user and a far user, where the latter attempts to overhear the message of the former. The near user is a full-duplex (FD) node that can also act as a relay. Two operating scenarios are considered: 1) friendly jammer (FJ), where the FD node broadcasts noise for degrading the channel between the BS and the far user, while receiving data from the BS; and 2) friendly jammer relay (FJR), where, in addition to degrading the channel between the BS and the far... 

This study investigates the capacity region of a three-user cognitive radio network with two primary users and one cognitive user. A three-user cognitive interference channel (C-IFC) is proposed by considering a three-user interference channel (IFC) where one of the transmitters has cognitive capabilities and knows the messages of the other two transmitters in a non-causal manner. First, two inner bounds on the capacity region of the three-user C-IFC are obtained based on using the schemes which allow all receivers to decode all messages with two different orders. Next, two sets of conditions are derived, under which the capacity region of the proposed model coincides with the capacity... 

In this paper, we consider a three-user cognitive radio network with two primary users and one cognitive radio. We concentrate on a three-user Interference Channel (IFC) where one of the transmitters has cognitive capabilities and non-causally knows the messages of the other two transmitters. Moreover, we assume that the cognitive transmitter does not cause any interference at the receivers of the primary users and we introduce three-user Cognitive Z-Interference Channel (C-ZIFC). We first obtain an inner bound on the capacity region of three-user C-ZIFC, where our coding scheme makes use of collaborative strategy by rate splitting and cooperative strategy by superposition coding. Moreover,... 

In this paper, we analyze the capacity region of a communication network where a Multiple Access Channel (MAC) and a point-to-point channel share a same medium and interfere with each other, where the transmitter of the point-to-point channel has cognitive capabilities. We introduce Multiple Access-Cognitive Interference Channel (MA-CIFC), with a two-user MAC as a primary network and a cognitive transmitter-receiver pair in which the cognitive transmitter knows the message being sent by all of the transmitters in a non-causal manner. We obtain an inner bound on the capacity region of MA-CIFC and derive two sets of strong interference conditions under which we establish the capacity regions.... 

This study investigates the Causal Cognitive Interference Channel (CC-IFC) with unlimited look-ahead, in which the cognitive user non-causally knows its entire received sequence. A coding scheme is proposed which combines the Compress-and-Forward (CF) strategy and Marton coding at the cognitive user. Using this scheme, a new inner bound on the capacity region (achievable rate region) is established for the CC-IFC with unlimited look-ahead. Further, the derived achievable rate region is extended to the Gaussian case and is compared with the previously obtained results via numerical examples, which are based on the Decode-and-Forward (DF) strategy  

In this paper, taking into account the effect of link delays, we investigate the capacity region of the cognitive interference channel (C-IFC), where cognition can be obtained from either causal or noncausal generalized feedback. For this purpose, we introduce the causal C-IFC with delay (CC-IFC-WD) in which the cognitive user's transmission can depend on L future received symbols as well as the past ones. We show that the CC-IFC-WD model is equivalent to a classical causal C-IFC (CC-IFC) with link delays. Moreover, CC-IFC-WD extends both genie-aided and causal cognitive radio channels and bridges the gap between them. First, we derive an outer bound on the capacity region for the arbitrary... 

In this paper, we consider Causal Cognitive Interference Channel (CC-IFC), wherein the cognitive user overhears the channel and exploits knowledge of the primary user's message from the causally received signals. We propose a coding scheme which combines Compress-and-Forward (CF) strategy with Marton coding with common information at the cognitive user. Rate splitting for messages at both transmitters is used to have a collaborative strategy. Moreover, the cognitive user compresses its channel observation using Wyner-Ziv coding and splits the index of its compressed signal. Then, the cognitive user having common information to both receivers and private information to each of them, jointly... 

In this paper, we investigate Causal Cognitive Interference Channel (CC-IFC) with delay in which the cognitive user transmission can depend on L future received symbols as well as the past ones. We study two special cases: CC-IFC without delay (L=1), where the cognitive user can use only current and past received symbols, and CC-IFC with a block length delay (L=n), wherein the entire received sequence can be used. In each case, we obtain an inner bound on the capacity region. Our coding schemes are based on the generalized block Markov superposition coding and instantaneous relaying for CC-IFC without delay, and non-causal partial Decode-and-Forward (DF) for CC-IFC with a block length delay.... 

In this paper, we study a state-dependent relay channel where perfect Channel State Information (CSI) is causally known to transmitters in both symmetric and asymmetric manner. So, three different setups are investigated in which causal CSI is available: 1) at the relay only, 2) at the source only and 3) both at the source and the relay nodes. In each situation, we obtain the lower bound on the capacity (achievable rate) for the general discrete memoryless case. The lower bounds are derived based on Shannon's strategy where CSI is known, and Compress-and-Forward (CF) Strategy at the relay  

Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless Ad-hoc and sensor networks with replenishable nodes. In this sense, it has emerged as a promising technique for Green Communications. On the other hand, cooperative communication with the help of relay nodes improves the performance of wireless communication networks. In this paper, we investigate the cooperation in EH nodes. We consider the optimal power and rate allocation in the full-duplex Gaussian relay channel in which source and relay can harvest energy from their environments. In our model, the energy arrivals at the source and the relay are general stochastic processes with known EH times and amounts...