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.

0 Bookmarks
 · 
73 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the joint design of transmission schedules and controllers for networked control loops that use WirelessHART communication for sensor and actuator data. By parameterizing the design problem in terms of the sampling rate of the control loop, the co-design problem separates into two well-defined subproblems which admit optimal solutions: transmission scheduling should be done to maximize the delay-constrained reliability while the control design should optimize closed-loop performance under packet loss. We illustrate how these problems can be solved and demonstrate our co-design framework for the case of linear-quadratic control.
    01/2011;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the joint design of forwarding policies and controllers for wireless control loops where sensor measurements are sent over an unreliable multi-hop wireless network to the controller node. For fixed sampling rate of the control loop, the co-design problem separates into two well-defined and independent subproblems: transmission scheduling for maximizing the delay-constrained reliability and optimal control under packet loss. We develop optimal solutions for these subproblems and show that the optimally co-designed system can be found by a one-dimensional search over the sampling interval. Several numerical examples illustrate the power of our approach.
    04/2012;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks have been increasingly used for real-time surveillance over large areas. In such applications, it is important to support end-to-end delay constraints for packet deliveries even when the corresponding flows require multi-hop transmissions. In addition to delay constraints, each flow of real-time surveillance may require some guarantees on throughput of packets that meet the delay constraints. Further, as wireless sensor networks are usually deployed in challenging environments, it is important to specifically consider the effects of unreliable wireless transmissions. In this paper, we study the problem of providing end-to-end delay guarantees for multi-hop wireless networks. We propose a model that jointly considers the end-to-end delay constraints and throughput requirements of flows, the need for multi-hop transmissions, and the unreliable nature of wireless transmissions. We develop a framework for designing feasibility-optimal policies. We then demonstrate the utility of this framework by considering two types of systems: one where sensors are equipped with full-duplex radios, and the other where sensors are equipped with half-duplex radios. When sensors are equipped with full-duplex radios, we propose an online distributed scheduling policy and proves the policy is feasibility-optimal. We also provide a heuristic for systems where sensors are equipped with half-duplex radios. We show that this heuristic is still feasibility-optimal for some topologies.
    04/2012;

Full-text

View
1 Download
Available from