Loading...
Search for: average-delay
0.01 seconds

    QoS-aware water-filling for real-time transmission in OFDMA systems

    , Article 2011 18th International Conference on Telecommunications, ICT 2011, 8 May 2011 through 11 May 2011, Ayia Napa ; 2011 , Pages 84-89 ; 9781457700248 (ISBN) Vakilinia, S ; Khalaj, B. H ; Froushani, M. H. L ; Sharif University of Technology
    2011
    Abstract
    In this paper, we propose a distributed rate and power allocation algorithm for real time traffic by using second order statistics of the channel. Our method minimizes the average delay of transmission over the fading channel. We assume that each sub carrier relies on its own buffer, and a constant arrival rate from higher layer application arrives at input buffers of each sub-carrier. This constant rate is optimally distributed through individual sub-rates transmitted over each sub-channel. Optimum power coefficients are also derived to minimize the average delay of transmission. In addition, collision and buffer overflows are taken into account while achieving acceptable throughputs  

    Performance analysis of slotted ALOHA random access packet-switching optical CDMA networks using generalized optical orthogonal codes and M-ary overlapping PPM signaling

    , Article Journal of Optical Communications and Networking ; Volume 3, Issue 7 , July , 2011 , Pages 568-576 ; 19430620 (ISSN) Shoaie, M. A ; Khazraei, S ; Pakravan, M. R ; Sharif University of Technology
    2011
    Abstract
    In this paper we study slotted ALOHA random access optical code division multiple access packet-switching networks with a chip-level receiver structure. We use generalized optical orthogonal codes (GOOCs) and the overlapping pulse position modulation (OPPM) signaling technique to improve system performance. The impact of physical layer parameters such as the GOOC cross-correlation value and the OPPM overlapping index on key performance benchmarks such as network throughput and delay are analyzed. We also study the stability of the network based on the number of backlogged users, using the expected state drift. It has been shown that using GOOC instead of strict optical orthogonal codes... 

    Enhancement of full-duplex efficiency in an asymmetric IEEE 802.11-based WLAN

    , Article IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC, 4 September 2016 through 8 September 2016 ; 2016 ; 9781509032549 (ISBN) Goshtasbpour, S ; Ashtiani, F ; Mirmohseni, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2016
    Abstract
    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... 

    Analytical evaluation of average delay and maximum stable throughput along a typical two-way street for vehicular ad hoc networks in sparse situations

    , Article Computer Communications ; Volume 32, Issue 16 , 2009 , Pages 1768-1780 ; 01403664 (ISSN) Javanmard, A ; Ashtiani, F ; Sharif University of Technology
    2009
    Abstract
    Intermittent connectivity is an intrinsic feature of vehicular ad hoc networks (VANETs) in sparse situations. This type of network is in fact an example of delay and disruption tolerant networks (DTNs). In this paper, we focus on a typical two-way street and analytically evaluate the maximum stable throughput and the average delay for packet forwarding along the street. To this end, we map the mobility patterns of the vehicles with different speeds onto suitable parameters of a BCMP queueing network and derive the location density of vehicles. Then, we employ another queueing network in order to model opportunistic multi-hop packet forwarding along the street with respect to the... 

    A new routing algorithm for sparse vehicular AD HOC networks with moving destinations

    , Article 2009 IEEE Wireless Communications and Networking Conference, WCNC 2009, Budapest, 5 April 2009 through 8 April 2009 ; 2009 ; 15253511 (ISSN); 9781424429486 (ISBN) Ghaffari, M ; Ashtian, F ; Sharif University of Technology
    2009
    Abstract
    In this paper, we propose the Object Pursuing based Efficient Routing Algorithm (OPERA) suitable for vehicular ad hoc networks (VANETs), esp. in sparse situations. The proposed algorithm is applicable for both moving and fixed destinations. It is based on considering static nodes at each intersection. In this algorithm, we optimize the decision making at intersections, with respect to the connectivity and feasibilty of the roads. To this end, we consider the average delay of each road as the connectivity metric, and the vehicle availability in the transmission range of the intersection as the feasibility metric. By exploiting the related metrics, we select the next road to forward the packet... 

    A novel zero-aware read-static-noise-margin-free SRAM Cell for high density and high speed cache application

    , Article 2008 9th International Conference on Solid-State and Integrated-Circuit Technology, ICSICT 2008, Beijing, 20 October 2008 through 23 October 2008 ; 2008 , Pages 876-879 ; 9781424421855 (ISBN) Azizi Mazreah, A ; Manzuri Shalmani, M. T ; Noormandi, R ; Mehrparvar, A ; Sharif University of Technology
    2008
    Abstract
    To help overcome limits to the density and speed of conventional SRAMs, we have developed a five-transistor SRAM cell. The newly developed CMOS five-transistor SRAM cell uses one word-line and one bit-line during read/write operation. This cell retains its data with leakage current and positive feedback without refresh cycle. The new cell size is 18% smaller than a conventional six-transistor SRAM cell using same design rules. Simulation result in standard 0.25μm CMOS technology shows purposed cell has correct operation during read/write and idle mode. The average delay of new cell is 20% smaller than a six-transistor SRAM cell. © 2008 IEEE  

    A semiclassical approach for the phase matching effect in the nonlinear optical phenomena

    , Article Journal of Optics A: Pure and Applied Optics ; Volume 10, Issue 12 , 2008 ; 14644258 (ISSN) Wahedy Zarch, A. A ; Kaatuzian, H ; Amjadi, A ; Sharif University of Technology
    2008
    Abstract
    In this paper we present a semiclassical model for explanation of the nonlinear optical effect and phase matching. We calculate momentary quantities of the delay time of photon-electron interaction in each layer. We show that for phase matching, the average delay time for the fundamental photons must be equal to the average delay time for the harmonic photons. Additionally, we calculate the number of layers that the harmonic photon needs to be absorbed or converted to fundamental photons. This calculation applies to different wavelengths with different phase matching angles. Our simulation results are in good agreement with experimental data. © 2008 IOP Publishing Ltd  

    Effect of data traffic shaping on throughput and delay for VSG-CDMA cellular networks

    , Article 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, ICT-MICC 2007, Penang, 14 May 2007 through 17 May 2007 ; February , 2007 , Pages 6-11 ; 1424410940 (ISBN); 9781424410941 (ISBN) Seyfi, A ; Ashtiani, F ; Sharif University of Technology
    2007
    Abstract
    In this paper, we analyze the effect of applying leaky bucket as a well known traffic shaper on data users in a variable spreading gain CDMA (VSG-CDMA) uplink wireless cellular network. To this end, we model the effect of leaky bucket mechanism on a typical data user, with a closed product form queueing network. Each node in this queueing network corresponds to a specific processing gain or equivalently transmission rate and power. By solving such a queueing network we obtain the steady state probability with which a typical data user will exist at each node. By aggregating the effects of all data users we compute the mean and variance of interference and obtain the throughput and average...