Priority Scheduling in Wireless Ad Hoc Networks Xue Yang and NitinVaidya University of Illinois at Urbana-Champaign.

Slides:



Advertisements
Similar presentations
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
Advertisements

Medium Access Issues David Holmer
Contents IEEE MAC layer operation Basic CSMA/CA operation
Lecture 5: IEEE Wireless LANs (Cont.). Mobile Communication Technology according to IEEE (examples) Local wireless networks WLAN a.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
1 A Novel Topology-blind Fair Medium Access Control for Wireless LAN and Ad Hoc Networks Z. Y. Fang and B. Bensaou Computer Science Department Hong Kong.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Nov 2011 Neng Xue Tianxu Wang.
Dynamic Bandwidth Scheduling for QoS Enhancement over IEEE WLAN Sangwook Kang, Sungkwan Kim, Mingan Wang, Sunshin An Korea University European Wireless.
Module C- Part 1 WLAN Performance Aspects
1 DOA-ALOHA: Slotted ALOHA for Ad Hoc Networking Using Smart Antennas Harkirat Singh & Suresh Singh Portland State University, OR, USA.
MAC Layer (Mis)behaviors Christophe Augier - CSE Summer 2003.
Evaluate IEEE e EDCA Performance Tyler Ngo CMPE 257.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
Distributed Fair Scheduling in a Wireless LAN Gautam Kulkarni EE206A (Spring 2001) Nitin Vaidya, Paramvir Bahl and Seema Gupta (appeared in Mobicom 2000.
1 QoS Schemes for IEEE Wireless LAN – An Evaluation by Anders Lindgren, Andreas Almquist and Olov Schelen Presented by Tony Sung, 10 th Feburary.
Isolation of Wireless Ad hoc Medium Access Mechanisms under TCP Ken Tang,Mario Correa,Mario Gerla Computer Science Department,UCLA.
1 Expected Data Rate (EDR): An Accurate High-Throughput Path Metric For Multi- Hop Wireless Routing Jun Cheol Park Sneha Kumar Kasera.
On the Performance Behavior of IEEE Distributed Coordination Function M.K.Sidiropoulos, J.S.Vardakas and M.D.Logothetis Wire Communications Laboratory,
8/7/20151 Mobile Computing COE 446 Wireless Multiple Access Tarek Sheltami KFUPM CCSE COE hthttp://faculty.kfupm.edu.sa/coe/tarek/coe446.htm Principles.
Medium Access Control Protocols Using Directional Antennas in Ad Hoc Networks CIS 888 Prof. Anish Arora The Ohio State University.
Wireless LAN Simulation - IEEE MAC Protocol
CS640: Introduction to Computer Networks Aditya Akella Lecture 22 - Wireless Networking.
Delay Analysis of IEEE in Single-Hop Networks Marcel M. Carvalho, J.J.Garcia-Luna-Aceves.
Opersating Mode DCF: distributed coordination function
MAC layer Taekyoung Kwon. Media access in wireless - start with IEEE In wired link, –Carrier Sense Multiple Access with Collision Detection –send.
1 Real-Time Traffic over the IEEE Medium Access Control Layer Tian He J. Sobrinho and A. krishnakumar.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya University of Illinois.
Distributed Fair Scheduling in a Wireless LAN
Computer and Data Communications Semester Mohd Nazri Mahmud Session 4a-12 March 2012.
Quality of Service Support in Wireless Networks
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs K.Murugan, B.Dushyanth, E.Gunasekaran S.Arivuthokai, RS.Bhuvaneswaran, S.Shanmugavel.
An Energy Efficient MAC Protocol for Wireless LANs Eun-Sun Jung Nitin H. Vaidya IEEE INFCOM 2002 Speaker :王智敏 研二.
Multiple Access.
Data Communications, Kwangwoon University12-1 Chapter 12. Multiple Access 1.Random Access 2.Controlled Access 3.Channelization.
Chapter 6 Multiple Radio Access
Fundamentals of Computer Networks ECE 478/578
1 Real-Time Traffic over the IEEE Medium Access Control Layer Tian He.
Performance Analysis of IEEE Distributed Coordination Function (DCF) Author : Giuseppe Bianchi Presented by: 李政修 December 23, 2003.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
THROUGHPUT ANALYSIS OF IEEE DCF BASIC IN PRESENCE OF HIDDEN STATIONS Shahriar Rahman Stanford Electrical Engineering
WLAN. Networks: Wireless LANs2 Distribute Coordination Function (DCF) Distributed access protocol Contention-Based Uses CSMA/ CA – Uses both physical.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
Medium Access Control in Wireless networks
MAC Layer Protocols for Wireless Networks. What is MAC? MAC stands for Media Access Control. A MAC layer protocol is the protocol that controls access.
Distributed-Queue Access for Wireless Ad Hoc Networks Authors: V. Baiamonte, C. Casetti, C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di.
1 A Power Control MAC Protocol for Ad Hoc Networks EUN-SUN JUNG, NITIN H. VAIDYA, Wireless Networks 11, 55–66, Speaker: Han-Tien Chang.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
DSSS PHY packet format Synchronization SFD (Start Frame Delimiter)
A New MAC Protocol for Wi-Fi Mesh Networks Tzu-Jane Tsai, Hsueh-Wen Tseng, and Ai-Chun Pang IEEE AINA’06.
Discovering Sensor Networks: Applications in Structural Health Monitoring Summary Lecture Wireless Communications.
Network System Lab. Sungkyunkwan Univ. Differentiated Access Mechanism in Cognitive Radio Networks with Energy-Harvesting Nodes Network System Lab. Yunmin.
MAC Protocols for Sensor Networks
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya Dept. of Computer.
MAC Protocols for Sensor Networks
Lecture 7 CSMA and Spread Spectrum Dr. Ghalib A. Shah
Topics in Distributed Wireless Medium Access Control
SENSYS Presented by Cheolki Lee
Multiple Access Mahesh Jangid Assistant Professor JVW University.
Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So and Nitin Vaidya Modified and Presented.
On the Physical Carrier Sense in Wireless Ad-hoc Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Wireless LAN Simulation IEEE MAC Protocol
Outline 1. INTRODUCTION 2. PRELIMINARIES 3.THE PROPOSED PROTOCOL
of the IEEE Distributed Coordination Function
CSE 313 Data Communication
Enhanced Backoff Scheme in CSMA/CA for IEEE
Chapter 6 Multiple Radio Access.
Presentation transcript:

Priority Scheduling in Wireless Ad Hoc Networks Xue Yang and NitinVaidya University of Illinois at Urbana-Champaign

Problem Definition High priority & low priority packets High priority packets should be transmitted before low priority packets Packets may reside at different nodes in ad hoc network

Related Work Reservation Based Schemes –Reserve channel for high priority in advance Contention Based Schemes [Aad01] –High priority source stations occupy channel with blackburst while contending. –Simple variations of IEEE DCF Modify backoff stage of Modify inter-frame space stage of

Contention Using Blackburst Station transmitting longer burst wins Longer bursts for high priority packets ABC

Contention Using Blackburst Hidden terminals may not sense the blackburst ABC

Variations on IEEE Figure source: IEEE standard spec.

Modifying Backoff Stage of Backoff intervals for low priority packets biased to be larger than high priority packets Priority reversal problem

Priority Reversal Station 1 (H) Station 2 (H) Station 3 (L) Station 4 (L) High priority backoff in [0-15] Low priority backoff in [16-31]

Modifying Inter-Frame Space Low priority source stations use larger inter-frame space (IFS) than high priority stations PMAC [Aad01] –CWh: maximum contention window for high priority –LIFS (HIFS): IFS of low (high) priority stations. –LIFS = HIFS + CWh Low priority packets wait too long when no high priority packets

Summary of Issues

Priority Scheduling in Multi-hop Networks 0123 High priority flowLow priority flow Impact of hidden terminals on priority scheduling Station 0 is hidden from 2  need some mechanism to make station 2 aware of high priority packets at station 0

Priority Scheduling in Multi-hop Networks High priority flow Low priority flow 4 Collisions among high priority packets increases priority reversals

Trade-Off Some existing schemes trade priority scheduling with throughput for low priority flows –Example: LIFS = DIFS + CWh Can we improve on this?

A Plausible Solution

Busy Tone Priority Scheduling (BTPS) Allows two priority classes Two busy tone used to inform hidden terminals BT1 and BT2

Busy Tone Priority Scheduling (BTPS) High priority source stations send BT1 pulse every M backoff slots

Busy Tone Priority Scheduling Stations sensing BT1 –Low priority stations defer transmission for a short duration –Transmit BT2 pulse  propagate BT1 to hidden terminals Busy Medium

Busy Tone Priority Scheduling The IFS of low priority source stations DIFS + M slots.  access priority to high priority

Busy Tone Priority Scheduling On receiving BT2, Low priority stations defer transmission for a short duration

Busy Tone Priority Scheduling (BTPS) Busy tones inform hidden terminals of pending high priority packets Low priority stations defer transmission after BT1 and BT2 for a short duration (= DIFS + M slots)  allows high priority packets to be transmitted first

Simulations

Fixed Simulation Topology Number of high priority flows is increased from 1 to 6. Bit rate 2 Mbps.

Conflict Graph Flows 5 and 8 have the highest contention degree, while flows 1, 3, 10 and 12 have the lowest contention degree

Delivery Ratio of High Priority Packets Number of high priority flows Delivery Ratio of High Priority Packets PMAC BTPS IEEE

Aggregate Throughput (Kbps) Number of high priority flows Aggregate Throughput (Kbps) PMAC BTPS IEEE

Delivery Ratio of individual flows with six high priority flows (4,5,6,7,8,9) Note flows 5 and 8 which have the highest contention degree.

Random Topology Number of nodes between 10 to 80, randomly located in a 1000m x 1000m rectangle The flows are randomly picked between two nodes within transmission range. Number of flows between 7 to 73. –Number of high priority flows between 4 to 37.

Delivery ratio of high priority packets Random Topology Number of nodes Delivery Ratio of High Priority Packets BTPS PMAC

Aggregate Throughput (Kbps) Random Topology Number of nodes BTPS PMAC

Conclusion Advantages –BTPS provides channel access priority for high priority packets –In absence of high priority packets, BTPS does not degrade throughput for low priority unnecessarily Disadvantages –Protocol more complicated than desired –Uses busy tones