Sharif Digital Repository

In this study, a new two-way relaying scheme based on compute-and-forward (CMF) framework and relay selection strategies is proposed, which provides a higher throughput than the conventional two-way relaying schemes. Two cases of relays with or without feedback transmission capability are considered. An upper bound on the computation rate of each relay is derived, and based on that, a lower bound on the outage probability of the system is presented assuming block Rayleigh fading channels. Numerical results show that while the average sum rate of the system without feedback, named as max-CMF (M-CMF), reaches the derived upper bound only in low SNRs, that of the system with feedback, named as... 

This paper develops a stochastic geometry-based approach for the modeling, analysis, and optimization of wireless cloud caching networks comprised of multiple-antenna radio units (RUs) inside clouds with coordinated multi-point transmissions and guard zones. We consider Poisson cluster processes to model RUs and users, and the probabilistic content placement to cache files in RUs. Accordingly, we study the exact hit probability for a user of interest for two strategies; closest selection, where the user is served by the closest RU that has its requested file, and best power selection, where the serving RU having the requested file provides the maximum instantaneous received power at the... 

In this paper, we propose a new transmission scheme, called integer forcing-and-forward (IFF), for communications among multipair multiple-antenna users in which each pair exchanges their messages with the help of a single multiple-antenna relay in the multiple-access and broadcast phases. The proposed scheme utilizes integer forcing linear receiver (IFLR) at the relay, which uses equations, i.e., linear integer combinations of messages, to harness intrapair interference. Accordingly, we propose the design of a mean square error (MSE)-based transceiver, including precoder and projection matrices for the relay and users, assuming that perfect channel state information (CSI) is available. In... 

This paper develops a stochastic geometry-based approach for the modeling and analysis of finite millimeter wave (mmWave) wireless networks where a random number of transmitters and receivers are randomly located inside a finite region. We consider a selection strategy to serve a reference receiver by the transmitter providing the maximum average received power among all transmitters. In our system model, we employ the unique features of mmWave communications such as directional transmit and receive beamforming and different channels for line-of-sight (LOS) and non-line-of-sight (NLOS) links. Accordingly, deploying a blockage process suitable for mmWave networks, we study the coverage... 

In this letter, we introduce a decentralized compute-and-forward (DCMF) protocol to solve the rank failure problem in compute-and-forward (CMF) ad hoc multi-user multi-relay networks without a central coordinator. In sufficiently strong inter-relay links, we show that the DCMF scheme can reach the same achievable rate as in the successive centralized CMF (SCCMF), which is a modified version of the previously introduced centralized CMF in using our proposed successive method for a fair comparison. We evaluate the outage probability and rate of the proposed strategy, and compare the results with those of the conventional CMF and decode-and-forward, and the SCCMF  

In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compared to the state-of-the-art integer-forcing linear receiver (IFLR), our proposed IFMR approach needs to decode considerably less number of messages. In our method, each receiver recovers independent linear integer combinations of the desirable messages each from two independent equations. We propose an efficient polynomial-time algorithm to sequentially find the equations and integer combinations with maximum rates and analyze its complexity. We evaluate the performance of our scheme and compare the results with the... 

This paper develops a stochastic geometry-based approach for the modeling and analysis of single- and multi-cluster wireless networks. We first define finite homogeneous Poisson point processes to model the number and locations of the transmitters in a confined region as a single-cluster wireless network. We study the coverage probability for a reference receiver for two strategies; closest-selection, where the receiver is served by the closest transmitter among all transmitters, and uniform-selection, where the serving transmitter is selected randomly with uniform distribution. Second, using Matern cluster processes, we extend our model and analysis to multi-cluster wireless networks. Here,... 

This paper develops a tractable modeling and analysis framework for finite cellular wireless networks using stochastic geometry. Defining finite homogeneous Poisson point processes to model the number and locations of access points in a confined region, we study the coverage probability for an arbitrarily-located reference user that is served by the closest access point. The distance distribution and the Laplace transform (LT) of the interference are derived. We also derive a closed-form lower bound on the LT of the interference. Our analyses reveal that a higher path loss exponent improves the coverage probability and that there is a location where the coverage probability is maximized. ©... 

Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the graceful labeling problem. Then a “branching method” is developed to solve the problem for special classes of graphs. Computational results show the efficiency of the proposed algorithm for different classes of graphs. One of the interesting results of our model is in the class of trees. The largest tree known to be graceful has at most 27 vertices... 

Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper, first a new approach based on the mathematical programming technique is presented to model the graceful labeling problem. Then a “branching method” is developed to solve the problem for special classes of graphs. Computational results show the efficiency of the proposed algorithm for different classes of graphs. One of the interesting results of our model is in the class of trees. The largest tree known to be graceful has at most 27 vertices... 

In this paper, we consider a relay-assisted uplink non-orthogonal multiple access (NOMA) system where two radio frequency (RF) users are grouped for simultaneous transmission, over each resource block, to an intermediate relay which forwards the amplified version of the users' aggregated signals in the presence of multiuser interference to a relatively far destination. In order to cope with the users' ever-increasing desire for higher data rates, a high-throughput free-space optics (FSO) link is employed as the relay-destination backhaul link. Dynamic-order decoding is employed at the destination to determine the priority of the users based on their instantaneous channel state information...