Steganography Ben Lee III Long Truong ECE 478 - Spring 2002.
Fundamentals of Computer Networks ECE 478/578
description
Transcript of Fundamentals of Computer Networks ECE 478/578
![Page 1: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/1.jpg)
Fundamentals of Computer NetworksECE 478/578
Lecture #10: Multiple Access in Wireless NetworksInstructor: Loukas Lazos
Dept of Electrical and Computer EngineeringUniversity of Arizona
![Page 2: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/2.jpg)
Wireless Access ProtocolsEach node has a fixed rangeNodes use omni-directional antennas
Can we use CSMA?What about reservations?Problem: Feedback Mechanism
2
![Page 3: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/3.jpg)
The Hidden Terminal Problem
3
A B C D
![Page 4: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/4.jpg)
The Exposed Terminal Problem
4
A B C D
![Page 5: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/5.jpg)
Multiple Access with Collision Avoidance
5
A B C DRTS
CTS
Addressing the Hidden Terminal Problem
![Page 6: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/6.jpg)
Multiple Access with Collision Avoidance
6
A B C DCTS
RTS
RTS
CTS
Addressing the Exposed Terminal Problem
![Page 7: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/7.jpg)
Distributed Coordination Function
7t
DIFS
data
defer access
otherstations
receiver
senderdata
DIFS
new contention
RTS
CTSSIFS SIFS
NAV (RTS)NAV (CTS)
Senses channel for DIFS (Distributed Interframe Space)
If busy backoff random time, else
Sender sends RTS with NAV (Network Allocation Vector)
Receiver acknowledges via CTS after SIFS (Short interframe space)CTS reserves channel for sender, notifying possibly hidden stations;
any station hearing CTS should be silent for NAV
Sender can now send data at once
![Page 8: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/8.jpg)
Can Collisions be useful?Zig-zag decoding
8
![Page 9: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/9.jpg)
Implementation IssuesFinding the beginning of each packet in a collision
Use the preamble to find the start of each packet
9
![Page 10: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/10.jpg)
Implementation IssuesObtaining matching collisions
Use the correlation to find the start of Pb, then use the header bits to ensure that Pb’ = Pb
Resolving more than two collisions
10
![Page 11: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/11.jpg)
What if Multiple Channels are Available?
11
A B C DCTS (1)
RTS (1, 2, 5, 7)
ACK (1)
D CTS (2)
RTS (2, 5, 7)
ACK (2)
![Page 12: Fundamentals of Computer Networks ECE 478/578](https://reader036.fdocuments.us/reader036/viewer/2022062805/56814e53550346895dbbe374/html5/thumbnails/12.jpg)
Possible SolutionForce everyone to switch to a common control channel for negotiation of channel assignmentDelay in the channel assignment, wasted bandwidthThroughput of control channel becomes a bottleneck
12