Conference Paper

A Theory of QoS for Wireless

Dept. of Comput. Sci., Univ. of Illinois Urbana, Urbana, IL
DOI: 10.1109/INFCOM.2009.5061954 Conference: INFOCOM 2009, IEEE
Source: IEEE Xplore

ABSTRACT

Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control, which consists of determining whether it is possible to fulfill the demands of a set of clients. The other is finding an optimal scheduling policy to meet the demands of all clients. In this paper, we propose a framework for jointly addressing three QoS criteria: delay, delivery ratio, and channel reliability. We analytically prove the necessary and sufficient condition for a set of clients to be feasible with respect to the above three criteria. We then establish an efficient algorithm for admission control to decide whether a set of clients is feasible. We further propose two scheduling policies and prove that they are feasibility optimal in the sense that they can meet the demands of every feasible set of clients. In addition, we show that these policies are easily implementable on the IEEE 802.11 mechanisms. We also present the results of simulation studies that appear to confirm the theoretical studies and suggest that the proposed policies outperform others tested under a variety of settings.

  • Source
    • "The packets not delivered by the end of the interval are dropped by the BS. The timely throughput measures the average number Fig. 2. Time model of a user for the timely throughput framework. of packets delivered before their deadlines, which handles the delay requirement and reliability performance jointly [34]. "

    Full-text · Article · Jan 2016 · IEEE Transactions on Wireless Communications
  • Source
    • "They are different in the assumption of the traffic. Some of them assume the traffic arrives at the beginning of the frame [11] [12], while others assume the arriving happens any time in the frame [14– 16]. They also differ in the introducing of channel fading [13], nonidentical delays [16], and so forth. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Cyber physical systems collect plenty of information from physical world. This information must be transmitted to the base station immediately to support the making of controlling orders since the physical world keeps transforming rapidly. Such a fact needs the support of real-time transmitting in CPS. Real-time traffic often has some extra QoS requirements. For example, regulating the interservice time, which is the time between two consecutive transmissions of a link, is essential for the real-time traffic in wireless networks. A guarantee of the interservice time of a single user is a precondition to support the normal operating of a system. As far as we know, none of previous work can guarantee the performance on the interservice time. Motivated by this, we design a framework for interservice time guaranteed scheduling. We first define a new capacity region of networks with a strict interservice time guarantee. It is an extension of the well-accepted definition on basic capacity region. Then we propose a novel scheduling policy that is both throughput-optimal and interservice time guaranteed. Simulation results show the policy performs well in interservice time and throughput.
    Full-text · Article · Aug 2015 · International Journal of Distributed Sensor Networks
  • Source
    • "It actually measures the mean probability that a user's packet is delivered before its transmission deadline, which evaluates the reliability performance under a delay constraint of τ time slots. According to the definition, the user timely throughput is given by [10] T "
    [Show abstract] [Hide abstract]
    ABSTRACT: Network densification via deploying dense small cells is one of the dominant evolutions towards future cellular network to increase spectrum efficiency. Packet transmission delay and reliability in the resultant interference-limited heterogeneous cellular network (HCN) are essential performance metrics for system design. By modeling the locations of base stations (BSs) in HCN as superimposed of independent Poisson point processes, we propose an analytical framework to derive the timely throughput of HCN, which captures both the delay and reliability performance. In the analysis, the BS activity and temporal correlation of transmissions are taken into consideration, both of which have significant effect on network performance. The effect of mobility, BS density, and association bias factor is investigated through numerical results, which shows that network performance derived ignoring the temporal correlation of transmissions is optimistic.
    Full-text · Conference Paper · Jun 2015
Show more