A Theory of QoS for Wireless

Conference PaperinProceedings - IEEE INFOCOM · May 2009with17 Reads
DOI: 10.1109/INFCOM.2009.5061954 · Source: IEEE Xplore
Conference: INFOCOM 2009, IEEE
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.
    • "Similar to the time averaged delivery ratio in [16], we define the time average packet dropping ratio as follows: "
    [Show abstract] [Hide abstract] ABSTRACT: To ensure the low end-to-end (E2E) delay for tactile internet, short frame structures will be used in 5G systems. As such, transmission errors with finite blocklength channel codes should be considered to guarantee the high reliability requirement. In this paper, we study cross-layer transmission optimization for tactile internet, where both queueing delay and transmission delay are accounted for in the E2E delay, and different packet loss/error probabilities are considered to characterize the reliability. We show that the required transmit power becomes unbounded when the allowed maximal queueing delay is shorter than the channel coherence time. To satisfy quality-of-service requirement with finite transmit power, we introduce a proactive packet dropping mechanism, and optimize a queue state information and channel state information dependent transmission policy. Since the resource and policy for transmission and the packet dropping policy are related to the packet error probability, queueing delay violation probability, and packet dropping probability, we optimize the three probabilities and obtain the policies related to these probabilities. We start from single-user scenario and then extend our framework to the multiuser scenario. Simulation results show that the optimized three probabilities are in the same order of magnitude. Therefore, we have to take into account all these factors when we design systems for tactile internet applications.
    Full-text · Conference Paper · Dec 2016
    • "The Optimal and Heuristic Algorithms are studied via simulations. To examine their performances, the metrics of interest are the achieved throughput vector and the Deadlines Miss Ratio [12]. The DMR is defined as "
    [Show abstract] [Hide abstract] ABSTRACT: An increasing number of applications rely on wireless networks for distributing information. Communicating time-sensitive data such as position, video, voice and telemetry, can be particularly challenging in wireless networks due to packet losses. In this thesis, we consider a single-hop wireless network, in which a base station is sending time-sensitive data packets to a set of clients. Our goal is to study transmission scheduling strategies for real-time traffic. Even though this problem has been explored in the literature, we present novel results that provide useful insight into the optimal scheduling problem. Previous work considered the problem of maximizing the throughput of networks with instantaneous feedback and without feedback. We address the general case of delayed feedback. Delayed feedback is particularly important for communication systems in which the round trip delay is much greater than the packet transmission time, and it has a significant impact on the scheduling decisions and network performance. In addition, we consider the case of clients receiving multiple parallel packet flows with heterogeneous deadlines. It is a well-known result that the Shortest Time to Extinction (STE) policy optimizes the throughput in wired networks. In this thesis, we establish a class of wireless networks for which the STE policy is throughput-optimal, i.e. minimizes the expected number of packets that expire due to the deadlines. Finally, we study the wireless network from the perspective of the Age of Information (AoI). This recently proposed performance metric represents the freshness of the information at the clients. We use Dynamic Programming to formulate and solve the problem of characterizing the scheduling policy that minimizes the AoI. The AoI metric is compared with throughput, and insights are drawn from numerical results. Simulations suggest that AoI-optimal policies are always throughput-optimal, while the converse is not true.
    Full-text · Thesis · Jul 2016
    • "Therefore, the challenges of securing a Networked Cyber-Physical System are two-fold: 1) Secure the cyber layer that comprises the communication network, ensuring confidentiality, integrity, and availability of network packets, and 2) Secure the sensors and actuators interfacing with the physical layer. The former is achieved by a combination of traditional approaches such as cryptography and a more recent line of work reported in [21], [39], [40], while the latter is the subject of this paper. Based on our assumption that the communication network is complete, and that the cyber layer has been secured, we suppose that every node in the network knows the identity of the node from which a packet that it receives originated, and knows if a packet that it receives was tampered with by any node along the route. "
    [Show abstract] [Hide abstract] ABSTRACT: The coming decades may see the large scale deployment of networked cyber-physical systems to address global needs in areas such as energy, water, healthcare, and transportation. However, as recent events have shown, such systems are vulnerable to cyber attacks. Being safety critical, their disruption or misbehavior can cause economic losses or injuries and loss of life. It is therefore important to secure such networked cyber-physical systems against attacks. In the absence of credible security guarantees, there will be resistance to the proliferation of cyber-physical systems, which are much needed to meet global needs in critical infrastructures and services. This paper addresses the problem of secure control of networked cyber-physical systems. This problem is different from the problem of securing the communication network, since cyber-physical systems at their very essence need sensors and actuators that interface with the physical plant, and malicious agents may tamper with sensors or actuators, as recent attacks have shown. We consider physical plants that are being controlled by multiple actuators and sensors communicating over a network, where some sensors could be "malicious," meaning that they may not report the measurements that they observe. We address a general technique by which the actuators can detect the actions of malicious sensors in the system, and disable closed-loop control based on their information. This technique, called "watermarking," employs the technique of actuators injecting private excitation into the system which will reveal malicious tampering with signals. We show how such an active defense can be used to secure networked systems of sensors and actuators.
    Article · Jun 2016
Show more

  • undefined · undefined
  • undefined · undefined
  • undefined · undefined