Sharif Digital Repository

In this paper, we derive the rate of route discovery process for finding a randomly chosen destination in large wireless networks. The well-known protocol for route discovery is flooding in which each node simply rebroadcasts the route request packet once. Rate of route discovery process is defined as the inverse of time between transmitting two successive route request packets which shows how fast a node can request a route to its destination. Discovery time is another parameter of interest. For a single node discovering routes to its destination, at most the rate of Eθ (1/3√n) is feasible when n identical nodes are optimally placed in network area and the discovery time is of order... 

We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approach in parallel and distributed systems. In this framework, we investigate the tension between storage resources, communication cost, and load balancing performance. To this end, we propose a randomized load balancing scheme which simultaneously considers cache size limitation and proximity in the server redirection process. IEEE  

We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approach in parallel and distributed systems that reduces network imbalance. In this paper, we propose a randomized load balancing scheme which simultaneously considers cache size limitation and proximity in the server redirection process. Since the memory limitation and the proximity constraint cause correlation in the server selection process, we may not benefit from the power of two choices in general. However, we prove that in certain regimes, in terms of memory limitation and proximity constraint, our scheme results... 

Recently, it has been shown that in a cache-enabled interference channel, the storage at the transmit and receive sides are of equal value in terms of Degrees of Freedom (DoF). This is derived by assuming full Channel State Information at the Transmitter (CSIT). In this paper, we consider a more practical scenario, where a training/feedback phase should exist for obtaining CSIT, during which instantaneous channel state is not known to the transmitters. This results in a combination of delayed and current CSIT availability, called mixed CSIT. In this setup, we derive DoF of a cache-enabled interference channel with mixed CSIT, which depends on the memory available at transmit and receive... 

We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approach in parallel and distributed systems. In this framework, we investigate the tension between storage resources, communication cost, and load balancing performance. To this end, we propose a randomized load balancing scheme which simultaneously considers cache size limitation and proximity in the server redirection process. In contrast to the classical power of two choices setup, since the memory limitation and the proximity constraint cause correlation in the server selection process, we may not benefit from the... 

Compute-and-forward is a promising strategy to tackle interference and obtain high rates between the transmitting users in a wireless network. However, the quality of the wireless channels between the users substantially limits the achievable computation rate in such systems. In this paper, we introduce the idea of using intelligent reflecting surfaces (IRSs) to enhance the computing capability of the compute-and-forward systems. For this purpose, we consider a multiple access channel (MAC) where a number of users aim to send data to a base station (BS) in a wireless network, where the BS is interested in decoding a linear combination of the data from different users in the corresponding... 

We present fabrication, characterization, and experimental results describing electrical actuation and readout of the mechanical vibratory response of electrospun ZnO nanofibers. For a fiber with an approximate radius of 200 nm and a length of 70 ìm, a resonance frequency around 3.62 MHz with a quality factor (Q) of about 235 in air at ambient conditions is observed. It is shown that the measured frequency of the resonance is consistent with results from finite element simulations. Also, the measurements were performed in an enclosed chamber with controlled levels of ethanol vapor. The adsorption of ethanol causes a shift in the resonance frequency of the fibers, which can be related to the... 

In this study, ethanol gas sensing of PVP fiber membranes based on Quartz Crystal Microbalance (QCM) was investigated. The fibers were deposited on the QCM's electrodes by electrospinning the viscous blend solutions of PVP. The effects of PVP concentration on morphology of the fibers and their permeability when exposed to ethanol were investigated. Membranes which were prepared using low concentration solutions, contained beads and high packing fibers and showed low permeability. Increase of the PVP concentration to 12 wt% resulted in continuous fine fibers with good permeability. Furthermore, higher PVP concentrations were found to decrease ethanol permeability due to larger fiber radius... 

We consider a cellular wireless system including several interfering multi-user multi-antenna uplink channels, where the base station of each cell has to locally recover the messages of its corresponding users. We use a linear Wyner model, where each base station experiences interference only from the users in the two neighboring cells. Each base station is connected to the two nearby base stations through a backhaul link. The objective is to achieve the maximum degrees of freedom per cell, with minimum aggregated load in the backhaul. We propose a successive cooperative alignment scheme, in which each base station forms backhaul messages by combining the previous received backhaul messages... 

It is well known that load balancing and low delivery communication cost are two critical issues in mapping requests to servers in Content Delivery Networks (CDNs). However, the trade-off between these two performance metrics has not been yet quantitatively investigated in designing efficient request mapping schemes. In this work, we formalize this trade-off through a stochastic optimization problem. While the solutions to the problem in the extreme cases of minimum communication cost and optimum load balancing can be derived in closed form, finding the general solution is hard to derive. Thus we propose three heuristic mapping schemes and compare the trade-off performance of them through... 

We consider a K-user Interference Channel where each transmitter is interested in conveying a message to its corresponding receiver. In addition, we assume a fully connected noiseless backhaul network through which receivers can collaborate and help each other recover their desired messages. In this paper, we fully characterize the trade-off between the rate in wireless link (per user) in terms of degrees of freedom (DoF) versus backhaul load (per user) for large values of K. In particular, we characterize the optimal trade-off for all values of K, where K is an even number. For odd values of K, we characterize the trade-off within a gap of 2(k - 1)/k(k + 1), which goes to zero as K... 

A single cell downlink scenario is considered where a multiple-antenna base station delivers contents to cache-enabled user terminals. Using the ideas from multi-server coded caching (CC) scheme developed for wired networks, a joint design of CC and general multicast beamforming is considered to benefit from spatial multiplexing gain, improved interference management and the global CC gain, simultaneously. The proposed multicast beamforming strategies utilize the multiantenna multicasting opportunities provided by the CC technique and optimally balance the detrimental impact of both noise and inter-stream interference from coded messages transmitted in parallel. The proposed scheme is shown... 

We propose a novel way of spreading data over multiple servers in Content Delivery Networks. Such approach provides a framework to explore trade-off between three key parameters of a content delivery network; namely, delay, storage size and communication cost. After presenting proper models for such trade-off, fundamental limits and lower and upper bounds on parameters of interest are provided for basic one-and two-dimensional spatial server arrangements. The observation that both delay and storage size can be reduced at the expense of moderate communication cost can be of great importance in a number of practical scenarios of interest. © 2018 IEEE  

We consider a group of mobile users, in closed proximity, who are interested in downloading a common content (e.g., a video file). We address a cooperative solution where each mobile device is equipped with both cellular and Wi-Fi interfaces. The users exploit the cellular link to download different shares of the content from the based-station and leverage on Wi-Fi link to exchange the received data. In order to expedite content delivery, the base-station transmits random linear network-coded data to users. This paper presents an analytical study of the average completion time, i.e., the time necessary for all devices to successfully retrieve the data. We propose an analytical model to... 

A wireless coded caching (CC) setup is considered, where a multi-antenna transmitter delivers contents to multiple cache-enabled users. Exploiting multicasting opportunities provided by the coded caching paradigm, novel interference management schemes are proposed by assigning carefully designed beamforming vectors to different multicast messages. Thereby, the proposed design benefits from spatial multiplexing gain, improved interference management and the global CC gain, simultaneously. In addition, a novel multicast mode selection scheme is proposed which determines the optimum multicast group sizes providing the best complexity-performance tradeoff for a given SNR range. While the... 

A single cell downlink scenario is considered, where a multiple-antenna base station delivers contents to cache-enabled user terminals. Depending on the available degrees of freedom, several multicast messages are transmitted in parallel to distinct subsets of users. In the multicast beamformer design, we restrict ourselves to linear receiver implementation, which does not require successive interference cancellation unlike in the more optimal baseline scheme. With a small loss in performance, the complexity of both the receiver and transmitter implementation can be significantly reduced. © 2018 IEEE  

We consider load balancing problem in a cache network consisting of storage-enabled servers forming a distributed content delivery scenario. Previously proposed load balancing solutions cannot perfectly balance out requests among servers, which is a critical issue in practical networks. Therefore, in this paper, we investigate a coded cache content placement where coded chunks of original files are stored in servers based on the files popularity distribution. In our scheme, upon each request arrival at the delivery phase, by dispatching enough coded chunks to the request origin from the nearest servers, the requested file can be decoded. Here, we show that if $n$n requests arrive randomly at... 

A multi-antenna broadcast channel scenario is considered where a base station delivers contents to cache-enabled user terminals. A joint design of coded caching (CC) and multigroup multicast beamforming is proposed to benefit from spatial multiplexing gain, improved interference management and the global CC gain, simultaneously. The developed general content delivery strategies utilize the multiantenna multicasting opportunities provided by the CC technique while optimally balancing the detrimental impact of both noise and inter-stream interference from coded messages transmitted in parallel. Flexible resource allocation schemes for CC are introduced where the multicast beamformer design and... 

We consider an index coding problem in which several transmitters deliver distinct files to a number of users with minimum delay. Each user has access to a subset of other files from the library, which can be used as side information. The information sent by the transmitters experience a linear transformation before being received at the users. By benefiting from the concept of Zero-Forcing in MIMO systems, we generalize the notion of MinRank characterization and the clique cover algorithm to accommodate this generalized setting. We show that increasing the number of transmitters can substantially reduce the delivery delay. IEEE  

We consider the problem of private information retrieval (PIR), where a single user with private side information (PSI) aims to retrieve multiple files from a library stored at some servers. We assume that the side information (SI) at the user includes a subset of files stored privately. Moreover, the identity of requests and side information at the user are not revealed to any of the servers. The problem involves finding the minimum load transmitted from the servers to the user such that the requested files can be decoded with the help of received data and side information. By providing matching lower and upper bounds for certain regimes, we characterize the minimum load imposed on all the...