Loading...
Search for: shariatpanahi--p
0.097 seconds

    Non-fixed scatterers and their effects on MIMO multicarrier fading communication channels

    , Article 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007, Washington, DC, 26 November 2007 through 30 November 2007 ; December , 2007 , Pages 3765-3769 ; 1424410436 (ISBN); 9781424410439 (ISBN) Saligheh Rad, H ; Gazor, S ; Shariatpanahi, P ; Sharif University of Technology
    2007
    Abstract
    There are two types of scatterers in a multipath propagation environment: fixed and non-fixed scatterers. Fixed scatterers like buildings, mountains and tree stems do not move, while non-fixed (moving) scatterers like cars, people and tree leaves move from their initial positions. In addition to different movements of the mobile station (MS) that cause different kinds of Doppler fading, movements of non-fixed scatterers are also anticipated to generate other kinds of fading/correlation. This fading changes depend on the type of the propagation environment and the type of movements of local surrounding scatterers. In this paper we characterize these effects in terms of temporal correlations.... 

    Storage, communication, and load balancing trade-off in distributed cache networks

    , Article IEEE Transactions on Parallel and Distributed Systems ; 2017 ; 10459219 (ISSN) Jafari Siavoshani, M ; Pourmiri, A ; Shariatpanahi, S. P ; Sharif University of Technology
    2017
    Abstract
    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  

    Storage, communication, and load balancing trade-off in distributed cache networks

    , Article IEEE Transactions on Parallel and Distributed Systems ; Volume 29, Issue 4 , April , 2018 , Pages 943-957 ; 10459219 (ISSN) Jafari Siavoshani, M ; Pourmiri, A ; Shariatpanahi, S. P ; Sharif University of Technology
    IEEE Computer Society  2018
    Abstract
    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... 

    Proximity-Aware balanced allocations in cache networks

    , Article 31st IEEE International Parallel and Distributed Processing Symposium, IPDPS 2017, 29 May 2017 through 2 June 2017 ; 2017 , Pages 1068-1077 ; 9781538639146 (ISBN) Pourmiri, A ; Jafari Siavoshan, M ; Shariatpanahi, S. P ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2017
    Abstract
    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... 

    On the route discovery rate of flooding in large wireless networks

    , Article IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC ; 2012 , Pages 1238-1242 ; 9781467325691 (ISBN) Shah-Mansouri, H ; Khalaj, B. H ; Shariatpanahi, S. P ; Sharif University of Technology
    2012
    Abstract
    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... 

    Coded load balancing in cache networks

    , Article IEEE Transactions on Parallel and Distributed Systems ; Volume 31, Issue 2 , 2020 , Pages 347-358 Jafari Siavoshani, M ; Parvaresh, F ; Pourmiri, A ; Shariatpanahi, S. P ; Sharif University of Technology
    IEEE Computer Society  2020
    Abstract
    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... 

    Electromechanical resonators based on electrospun ZnO nanofibers

    , Article Journal of Micro/ Nanolithography, MEMS, and MOEMS ; Vol. 13,Issue. 4 , 2014 ; ISSN: 19325150 Fardindoost, S ; Mohammadi, S ; Zad, A. I ; Sarvari, R ; Shariatpanahi, S. P ; Sharif University of Technology
    2014
    Abstract
    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... 

    Collaboration alignment in distributed interference management in uplink cellular systems

    , Article 2016 IEEE International Symposium on Information Theory, 10 July 2016 through 15 July 2016 ; Volume 2016-August , 2016 , Pages 1456-1460 ; 21578095 (ISSN) ; 9781509018062 (ISBN) Kananian, B ; Maddah Ali, M. A ; Shariatpanahi, S. P ; Khalaj, B. H ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2016
    Abstract
    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... 

    Characterization of degrees of freedom versus receivers backhaul load in K-user interference channel

    , Article IEEE International Symposium on Information Theory - Proceedings, 25 June 2017 through 30 June 2017 ; 2017 , Pages 1431-1435 ; 21578095 (ISSN) ; 9781509040964 (ISBN) Kananian, B ; Maddah Ali, M. A ; Shariatpanahi, S. P ; Khalaj, B. H ; Sharif University of Technology
    2017
    Abstract
    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... 

    Linear multicast beamforming schemes for coded caching

    , Article 52nd Asilomar Conference on Signals, Systems and Computers, ACSSC 2018, 28 October 2018 through 31 October 2018 ; Volume 2018-October , 2019 , Pages 172-176 ; 10586393 (ISSN); 9781538692189 (ISBN) Tolli, A ; Kaleva, J ; Shariatpanahi, S. P ; Khalaj, B ; Matthews M. B ; Sharif University of Technology
    IEEE Computer Society  2019
    Abstract
    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  

    Content delivery networks: interactions between storage/delay/cost

    , Article 2018 Iran Workshop on Communication and Information Theory, IWCIT 2018, 25 April 2018 through 26 April 2018 ; 2018 , Pages 1-6 ; 9781538641491 (ISBN) Salehi, M. J ; Motahari, S. A ; Khalaj, B. H ; Shariatpanahi, S. P ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    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  

    Conifer: clonal tree inference for tumor heterogeneity with single-cell and bulk sequencing data

    , Article BMC Bioinformatics ; Volume 22, Issue 1 , 2021 ; 14712105 (ISSN) Baghaarabani, L ; Goliaei, S ; Foroughmand Araabi, M. H ; Shariatpanahi, P ; Goliaei, B ; Sharif University of Technology
    BioMed Central Ltd  2021
    Abstract
    Background: Genetic heterogeneity of a cancer tumor that develops during clonal evolution is one of the reasons for cancer treatment failure, by increasing the chance of drug resistance. Clones are cell populations with different genotypes, resulting from differences in somatic mutations that occur and accumulate during cancer development. An appropriate approach for identifying clones is determining the variant allele frequency of mutations that occurred in the tumor. Although bulk sequencing data can be used to provide that information, the frequencies are not informative enough for identifying different clones with the same prevalence and their evolutionary relationships. On the other... 

    Ethanol sensing properties of PVP electrospun membranes studied by quartz crystal microbalance

    , Article Measurement: Journal of the International Measurement Confederation ; Volume 78 , 2016 , Pages 283-288 ; 02632241 (ISSN) Mohammadi Ari, M ; Irajizad, A ; Razi Astaraei, F ; Shariatpanahi, S. P ; Sarvari, R ; Sharif University of Technology
    Elsevier B.V  2016
    Abstract
    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... 

    On reliable routing in wireless networks with diversity

    , Article 4th IEEE and IFIP International Conference on Wireless and Optical Communications Networks, WOCN 2007, Singapore, 2 July 2007 through 4 July 2007 ; 2007 ; 1424410045 (ISBN); 9781424410040 (ISBN) Shariatpanahi, P ; Foroughmand Aarabi, H ; Sharif University of Technology
    2007
    Abstract
    Many forms of diversity have been exploited in communication systems to combat fading nature of wireless channels. Some examples are time diversity, frequency diversity, space diversity and multiuser diversity. However, another form of diversity inherent in any wireless network, which is usually not exploited, is the diversity due to the shared medium of propagation. When in a network one node transmits to the other node, all the other nodes may hear this transmission and some of them can decode the data as well. This data can be used later to enhance the end-to-end network reliability. Previous works mostly consider some special cases of relay nodes configurations, not the general case. In... 

    Delay-aware scheduling in heterogeneous multiuser systems

    , Article 2006 IEEE 7th Workshop on Signal Processing Advances in Wireless Communications, SPAWC, Cannes, 2 July 2006 through 5 July 2006 ; 2006 ; 078039710X (ISBN); 9780780397101 (ISBN) Shariatpanahi, P ; Hossein Khalaj, B ; Sharif University of Technology
    2006
    Abstract
    Adaptive scheduling schemes which consider channel conditions are examples of cross-layer design in wireless networks. Research work which has been done on optimizing the performance of scheduling systems have shown that in each time slot it is better to transmit to the users with the best channel condition. In order to realize such schemes, most of earlier works have considered perfect feedback channels to send Channel State Information (CSI) to the scheduler. However, in practical systems there are some sources of imperfectness in feedback channels such as delay and quantization error. In this paper, we consider the effect of CSI delay on the performance of such systems. A new delay-aware... 

    Analysis of quantization effects on performance of hierarchical cooperation schemes in ad-hoc wireless networks

    , Article Proceedings - Conference on Local Computer Networks, LCN ; 2011 , Pages 171-174 ; 9781612849287 (ISBN) Shariatpanahi, S. P ; Khalaj, B. H ; Sharif University of Technology
    2011
    Abstract
    In this paper, we analyze the role of the number of quantization bits on the third phase of the hierarchical cooperation scheme proposed by Ozgur et al. in 2007. The hierarchical cooperation scheme has a digital architecture and requires quantization of MIMO (Multiple-Input Multiple-Output) observations in the third phase. The choice of the number of quantization bits Q has direct effect on the pre-constant factor of the network throughput. By increasing the number of quantization bits, the MIMO capacity in the second phase increases at the expense of higher computational complexity of the third phase. We investigate such trade-off and show that there is an optimum number of quantization... 

    Information Flow in Random Wireless Networks

    , Ph.D. Dissertation Sharif University of Technology Shariatpanahi, Pooya (Author) ; Hossein Khalaj, Babak (Supervisor)
    Abstract
    We analyze the fundamental communication limits and capabilities of random wireless networks. In order to achieve this goal, we investigate and analyze efficient communication strategies in such networks. The traffic model considered is unicasting. Also, we consider two different channel models, namely, the geometric channel model and the random connections model.
    In networks with random connection model, channel powers between different nodes are drawn from a common distribution in an independent manner. We assume an on-off strategy for operation of transmitters, and show that finding the optimum transmission strategy problem is an NP-hard problem. Thus, we propose a heuristic algorithm... 

    Feedback bit reduction for antenna selection methods in wireless systems

    , Article 2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications, Kuala Lumpur, 16 November 2005 through 18 November 2005 ; Volume 1 , 2005 , Pages 229-233 ; 1424400007 (ISBN); 9781424400003 (ISBN) Shariatpanahi, P ; Babadi, B ; Hossein Khalaj, B ; Sharif University of Technology
    2005
    Abstract
    A well known method to reduce the intrinsic complexity of Multiple Input Multiple Output (MIMO) systems is to choose a subset of available antennas which have stronger links than the others, in order to perform the specified MIMO algorithm. The data resulted from the antenna selection process (at the receiver side) is sent back to the transmitter side via a feedback channel. There seems to be a need to reduce the number of feedack bits, specially when the number of antennas is not small. In this paper, we investigate the problem of reducing the number of feedback bits in antenna selection techniques. We've proposed two methods using vector quantization techniques to perform feedback bit... 

    Anticorrosion properties of smart coating based on polyaniline nanoparticles/epoxy-ester system

    , Article Progress in Organic Coatings ; Volume 75, Issue 4 , 2012 , Pages 502-508 ; 03009440 (ISSN) Arefinia, R ; Shojaei, A ; Shariatpanahi, H ; Neshati, J ; Sharif University of Technology
    2012
    Abstract
    In this study, the anticorrosive effect of dodecylbenzenesulfonicacid-doped polyaniline nanoparticles [n-PANI (DBSA)] as a conductive polymer was investigated using electrochemical impedance spectroscopy (EIS) and X-ray photoelectron spectroscopy (XPS) techniques. Initially, the n-PANI (DBSA) were successfully synthesized via inverse microemulsion polymerization leading to the spherical nanoparticles with an average diameter less than 30 nm. Two coating systems including 1 wt% n-PANI(DBSA) blended epoxy ester (n-PANI(DBSA)/EPE) and neat epoxy ester (EPE) were coated on the carbon steal substrate. The anticorrosion performance of the prepared coatings was studied using EIS measurement in 3.5%... 

    Multi-antenna coded caching

    , Article IEEE International Symposium on Information Theory - Proceedings, 25 June 2017 through 30 June 2017 ; 2017 , Pages 2113-2117 ; 21578095 (ISSN) ; 9781509040964 (ISBN) Shariatpanahi, S. P ; Caire, G ; Khalaj, B. H ; Sharif University of Technology
    2017
    Abstract
    In this paper we consider a single-cell downlink scenario where a multiple-antenna base station delivers contents to multiple cache-enabled user terminals. Based on the multicasting opportunities provided by the so-called Coded Caching technique, we investigate three delivery approaches. Our baseline scheme employs the coded caching technique on top of max-min fair multicasting. The second one consists of a joint design of Zero-Forcing (ZF) and coded caching, where the coded chunks are formed in the signal domain (complex field). The third scheme is similar to the second one with the difference that the coded chunks are formed in the data domain (finite field). We derive closed-form rate...