Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial.

Slides:



Advertisements
Similar presentations
Problems in Ad Hoc Channel Access
Advertisements

Nick Feamster CS 4251 Computer Networking II Spring 2008
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
Improving TCP over Wireless by Selectively Protecting Packet Transmissions Carla F. Chiasserini Michele Garetto Michela Meo Dipartimento di Elettronica.
Interference Alignment and Cancellation EE360 Presentation Omid Aryan Shyamnath Gollakota, Samuel David Perli and Dina Katabi MIT CSAIL.
Advantage Century Telecommunication Corp. AIL: Actively Intelligent Link-Layer Handoff Guo-Yuan Mikko Wang
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Review of Topology and Access Techniques / Switching Concepts BSAD 141 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
802.11a/b/g Networks Herbert Rubens Some slides taken from UIUC Wireless Networking Group.
1 Solutions to Performance Problems in VOIP over Wireless LAN Wei Wang, Soung C. Liew Presented By Syed Zaidi.
802.11n MAC layer simulation Submitted by: Niv Tokman Aya Mire Oren Gur-Arie.
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.
An End-to-End Multipath Smooth Handoff Scheme for Stream Media Yi Pan Meejeong Lee Jaime Bae Kim Tatsuya Suda IEEE Journal On Selected Areas In Communications.
20 – Collision Avoidance, : Wireless and Mobile Networks6-1.
1 Elements of a wireless network network infrastructure wireless hosts r laptop, PDA, IP phone r run applications r may be stationary (non- mobile) or.
1 QoS Schemes for IEEE Wireless LAN – An Evaluation by Anders Lindgren, Andreas Almquist and Olov Schelen Presented by Tony Sung, 10 th Feburary.
1 Short-term Fairness for TCP Flows in b WLANs M. Bottigliengo, C. Casetti, C.-F. Chiasserini, M. Meo INFOCOM 2004.
MAC Protocol By Ervin Kulenica & Chien Pham.
5-1 Data Link Layer r Wireless Networks m Wi-Fi (Wireless LAN) Example Problems m RTS/CTS.
1 Expected Data Rate (EDR): An Accurate High-Throughput Path Metric For Multi- Hop Wireless Routing Jun Cheol Park Sneha Kumar Kasera.
5-1 Data Link Layer r What is Data Link Layer? r Wireless Networks m Wi-Fi (Wireless LAN) r Comparison with Ethernet.
Low Latency Wireless Video Over Networks Using Path Diversity John Apostolopolous Wai-tian Tan Mitchell Trott Hewlett-Packard Laboratories Allen.
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.
6: Wireless and Mobile Networks6-1 Elements of a wireless network network infrastructure wireless hosts r laptop, PDA, IP phone r run applications r may.
August 21, Mobile Computing COE 446 IS-95 Tarek Sheltami KFUPM CCSE COE Principles of Wireless Networks.
Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Tamer Nadeem Dept. of Computer Science Lec #7: MAC Multi-Rate.
Adapted from: Computer Networking, Kurose/Ross 1DT066 Distributed Information Systems Chapter 6 Wireless, WiFi and mobility.
CIS 725 Wireless networks. Low bandwidth High error rates.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
CS640: Introduction to Computer Networks Aditya Akella Lecture 22 - Wireless Networking.
Divert: Fine-grained Path Selection for Wireless LAN Allen Miu, Godfrey Tan, Hari Balakrishnan, John Apostolopoulos * MIT Computer Science and Artificial.
Unwanted Link Layer Traffic in Large IEEE Wireless Network By Naga V K Akkineni.
CCH: Cognitive Channel Hopping in Vehicular Ad Hoc Networks Brian Sung Chul Choi, Hyungjune Im, Kevin C. Lee, and Mario Gerla UCLA Computer Science Department.
doc.: IEEE /211r0 Submission March 2002 M. BenvenisteSlide 1 SELF-CONFIGURABLE WIRELESS LAN SYSTEMS Mathilde Benveniste, Ph.D.
Understanding the Real-World Performance of Carrier Sense MIT Computer Science and Artificial Intelligence Laboratory Networks and Mobile Systems
Mobile Routing protocols MANET
Study on Power Saving for Cellular Digital Packet Data over a Random Error/Loss Channel Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer.
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
William Stallings Data and Computer Communications 7 th Edition Chapter 1 Data Communications and Networks Overview.
An Introduction to CDMA Air Interface: IS-95A
Copyright: S.Krishnamurthy, UCR Power Controlled Medium Access Control in Wireless Networks – The story continues.
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Transport over Wireless Networks Myungchul Kim
A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris MIT Computer Science and.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Wireless and Mobility The term wireless is normally used to refer to any type of electrical or electronic operation which is accomplished without the use.
Vertical Optimization Of Data Transmission For Mobile Wireless Terminals MICHAEL METHFESSEL, KAI F. DOMBROWSKI, PETER LANGENDORFER, HORST FRANKENFELDT,
A Multiplex-Multicast Scheme that Improves System Capacity of Voice- over-IP on Wireless LAN by 100% * B 葉仰廷 B 陳柏煒 B 林易增 B
Lecture # 13 Computer Communication & Networks. Today’s Menu ↗Last Lecture Review ↗Wireless LANs ↗Introduction ↗Flavors of Wireless LANs ↗CSMA/CA Wireless.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
Improving Loss Resilience with Multi- Radio Diversity in Wireless Networks by Allen Miu, Hari Balakrishnan and C.E. Koksal Appeared in ACM MOBICOM 2005,
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Wi-Fi. Basic structure: – Stations plus an access point – Stations talk to the access point, then to outside – Access point talks to stations – Stations.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
Medium Access Control in Wireless networks
2012 1/6 NSDI’08 Harnessing Exposed Terminals in Wireless Networks Mythili Vutukuru, Kyle Jamieson, and Hari Balakrishnan MIT Computer Science and Artificial.
1 Chapter 4 MAC Layer – Wireless LAN Jonathan C.L. Liu, Ph.D. Department of Computer, Information Science and Engineering (CISE), University of Florida.
Structure-Free Data Aggregation in Sensor Networks.
Copyright © 2003 OPNET Technologies, Inc. Confidential, not for distribution to third parties. Wireless LANs Session
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
MAC Protocols for Sensor Networks
Improving Loss Resilience with Multi-Radio Diversity in Wireless Networks Allen Miu, Hari Balakrishnan MIT Computer Science and Artificial Intelligence.
MAC Protocols for Sensor Networks
MACAW: A Media Access Protocol for Wireless LAN’s
CS 457 – Lecture 7 Wireless Networks
Spectrum Sharing in Cognitive Radio Networks
Maximizing MAC Throughputs by Dynamic RTS-CTS Threshold
Presentation transcript:

Divert: Fine-grained Path Selection for Wireless LANs Allen Miu, Godfrey Tan, Hari Balakrishnan, and John Apostolopoulos MIT Computer Science and Artificial Intelligence Laboratory MobiSys ’ 04, June 6 – 9, 2004, Boston, Massachusetts, USA.

Outline Introduction The case for fine-grained path selection Design and implementation of divert Experimental result conclusion

Introduction Wireless communication channels have notoriously time-varying characteristics ■ Noise ■ Attenuation ■ interference ■ multipath ■ user mobility results in packet losses, and higher and more variable packet latencies

Introduction In current WLANs, a client station sends and receives data only via the AP The client station will only switch association to another AP via a handoff decouple the process of associating a client with an AP fine-grained path selection for each frame transmission to client stations can reduce link-layer frame loss rates

Introduction two reasons why such fine-grained control is effective: - Frame losses occur in bursts, and many of these bursts are of long lengths on the order of tens of frames - attenuation,multipath and mobility — depend on the path traversed between an AP and a client fine-grained client-specific path selection among a set of neighboring APs. call Divert Little overhead for AP exchanged

Introduction fine-grained path selection heuristic that can reduce the average frame loss rates

The case for fine-grained path selection b transmitter at location A and B each broadcast packets at 2.88Mbps to receiver R1,R2,R3 The packet generator sends a stream UDP/IP packets at 240 packets per second to each wireless transmitter

The case for fine-grained path selection measure the loss characteristics of two concurrent packet streams transmitted (spatial correlation) how bursty losses how frame losses from different transmitters how receiver motion affects loss characteristics

The case for fine-grained path selection

how frame losses are correlated between different transmitters (spatial) Ai and Bi represent the lost of frame i sent from transmitters A and B respectively - auto-conditional loss probability P(Ai+k|Ai) and P(Bi+k|Bi), for k > 0, K=lag if losses occur in bursts P(Ai+k|Ai) > P(A), P(A) = FLR A

The case for fine-grained path selection - auto-conditional loss probability if losses are non-bursty P(Ai+k|Ai) = P(A)

The case for fine-grained path selection - cross-conditional loss probability P(Bi+k|Ai) and P(Ai+k|Bi) if losses correlated between the stream P(Bi+k|Ai) >P(B), P(B) = FLR B if losses are independent between streams P(Bi+k|Ai) = P(B).

The case for fine-grained path selection 1 ≦ k ≧ 200 (4.2 to 840ms) (P(Ai+k|Ai) and P(Bi+k|Bi)) are much larger than the respective average FLR A 0.17 B 0.15 cross-conditional loss probabilities (P(Ai+k|Bi) and P(Bi+k|Ai)) remain nearly the same as the respective average FLR frame losses have very little correlation between the different transmission sites

The case for fine-grained path selection Observe that the average FLR 0.17 of A is larger than that of B 0.15, yet P(Ai+k|Bi) < P(Bi+k|Bi) fine-grained path selection can be effective in avoiding imminent burst losses by switching to an alternate site whenever a loss occurs in the current site

The case for fine-grained path selection P(Bi+k|Ai) > P(Ai+k|Ai) but P(Ai+k|Bi) < P(Bi+k|Bi). This is because the FLR of B (1.02) is about twice that of A (0.47)

The case for fine-grained path selection 1 ≦ k ≧ (4.2 to 84s) frame losses become more and more independent as the lag increases

The case for fine-grained path selection frame loss occurs,the short-term probability of losing a subsequent frame transmitted from the same site is greater than the short- term probability of losing a subsequent frame if it were sent from another site

The case for fine-grained path selection Interference - Before sending a frame, the sender senses the channel for activity. If the sender senses energy in the channel, it suppresses its transmission to avoid colliding with another potential ongoing transmission

The case for fine-grained path selection one site ’ s transmission is suppressed by CS, an alternate site may be used to transmit data frames. A fine-grained path selection system can discover such transmission

Design and implementation of divert

Divert uses a path-selection heuristic to determine which AP and path Divert requires explicit coordination because it makes path choices To enable this coordination - Divert extends the WLAN architecture by adding two components, the Divert Controller (DC) and the Divert Monitor (DM)

Design and implementation of divert The DC runs a fine-grained path- selection heuristic, which makes a forwarding decision for each packet DC runs at primary AP within a cell DM runs at each secondary AP

Design and implementation of divert A DM monitors the wireless link at its AP and sends two types of messages to the DC - registration event messages. The DM sends a periodic registration event to the DC. The registration event allows the DC to maintain a set of usable transmission paths for fine-grained path selection. the registration can timeout when a client moves out of an AP ’ s transmission range

Design and implementation of divert - path-condition update messages. Each DM monitors the channel conditions. the DM maintains this information per client. The DM periodically sends updates of this information to the DC. 1.The DM observes a failed transmission if the sender does not receive asynchronous ACK after a frame transmission. 2.either the data frame or the returning ACK is lost

Design and implementation of divert Divert path selection Heuristic - The goal of Divert ’ s fine-grained path selection heuristic is to reduce losses in the wireless medium - selects only one AP with a good transmission path to a client - The DM then monitors the loss rate within this time window H - number of lost data frames is greater than a threshold T, the DM notifies the DC to forward subsequent frames via a different AP

Design and implementation of divert - a larger value for H allows the heuristic to obtain a better estimate of the channel ’ s average loss rate, suitable static channel conditions - a large T is desirable to prevent switching to a potentially poorer path - a small T, to avoid imminent burst losses in the current path - H = 1 and T = 1 when the receiver is mobile - H = 10 and T = 5, less dynamic

Design and implementation of divert Reducing path switching cost Secondary access points (SAP) provide alternate communication paths within the same cell

Experimental result 1500 byte of Unicast packets to the receiver Use AP A or AP B to transmit each frame H=1 T=1 reduces the average FLR by about 38% from scheme A and 21% from scheme B

Experimental result H=1 T=1 with a higher average FLR H=3 T=2 with a lower average FLR Hybrid H=1 T=1 to A H=3 T=2 to B R1 closer to A the average FLR of scheme A (2.1%) is much lower than B (15%)

Experimental result

in Divert, 98% of the packets have a channel delay less than 15 ms(0.015s) fewer packets (90% and 95%) are transmitted successfully

Experimental result

Conclusion fine-grained site selection can be used to reduce both loss and delay by switching data frame transmissions intelligently between the available transmission sites