Both RTS and CTS contains: The address of the sender The address of the receiver The sizeof the intended data short message size contention concentrated.

Slides:



Advertisements
Similar presentations
Problems in Ad Hoc Channel Access
Advertisements

Nick Feamster CS 4251 Computer Networking II Spring 2008
IEEE CSMA/CA DCF CSE 6590 Fall /7/20141.
Medium Access Issues David Holmer
1 Dual Busy Tone Multiple Access (DBTMA) : A Multiple Access Control Scheme for Ad Hoc Networks Z. Haas and J. Deng IEEE Trans. on Communications June,
1 Dual Busy Tone Multiple Access (DBTMA) : A Multiple Access Control Scheme for Ad Hoc Networks Z. Haas and J. Deng IEEE Trans. on Communications June,
1 Wireless Medium Access Control Protocols CS 851 Seminar University of Virginia
Wireless Medium Access Control Protocols
Hai-Heng Ng, Wee-Seng Soh, Mehul Motani National University of Singapore IEEE GLOBECOM 2008.
MAC Layer (Mis)behaviors Christophe Augier - CSE Summer 2003.
Distributed systems Module 1 -Basic networking Teaching unit 1 – LAN standards Ernesto Damiani University of Bozen-Bolzano Lesson 2 – LAN Medium Access.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
Does the IEEE MAC Protocol Work Well in Multihop Wireless Ad Hoc Networks? Shugong Xu Tark Saadawi June, 2001 IEEE Communications Magazine (Adapted.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Spring 2002CS 4611 Shared Access Networks Outline Bus (Ethernet) Token ring (FDDI) Wireless (802.11)
The Impact of Multihop Wireless Channel on TCP Throughput and Loss Presented by Scott McLaren Zhenghua Fu, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia.
20 – Collision Avoidance, : Wireless and Mobile Networks6-1.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao
1 Introduction to Wireless Networks Michalis Faloutsos.
Spanning Tree and Wireless EE122 Discussion 10/28/2011.
5-1 Data Link Layer r What is Data Link Layer? r Wireless Networks m Wi-Fi (Wireless LAN) r Comparison with Ethernet.
Semester EEE449 Computer Networks The Data Link Layer Part 2: Media Access Control En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex,
MAC Layer Protocols for Sensor Networks Leonardo Leiria Fernandes.
1 Wireless Medium Access Control Protocols CS 851 Seminar University of Virginia
CSE 461 University of Washington1 Topic How do nodes share a single link? Who sends when, e.g., in WiFI? – Explore with a simple model Assume no-one is.
Wireless LAN Simulation - IEEE MAC Protocol
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.
Opersating Mode DCF: distributed coordination function
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
Ethernet. Problem In an Ethernet, suppose there are three stations very close to each other, A, B and C. Suppose at time 0, all of them have a frame to.
An Energy Efficient MAC Protocol for Wireless Sensor Networks “S-MAC” Wei Ye, John Heidemann, Deborah Estrin Presentation: Deniz Çokuslu May 2008.
Recitation 8 Wireless Networks. Virtual carrier sensing First exchange control frames before transmitting data – Sender issues “Request to Send” (RTS),
Why Visual Sensor Network & SMAC Implementation Group Presentation Raghul Gunasekaran.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
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.
Network Technologies essentials Week 3: Retransmission, sharing links, switching Compilation made by Tim Moors, UNSW Australia Original slides by David.
Chapter 6 Multiple Radio Access
Fundamentals of Computer Networks ECE 478/578
Introduction to Wireless Networks Dina Katabi & Sam Madden MIT – – Spring 2014.
Recitation 8 Wireless Networks.
Wireless. 2 A talks to B C senses the channel – C does not hear A’s transmission C talks to B Signals from A and B collide Carrier Sense will be ineffective.
Background of Ad hoc Wireless Networks Student Presentations Wireless Communication Technology and Research Ad hoc Routing and Mobile IP and Mobility Wireless.
Wi-Fi. Basic structure: – Stations plus an access point – Stations talk to the access point, then to outside – Access point talks to stations – Stations.
CSE 461: Multiple Access Networks. This Lecture  Key Focus: How do multiple parties share a wire?  This is the Medium Access Control (MAC) portion of.
SMAC: An Energy-efficient MAC Protocol for Wireless Networks
KAIS T Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Network Wei Ye, John Heidemann, Deborah Estrin 2003 IEEE/ACM TRANSACTIONS.
An Energy-Efficient MAC Protocol for Wireless Sensor Networks Speaker: hsiwei Wei Ye, John Heidemann and Deborah Estrin. IEEE INFOCOM 2002 Page
WLAN.
MAC Sublayer MAC layer tasks: – Control medium access – Roaming, authentication, power conservation Traffic services – DCF (Distributed Coordination.
Advanced Wireless Antonello Cruz FMAC/CSR: a Fair MAC Protocol for Wireless Ad-hoc Networks Zhifei Li Anil K. Gupta Sukumar Nandi.
Medium Access Control in Wireless networks
CS541 Advanced Networking 1 Contention-based MAC Protocol for Wireless Sensor Networks Neil Tang 4/20/2009.
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.
0.1 IT 601: Mobile Computing MAC Protocols Prof. Anirudha Sahoo IIT Bombay.
Medium Access in Sensor Networks. Presented by: Vikram Shankar.
S-MAC Taekyoung Kwon. MAC in sensor network Energy-efficient Scalable –Size, density, topology change Fairness Latency Throughput/utilization.
Wireless Media Access Protocols Hari Balakrishnan LCS and EECS Massachusetts Institute of Technology
Distributed-Queue Access for Wireless Ad Hoc Networks Authors: V. Baiamonte, C. Casetti, C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
A New MAC Protocol for Wi-Fi Mesh Networks Tzu-Jane Tsai, Hsueh-Wen Tseng, and Ai-Chun Pang IEEE AINA’06.
To Design an Efficient MAC Protocol for Underwater Acoustic Sensor Network under Multi-hop Environment.
Wireless Sensor Networks 4. Medium Access
MACAW: A Media Access Protocol for Wireless LAN’s
MACAW: A Media Access Protocol for Wireless LANs
Multiple Access, Collision Avoidance for Wireless LAN’s
CS294-1 Joe Polastre September 9, 2003
Wireless LAN Simulation IEEE MAC Protocol
Chapter 6 Multiple Radio Access.
Presentation transcript:

Both RTS and CTS contains: The address of the sender The address of the receiver The sizeof the intended data short message size contention concentrated in RTS-CTS Basic Behavior of a overhearing station: Receive RTS: Defer until CTS should have been sent Receive CTS: Defer until Data should have been sent Hand-Shake Protocol

MACA in Operation The Hidden Terminal Problem is avoided ABC CTS RTS C waits to send since it hears B ’ s CTS ABC RTS CTS C send since it does not hears A ’ s CTS The Expose Terminal Problem is avoided

MACA Rules Machine states: IDLE, CONTEND, WFCTS, WFDATA, QUITE. Control rules: carry capture and data transmission –IDLE, have data  CONTEND, random timer,  WFCTS if capture carry –IDLE, income RTS  send CTS, WFData, set timer –WFCTS, income CTS  tran Data, IDLE, clear timer –WFData, income Data  IDLE, clear timer –CONTEND, income RTS  tran CTS, WFData, clear timer Backoff rules: reduce collision in re-attempt Deferral rules:govern collision avoidance –When hear RTS, goes to QUITE, and sets a timer value sufficient to hear a CTS from the intended node. –When hear CTS, goes to QUITE, and sets a timer value sufficient to hear Data from the intended node. Timeout rules: –CONTEND, timer expires  send RTS, WFCTS –Other states, timer expires  IDLE

Binary Exponential Backoff A station know a collision if it does not receive the expected CTS It will try to re-transmit the RTS. Before re-transmit RTS, it need to wait an random time from [0 BO] to avoid second collision. How to decide the upper bound BO according to the congestion condition. Backoff rules in MACA: BO = B_min initially. When a CTS is received, BO=B_min If a CTS is not received after RTS, BO= min(2*BO, B_max)

MACAW: Paper # 12 Many Improvement to MACA Blueprint of the Goals: Improve network utilization Provide fair access to network Concentrates on two aspects of the MAC protocol: The backoff algorithm The basic RTS-CTS-DATA message exchange

Unfairness in BEB Problem: The “least backed off” node will likely unfairly always win Solution: Share BO value with other nodes: Sender includes current BO value in each packet When you hear a packet, your BO = BO from packet

The Backoff Algorithm BEBcopy BEB P1-B P2-B B P2 P1

Control Oscillation for BO BEB copyMILD copy P1-B P2-B P3-B P4-B P5-B P6-B Multiplicative Increase and Linear Decrease(MILD): Collision: BO = min(1.5× BO, BOmax) Success: BO = max(BO-1, BOmin)

Backoffs for Multiple Streams Problem: Congestion at one stream affects all streams (of the same node): Single outgoing packet queue and single BO at each node But congestion at one receiver may not be present at others Need a per-stream-fairness in sharing the bandwidth Solution: Treat each stream separately: Use a separate packet queue for each destination Run the backoff algorithm separately for each queue A node sends next from the queue whose BO expires first If a tie, just pick among the winning queues randomly

Adding an ACK Problem: Collisions/dropped packets are still possible: Due to random noise. Can recover at transport layer, but introduces a large delay Solution: Receiver sends an ACK packet after receipt of DATA: Link-layer recovery, much faster If ACK not received, sender schedules DATA for retransmit On retransmit, sender starts again with RTS If receiver already had DATA (first ACK was lost), receiver returns ACK in response to RTS Causes slight throughput decrease when few errors But significant throughput in more common case of more errors

Use of New Request-for-RTS Packet Problem: What happens to the sender if the destination can’t CTS a received RTS This occurs when destination is deferring (in QUITE state)? The sender keeps retransmitting RTS and increasing its own BO timeout. Not fair to this sender Solution: Have B do contention on behalf of A: If B receives RTS for which it must defer CTS reply Then B later sends RRTS to A when it can send A responds by starting normal RTS-CTS Others hearing RRTS defer long enough for RTS-CTS

Multicast Transmissions Problem: Basic RTS-CTS only works for unicast transmissions: For multicast, RTS would get CTS from each intended receiver Likely to cause (many) collisions back at sender Sort-of solution: Don’t use CTS for multicast data: Receivers recognize multicast destination in RTS Don’t return CTS Sender follows RTS immediately by DATA After RTS, all receivers defer for long enough for DATA Helps, but doesn’t fully solve problem: Like normal CSMA, only those in range of sender will defer Others in range of receiver will not defer Complete solution to problem not yet known