Recitation 8 Wireless Networks.

Slides:



Advertisements
Similar presentations
Problems in Ad Hoc Channel Access
Advertisements

Nick Feamster CS 4251 Computer Networking II Spring 2008
Hidden Terminal Problem and Exposed Terminal Problem in Wireless MAC Protocols.
Medium Access Issues David Holmer
Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.
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.
Wireless Networks Reading: Section 2.8 COS 461: Computer Networks Spring
Comp 361, Spring 20056:Basic Wireless 1 Chapter 6: Basic Wireless (last updated 02/05/05) r A quick intro to CDMA r Basic
MAC Layer (Mis)behaviors Christophe Augier - CSE Summer 2003.
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
Wireless Networks Reading: Section 2.8 COS 461: Computer Networks Spring 2011 Mike Freedman
Copyright: UC Riverside Alleviating the effects of mobility on TCP Performance Signal Strength based Link Management Fabius Klemm *, Srikanth Krishnamurthy.
Spanning Tree and Wireless EE122 Discussion 10/28/2011.
5-1 Data Link Layer r Wireless Networks m Wi-Fi (Wireless LAN) Example Problems m RTS/CTS.
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,
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.
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
CIS 725 Wireless networks. Low bandwidth High error rates.
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
MAC Protocols and Security in Ad hoc and Sensor Networks
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.
CHAPTER 4: THE MEDIUM ACCESS SUBLAYER 4.1: The Channel Allocation Problem 4.2: Multiple Access Protocols.
Computer and Data Communications Semester Mohd Nazri Mahmud Session 4a-12 March 2012.
LAN technologies and network topology LANs and shared media Locality of reference Star, bus and ring topologies Medium access control protocols.
Recitation 8 Wireless Networks. Virtual carrier sensing First exchange control frames before transmitting data – Sender issues “Request to Send” (RTS),
Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks Mario Gerla Computer Science Department University of California, Los Angeles Los Angeles, CA.
The Transmission Control Protocol (TCP) Application Services (Telnet, FTP, , WWW) Reliable Stream Transport (TCP) Connectionless Packet Delivery.
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.
Chapter 6 Multiple Radio Access
Fundamentals of Computer Networks ECE 478/578
Lecture 4 Overview. Ethernet Data Link Layer protocol Ethernet (IEEE 802.3) is widely used Supported by a variety of physical layer implementations Multi-access.
Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.
Medium Access Control protocols for ad hoc wireless networks: A survey 指導教授 : 許子衡 報告者 : 黃群凱.
TCP: Transmission Control Protocol Part II : Protocol Mechanisms Computer Network System Sirak Kaewjamnong Semester 1st, 2004.
Introduction to Wireless Networks Dina Katabi & Sam Madden MIT – – Spring 2014.
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.
Tackling Exposed Node Problem in IEEE Mac Deepanshu Shukla ( ) Guide: Dr. Sridhar Iyer.
WIRELESS COMMUNICATION Husnain Sherazi Lecture 1.
Universität Karlsruhe Institut für Telematik ECE 591
SMAC: An Energy-efficient MAC Protocol for Wireless Networks
Copyright © Syed Ali Khayam 2007 CC-885: Wireless Networks Syed Ali Khayam NUST Institute of Information Technology (NIIT) National University of Sciences.
ECE 4110 – Internetwork Programming
WLAN.
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.
Data Link Layer Flow and Error Control. Flow Control Flow Control Flow Control Specifies the amount of data can be transmitted by sender before receiving.
Wireless Media Access Protocols Hari Balakrishnan LCS and EECS Massachusetts Institute of Technology
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
1 Chapter 4 MAC Layer – Wireless LAN Jonathan C.L. Liu, Ph.D. Department of Computer, Information Science and Engineering (CISE), University of Florida.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray,Jeffrey B. Carruthers and David Starobinski WCNC 2003.
Wireless LAN Requirements (1) Same as any LAN – High capacity, short distances, full connectivity, broadcast capability Throughput: – efficient use wireless.
MAC Protocols for Sensor Networks
Distributed Medium Access Control in Wireless Networks
MACAW: A Media Access Protocol for Wireless LAN’s
MACAW: A Media Access Protocol for Wireless LANs
TCP/IP Transmission Control Protocol / Internet Protocol
TCP and MAC interplay in Wireless Ad Hoc Networks
Goal Control the amount of traffic in the network
Wireless LAN Simulation IEEE MAC Protocol
Congestion Control Reasons:
TCP Congestion Control
The Transport Layer Reliability
Impact of transmission errors on TCP performance
Presentation transcript:

Recitation 8 Wireless Networks

Virtual carrier sensing First exchange control frames before transmitting data Sender issues “Request to Send” (RTS), incl. length of data Receiver responds with “Clear to Send” (CTS) If sender sees CTS, transmits data (of specified length) If other node sees CTS, will idle for specified period If other node sees RTS but not CTS, free to send Like we said in class, CTS is like token, except that every host has its own.

Hidden Terminal Problem C A and C can’t see each other, both send to B RTS/CTS can help Both A and C would send RTS that B would see first B only responds with one CTS (say, echoing A’s RTS) C detects that CTS doesn’t match and won’t send Can’t see each other because neither C is in A’s range, nor A is in C’s range, but B is in both of their ranges

Exposed Terminal Problem C D B sending to A, C wants to send to D As C receives packets, carrier sense would prevent it from sending to D, even though wouldn’t interfere RTS/CTS can help C hears RTS from B, but not CTS from A C knows its transmission will not interfere at B’s receiver C is safe to transmit to D B is sending to A, and C is in B’s range

1. When using RTS/CTS, what prevents a hidden terminal from clobbering the packets that another node is sending?

1. When using RTS/CTS, what prevents a hidden terminal from clobbering the packets that another node is sending? Hidden terminal would see the CTS of the sender’s desired destination, but not the RTS of the sender, and choose not to send to the same destination as had sent the CTS.

2. When using RTS/CTS, how does an exposed terminal decide it is safe to send?

2. When using RTS/CTS, how does an exposed terminal decide it is safe to send? Exposed terminal would see the RTS of another node, but not the corresponding CTS (from the other node’s destination), and know it’s safe to send.

3. Why does TCP perform badly on wireless links 3. Why does TCP perform badly on wireless links? What can be done to improve performance without requiring all wired hosts to upgrade to a new protocol?

3. Why does TCP perform badly on wireless links 3. Why does TCP perform badly on wireless links? What can be done to improve performance without requiring all wired hosts to upgrade to a new protocol? TCP treats packet loss as an implicit sign of congestion and decreases the sending rate. In contrast to wired networks, packet loss in wireless networks is not necessarily a sign of congestion; rather, interference and/or fading may be the cause. The performance could be improved by employing WTCP, a TCP proxy at the wireless/wired boundary. WTCP: Wireless TCP which detects wireless-related problems (such as lost or corrupted segments due to multipath fading or high bit error roates) with the use of timeouts and duplicate acknowledgments. WTCP then attempts to mitigate the problem by retransmitting a lost segment only once, until it receives an acknowledgment back from the mobile host that it was received. Any other lost segments will have to wait in the WTCP's buffer until the first one is confirmed to have been received.

4. Why are many packet losses in wireless networks detected by a timeout rather than a triple-duplicate acknowledgment? What are the performance implications?

4. Why are many packet losses in wireless networks detected by a timeout rather than a triple-duplicate acknowledgment? What are the performance implications? Periodically sustained packet loss due to interference (e.g. a microwave): This decreases the likelihood that any packets are successfully delivered in the same TCP sending window; Instead, all of the packets are lost. Since some successful deliveries are necessary to trigger the receiver to send duplicate ACKs, periodically sustained loss tends to require the sender to rely on retransmission timeout to detect loss. Relatively low capacity leads to a relatively small congestion window: This also decreases the likelihood that enough packets are successfully delivered to enable detection of an earlier packet loss by duplicate acknowledgments. Since there are often smaller transfers due to limited bandwidth or small screen sizes, there is less opportunity for multiple packets in flight during the same RTT.

In this wireless topology, A, B, C, and D all have equi-sized transmission ranges, while E has a smaller range. Assume that two nodes’ transmissions will interfere if and only if they transmit at the same time and their transmission areas overlap. Further, assume that losses only occur due to collisions. When D communicates with C, what nodes are exposed terminals and what nodes are hidden terminals?

In this wireless topology, A, B, C, and D all have equi-sized transmission ranges, while E has a smaller range. Assume that two nodes’ transmissions will interfere if and only if they transmit at the same time and their transmission areas overlap. Further, assume that losses only occur due to collisions. When D communicates with C, what nodes are exposed terminals and what nodes are hidden terminals? only B is a hidden terminal and there are no exposed terminals

If A sends data to B and C sends data to D (as fast as they can), and no collision detection mechanism is used, what is the throughput of their transfer as a proportion of their send rate? A -> B ? C -> D ? C is hidden to A

If A sends data to B and C sends data to D (as fast as they can), and no collision detection mechanism is used, what is the throughput of their transfer as a proportion of their send rate? A -> B ? 0% C -> D ? 100%

If A sends data to B and C sends data to D (as fast as they can), and CSMA is used, what is the throughput of their transfer as a proportion of their send rate? A -> B ? C -> D ? Carrier sense means that a transmitter uses physical feedback from a receiver to determine whether another transmission is in progress before initiating a transmission. That is, it tries to detect the presence of a carrier wave from another station before attempting to transmit.

If A sends data to B and C sends data to D (as fast as they can), and CSMA is used, what is the throughput of their transfer as a proportion of their send rate? A -> B ? 0% C -> D ? 100%

Now assume a RTS / CTS protocol is used Now assume a RTS / CTS protocol is used. Assume that the overhead from RTS and CTS packets is small relative to the data transfer. What are the approximate throughputs of the transfer from each node? A -> B ? C -> D ?

Now assume a RTS / CTS protocol is used Now assume a RTS / CTS protocol is used. Assume that the overhead from RTS and CTS packets is small relative to the data transfer. What are the approximate throughputs of the transfer from each node? A -> B ? 50% C -> D ? 50%

A B C D E Hidden Terminals for E -> B? E A D C B

A B C D E E A D C B Hidden Terminals for E -> B? D C would receive CTS and not send. However, C is not a hidden terminal, because its range will not reach B. E A D C B

A B C D E E A D C B Hidden Terminals for E -> B? D Exposed Terminals for B -> D? E A D C B

A B C D E E A D C B Hidden Terminals for E -> B? D Exposed Terminals for B -> D? A, E, & C E A D C B

Participation Check Not graded, just like Assignment 0. Please write name, NetID, and answers on paper and return to us. This is open notes, references, slides, and even brainstorming with each other. Please answer each question briefly. (Two to five sentences for each question should suffice.) 1. Why does SplitStream construct a multicast forest? What property of the multicast forest construction (without the spare capacity group) strives to ensure fairness? 2. What is serialization in Java? Why is serialization necessary for Java RMI (RPC)?