756 research outputs found

    Congestion probabilities in CDMA-based networks supporting batched Poisson traffic

    Get PDF
    We propose a new multirate teletraffic loss model for the calculation of time and call congestion probabilities in CDMA-based networks that accommodate calls of different serviceclasses whose arrival follows a batched Poisson process. The latter is more "peaked" and "bursty" than the ordinary Poisson process. The acceptance of calls in the system is based on the partial batch blocking discipline. This policy accepts a part of the batch (one or more calls) and discards the rest if the available resources are not enough to accept the whole batch. The proposed model takes into account the multiple access interference, the notion of local (soft) blocking, user’s activity and the interference cancellation. Although the analysis of the model does not lead to a product form solution of the steady state probabilities, we show that the calculation of the call-level performance metrics, time and call congestion probabilities, can be based on approximate but recursive formulas. The accuracy of the proposed formulas are verified through simulation and found to be quite satisfactory

    Influence of various application types on the performance of LTE mobile networks

    Get PDF
    Modern mobile internet networks are becoming heavier and denser. Also it is not regularly planned, and becoming more heterogeneous. The explosive growth in the usage of smartphones poses numerous challenges for LTE cellular networks design and implementation. The performance of LTE networks with bursty and self-similar trafïŹc has become a major challenge. Accurate modeling of the data generated by each connected wireless device is important for properly investigating the performance of LTE networks. This paper presents a mathematical model for LTE networks using queuing theory considering the inïŹ‚uence of various application types. Using sporadic source trafïŹc feeding to the queue of the evolved node B and with the exponential service time assumption, we construct a queuing model to estimate the performance of LTE networks. We use the performance model presented in this paper to study the inïŹ‚uence of various application categories on the performance of LTE cellular networks. Also we validate our model with simulation using NS3 simulator with different scenarios

    Maximally Flexible Assignment of Orthogonal Variable Spreading Factor Codes for Multi-Rate Traffic

    Get PDF
    In universal terrestrial radio access (UTRA) systems, orthogonal variable spreading factor (OVSF) codes are used to support different transmission rates for different users. In this paper, we first define the flexibility index to measure the capability of an assignable code set in supporting multirate traffic classes. Based on this index, two single-code assignment schemes, nonrearrangeable and rearrangeable compact assignments, are proposed. Both schemes can offer maximal flexibility for the resulting code tree after each code assignment. We then present an analytical model and derive the call blocking probability, system throughput and fairness index. Analytical and simulation results show that the proposed schemes are efficient, stable and fair

    Can Unlicensed Bands Be Used by Unlicensed Usage?

    Get PDF
    Since their introduction, unlicensed ISM bands have resulted in a wide range of new wireless devices and services. It is fair to say that the success of ISM was an important factor in the opening of the TV white space for unlicensed access. Further bands (e.g., 3550-3650 MHz) are being studied to support unlicensed access. Expansion of the unlicensed bands may well address one of the principle disadvantages of unlicensed (variable quality of service) which could result in a vibrant new group companies providing innovative services and better prices. However, given that many commercial mobile telephone operators are relying heavily on the unlicensed bands to manage growth in data traffic through the “offloading” strategy, the promise of these bands may be more limited than might otherwise be expected (Musey, 2013).\ud \ud Wireless data traffic has exploded in the past several years due to more capable devices and faster network technologies. While there is some debate on the trajectory of data growth, some notable reports include AT&T, which reported data growth of over 5000% from 2008 to 2010 and Cisco, who predicted that mobile data traffic will grow to 6.3 exabytes per month in average by 2015 (Hu, 2012). Although the data traffic increased dramatically, relatively little new spectrum for mobile operators has come online in the last several years; further, the “flat-rate” pricing strategy has led to declining Average Revenue Per User (ARPU) for the mobile operators. Their challenge, then, is how to satisfy the service demand with acceptable additional expenditures on infrastructure and spectrum utilization.\ud \ud A common response to this challenge has been to offload data traffic onto unlicensed (usually WiFi) networks. This can be accomplished either by establishing infrastructure (WiFi hotspots) or to use existing private networks. This phenomenon leads to two potential risks for spectrum entrants: (1) the use of offloading may overwhelm unlicensed spectrum and leave little access opportunities for newcomers; (2) the intensity of the traffic may increase interference and degrade innovative services.\ud \ud Consequently, opening more unlicensed frequency bands alone may not necessarily lead to more unlicensed usage. In this paper, we will estimate spectrum that left for unlicensed usage and analyze risks for unlicensed users in unlicensed bands in terms of access opportunities and monetary gain. We will further provide recommendations that help foster unlicensed usage in unlicensed bands

    An analytical framework in LEO mobile satellite systems servicing batched Poisson traffic

    Get PDF
    The authors consider a low earth orbit (LEO) mobile satellite system (MSS) that accepts new and handover calls of multirate service-classes. New calls arrive in the system as batches, following the batched Poisson process. A batch has a generally distributed number of calls. Each call is treated separately from the others and its acceptance is decided according to the availability of the requested number of channels. Handover calls follow also a batched Poisson process. All calls compete for the available channels under the complete sharing policy. By considering the LEO-MSS as a multirate loss system with ‘satellite-fixed’ cells, it can be analysed via a multi-dimensional Markov chain, which yields to a product form solution (PFS) for the steady-state distribution. Based on the PFS, they propose a recursive and yet efficient formula for the determination of the channel occupancy distribution, and consequently, for the calculation of various performance measures including call blocking and handover failure probabilities. The latter are much higher compared to the corresponding probabilities in the case of the classical (and less bursty) Poisson process. Simulation results verify the accuracy of the proposed formulas. Furthermore, they discuss the applicability of the proposed model in software-defined LEO-MSS

    LPDQ: a self-scheduled TDMA MAC protocol for one-hop dynamic lowpower wireless networks

    Get PDF
    Current Medium Access Control (MAC) protocols for data collection scenarios with a large number of nodes that generate bursty traffic are based on Low-Power Listening (LPL) for network synchronization and Frame Slotted ALOHA (FSA) as the channel access mechanism. However, FSA has an efficiency bounded to 36.8% due to contention effects, which reduces packet throughput and increases energy consumption. In this paper, we target such scenarios by presenting Low-Power Distributed Queuing (LPDQ), a highly efficient and low-power MAC protocol. LPDQ is able to self-schedule data transmissions, acting as a FSA MAC under light traffic and seamlessly converging to a Time Division Multiple Access (TDMA) MAC under congestion. The paper presents the design principles and the implementation details of LPDQ using low-power commercial radio transceivers. Experiments demonstrate an efficiency close to 99% that is independent of the number of nodes and is fair in terms of resource allocation.Peer ReviewedPostprint (author’s final draft

    Buffer management and cell switching management in wireless packet communications

    Get PDF
    The buffer management and the cell switching (e.g., packet handoff) management using buffer management scheme are studied in Wireless Packet Communications. First, a throughput improvement method for multi-class services is proposed in Wireless Packet System. Efficient traffic management schemes should be developed to provide seamless access to the wireless network. Specially, it is proposed to regulate the buffer by the Selective- Delay Push-In (SDPI) scheme, which is applicable to scheduling delay-tolerant non-real time traffic and delay-sensitive real time traffic. Simulation results show that the performance observed by real time traffics are improved as compared to existing buffer priority scheme in term of packet loss probability. Second, the performance of the proposed SDPI scheme is analyzed in a single CBR server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the ATM layer to adapt the quality of the cell transfer to the QoS requirements and to improve the utilization of network resources. This is achieved by selective-delaying and pushing-in cells according to the class they belong to. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis. Finally, a novel cell-switching scheme based on TDMA protocol is proposed to support QoS guarantee for the downlink. The new packets and handoff packets for each type of traffic are defined and a new cutoff prioritization scheme is devised at the buffer of the base station. A procedure to find the optimal thresholds satisfying the QoS requirements is presented. Using the ON-OFF approximation for aggregate traffic, the packet loss probability and the average packet delay are computed. The performance of the proposed scheme is evaluated by simulation and numerical analysis in terms of packet loss probability and average packet delay
    • 

    corecore