Professional Documents
Culture Documents
MAC Feb 3
MAC Feb 3
Introduction
1-1
Reference
These are a modified version of slides by
http://ctas.poly.asu.edu/millard/CET459/lectno/K% 20-%20R%20stuff/index.html
Introduction
1-2
Link Layer
Network layer transports
link
packets from one end system to other via several intermediate routers For transferring packet over an individual link, network layer uses services of link layer Terminology: refer to end system or router as node Link layer transfers packet from one node to adjacent node
5: DataLink Layer
5-3
Types of Links
Point-to-point Link
single sender at one end of the link single receiver at other end of the link when sender has a packet for receiver, simply sends it over the link e.g., dial-up, DSL Broadcast Link N nodes connected to a shared medium (e.g., cable, wireless) When one node transmits, packet reaches every other node Broadcast medium E.g., Ethernet, Wireless LAN
channel, i.e., determines when given node can transmit Key Challenge: Communication about channel sharing must use channel itself!
Example
MAC Protocol should attempt to maximize successful transmissions minimize collisions minimize idle time intervals
5: DataLink Layer 5-6
Analogy
Telephone conference call N people, at different locations, all connected
via phone Each one can talk to and hear all others Confusion if two or more talk simultaneously
similar to collision
a time If the N people were all face-to-face in the same room, could raise hands to request permission to speak
Examples
Ethernet: widely used in
company and university LANs In simplest version, each node connected to a shared cable
Broadcast medium
Base station
Broadcast medium
Ref: Kurose and Ross, Chapter 5
Mobile nodes
Introduction
1-8
5: DataLink Layer
5-9
5: DataLink Layer
5-10
frame divided into N equal-sized slots Each node gets one slot in each frame Unused slots go idle Example: 6 nodes, 1,3,4 have packets, slots 2,5,6 idle
5: DataLink Layer
5-11
frequency bands
5: DataLink Layer
5-12
TDMA
5: DataLink Layer
5-13
at full channel data rate R Node with a packet to send refrains from transmitting with some probability to avoid collisions Examples:
Slotted
ALOHA
Slotted ALOHA
Assumptions All packets same size Time is divided into equal size slots
packets only at beginnings of slots If 2 or more nodes transmit in slot, all nodes detect collision before slot ends
Operation At a Node When node obtains new packet from above, it transmits in next slot If no collision, node can send new packet (if available) in next slot If collision, node retransmits packet in each subsequent slot with prob. p until success
Example
5: DataLink Layer
5-16
Slotted ALOHA
Notice that a node sends
a
new packet w.p. 1 in next slot a packet involved in one or more collisions w.p. p
Why not send every packet w.p. p?
5: DataLink Layer
5-17