16,260 research outputs found

    User-level performance of channel-aware scheduling algorithms in wireless data networks

    Get PDF
    Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in wireless data networks by exploiting channel fluctuations. The performance of channel-aware scheduling algorithms has mostly been explored at the packet level for a static user population, often assuming infinite backlogs. In the present paper, we focus on the performance at the flow level in a dynamic setting with random finite-size service demands. We show that in certain cases the user-level performance may be evaluated by means of a multi-class Processor-Sharing model where the total service rate varies with the total number of users. The latter model provides explicit formulas for the distribution of the number of active users of the various classes, the mean response times, the blocking probabilities, and the mean throughput. In addition we show that, in the presence of channel variations, greedy, myopic strategies which maximize throughput in a static scenario, may result in sub-optimal throughput performance for a dynamic user configuration and cause potential instability effects

    User-level performance of channel-aware scheduling algorithms in wireless data networks

    Full text link

    Improvement of indoor VLC network downlink scheduling and resource allocation

    Get PDF
    Indoor visible light communications (VLC) combines illumination and communication by utilizing the high-modulation-speed of LEDs. VLC is anticipated to be complementary to radio frequency communications and an important part of next generation heterogeneous networks. In order to make the maximum use of VLC technology in a networking environment, we need to expand existing research from studies of traditional point-to-point links to encompass scheduling and resource allocation related to multi-user scenarios. This work aims to maximize the downlink throughput of an indoor VLC network, while taking both user fairness and time latency into consideration. Inter-user interference is eliminated by appropriately allocating LEDs to users with the aid of graph theory. A three-term priority factor model is derived and is shown to improve the throughput performance of the network scheduling scheme over those previously reported. Simulations of VLC downlink scheduling have been performed under proportional fairness scheduling principles where our newly formulated priority factor model has been applied. The downlink throughput is improved by 19.6% compared to previous two-term priority models, while achieving similar fairness and latency performance. When the number of users grows larger, the three-term priority model indicates an improvement in Fairness performance compared to two-term priority model scheduling

    Scheduling for next generation WLANs: filling the gap between offered and observed data rates

    Get PDF
    In wireless networks, opportunistic scheduling is used to increase system throughput by exploiting multi-user diversity. Although recent advances have increased physical layer data rates supported in wireless local area networks (WLANs), actual throughput realized are significantly lower due to overhead. Accordingly, the frame aggregation concept is used in next generation WLANs to improve efficiency. However, with frame aggregation, traditional opportunistic schemes are no longer optimal. In this paper, we propose schedulers that take queue and channel conditions into account jointly, to maximize throughput observed at the users for next generation WLANs. We also extend this work to design two schedulers that perform block scheduling for maximizing network throughput over multiple transmission sequences. For these schedulers, which make decisions over long time durations, we model the system using queueing theory and determine users' temporal access proportions according to this model. Through detailed simulations, we show that all our proposed algorithms offer significant throughput improvement, better fairness, and much lower delay compared with traditional opportunistic schedulers, facilitating the practical use of the evolving standard for next generation wireless networks
    • …
    corecore