104 research outputs found

    Design and evaluation of an optimization based approach to multiple burst admission control for cdma2000

    Get PDF
    In our recent study, we have formulated the burst admission control problem for wideband CDMA systems as an integer programming problem. In this paper, we propose and analyze the performance of a novel burst admission technique, called the multiple-burst admission-spatial dimension algorithm (MBA-SD) to judiciously allocate the previous channels in wideband CDMA systems to burst requests. Both the forward link and the reverse link burst requests are considered and the system is simulated by dynamic simulations which takes into account of the user mobility, power control and soft hand-off. We found that significant performance improvement, in terms of data user capacity, coverage, and admission and outage probabilities, could be achieved by our scheme compared to the existing burst assignment algorithms.published_or_final_versio

    On generalized optimal scheduling of high data-rate bursts in CDMA systems

    Get PDF
    In a code-division multiple access (CDMA)-based wireless communication system, forward link is power limited and reverse link is interference limited. With power control and statistical multiplexing, voice services can be supported reasonably well. However, for high data-rate services, a more comprehensive scheduling mechanism is needed in order to achieve a high capacity while satisfying the forward and reverse link constraints. In this paper, we formulate the high data-burst scheduling as a integer programming problem using a generic CDMA system model. We also suggest an optimal algorithm for generating scheduling solutions. With cdma2000 system details plugged in the proposed algorithm, it is found that our algorithm considerably outperforms several fast heuristics, including equal sharing, first-come-first-served, longest delay first, and shortest burst first.published_or_final_versio

    System modeling and performance evaluation of rate allocation schemes for packet data services in wideband CDMA systems

    Get PDF
    To fully exploit the potential of a wideband CDMA-based mobile Internet computing system, an efficient algorithm is needed for judiciously performing rate allocation, so as to orchestrate and allocate bandwidth for voice services and high data rate applications. However, in existing standards (e.g., cdma2000), only a first-come-first-served equal sharing allocation algorithm is used, potentially leading to a low bandwidth utilization and inadequate support of high data rate multimedia mobile applications (e.g., video/audio files swapping, multimedia messaging services, etc.). In this paper, we first analytically model the rate allocation problem that captures realistic system constraints such as downlink power limits and control, uplink Interference effects, physical channel adaptation, and soft handoff. We then suggest six efficient rate allocation schemes that are designed based on different philosophies: rate optimal, fairness-based, and user-oriented. Simulations are performed to evaluate the effectiveness of the rate allocation schemes using realistic system parameters In our model.published_or_final_versio

    GAME THEORETIC APPROACH TO RADIO RESOURCE MANAGEMENT ON THE REVERSE LINK FOR MULTI-RATE CDMA WIRELESS DATA NETWORKS

    Get PDF
    This work deals with efficient power and rate assignment to mobile stations (MSs) involved in bursty data transmission in cellular CDMA networks. Power control in the current CDMA standards is based on a fixed target signal quality called signal to interference ratio (SIR). The target SIR represents a predefined frame error rate (FER). This approach is inefficient for data-MSs because a fixed target SIR can limit the MS's throughput. Power control should thus provide dynamic target SIRs instead of a fixed target SIR. In the research literature, the power control problem has been modeled using game theory. A limitation of the current literature is that in order to implement the algorithms, each MS needs to know information such as path gains and transmission rates of all other MSs. Fast rate control schemes in the evolving cellular data systems such as cdma2000-1x-EV assign transmission rates to MSs using a probabilistic approach. The limitation here is that the radio resources can be either under or over-utilized. Further, all MSs are not assigned the same rates. In the schemes proposed in the literature, only few MSs, which have the best channel conditions, obtain all radio resources. In this dissertation, we address the power control issue by moving the computation of the Nash equilibrium from each MS to the base station (BS). We also propose equal radio resource allocation for all MSs under the constraint that only the maximum allowable radio resources are used in a cell. This dissertation addresses the problem of how to efficiently assign power and rate to MSs based on dynamic target SIRs for bursty transmissions. The proposed schemes in this work maximize the throughput of each data-MS while still providing equal allocation of radio resources to all MSs and achieving full radio resource utilization in each cell. The proposed schemes result in power and rate control algorithms that however require some assistance from the BS. The performance evaluation and comparisons with cdma2000-1x-Evolution Data Only (1x-EV-DO) show that the proposed schemes can provide better effective rates (rates after error) than the existing schemes

    Mobile Networks

    Get PDF
    The growth in the use of mobile networks has come mainly with the third generation systems and voice traffic. With the current third generation and the arrival of the 4G, the number of mobile users in the world will exceed the number of landlines users. Audio and video streaming have had a significant increase, parallel to the requirements of bandwidth and quality of service demanded by those applications. Mobile networks require that the applications and protocols that have worked successfully in fixed networks can be used with the same level of quality in mobile scenarios. Until the third generation of mobile networks, the need to ensure reliable handovers was still an important issue. On the eve of a new generation of access networks (4G) and increased connectivity between networks of different characteristics commonly called hybrid (satellite, ad-hoc, sensors, wired, WIMAX, LAN, etc.), it is necessary to transfer mechanisms of mobility to future generations of networks. In order to achieve this, it is essential to carry out a comprehensive evaluation of the performance of current protocols and the diverse topologies to suit the new mobility conditions

    Connection admission control and packet scheduling for IEEE 802.16 networks

    Get PDF
    Includes bibliographical references.The IEEE 802.16 standard introduced as one of the Wireless Metropolitan Area Networks (WMAN) for Broadband Wireless Access (BWA) which is known as Worldwide Interoperability for Microwave Access (WiMAX), provides a solution of broadband connectivity to areas where wired infrastructure is economically and technically infeasible. Apart from the advantage of having high speeds and low costs, IEEE 802.16 has the capability to simultaneously support various service types with required QoS characteristics. ... While IEEE 802.16 standard defines medium access control (MAC) and physical (PHY) layers specification, admission control and packet scheduling mechanisms which are important elements of QoS provisioning are left to vendors to design and implement for service differentiation and QoS support

    Approximation Techniques For Analytical Characterization Of Downlink Traffic Power For Multi-Service CDMA Networks

    Get PDF
    This paper presents a novel analytical framework for characterizing the downlink power allocations for a multi-rate Code Division Multiple Access (CDMA) network. The characterization takes into account the RF propagation model, the shadowing process and considers both intracell and intercell interference. To arrive at the model, the paper utilizes approximation techniques recently developed in the recent literature to evaluate the sum of lognormal random variables. The overall traffic power is modeled as a random variable that is function of the network parameters and the assigned downlink bit rates. The paper demonstrates the calculation of the forward link power outage probability as one example application for the developed characterization. It also compares between two approximation techniques suggested in this paper: matched first and second order statistics, and the min-max technique. The analytical results are compared to those obtained via Monte-Carlo simulations to assess the accuracy of the adapted approximations. The results indicate the min-max technique produces more accurate results when compared to matched first and second moments approximation scheme

    Approximation Techniques For Analytical Characterization Of Downlink Traffic Power For Multi-Service CDMA Networks

    Get PDF
    This paper presents a novel analytical framework for characterizing the downlink power allocations for a multi-rate Code Division Multiple Access (CDMA) network. The characterization takes into account the RF propagation model, the shadowing process and considers both intracell and intercell interference. To arrive at the model, the paper utilizes approximation techniques recently developed in the recent literature to evaluate the sum of lognormal random variables. The overall traffic power is modeled as a random variable that is function of the network parameters and the assigned downlink bit rates. The paper demonstrates the calculation of the forward link power outage probability as one example application for the developed characterization. It also compares between two approximation techniques suggested in this paper: matched first and second order statistics, and the min-max technique. The analytical results are compared to those obtained via Monte-Carlo simulations to assess the accuracy of the adapted approximations. The results indicate the min-max technique produces more accurate results when compared to matched first and second moments approximation scheme

    QoS constrained cellular ad hoc augmented networks

    Get PDF
    In this dissertation, based on different design criteria, three novel quality of service (QoS) constrained cellular ad hoc augmented network (CAHAN) architectures are proposed for next generation wireless networks. The CAHAN architectures have a hybrid architecture, in which each MT of CDMA cellular networks has ad hoc communication capability. The CAHAN architectures are an evolutionary approach to conventional cellular networks. The proposed architectures have good system scalability and high system reliability. The first proposed architecture is the QoS constrained minimum-power cellular ad hoc augmented network architecture (QCMP CAHAN). The QCMP CAHAN can find the optimal minimum-power routes under the QoS constraints (bandwidth, packet-delay, or packet-error-rate constraint). The total energy consumed by the MTs is lower in the case of QCMP CAHAN than in the case of pure cellular networks. As the ad hoc communication range of each MT increases, the total transmitted power in QCMP CAHAN decreases. However, due to the increased number of hops involved in information delivery between the source and the destination, the end-to-end delay increases. The maximum end-to-end delay will be limited to a specified tolerable value for different services. An MT in QCMP CAHAN will not relay any messages when its ad hoc communication range is zero, and if this is the case for all MTs, then QCMP CAHAN reduces to the traditional cellular network. A QoS constrained network lifetime extension cellular ad hoc augmented network architecture (QCLE CAHAN) is proposed to achieve the maximum network lifetime under the QoS constraints. The network lifetime is higher in the case of QCLE CAHAN than in the case of pure cellular networks or QCMP CAHAN. In QCLE CAHAN, a novel QoS-constrained network lifetime extension routing algorithm will dynamically select suitable ad-hoc-switch-to-cellular points (ASCPs) according to the MT remaining battery energy such that the selection will balance all the MT battery energy and maximizes the network lifetime. As the number of ASCPs in an ad hoc subnet decreases, the network lifetime will be extended. Maximum network lifetime can be increased until the end-to-end QoS in QCLE CAHAN reaches its maximum tolerable value. Geocasting is the mechanism to multicast messages to the MTs whose locations lie within a given geographic area (target area). Geolocation-aware CAHAN (GA CAHAN) architecture is proposed to improve total transmitted power expended for geocast services in cellular networks. By using GA CAHAN for geocasting, saving in total transmitted energy can be achieved as compared to the case of pure cellular networks. When the size of geocast target area is large, GA CAHAN can save larger transmitted energy
    corecore