Sharif Digital Repository

A probabilistic method is proposed in this study to predict the spreading profile of the coronavirus disease 2019 (COVID-19) in the United State (US) via time-variant reliability analysis. To this end, an extended susceptible-exposed-infected-vaccinated-recovered (SEIVR) epidemic model is first established deterministically, considering the quarantine and vaccination effects, and then applied to the available COVID-19 data from US. Afterwards, the prediction results are described as a time-series of the number of people infected, recovered, and dead. Upon introducing the extended SEIVR model into a limit-state function and defining the model parameters including transmission, recovery, and... 

Underlay device-to-device (D2D) communication is an attractive technology enabling nearby cellular users to communicate with each other directly in order to increase data rate and spectral efficiency. The current cellular heterogeneous networks consist of macrocell base stations and small cell base stations with different transmit powers and coverage areas. Femtocell is the most popular small cell which is expected to be utilized in dense and ultra-dense scenarios in the future. Network coding in relay-assisted multi-hop communications improves achievable transmission rate and coverage of D2D communications. In this paper, two-hop random linear network coding network in cooperative D2D... 

Underlay device-to-device (D2D) communication is an attractive technology enabling nearby cellular users to communicate with each other directly in order to increase data rate and spectral efficiency. The current cellular heterogeneous networks consist of macrocell base stations and small cell base stations with different transmit powers and coverage areas. Femtocell is the most popular small cell which is expected to be utilized in dense and ultra-dense scenarios in the future. Network coding in relay-assisted multi-hop communications improves achievable transmission rate and coverage of D2D communications. In this paper, two-hop random linear network coding network in cooperative D2D... 

We introduce the blind index coding (BIC) problem, in which a single sender communicates distinct messages to multiple users over a shared channel. Each user has partial knowledge of each message as side information. However, unlike classical index coding, in BIC, the sender is uncertain of what side information is available to each user. In particular, the sender only knows the amount of bits in each user's side information but not its content. This problem can arise naturally in caching and wireless networks. In order to blindly exploit side information in the BIC problem, we develop a hybrid coding scheme that XORs uncoded bits of a subset of messages with random combinations of bits from... 

A semicentralized joint cell muting and user scheduling scheme for interference coordination in a multicell network is proposed under two different temporal fairness criteria. In the proposed scheme, at a decision instant, each base station (BS) in the multicell network employs a cell-level scheduler to nominate one user for each of its inner and outer sections and their available transmission rates to a network-level scheduler which then computes the potential overall transmission rate for each muting pattern. Subsequently, the network-level scheduler selects one pattern to unmute, out of all the available patterns. This decision is shared with all cell-level schedulers which then forward... 

We consider a slotted Aloha-based wireless communication network comprising a source and an active relay, both transmitting to a common destination. The relay node is able to relay the unsuccessfully transmitted packets of the source node, if it can detect them. We find the analytical closed form optimal static relaying policy in order to minimize the average transmission delay (ATD) of source packets, while ATD of its own packets is constrained. A static relaying policy is determined by acceptance and relaying probabilities of the relay node. According to acceptance probability, the relay node decides whether to accept an unsuccessfully transmitted packet from source or not, while the... 

Energy consumption is a main issue of concern in wireless networks. Energy minimization increases the time that networks' nodes work properly without recharging or substituting batteries. Another criterion for network performance is data transmission rate which is usually quantified by a network utility function. There exists an inherent tradeoff between these criteria and enhancing one of them can deteriorate the other one. In this paper, we consider both Network Utility Maximization (NUM) and energy minimization in a bi-criterion optimization problem. The problem is formulated for Random Access (RA) Medium Access Control (MAC) for ad-hoc networks. First, we optimize performance of the MAC... 

In this paper, we consider a binary erasure channel (BEC) with an unknown erasure probability of {delta } at a transmitter. In addition, we consider that {delta } has a constant value in each transmission block and the transmitter knows the probability distribution of {delta }. For this problem with the infinite block length, based on the distribution of the random variable {delta } , a multi-layer encoding strategy at the transmitter and a successive decoding strategy at the receiver are proposed. In our proposed scheme, based on the value of {delta } , the receiver can decode a part of transmitted data from different transmission layers. In order to have a comparison with other erasure... 

In this paper, a diffusion-based molecular communication channel between two nano-machines is considered. The effect of the amount of memory on performance is characterized, and a simple memory-limited decoder is proposed; its performance is shown to be close to that of the best possible decoder (without any restrictions on the computational complexity or its functional form), using genie-aided upper bounds. This effect is adapted to the case of Molecular Concentration Shift Keying; it is shown that a four-bit memory achieves nearly the same performance as infinite memory for all of the examples considered. A general class of threshold decoders is considered and shown to be suboptimal for a... 

A pragmatic distributed algorithm (PDA) is proposed for supporting the ef-cient spectral access of multiple Primary Users (PUs) and Cognitive Users (CUs) in cooperative Cognitive Radio (CR) networks. The CUs may serve as relay nodes for relaying the signal received from the PUs to their destinations, while both the PUs' and the CUs' minimum rate requirements are satis-ed. The key idea of our PDA is that the PUs negotiate with the CUs concerning the speci-c amount of relaying and transmission time, whilst reducing the required transmission power or increasing the transmission rate of the PU. Our results show that the cooperative spectral access based on our PDA reaches an equilibrium, when it... 

In this paper, a simple memory limited transmitter for molecular communication is proposed, in which information is encoded in the emission rate of the molecules. Taking advantage of memory, the proposed transmitter reduces the ISI problem by properly adjusting its emission rate, which can be interpreted as water-filling on the expected interference. The error probability of the proposed scheme is derived and the result is compared with the error probability of the optimal transmitter obtained by dynamic programming methods. Furthermore, for the special case of channel with one symbol memory, a tight lower bound on error probability is derived. Numerical results show that the performance of... 

We consider a cooperative wireless communication network comprising two full-duplex (FD) nodes transmitting to a common destination based on slotted Aloha protocol. Each node has exogenous arrivals and also may relay some of the unsuccessfully transmitted packets of the other node. In this article, we find the optimal static policies of nodes in order to minimize the sum of the average transmission delays, while the average transmission delay of each node is constrained. The static policy of each node specifies the probability of accepting an unsuccessfully transmitted packet of the other node and how the node prioritizes its transmissions. We show that in the optimal policies, just the node... 

We study transmission rate control and performance delay in cognitive radio (CR) links from a cross-layer perspective. We assume a hierarchical CR network where the secondary users (SU) access the spectrum band in an opportunistic and noncooperative way. The SU goal is to transmit a fixed-size file (fixed amount of data packets) during the sojourn time of the primary users (PU's) idle state. We assume that the SU's support frames retransmission through an automatic repeat request (ARQ) mechanism. By formulating the problem as a Markov decision process, we demonstrate that there is always an optimal stationary rate adaptation policy, and we propose a simple algorithm to obtain it. We derive... 

Energy harvesters are used in today's Wireless Sensor Networks (WSNs) to harvest energy from the environment. Although an energy harvester can provide a supply source with a much greater lifetime than a battery, the amount of available energy for an energy harvesting system is a random variable. Furthermore, the proper management of energy harvesters has a considerable impact on reliability. It has been observed that cooperative error control mechanisms like Cooperative Automatic Repeat Request (C-ARQ) and Cooperative Hybrid ARQ (C-HARQ) can be used for improving the energy management and reliability in Energy Harvesting WSNs (EH-WSNs). Recently, the impact of C-ARC mechanism has been... 

The prime shortcoming of Wireless Sensor Networks (WSNs) is their energy constraint. The main energy consumer in a sensor node is its radio transmitter. One of the most effective methods to reduce the data transmission rate is data prediction. By data prediction, the amount of transmitted data is reduced; which results in energy saving and the longevity of the network life. Environmental variations almost have similar effects on different sensor sources in a sensor device. So, considering the correlation between different sources reduces the noise impact and increases data prediction accuracy. In this paper, temporal and multi-source correlations are used, to reduce data transmission in... 

This paper is concerned with the stability of linear time-invariant dynamic systems over the packet erasure channel subject to minimum bit rate constraint when an encoder and a decoder are unaware of the control signal. This assumption results in co-designing the encoder, decoder and controller. The encoder, decoder, controller and conditions relating transmission rate to packet erasure probability and eigenvalues of the system matrix A are presented for almost sure asymptotic stability of linear time-invariant dynamic systems over the packet erasure channel with feedback acknowledgment. When the eigenvalues of the system matrix A are real valued, it is shown that the obtained condition for... 

Cotton fabrics have been prepared with smart properties by functional finishing with stimuli-responsive nano gel. A biopolymer (chitosan) and a synthetic polymer (poly-NiPAAm) have been used for the synthesis of nano gel through semi-batch surfactant-free dispersion polymerization (SB-SFDP) method. The incorporation of nano gel to textile fabrics is achieved by pad-dry-cure procedure, using an aqueous nano gel dispersion and 1,2,3,4-butantetracarboxylic acid as a crosslinking agent. With this cross linking method, it is possible to integrate the nano gel into the cotton fabric’s structure with good resistance to washing. The changes in physiological comfort parameters of cotton fabric such... 

This paper is concerned with the stability of nonlinear Lipschitz systems subject to bounded process and measurement noises when transmission from sensor to controller is subject to distortion due to quantization. A stabilizing technique and a sufficient condition relating transmission rate to Lipschitz coefficients are presented for almost sure asymptotic bounded stability of nonlinear uncertain Lipschitz systems. In the absence of process and measurement noises, it is shown that the proposed stabilizing technique results in almost sure asymptotic stability. Computer simulations illustrate the satisfactory performance of the proposed technique for almost sure asymptotic bounded stability... 

Rate, energy and delay are three main parameters of interest in ad-hoc networks. In this paper, we discuss the problem of maximizing network utility and minimizing energy consumption while satisfying a given transmission delay constraint for each packet. We formulate this problem in the standard convex optimization form and subsequently discuss the tradeoff between utility, energy and delay in such framework. Also, in order to adapt for the distributed nature of the network, a distributed algorithm where nodes decide on choosing transmission rates and probabilities based on their local information is introduced. ©2009 IEEE