Mobile Wireless Networking
Transcript of Mobile Wireless Networking
1
© James P.G. SterbenzITTCMobile Wireless Networking
The University of Kansas EECS 882Medium Access Control
© 2004–2011 James P.G. Sterbenz29 August 2011
James P.G. Sterbenz
Department of Electrical Engineering & Computer ScienceInformation Technology & Telecommunications Research Center
The University of Kansas
http://www.ittc.ku.edu/~jpgs/courses/mwnets
rev. 11.0
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-2
© James P.G. SterbenzITTC
Mobile Wireless NetworkingMedium Access Control
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithmsML.3 Contention-based MAC algorithmsML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
2
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-3
© James P.G. SterbenzITTC
Medium Access and Link LayersLayer/Plane Cube Model
link layer indata planewith error control
MAC layer:arbitration to shared medium in control plane
physicalMAC
link
networktransport
sessionapplication
L1
L7L5L4L3
L2L1.5
data plane control plane
plane
management
socialL8
virtual linkL2.5
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-4
© James P.G. SterbenzITTC
Medium Access and Link LayersMAC Definition
• Medium access control arbitrates a channel in shared medium (free space, guided wire, or fiber)among nodes (or terminals or stations )
networkCPU
M app
end system
CPU
M app
end system
3
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-5
© James P.G. SterbenzITTC
Medium Access and Link LayersLink Definition
• Link is the interconnection between nodes– intermediate systems (IS – switches or routers)– end systems (ES – or terminals, stations, hosts)– uses MAC to access channelnote: in ad hoc wireless networks nodes are both IS and ES
networkCPU
M app
end system
CPU
M app
end system
intermediatesystem
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-6
© James P.G. SterbenzITTC
Medium Access and Link LayersMAC and Link Protocol
• Link protocol– is responsible for per hop transfer of data frame– using a MAC algorithm to arbitrate channel access
network
application
session
transport
network
link/MAC
end system
network
link/MAC
intermediatesystem
network
link/MAC
intermediatesystemnetwork
link/MAC
intermediatesystem
application
session
transport
network
link/MAC
end system
4
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-7
© James P.G. SterbenzITTC
Wireless NetworksNetwork Elements: Base Station
• Base station (BS) orAccess point (AP)– fixed wireless node
• one or more antennæ• may be small (e.g. home hub)• may have huge tower
– range is frequently called a cell– typically connected to Internet via wired link
• in which case it is an intermediate system
Internet
cell
BS
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-8
© James P.G. SterbenzITTC
Wireless NetworksNetwork Elements: Base Station
• Base station (BS) orAccess point (AP)– fixed wireless node
• one or more antennæ• may be small (e.g. home hub)• may have huge tower
– range is frequently called a cell– typically connected to Internet via wired link
• in which case it is an intermediate system• may wireless mulithop through other BSs
Internet
cell
BSBS
5
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-9
© James P.G. SterbenzITTC
Wireless NetworksNetwork Elements: Wireless Node
• Base station (BS)
• Wireless node (WN) orMobile terminal (MT) orAccess terminal (AT)– untethered with no wired connectivity– fixed or stationary node doesn’t move
• wireless does not imply mobility• typical example: laptop computer
– mobile node (MN) if• typical example: mobile phone or PDA
Lecture LM
Internet
cell
BS
WN
WN
BS
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-10
© James P.G. SterbenzITTC
Wireless NetworksNetwork Elements: Wireless Link
• Base station (BS)
• Wireless node (WN)
• Wireless link– MAC needed to arbitrate
Internet
cell
BS BS
WN
WN
6
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-11
© James P.G. SterbenzITTC
Wireless NetworksNetwork Elements: Wireless Link
• Base station (BS)
• Wireless node (WN)
• Wireless link– MAC needed to arbitrate– interconnects BSs Internet
cell
BS BS
WN
WN
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-12
© James P.G. SterbenzITTC
Wireless NetworksNetwork Elements: Wireless Link
• Base station (BS)
• Wireless node (WN)
• Wireless link– MAC needed to arbitrate– interconnects BSs– interconnects WNs to BSs
Internet
cell
BS BS
WN
WN
7
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-13
© James P.G. SterbenzITTC
Wireless NetworksNetwork Elements: Wireless Link
• Base station (BS)
• Wireless node (WN)
• Wireless link– MAC needed to arbitrate– interconnects BSs– interconnects WNs to BSs– interconnects WNs peer-to-peer
– multihop WNs are both ES and IS
Internet
cell
BS BS
WN
WN
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-14
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.1 MAC and Link Layer Functions & Services
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithmsML.3 Contention-based MAC algorithmsML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
8
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-15
© James P.G. SterbenzITTC
MAC LayerService and Interfaces
• MAC is in-between physical layer 1 and link layer 2– lower link sublayer in IEEE 802 model
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-16
© James P.G. SterbenzITTC
MAC LayerService and Interfaces
• MAC is in-between physical layer 1 and link layer 2– lower link sublayer in IEEE 802 model
• MAC layer is mostly in control plane– control over when to transmit a L2 frame– but may have its own encapsulation (e.g. IEEE 802 legacy)
9
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-17
© James P.G. SterbenzITTC
MAC LayerService and Interfaces
• MAC is in-between physical layer 1 and link layer 2– lower link sublayer in IEEE 802 model
• MAC layer is mostly in control plane– control over when to transmit a L2 frame– but may have its own encapsulation
• node address to determine receiver
• MAC layer service to link layer (L2)– MAC layer encapsulate/decapsulate if appropriate– initiate transfer of frame into the medium
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-18
© James P.G. SterbenzITTC
MAC LayerService and Interfaces
• MAC layer frame may encapsulate link layer frame– done for link layer / MAC protocol independence
• IEEE 802: 802.2 LLC (logical link control) over 802.N MAC
link layer
physical layer
MAC layer
link layer
physical layer
MAC layer
NPDU TH NPDU TH
…10111001010…
NPDU TH NPDU THHH
10
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-19
© James P.G. SterbenzITTC
Medium Access ControlTaxonomy
• Distributed or centralised• Duplexing in time or frequency• Contention-based or contention-free• Random access or reservation-based• Sender- or receiver-driven• In-band or out-of-band
– explicit or implicit signalling
notes: not all combinations practical or possibleno standard taxonomy
e.g. [GL2000] vs. [KRD2006]
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-20
© James P.G. SterbenzITTC
Medium Access ControlDistributed
• Distributed MAC– each node operates on its own: ad hoc mode– nodes transmit when they have data– subject to MAC
• mechanisms limit when a node may transmit
– generally implies random access
• Centralised MAC
11
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-21
© James P.G. SterbenzITTC
Medium Access ControlCentralised
• Distributed MAC• Centralised MAC
– arbitration handled by central controller: infrastructure mode• infrastructure mode
– typically base station or cell tower
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-22
© James P.G. SterbenzITTC
Medium Access ControlDuplexing
• Duplexing to determine sharing of bidirectional data• TDD: time division duplexing• FDD: frequency division duplexing
12
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-23
© James P.G. SterbenzITTC
Medium Access ControlDuplexing: TDD
• Duplexing to determine sharing of bidirectional data• TDD: time division duplexing
– forward and reverse transmissions are multiplexed in time• within same frequency (and code)
– generally necessary for distributed (random) MAC• otherwise partitioning is needed by central controller
– adds complexity to MAC
• FDD: frequency division duplexing
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-24
© James P.G. SterbenzITTC
Medium Access ControlDuplexing: FDD
• Duplexing to determine sharing of bidirectional data• TDD: time division duplexing• FDD: frequency division duplexing
– forward and reverse transmissions partitioned in frequency– generally requires centralised controller
• unless well-known or standard frequencies used
– eliminates timer duplexing complexity within transmit band
13
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-25
© James P.G. SterbenzITTC
Medium Access ControlContention Based
• Contention-based MAC– nodes transmit when they have data– subject to MAC
• per frame decision• analogue to connectionless service
implications?
• Contention-free MAC
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-26
© James P.G. SterbenzITTC
Medium Access ControlContention Based
• Contention-based MAC– nodes transmit when they have data– subject to MAC
• per frame decision• analogue to connectionless service
– collisions possible– efficient channel utilisation
• in the absence of collisions• collision avoidance techniques mitigate
• Contention-free MAC
14
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-27
© James P.G. SterbenzITTC
Medium Access ControlContention Free
• Contention-based MAC• Contention-free MAC
– reserves or schedules part of the channel• partitions or coördinates access• per link or flow decision• analogue to connection-oriented service
– collisions not possibleimplications?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-28
© James P.G. SterbenzITTC
Medium Access ControlContention
• Contention-based MAC• Contention-free MAC
– reserves or schedules part of the channel• partitions or coördinates access• per link or flow decision• analogue to connection-oriented service
– collisions not possible– inefficient channel use for non-CBR traffic– resource allocation for QoS possible
Note: [Manoj & Murthy] call this“contention based with reservations or scheduling”
15
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-29
© James P.G. SterbenzITTC
Medium Access ControlRandom Access
• Random-access MAC– nodes transmit when they have data– subject to MAC to resolve contention
• per frame decision• pure random vs. carrier sense
• Reservation-based MAC
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-30
© James P.G. SterbenzITTC
Medium Access ControlReservation Based
• Random-access MAC• Reservation-based MAC
– nodes transmit when they have data– subject to MAC reservation
• typically based on control mechanism– RTS/CTS– floor acquisition
16
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-31
© James P.G. SterbenzITTC
Medium Access ControlSender Driven
• Sender-driven MAC– sender initiates MAC and transmission when frame to send– most MAC algorithms are sender driven
• Receiver-driven MAC
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-32
© James P.G. SterbenzITTC
Medium Access ControlReceiver Driven
• Sender-driven MAC• Receiver-driven
– receiver initiates MAC when it is ready to receiveexample later
17
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-33
© James P.G. SterbenzITTC
Medium Access ControlIn-Band vs. Out-of-Band Control
• In-band MAC– control is in same frequency band as data
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-34
© James P.G. SterbenzITTC
Medium Access ControlIn-Band vs. Out-of-Band Control
• In-band MAC– control is in same frequency band as data– explicit signalling messages (e.g. RTS/CTS)
18
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-35
© James P.G. SterbenzITTC
Medium Access ControlIn-Band Control
• In-band MAC– control is in same frequency band as data– explicit signalling messages (e.g. RTS/CTS) or– implicit signalling (e.g. CSMA/CD): no signalling messages
• Out-of-band MAC
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-36
© James P.G. SterbenzITTC
Medium Access ControlOut-of-Band Control
• In-band MAC• Out-of-band MAC
– control in dedicated signalling channel
19
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-37
© James P.G. SterbenzITTC
Link LayerService and Interfaces
• Link layer is HBH analog of E2E transport layer– transport layer (L4) transfers packets E2E
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-38
© James P.G. SterbenzITTC
Link LayerService and Interfaces
• Link layer is HBH analog of E2E transport layer– transport layer (L4) transfers packets E2E
• Link layer (L2) service to network layer (L3)– transfer frame HBH (hop-by-hop)
• sender: encapsulate packet into frame and transmit• receiver: receive frame and decapsulate into packet
20
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-39
© James P.G. SterbenzITTC
Link LayerService and Interfaces
• Link layer is HBH analog of E2E transport layer– transport layer (L4) transfers packets E2E
• Link layer (L2) service to network layer (L3)– transfer frame HBH (hop-by-hop)
• sender: encapsulate packet into frame and transmit• receiver: receive frame and decapsulate into packet
– error checking / optional correction or retransmission• recall end-to-end arguments:
E2E reliability with HBH error control only for performance
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-40
© James P.G. SterbenzITTC
Link LayerService and Interfaces
• Link layer is HBH analog of E2E transport layer– transport layer (L4) transfers packets E2E
• Link layer (L2) service to network layer (L3)– transfer frame HBH (hop-by-hop)
• sender: encapsulate packet into frame and transmit• receiver: receive frame and decapsulate into packet
– error checking / optional correction or retransmission• recall end-to-end arguments:
E2E reliability with HBH error control only for performance – flow control possible but not generally needed at link layer
• parameter negotiation typical (e.g. data rate)
21
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-41
© James P.G. SterbenzITTC
Link LayerService and Interfaces
• Link layer is HBH analog of E2E transport layer– transport layer (L4) transfers packets E2E
• Link layer (L2) service to network layer (L3)– transfer frame HBH (hop-by-hop)
• sender: encapsulate packet into frame and transmit• receiver: receive frame and decapsulate into packet
– error checking / optional correction or retransmission• recall end-to-end arguments:
E2E reliability with HBH error control only for performance – flow control possible but not generally needed at link layer
• parameter negotiation typical (e.g. data rate)
• Link layer multiplexing and switching
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-42
© James P.G. SterbenzITTC
Link LayerService and Interfaces
• Link layer frame encapsulates network layer packet– packet (NPDU – network layer protocol data unit)– frame (LPDU link layer protocol data unit)
• frame = header + packet + (trailer)
network layer
MAC/phy layer
link layer
network layer
MAC/phy layer
link layer
NPDU
NPDU TH
NPDU
NPDU TH
…10111001010…
22
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-43
© James P.G. SterbenzITTC
MAC and Link LayerComparison
• Link layer transfers frame hop-by-hopfunction?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-44
© James P.G. SterbenzITTC
MAC and Link LayerComparison
• Link layer transfers frame hop-by-hop– encapsulates in frame– node address not needed for point-to-point link
23
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-45
© James P.G. SterbenzITTC
MAC and Link LayerComparison
• Link layer transfers frame hop-by-hop– encapsulates in frame– node address not needed for point-to-point link
• MAC layer arbitrates access to channelfunction?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-46
© James P.G. SterbenzITTC
MAC and Link LayerComparison
• Link layer transfers frame hop-by-hop– encapsulates in frame– station address not needed for point-to-point link
• MAC layer arbitrates access to channel– control-plane function– header fields may be necessary: node address– link and MAC
24
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-47
© James P.G. SterbenzITTC
MAC and Link LayerComparison
• Link layer transfers frame hop-by-hop– encapsulates in frame– station address not needed for point-to-point link
• MAC layer arbitrates access to channel– control-plane function– header fields may be necessary: node address– link and MAC
• Physical layer transfers bits through medium– coded as electromagentic wave, photons, or electrons
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-48
© James P.G. SterbenzITTC
MAC and Link LayerComparison
• Link layer transfers frame hop-by-hop– encapsulates in frame– node address not needed for point-to-point link
• MAC layer arbitrates access to channel– control-plane function– header fields may be necessary: node address– link and MAC
• Physical layer transfers bits through medium– coded as electromagentic wave, photons, or electrons
• Link, MAC, and physical layers frequently blurred
25
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-49
© James P.G. SterbenzITTC
MAC and Link ProtocolsIEEE 802 Protocol Stack
• IEEE 802 LAN/MAN standards [IEEE 802.1]– www.ieee802.org
• Definition of LAN/MAN protocols for L1–L2– 802.2 : logical link control– 802.n : MAC and physical media dependent
LLC sublayerlogical link control
MAC sublayermedium access control
MI sublayermedia independent
PMD sublayerphysical media dependent
physicallayer
linklayerMAClayer
802.2
802.n
PMD1 PMD2 PMDk
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-50
© James P.G. SterbenzITTC
Link Protocol and MAC Multiplexing vs. Multiple Access
• Multiplexing vs. multiple access• Link multiplexing
– single transmitter– dedicated point-to-point link
26
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-51
© James P.G. SterbenzITTC
Link Protocol and MACMultiplexing vs. Multiple Access
• Multiplexing vs. multiple access• Link multiplexing
– single transmitter– dedicated point-to-point link
• Multiple access– multiple transmitters– shared medium– essentially physical layer multiplexing– MAC algorithm needed to arbitrate
Lecture WM
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-52
© James P.G. SterbenzITTC
Link Protocol and MACFunctional Placement
• MAC and Link layer functionality per line interface– end system: network interface (NIC)– switch/router: line card
switch
forwarding
line card
framespackets
line card
line card
line card
end system
network interface
mem CPU
routing
frames
27
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-53
© James P.G. SterbenzITTC
Wireless MAC AlgorithmsDesign Goals
• Scalable to large networks• Efficient bandwidth utilisation
– low control traffic overhead
• Fair among users– subject to QoS differentiation
• Resilience– minimise impact of hidden and exposed nodes– robust against lost control messages, fading, jamming
• Power/energy awareness– optimised for energy constrained nodes
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-54
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.2 Contention-Free MAC Algorithms
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithms
ML.2.1 Channel partitioning MACML.2.2 Coördinated access MACML.2.3 Spread spectrum MAC
ML.3 Contention-based MAC algorithmsML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
28
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-55
© James P.G. SterbenzITTC
Medium Access ControlContention-Free MAC
• Contention-free MAC– ensures that channel is divided in time or frequency
• reserved or scheduled• per link or flow decision• analogue to connection-oriented service• generally centralised control from base station
– collisions not possible– inefficient channel use for non-CBR traffic– resource allocation for QoS possible
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-56
© James P.G. SterbenzITTC
Medium Access ControlContention-Free MAC
• Contention-free MAC taxonomy– following EECS 780, [Kurose and Ross], [KRD2006]
• Channel partitioning– reserve chunk of channel– e.g. TDMA
• Coördinated access– take turns– e.g. polling using tokens
• Spread spectrum– share same spectrum among users without collisions
29
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-57
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.2.1 Channel Partitioning MAC Algorithms
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithms
ML.2.1 Channel partitioning MACML.2.2 Coördinated access MACML.2.3 Spread spectrum MAC
ML.3 Contention-based MAC algorithmsML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-58
© James P.G. SterbenzITTC
Contention-Free MAC AlgorithmsTypes
• Channel partitioning– TDMA, FDMA, WDMA (optical)– best under high deterministic load
• Coördinated access (taking turns)– polling, token passing– performs well in wired networks
• combines benefits of both partitioning and random access
– difficult to implement in wireless networks
• Spread spectrum– CDMA– resistant to interference and jamming
30
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-59
© James P.G. SterbenzITTC
Channel Partitioning MACIntroduction and Assumptions
• Channel has sufficient capacity – individual inter-node date rates less than channel capacity
• Multiple nodes share a channel• Channel partitioned into pieces
– pieces assigned to individual inter-node communication– MAC arbitrates
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-60
© James P.G. SterbenzITTC
Channel Partitioning MACAlternatives
• TDMA: time division multiple access• FDMA: frequency division multiple access
– typically refers to RF– WDMA: wavelength division multiple access (light)
• CDMA: code division multiple access– spread spectrum (later)
• Note similarity to multiplexing schemes– TDMA ~ TDM, FDMA ~ FDM– essentially distributed physical layer versions of link muxing
31
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-61
© James P.G. SterbenzITTC
Channel Partitioning MACTDMA
• TDMA: time division multiple access• Channel divided into n time slots
– served cyclically– generally equal size– within a frequency band
chan
nel 0
chan
nel 1
chan
nel n
–1ch
anne
l 0
f
t
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-62
© James P.G. SterbenzITTC
Channel Partitioning MACTDMA
• TDMA: time division multiple access• Channel divided into n time slots
– served cyclically– generally equal size– within a frequency band
• MAC arbitrates how nodes assigned to slots– static TDMA: slots reserved for particular links– dynamic TDMA: slots scheduled based on traffic demand
32
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-63
© James P.G. SterbenzITTC
Channel Partitioning MACFDMA
• FDMA: frequency division multiple access• Channel divided into n frequency bands
– generally of equal bandwidth– over period of time
chan
nel 0
chan
nel 1
chan
nel 2
chan
nel n
–1
f
t
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-64
© James P.G. SterbenzITTC
Channel Partitioning MACFDMA
• FDMA: frequency division multiple access• Channel divided into n frequency bands
– generally of equal bandwidth– over period of time
• MAC arbitrates how nodes assigned to frequencies– static TDMA: slots reserved for particular links– dynamic TDMA: slots scheduled based on traffic demand
33
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-65
© James P.G. SterbenzITTC
Channel Partitioning MACLink Duplexing
• Link types– half duplex: unidirectional hop-by-hop transfer– full duplex: bidirectional hop-by-hop transfer
• Most communication requires full duplex link– even unidirectional data transfer– why?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-66
© James P.G. SterbenzITTC
Channel Partitioning MACLink Duplexing
• Link types– half duplex: unidirectional hop-by-hop transfer– full duplex: bidirectional hop-by-hop transfer
• Most communication requires full duplex link– even unidirectional data transfer– control messages such as ACKs for ARQ
– may be highly asymmetric
34
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-67
© James P.G. SterbenzITTC
Channel Partitioning MACLink Duplexing
• Link types– half duplex: unidirectional hop-by-hop transfer– full duplex: bidirectional hop-by-hop transfer
• Most communication requires full duplex link– even unidirectional data transfer– control messages such as ACKs for ARQ
– may be highly asymmetric
– Alternative strategies for duplexing– separate end-to-end paths
problem?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-68
© James P.G. SterbenzITTC
Channel Partitioning MACLink Duplexing
• Link types– half duplex: unidirectional hop-by-hop transfer– full duplex: bidirectional hop-by-hop transfer
• Most communication requires full duplex link– even unidirectional data transfer– control messages such as ACKs for ARQ
– may be highly asymmetric
– Alternative strategies for duplexing– separate distinct end-to-end paths through network
– may have different loss & delay properties– may be necessary in some cases (e.g. satellite)
35
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-69
© James P.G. SterbenzITTC
Channel Partitioning MACLink Duplexing
• Link types– half duplex: unidirectional hop-by-hop transfer– full duplex: bidirectional hop-by-hop transfer
• Most communication requires full duplex link– even unidirectional data transfer– control messages such as ACKs for ARQ
– may be highly asymmetric
– Alternative strategies for duplexing– separate distinct end-to-end paths through network– paired unidirectional links in same guided media
– e.g. 2×twisted-pair, 2×fiber
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-70
© James P.G. SterbenzITTC
Channel Partitioning MACLink Duplexing
• Link types– half duplex: unidirectional hop-by-hop transfer– full duplex: bidirectional hop-by-hop transfer
• Most communication requires full duplex link– even unidirectional data transfer– control messages such as ACKs for ARQ
– may be highly asymmetric
– Alternative strategies for duplexing– separate distinct end-to-end paths through network– paired unidirectional links in same guided media– sharing same media (e.g. fiber or free space)
36
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-71
© James P.G. SterbenzITTC
Channel Partitioning MACFrequency Division Duplexing
• Duplexing : bidirectional transmission sharing media• FDD: frequency division duplexing
– forward and reverse traffic assigned to different freq. bandsadvantages and disadvantages?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-72
© James P.G. SterbenzITTC
Channel Partitioning MACFrequency Division Duplexing
• Duplexing : bidirectional transmission sharing media• FDD: frequency division duplexing
– forward and reverse traffic assigned to different freq. bands– simple scheme– no possibility of collisions between forward & revere packets– less efficient use of spectrum under light load
37
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-73
© James P.G. SterbenzITTC
Channel Partitioning MACTime Division Duplexing
• Multiplexing in time and space for full duplex– bidirectional data transmission
• FDD: frequency division duplexing• TDD: time division duplexing
– forward and reverse traffic assigned to same freq. bandsadvantages and disadvantages?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-74
© James P.G. SterbenzITTC
Channel Partitioning MACTime Division Duplexing
• Multiplexing in time and space for full duplex– bidirectional data transmission
• FDD: frequency division duplexing• TDD: time division duplexing
– forward and reverse traffic assigned to same freq. bands– slots divided between upstream and downstream traffic– dynamic bandwidth adjustment needed for assymetric traffic– operates in conjunction with various channel multiplexing
• eg. TDD within FDMA
examples in Lecture WN
38
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-75
© James P.G. SterbenzITTC
Channel Partitioning MACAdvantages and Disadvantages
• Channel partitioning– TDMA, FDMA, WDMA (optical)– best under high deterministic load
• Coördinated access (taking turns)– polling, token passing– performs well in wired networks
• combines benefits of both partitioning and random access
– difficult to implement in wireless networks
• Spread spectrum– CDMA– resistant to interference and jamming
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-76
© James P.G. SterbenzITTC
Channel Partitioning MACCharacteristics
lowComplexity
802.16 meshExamples
poorResilience
–Consequence of Contention
highdeterministicLoad Tolerance
TDMAFDMA WDMA
SDMATypes
Spread Spectrum
Random Access
Cöordinated Access
Channel PartitioningCharacteristic
39
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-77
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.2.2 Coördinated Access MAC
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithms
ML.2.1 Channel partitioning MACML.2.2 Coördinated access MACML.2.3 Spread spectrum MAC
ML.3 Contention-based MAC algorithmsML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-78
© James P.G. SterbenzITTC
Coördinated Access MACIntroduction and Assumptions
• Channel has sufficient capacity – individual inter-node date rates less than channel capacity
• Multiple nodes share a channel• Nodes use channel for a period of time
– in a fully highly coordinated manner• central controller (e.g. polling)• algorithmic turn taking (e.g. token passing)
– MAC arbitrates
40
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-79
© James P.G. SterbenzITTC
Coördinated Access MACPolling
• Controller grants channel access to node– each node polled to determine if it needs to transmit
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-80
© James P.G. SterbenzITTC
Coördinated Access MACToken Passing
• Token grants channel access to station– token passed between nodes– generally round robin
41
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-81
© James P.G. SterbenzITTC
Coördinated Access MACToken Passing
• Token grants channel access to station– token passed between nodes– generally round robin
• Topologies– wired bus
• IEEE 802.4 never successful
– wired ring interconnection• IEEE 802.5
Problem for wireless?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-82
© James P.G. SterbenzITTC
Coördinated Access MACToken Passing
• Token grants channel access to station– token passed between nodes– generally round robin
• Topologies– wired bus
• IEEE 802.4 never successful
– wired ring interconnection• IEEE 802.5
• Problem for wireless– how to order nodes– sequential nodes must be in range
42
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-83
© James P.G. SterbenzITTC
Coördinated Access MACAdvantages and Disadvantages
• Channel partitioning– TDMA, FDMA, WDMA (optical)– best under high deterministic load
• Coördinated access (taking turns)– polling, token passing– performs well in wired networks
• combines benefits of both partitioning and random access
– difficult to implement in wireless networks
• Spread spectrum– CDMA– resistant to interference and jamming
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-84
© James P.G. SterbenzITTC
Coördinated Access MACCharacteristics
highlowComplexity
802.5 TR802.16 meshExamples
wired: moderatewireless: poorpoorResilience
degradation–Consequence of Contention
higherhighdeterministicLoad Tolerance
token ringpolling
TDMAFDMA WDMA
SDMATypes
Spread Spectrum
Random Access
Cöordinated Access
Channel PartitioningCharacteristic
43
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-85
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.2.3 Spread Spectrum MAC
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithms
ML.2.1 Channel partitioning MACML.2.2 Coordinated access MACML.2.3 Spread spectrum MAC
ML.3 Contention-based MAC algorithmsML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-86
© James P.G. SterbenzITTC
Spread Spectrum MACIntroduction and Assumptions
• Channel has sufficient capacity – individual inter-node date rates less than channel capacity
• Multiple nodes share a channel• Nodes use channel for a period of time• Transmission spread in frequency spectrum
– coding techniques avoid interference
• CDMA: code division multiple access– DSSS: direct sequence spread spectrum– FHSS: frequency hopping spread spectrum
44
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-87
© James P.G. SterbenzITTC
Spread Spectrum MACCDMA
• CDMA: code division multiple access• Channel use different codes
– in a given frequency band– over period of time
• Analogy: speaking– English, German,
Chinese, Hindi– in the same room
at the same time– easier to converse in a given language (code)
if interference is in different languages (codes)
code 0
f
tcode 1
code n–1
c
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-88
© James P.G. SterbenzITTC
Spread Spectrum MACCDMA Types
• Direct sequence (DS)– symbols multiplied by higher frequency chipping sequence
• Frequency hopping (FH)– transmissions rapidly hop among different frequency carriers
• pseudorandom sequence negotiated between tranceivers
45
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-89
© James P.G. SterbenzITTC
Spread Spectrum MACDS CDMA Concepts
• All stations share same frequency band– unique code assigned to each station
• Each station has its own chipping sequence– unique code at chipping rate– encoded signal = (original data) × (chipping sequence)– decoding: inner-product of encoded signal and chipping seq.
• Multiple stations transmit simultaneously– minimal interference if codes are orthogonal
analogy : [suggested by D. Broyles]
conversations at the same time in different languages
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-90
© James P.G. SterbenzITTC
Spread Spectrum MACCDMA Encode/Decode Example
slot 1 slot 0
d1 = -1
1 1 1 1
1- 1- 1- 1-
Zi,m= di.cm
d0 = 1
1 1 1 1
1- 1- 1- 1-
1 1 1 1
1- 1- 1- 1-
1 1 11
1-1- 1- 1-
slot 0channeloutput
slot 1channeloutput
channel output Zi,m
sendercode
databits
slot 1 slot 0
d1 = -1d0 = 1
1 1 1 1
1- 1- 1- 1-
1 1 1 1
1- 1- 1- 1-
1 1 1 1
1- 1- 1- 1-
1 1 11
1-1- 1- 1-
slot 0channeloutput
slot 1channeloutputreceiver
code
receivedinput
Di = Σ Zi,m.cmm=1
M
M
46
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-91
© James P.G. SterbenzITTC
Spread Spectrum MACFHSS Concepts
• All nodes share set of frequency bands• Each node has its own channel sequence
– transmitters and receivers hop through channel sequence
• Multiple nodes transmit simultaneouslyAdvantages and disadvantages?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-92
© James P.G. SterbenzITTC
Spread Spectrum MACFHSS Advantages
• All nodes share set of frequency bands• Each node has its own channel sequence
– transmitters and receivers hop thorugh channel sequence
• Multiple nodes transmit simultaneously• Advantages
– resistant to interception• unless receiver has channel sequence
– resistant to jamming• difficult to jam over wide frequency ranges
47
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-93
© James P.G. SterbenzITTC
Spread Spectrum MACFHSS Disadvantages
• All nodes share set of frequency bands• Each node has its own channel sequence
– transmitters and receivers hop through channel sequence
• Multiple nodes transmit simultaneously• Advantages
– resistant to interception and jamming
• Disadvantages– interferes with FDM and DSSS in same frequency bands
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-94
© James P.G. SterbenzITTC
Spread Spectrum MACAdvantages and Disadvantages
• Channel partitioning– TDMA, FDMA, WDMA (optical)– best under high deterministic load
• Coördinated access (taking turns)– polling, token passing– performs well in wired networks
• combines benefits of both partitioning and random access
– difficult to implement in wireless networks
• Spread spectrum– CDMA– resistant to interference and jamming
48
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-95
© James P.G. SterbenzITTC
Spread Spectrum MACCharacteristics
highlowhighlowComplexity
802.11Ethernet802.11802.5 TR802.11
802.16Examples
resistant to interferencepoorwired: moderate
wireless: poorpoorResilience
degradationcollisionsdegradation–Consequence of Contention
varieslowerhigherhighdeterministicLoad Tolerance
CDMAFH, DS
ALOHA, slotCSMA
CD, CA
token ringpolling
TDMAFDMA WDMA
SDMATypes
Spread Spectrum
Random Access
Cöordinated Access
Channel PartitioningCharacteristic
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-96
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.3 Contention-Based MAC Algorithms
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithmsML.3 Contention-based MAC algorithms
ML.3.1 Random access and slotted timeML.3.2 Contention, collisions, and CSMAML.3.3 Hidden and exposed nodes
ML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
49
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-97
© James P.G. SterbenzITTC
Contention-Based MACIntroduction and Assumptions
• Channel has sufficient capacity – individual inter-node date rates less than channel capacity
• Multiple nodes share a channel• Nodes use channel for a period of time
– generally entire channel• baseband for wired network• share a frequency band for wireless (random access in FDMA)
– in a fully distributed (random) manner• similar to statistical TDM
– MAC arbitrates
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-98
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.3.1 Random Access and Slotted Time
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithmsML.3 Contention-based MAC algorithms
ML.3.1 Random access and slotted timeML.3.2 Contention, collisions, and CSMAML.3.3 Hidden and exposed nodes
ML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
50
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-99
© James P.G. SterbenzITTC
Random Access MACALOHA
• ALOHA: 1970s radio network among Hawaiian islands• Senders transmit whenever they have data (no MAC)
• Performance metrics– channel efficiency
• what fraction of transmission attempts are successful
– channel throughput• what is the maximum carried load of the channel?
A
B
C
t
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-100
© James P.G. SterbenzITTC
Random Access MACALOHA
• ALOHA: 1970s radio network among Hawaiian islands• Senders transmit whenever they have data (no MAC)
• Problem– collisions : transmissions interfere with one another
A
B
C
t
51
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-101
© James P.G. SterbenzITTC
Random Access MACALOHA
• ALOHA: 1970s radio network among Hawaiian islands• Senders transmit whenever they have data (no MAC)
• Problem– collisions : transmissions interfere with one another– even if only very small overlap
A
B
C
t
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-102
© James P.G. SterbenzITTC
Random Access MACALOHA
• ALOHA: 1970s radio network among Hawaiian islands• Senders transmit whenever they have data (no MAC)
• Problem– collisions : transmissions interfere with one another– even if only very small overlap
can we do better?
A
B
C
t
52
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-103
© James P.G. SterbenzITTC
Random Access MACSlotted ALOHA
• ALOHA: 1970s radio network among Hawaiian islands• Senders transmit whenever they have data in slot
• Problem– collisions : transmissions interfere with one another– improvement: divide time into slots
A
B
C
t
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-104
© James P.G. SterbenzITTC
Random Access MACSlotted ALOHA
• ALOHA: 1970s radio network among Hawaiian islands• Senders transmit whenever they have data in slot
• Problem– collisions : transmissions interfere with one another– improvement: divide time into slots– delay transmissions to next slot time
A
B
C
t
53
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-105
© James P.G. SterbenzITTC
Random Access MACSlotted ALOHA
• ALOHA: 1970s radio network among Hawaiian islands• Senders transmit whenever they have data in slot
• Problem– collisions : transmissions interfere with one another– improvement: divide time into slots– delay transmissions to next slot time– slotted time reduces probability of collisions
A
B
C
t
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-106
© James P.G. SterbenzITTC
Random Access MACUnslotted vs. Slotted Performance
• Slotting approximately doubles performance– slotted: Throughput = Ge−G
– unslotted: Throughput = Ge−2G
[adapted from Tannenbaum]
0.0 0.5 1.0 1.5 2.0 2.5 3.0
G [attempts / packet time]
0.10
0.20
0.30
0.40
[thro
ughp
ut /
pack
et ti
me]
unslotted
slotted
54
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-107
© James P.G. SterbenzITTC
Random Access MACChallenges
• Multiple nodes must be able to share channel• When 2 or more nodes simultaneously transmit
– signals garbled in a collision : none of them are successful
• How to arbitrate among them?– MAC algorithm
How can we do better than random transmission?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-108
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.3.2 Contention, Collisions, and CSMA
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithmsML.3 Contention-based MAC algorithms
ML.3.1 Random access and slotted timeML.3.2 Contention, collisions, and CSMAML.3.3 Hidden and exposed nodes
ML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
55
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-109
© James P.G. SterbenzITTC
Medium Access ControlContention
• Contention-based or random-access MAC– nodes transmit when they have data– subject to MAC
• per frame decision• analogue to connectionless service
– collisions possible– efficient channel utilisation
• in the absence of collisions
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-110
© James P.G. SterbenzITTC
Random Access MACContention and Collisions
What is the simplest way to reduce collisions?
56
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-111
© James P.G. SterbenzITTC
Random Access MACCSMA (1-persistant)
• CSMA – carrier sense multiple access– nodes can sense if channel is in use by another station– wait to transmit to avoid collision– human analogy: don’t interrupt others already speaking
• 1-persistant CSMA– wait until channel free, then transmit
(transmit with probability 1)
Problem? How can we do better?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-112
© James P.G. SterbenzITTC
Random Access MACCSMA (non- and p - persistent)
• Problem: synchronisation of collisions– waiting nodes will all transmit as soon as channel free
• Two options:• Non-persistent CSMA
– if carrier sensed wait random period before trying again(rather than continuously sensing until channel free)
– better utilisation, but delayed even when unnecessary
• p -persistent CSMA (for slotted time)– continuously sense carrier until channel is available– but with only with probability p transmit on next slot
57
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-113
© James P.G. SterbenzITTC
Random Access MACCSMA Collisions
• Collisions still occur– due to propagation delay– sender may not know
channel already in use
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-114
© James P.G. SterbenzITTC
Random Access MACCSMA Collisions
• Collisions still occur– due to propagation delay– sender may not know
channel already in use
• Pr[collision] incr. w/ length– B & D don’t know other xmit
B DA C
58
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-115
© James P.G. SterbenzITTC
Random Access MACCSMA Collisions
• Collisions still occur– due to propagation delay– sender may not know
channel already in use
• Pr[collision] incr. w/ length– B & D don’t know other xmit– until signals meet near C– and return
• Inefficient– channel used by garbage
Can we do better?
B DA C
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-116
© James P.G. SterbenzITTC
Random Access MACCSMA/CD
• CSMA/CD: CSMA with collision detection– station detecting a collision immediately ceases transmission– human analogy: polite conservationist
• Worst case CD takes twice media propagation delay– A transmits packet
59
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-117
© James P.G. SterbenzITTC
Random Access MACCSMA/CD
• CSMA/CD: CSMA with collision detection– station detecting a collision immediately ceases transmission– human analogy: polite conservationist
• Worst case CD takes twice media propagation delay– A transmits packet
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-118
© James P.G. SterbenzITTC
Random Access MACCSMA/CD
• CSMA/CD: CSMA with collision detection– station detecting a collision immediately ceases transmission– human analogy: polite conservationist
• Worst case CD takes twice media propagation delay– A transmits packet– B transmits packet just before A reaches B
60
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-119
© James P.G. SterbenzITTC
Random Access MACCSMA/CD
• CSMA/CD: CSMA with collision detection– station detecting a collision immediately ceases transmission– human analogy: polite conservationist
• Worst case CD takes twice media propagation delay– A transmits packet– B transmits packet just before A reaches B– A+B interference travels back to A
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-120
© James P.G. SterbenzITTC
Random Access MACCollision Detection Efficiency
• CD frees channel earlier= 1 / [1+5tprop/ttrans]
tprop max prop between nodesttrans time to transmit max frame
• Efficiency→ 1 as tprop → 0→ 1 as ttrans → ∞
B DA C
CD and abort
61
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-121
© James P.G. SterbenzITTC
Random Access MACCollision Detection Efficiency
• CD frees channel earlier= 1 / [1+5tprop/ttrans]
tprop max prop between nodesttrans time to transmit max frame
• Efficiency→ 1 as tprop → 0→ 1 as ttrans → ∞
• Much better than CSMA– still decentralized,
simple, and cheapproblem?
B DA C
CD and abort
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-122
© James P.G. SterbenzITTC
CSMA/CDBackoff
• If stations all transmit after backoff, same problem– need some way of un-synchronising retransmissions
How?
62
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-123
© James P.G. SterbenzITTC
CSMA/CDExponential Backoff
• If stations all transmit after backoff, same problem– need some way of un-synchronising transmissions
• Exponential backoff:– stations wait a random number of slot times before retrying– binary exponential distribution:
nth collision wait randomly among {0…2n–1} slots1st collision: wait 0 or 1 slots2nd collision: wait 0, 1, 2, or 3 slots…
– low load: minimise delaymoderate load: spread retries
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-124
© James P.G. SterbenzITTC
CSMA/CDProblems
Problems?
63
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-125
© James P.G. SterbenzITTC
CSMA/CDProblems: Collision Detection and Carrier Sense
Problem with collision detection?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-126
© James P.G. SterbenzITTC
CSMA/CDProblem with Collision Detection
• Problems with collision detection– station must be able to simultaneously transmit and receive
• requires full duplex
– not possible for single wireless tranceiver at given frequency
• CSMA/CD not appropriate for wireless networks– Ethernet evolution eliminated vast majority of CSMA/CD
64
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-127
© James P.G. SterbenzITTC
CSMAProblem with Carrier Sense
• CSMA/CD not appropriate for wireless networksProblem with carrier sense?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-128
© James P.G. SterbenzITTC
CSMAProblem with Carrier Sense
• CSMA/CD not appropriate for wireless networks• Problem with carrier sense
– only appropriate when all nodes within range– typically not the case for wireless networks
problem?
65
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-129
© James P.G. SterbenzITTC
CSMAProblem with Carrier Sense
• CSMA/CD not appropriate for wireless networks• Problem with carrier sense
– only appropriate when all nodes within range– typically not the case for wireless networks– problem: hidden nodes
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-130
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.3.3 Hidden and Exposed Nodes
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithmsML.3 Contention-based MAC algorithms
ML.3.1 Random access and slotted timeML.3.2 Contention, collisions, and CSMAML.3.3 Hidden and exposed nodes
ML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
66
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-131
© James P.G. SterbenzITTC
Hidden and Exposed NodesHidden Nodes
• Hidden nodes (terminals)– some nodes are hidden from one another– out of transmission range– unaware that they are causing collisions with hidden node
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-132
© James P.G. SterbenzITTC
Random Access Wireless MACHidden Nodes
• Hidden node problem
A
BC
A
67
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-133
© James P.G. SterbenzITTC
Random Access Wireless MACHidden Nodes
• Hidden node problem– A can communicate with B
A
BC
A
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-134
© James P.G. SterbenzITTC
Random Access Wireless MACHidden Nodes
• Hidden node problem– A can communicate with B– C can communicate with B A
BC
A
68
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-135
© James P.G. SterbenzITTC
Random Access Wireless MACHidden Nodes
• Hidden node problem– A can communicate with B– C can communicate with B– A can not communicate with C
A
BC
A
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-136
© James P.G. SterbenzITTC
Random Access Wireless MACHidden Nodes
• Hidden node problem– A can communicate with B– C can communicate with B– A can not communicate with C
• unaware of interference
A
BC
A
69
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-137
© James P.G. SterbenzITTC
Random Access Wireless MACHidden Nodes
• Hidden node problem– A can communicate with B– C can communicate with B– A can not communicate with C
• unaware of interference
• Causes of hidden nodess– line-of-sight obstructions
A
BC
A
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-138
© James P.G. SterbenzITTC
Random Access Wireless MACHidden Nodes
• Hidden node problem– A can communicate with B– C can communicate with B– A can not communicate with C
• unaware of interference
• Causes of hidden nodes– line-of-sight obstructions– signal attenuation
• limitedtransmissionrange
A
BC
A
A B C
70
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-139
© James P.G. SterbenzITTC
Hidden and Exposed NodesExposed Nodes
• Exposed nodes (terminals)– some nodes are in range of one another– prevent transmission because collision assumed
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-140
© James P.G. SterbenzITTC
Hidden and Exposed NodesExposed Nodes
• Exposed nodes (terminals)– some nodes are in range of one another– prevent transmission because collision assumed
• Example:– B transmitting to C
B C
71
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-141
© James P.G. SterbenzITTC
Hidden and Exposed NodesExposed Nodes
• Exposed nodes (terminals)– some nodes are in range of one another– prevent transmission because collision assumed
• Example:– B transmitting to C– but A hears B: won’t transmit for CA
A B C
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-142
© James P.G. SterbenzITTC
Hidden and Exposed NodesExposed Nodes
• Exposed nodes (terminals)– some nodes are in range of one another– prevent transmission because collision assumed
• Example:– B transmitting to C– but A hears B: won’t transmit for CA– even though it could to D without jamming B→C
B CD A
72
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-143
© James P.G. SterbenzITTC
Hidden and Exposed NodesExposed Nodes
• Exposed nodes (terminals)– some nodes are in range of one another– prevent transmission because collision assumed
Solution?
B CD A
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-144
© James P.G. SterbenzITTC
Hidden and Exposed NodesExposed Nodes
• Exposed nodes (terminals)– some nodes are in range of one another– prevent transmission because collision assumed
• Spatial reuse necessary– directional antennæ one strategy
B CD A
73
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-145
© James P.G. SterbenzITTC
Random Access Wireless MACCSMA
• CSMA/CD not practical for wireless networks– full duplex problem– hidden terminal problem
Alternatives that are still better than (pure) CSMA?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-146
© James P.G. SterbenzITTC
Random Access Wireless MACCollision Avoidance
• Collision avoidance (CA)– attempt to avoid collision (but don’t detect once occurs)
74
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-147
© James P.G. SterbenzITTC
Random Access Wireless MACCollision Avoidance: Floor Acquisition
• Floor acquisition (FAMA: floor access multiple access)– efficient negation to determine which node transmits– may be in-band or out-of band (e.g. signalling frequency)– similar to audio conference floor acquision protocols
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-148
© James P.G. SterbenzITTC
Random Access Wireless MACMACA
• MACA: multiple access with collision avoidance– in-band floor acquisition
How?
A B C
75
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-149
© James P.G. SterbenzITTC
Random Access Wireless MACMACA
• MACA: multiple access with collision avoidance– in-band floor acquisition
• MACA operation (analogy: teleconference “may I”)– sender transmits RTS (request to send) if no carrier sense
A B C
RTS
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-150
© James P.G. SterbenzITTC
Random Access Wireless MACMACA
• MACA: multiple access with collision avoidance– in-band floor acquisition
• MACA operation– sender transmits RTS (request to send)– intended receiver replies with CTS (clear to send)– all nodes in range of both will detect at least 1 of RTS/CTS
A B C
CTS CTS
76
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-151
© James P.G. SterbenzITTC
Random Access Wireless MACMACA
• MACA: multiple access with collision avoidance– in-band floor acquisition
• MACA operation– sender transmits RTS (request to send)– intended receiver replies with CTS (clear to send)– all nodes in range of both will detect at least 1 of RTS/CTS– if sender receives clear CTS it can transmit
A B C
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-152
© James P.G. SterbenzITTC
Random Access Wireless MACMACAW
• MACAW: MACA for wireless– data frames acknowledged– exponential backoff per send/receive pair– modified backoff algorithm
[BDSZ1994] next time
77
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-153
© James P.G. SterbenzITTC
Random Access Wireless MACDFWMAC
• DFWMAC: distributed foundation wireless MAC
• MACAW + CSMA/CA = CSMA/CA:collision avoidance– RTS/CTS to reduce Pr[collision]– used in IEEE 802.11
• Sender– sense and wait for DIFS interval
senseDIFS
1
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-154
© James P.G. SterbenzITTC
Random Access Wireless MACDFWMAC
• CSMA/CA: collision avoidance– RTS/CTS to reduce Pr[collision]
• Sender– sense and wait for DIFS interval– if channel free send RTS
senseDIFS
2
RTS
78
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-155
© James P.G. SterbenzITTC
Random Access Wireless MACDFWMAC
• CSMA/CA: collision avoidance– RTS/CTS to reduce Pr[collision]
• Sender– sense and wait for DIFS interval– if channel free send RTS
• Receiver– wait for SIFS interval
senseDIFS
3
RTS
SIFS
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-156
© James P.G. SterbenzITTC
Random Access Wireless MACDFWMAC
• CSMA/CA: collision avoidance– RTS/CTS to reduce Pr[collision]
• Sender– sense and wait for DIFS interval– if channel free send RTS
• Receiver– wait for SIFS interval– return CTS if channel idle
• receiver hears nodes hidden from sender
senseDIFS
4
RTS
SIFSCTS
79
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-157
© James P.G. SterbenzITTC
Random Access Wireless MACDFWMAC
• CSMA/CA: collision avoidance– RTS/CTS to reduce Pr[collision]
• Sender– sense and wait for DIFS interval– if channel free send RTS
• Receiver– wait for SIFS interval– return CTS if channel idle
• Sender– wait for SIFS interval
why not DIFS?
senseDIFS
5
RTS
SIFSCTS
SIFS
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-158
© James P.G. SterbenzITTC
Random Access Wireless MACDFWMAC
• CSMA/CA: collision avoidance– RTS/CTS to reduce Pr[collision]
• Sender– sense and wait for DIFS interval– if channel free send RTS
• Receiver– wait for SIFS interval– return CTS if channel idle
• Sender– wait for SIFS interval
• DIFS already used to seize channel
senseDIFS
5
RTS
SIFSCTS
SIFS
80
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-159
© James P.G. SterbenzITTC
Random Access Wireless MACDFWMAC
• CSMA/CA: collision avoidance– RTS/CTS to reduce Pr[collision]
• Sender– sense and wait for DIFS interval– if channel free send RTS
• Receiver– wait for SIFS interval– return CTS if channel idle
• Sender– wait for SIFS interval– transmit frame
senseDIFS
6
RTS
SIFSCTS
SIFS
frame
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-160
© James P.G. SterbenzITTC
Random Access Wireless MACDFWMAC
• CSMA/CA: collision avoidance– RTS/CTS to reduce Pr[collision]
• Sender– sense, wait for DIFS, send RTS
• Receiver– wait for SIFS, return CTS
• Sender– wait for SIFS, transmit frame
• Receiver– wait for SIFS interval and return ACK
senseDIFS
7
RTS
SIFSCTS
SIFS
frame
SIFSACK
81
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-161
© James P.G. SterbenzITTC
Random Access Wireless MACDFWMAC
• CSMA/CA: collision avoidance– RTS/CTS to reduce Pr[collision]
• Sender– sense, wait for DIFS, send RTS
• Receiver– wait for SIFS, return CTS
• Sender– wait for SIFS, transmit frame
• Receiver– wait for SIFS interval and return ACK
• Sender– must wait DIFS before next frame
senseDIFS
8
RTS
SIFSCTS
SIFS
frame
SIFSACK
frame
DIFS
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-162
© James P.G. SterbenzITTC
Random Access Wireless MACEY-NPMA
• EY-NPMA: Elimination yield – non-preëmptivepriority multiple access– carrier sense
• If no carrier, transmit immediately (no DIFS wait)• If carrier:
– prioritisation phase– contention phase
• elimination phase• yield phase
• Used in ETSI HIPERLAN– early competitor for 802.11
82
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-163
© James P.G. SterbenzITTC
Random Access Wireless MACFloor Acquisition
• In-band floor acquisition– MACA / MACAW / DFWMAC
Alternative?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-164
© James P.G. SterbenzITTC
Random Access Wireless MACBTMA
• BTMA: busy tone multiple access– out-of-band floor acquisition
How?
83
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-165
© James P.G. SterbenzITTC
Random Access Wireless MACBTMA
• BTMA: busy tone multiple access– out-of-band floor acquisition
• BTMA operation (analogy: raise hand to speak)– sender transmits busy tone if no busy tone sense– sender transmits data– all nodes sensing data carrier tone transmit busy tone
why?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-166
© James P.G. SterbenzITTC
Random Access Wireless MACBTMA
• BTMA: busy tone multiple access– out-of-band floor acquisition
• BTMA operation (analogy: raise hand to speak)– sender transmits busy tone if no carrier sense– sender transmits data– all nodes sensing data carrier tone retransmit busy tone
• busy tone propagated 2-hops to avoid hidden-node problem
Advantages and disadvantages?
84
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-167
© James P.G. SterbenzITTC
Random Access Wireless MACBTMA
• BTMA: busy tone multiple access– out-of-band floor acquisition
• BTMA operation (analogy: raise hand to speak)– sender transmits busy tone if no carrier sense– sender transmits data– all nodes sensing data carrier tone retransmit busy tone
• busy tone propagated 2-hops to avoid hidden-node problem
• Advantages and disadvantages+ simple and effective– inefficient: busy tone channel and exposed terminals
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-168
© James P.G. SterbenzITTC
Random Access Wireless MACBTMA Variants: DBTMA
• DBTMA: Dual BTMA– data channel + out-of-band slotted control channel– control channel for RTS/CTS and orthogonal busy tones
• receiver BTr and transmitter BTt
why?
85
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-169
© James P.G. SterbenzITTC
Random Access Wireless MACBTMA Variants: DBTMA
• DBTMA: Dual BTMA– data channel + out-of-band slotted control channel– control channel for RTS/CTS and orthogonal busy tones
• receiver BTr and transmitter BTt
– directionality of BTs allows spatial reuse
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-170
© James P.G. SterbenzITTC
Random Access Wireless MACBTMA Variants: DBTMA
• DBTMA: Dual BTMA– data channel + out-of-band slotted control channel– control channel for RTS/CTS and orthogonal busy tones
• receiver BTr and transmitter BTt
– directionality of BTs allows prevents hidden/exposed nodes
• Operation– sender transmits RTS if no BTr active – if RTS received, receiver transmits CTS and asserts BTr
– if CTS received, transmitter asserts BTt and transmits frame– receiver turns off BTr when entire frame received
86
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-171
© James P.G. SterbenzITTC
Random Access Wireless MACBTMA Variants: RI-BTMA
• RI-BTMA: receiver-initiated BTMA– data channel + out-of-band busy tone control channel
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-172
© James P.G. SterbenzITTC
Random Access Wireless MACBTMA Variants: RI-BTMA
• RI-BTMA: receiver-initiated BTMA– data channel + out-of-band busy tone control channel
• Operation– sender transmits preamble with destination station id– receiver asserts busy tone (receiver initiation)– sender transmits data frame if busy tone received
87
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-173
© James P.G. SterbenzITTC
Random Access MACCharacteristics
lowhighlowComplexity
Ethernet802.11802.5 TR802.11
802.16 meshExamples
poorwired: moderatewireless: poorpoorResilience
collisionsdegradation–Consequence of Contention
lowerhigherhighdeterministicLoad Tolerance
ALOHA, slotCSMA
CD, CA
token ringpolling
TDMAFDMA WDMA
SDMATypes
Spread Spectrum
Random Access
Cöordinated Access
Channel PartitioningCharacteristic
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-174
© James P.G. SterbenzITTC
Centralised Random Access MACOverview
• Random access MAC exploiting base station• Examples [GL2000]
– ISMA: idle sense multiple access– RAP: random addressed polling– RAMA: resource auction multiple access
88
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-175
© James P.G. SterbenzITTC
Centralised Random Access MACISMA
• ISMA: idle sense multiple access• CSMA/CD performed by BS (base station)• Base station transmits periodic idle signal (IS) frames• Stations transmit after IS• If no collision, BS replies with ISA (IS ACK)
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-176
© James P.G. SterbenzITTC
Centralised Random Access MACRAP
• RAP: Randomly addressed polling• Each station assigned orthogonal pseudo-random ID• Contention period
– stations wishing to transmit CDMA tranmit ID
• Data phase– BS polls all stations that transmitted– stations reply with data frame
89
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-177
© James P.G. SterbenzITTC
Centralised Random Access MACRAMA
• RAMA: Resource auction multiple access• Each station assigned id
– prioritised
• Contention or auction phase– each station transmits ID bit-by-bit– BS does logical or and replies– stations with mismatch drop out– highest ID (priority) stations win
• Inherently unfair
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-178
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.4 MAC Algorithms for Directional Antennæ
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithmsML.3 Contention-based MAC algorithmsML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
90
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-179
© James P.G. SterbenzITTC
Channel Partitioning MACSDMA and Directional Antennæ
• Assumption so far– omnidirectional antennæ radiate in all directions
problem?
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-180
© James P.G. SterbenzITTC
Channel Partitioning MACSDMA and Directional Antennæ
• Assumption so far– omnidirectional antennæ radiate in all directions– radiate even where not needed– reduce channel capacity
• Directional antennæ– radiate focused beam toward receiver– reduce power use– reduce interference: spatial reuse
• SDMA: space division multiple access MAC– complexity of beam steering and station tracking
91
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-181
© James P.G. SterbenzITTC
Mobile Wireless NetworkingML.5 Wireless Link Protocols
ML.1 MAC and link layer functions and servicesML.2 Contention-free MAC algorithmsML.3 Contention-based MAC algorithmsML.4 MAC algorithms for directional antennæML.5 Wireless link protocols
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-182
© James P.G. SterbenzITTC
Frame Error DetectionChecksum
• Detect errors in PDU• Binary addition of bytes/words
– sender: compute checksum and insert in header/trailer– receiver: compute checksum and compare to header/trailer
Advantages?Disadvantages?
92
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-183
© James P.G. SterbenzITTC
Frame Error DetectionChecksum
• Detect errors in PDU• Binary addition of bytes/words
– sender: compute checksum and insert in header/trailer– receiver: compute checksum and compare to header/trailer
• Advantage:– simple to compute
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-184
© James P.G. SterbenzITTC
Frame Error DetectionChecksum
• Detect errors in PDU• Binary addition of bytes/words
– sender: compute checksum and insert in header/trailer– receiver: compute checksum and compare to header/trailer
• Advantage:– simple to compute
• Disadvantage:– weak detection of errors– some bit-flip combinations may remain undetected– not adequate for error-prone wireless links
93
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-185
© James P.G. SterbenzITTC
Frame Error DetectionCRC
• Cyclic redundancy check– stronger error detection for PDU
CRC
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-186
© James P.G. SterbenzITTC
Frame Error DetectionCRC
• Cyclic redundancy check– stronger error detection for PDU
• View data bits, D, as a binary number– choose r + 1 bit pattern (generator), G
• Goal: choose r CRC bits R such that– <D,R> exactly divisible by G (modulo 2) – receiver knows G, divides <D,R> by G
if non-zero remainder: error detected– can detect all burst errors less than r + 1 bits
D R
d r
94
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-187
© James P.G. SterbenzITTC
Frame Error Detection & CorrectionFEC
• Forward error correction– each PDU has error correcting header– combination of header/payload allows significant correction
DFEC
dh
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-188
© James P.G. SterbenzITTC
Frame Error Detection & CorrectionFEC
• Forward error correction– each PDU has error correcting header– combination of header/payload allows significant correction
• Open-loop error control– errors corrected at the receiver without retransmissions
how does this help?
DFEC
dh
95
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-189
© James P.G. SterbenzITTC
Frame Error Detection & CorrectionFEC
• Forward error correction– each PDU has error correcting header– combination of header/payload allows significant correction
• Open-loop error control– errors corrected at the receiver without retransmissions– reduces need over long delay links for:
• retransmissions• sender buffers
– statistical reliability good enough for some applications– e.g. G.975 (255,239) Reed Solomon code in SDH/SONET
DFEC
dh
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-190
© James P.G. SterbenzITTC
Frame Error Detection & CorrectionFEC
• Forward error correction– each PDU has error correcting header– combination of header/payload allows significant correction
• Open-loop error control– errors corrected at the receiver without retransmissions– reduces need for retransmissions over long delay links– statistical reliability good enough for some applications– e.g. G.975 (255,239) Reed Solomon code in SDH/SONET
• Note: FEC can also be done end-to-end– but TCP doesn’t support it
DFEC
dh
96
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-191
© James P.G. SterbenzITTC
Medium Access and Link LayerFurther Reading
• William Stallings,Wireless Communications and Networks, 2nd ed.Pearson Prentice Hall, Upper Saddle River NJ, 2005.
• [GL2000] Ajay Chandra V. Gummalla, John O. Limb,“Wireless Medium Access Control Protocols”,IEEE Communications Surveys & Tutorials,vol.3 iss.2, 2nd quarter 2000, pp. 2–15
• [KRD2006] Sunil Kumar, Vineet S. Raghavan, and Jing Deng,“Medium Access Control Protocols for Ad Hoc Wireless Networks: A Survey”, Ad Hoc Networks,vol.4, iss.3, May 2006, pp. 326–358
• [KSV2000] Young-Bae Ko, V. Shankarkumar, Nitin H. Vaidya,“Medium Access Control Protocols Using Directional Antennas in Ad Hoc Networks”, INFOCOM 2000, vol.1, March 2000, pp.13–21
29 August 2011 KU EECS 882 – Mobile Wireless Nets – MAC & Link MWN-ML-192
© James P.G. SterbenzITTC
Medium Access and Link LayerAcknowledgements
Some material in these foils is based on the textbook• Murthy and Manoj,
Ad Hoc Wireless Networks:Architectures and Protocolshttp://hsn-book.sterbenz.org
Significant material in these foils enhanced from EECS 780 foils