SlideShare a Scribd company logo
CS6003 ADHOC & SENSOR
NETWORKS
UNIT – II
Dr.A.Kathirvel, Professor and Head, Dept of CSE
Anand Institute of Higher Technology, Chennai
Unit - II
MAC PROTOCOLS FOR AD HOC WIRELESS
NETWORKS
Issues in designing a MAC Protocol- Classification of MAC
Protocols- Contention based protocols- Contention based
protocols with Reservation Mechanisms- Contention
based protocols with Scheduling Mechanisms – Multi
channel MAC-IEEE 802.11
2
3
Issues
The main issues need to be addressed while designing a
MAC protocol for ad hoc wireless networks:
Bandwidth efficiency is defined at the ratio of the
bandwidth used for actual data transmission to the total
available bandwidth. The MAC protocol for ad-hoc
networks should maximize it.
Quality of service support is essential for time-
critical applications. The MAC protocol for ad-hoc
networks should consider the constraint of ad-hoc
networks.
Synchronization can be achieved by exchange of
control packets.
4
Issues
The main issues need to be addressed while designing a MAC protocol for ad
hoc wireless networks:
Hidden and exposed terminal problems:
Hidden nodes:
Hidden stations: Carrier sensing may fail to detect another station.
For example, A and D.
Fading: The strength of radio signals diminished rapidly with the
distance from the transmitter. For example, A and C.
Exposed nodes:
Exposed stations: B is sending to A. C can detect it. C might want to
send to E but conclude it cannot transmit because C hears B.
Collision masking: The local signal might drown out the remote
transmission.
Error-Prone Shared Broadcast Channel
Distributed Nature/Lack of Central Coordination
Mobility of Nodes: Nodes are mobile most of the time.
A)THE HIDDEN STATION PROBLEM. (B) THE EXPOSED STATION PROBLEM.
Hidden & exposed terminal problem
5
6
The Hidden Terminal Problem
Wireless stations have transmission ranges
and not all stations are within radio range of
each other.
Simple CSMA will not work!
C transmits to B.
If A “senses” the channel, it will not hear
C’s transmission and falsely conclude that A
can begin a transmission to B.
7
The Exposed Station Problem
The inverse problem.
B wants to send to C and listens to the
channel.
When B hears A’s transmission, B falsely
assumes that it cannot send to C.
8
Wireless LAN configuration
LAN
Server
Wireless
LAN
Laptops
Base station/
access point
Palmtop
radio obstruction
A B C
D
E
9
Design goals of a MAC Protocol
Design goals of a MAC protocol for ad hoc wireless
networks
The operation of the protocol should be distributed.
The protocol should provide QoS support for real-
time traffic.
The access delay, which refers to the average delay
experienced by any packet to get transmitted, must be
kept low.
The available bandwidth must be utilized efficiently.
The protocol should ensure fair allocation of
bandwidth to nodes.
10
Design goals of a MAC Protocol
Control overhead must be kept as low as possible.
The protocol should minimize the effects of hidden
and exposed terminal problems.
The protocol must be scalable to large networks.
It should have power control mechanisms.
The protocol should have mechanisms for adaptive
data rate control.
It should try to use directional antennas.
The protocol should provide synchronization among
nodes.
11
Classifications of MAC protocols
Ad hoc network MAC protocols can be
classified into three types:
Contention-based protocols
Contention-based protocols with reservation
mechanisms
Contention-based protocols with scheduling
mechanisms
Other MAC protocols
12
Classifications of MAC protocols
MAC Protocols for Ad Hoc
Wireless Networks
Contention-Based
Protocols
Contention-based
protocols with
reservation mechanisms
Other MAC
Protocols
Contention-based
protocols with
scheduling mechanisms
Sender-Initiated
Protocols
Receiver-Initiated
Protocols
Synchronous
Protocols
Asynchronous
Protocols
Single-Channel
Protocols
Multichannel
Protocols
MACAW
FAMA
BTMA
DBTMA
ICSMA
RI-BTMA
MACA-BI
MARCH
D-PRMA
CATA
HRMA
RI-BTMA
MACA-BI
MARCH
SRMA/PA
FPRP
MACA/PR
RTMAC
Directional
Antennas
MMAC
MCSMA
PCM
RBAR
13
Classifications of MAC Protocols
Contention-based protocols
Sender-initiated protocols:
Packet transmissions are initiated by the sender node.
Single-channel sender-initiated protocols: A node that
wins the contention to the channel can make use of the
entire bandwidth.
Multichannel sender-initiated protocols: The available
bandwidth is divided into multiple channels.
Receiver-initiated protocols:
The receiver node initiates the contention resolution
protocol.
14
Classifications of MAC Protocols
Contention-based protocols with reservation
mechanisms
Synchronous protocols
All nodes need to be synchronized. Global
time synchronization is difficult to achieve.
Asynchronous protocols
These protocols use relative time
information for effecting reservations.
15
Classifications of MAC Protocols
Contention-based protocols with scheduling mechanisms
Node scheduling is done in a manner so that all nodes
are treated fairly and no node is starved of bandwidth.
Scheduling-based schemes are also used for enforcing
priorities among flows whose packets are queued at
nodes.
Some scheduling schemes also consider battery
characteristics.
Other protocols are those MAC protocols that do not
strictly fall under the above categories.
16
Contention-based protocols
MACAW: A Media Access Protocol for
Wireless LANs is based on MACA (Multiple
Access Collision Avoidance) Protocol
MACA
When a node wants to transmit a data packet, it first
transmit a RTS (Request To Send) frame.
The receiver node, on receiving the RTS packet, if it
is ready to receive the data packet, transmits a CTS
(Clear to Send) packet.
17
Contention-based protocols
Once the sender receives the CTS packet
without any error, it starts transmitting the data
packet.
If a packet transmitted by a node is lost, the
node uses the binary exponential back-off
(BEB) algorithm to back off a random interval
of time before retrying.
The binary exponential back-off mechanism
used in MACA might starves flows sometimes.
The problem is solved by MACAW.
18
MACA Protocol
The MACA protocol. (a) A sending an RTS to B.
(b) B responding with a CTS to A.
19
MACA avoids the problem of hidden terminals
A and C want to send to B
A sends RTS first
C waits after receiving CTS from B
MACA examples
A B C
RTS
CTSCTS
20
MACA avoids the problem of exposed
terminals
B wants to send to A, C to another terminal
now C does not have to wait for it cannot
receive CTS from A
MACA examples
A B C
RTS
CTS
RTS
21
MACAW
Variants of this method can be found in IEEE 802.11
as DFWMAC (Distributed Foundation Wireless
MAC),
MACAW (MACA for Wireless) is a revision of
MACA.
The sender senses the carrier to see and transmits a
RTS (Request To Send) frame if no nearby station
transmits a RTS.
The receiver replies with a CTS (Clear To Send)
frame.
22
MACAW
Neighbors
see CTS, then keep quiet.
see RTS but not CTS, then keep quiet until the CTS is back
to the sender.
The receiver sends an ACK when receiving an
frame.
Neighbors keep silent until see ACK.
Collisions
There is no collision detection.
The senders know collision when they don’t receive CTS.
They each wait for the exponential backoff time.
23
MACA variant:DFWMAC in 802.11
idle
wait for the
right to send
wait for ACK
sender receiver
packet ready to send; RTS
time-out;
RTS
CTS; data
ACK
RxBusy
idle
wait for
data
RTS; RxBusy
RTS;
CTS
data;
ACK
time-out 
data;
NAK
ACK: positive acknowledgement
NAK: negative acknowledgement
RxBusy: receiver busy
time-out 
NAK;
RTS
24
Contention-based protocols
Floor acquisition Multiple Access Protocols
(FAMA)
Based on a channel access discipline which consists
of a carrier-sensing operation and a collision-
avoidance dialog between the sender and the intended
receiver of a packet.
Floor acquisition refers to the process of gaining
control of the channel.
At any time only one node is assigned to use the
channel.
25
Contention-based protocols
Carrier-sensing by the sender, followed by the RTS-
CTS control packet exchange, enables the protocol to
perform as efficiently as MACA.
Two variations of FAMA
RTS-CTS exchange with no carrier-sensing uses the
ALOHA protocol for transmitting RTS packets.
RTS-CTS exchange with non-persistent carrier-
sensing uses non-persistent CSMA for the same
purpose.
26
Contention-based protocols
Busy Tone Multiple Access Protocols (BTMA)
The transmission channel is split into two:
a data channel for data packet transmissions
a control channel used to transmit the busy tone signal
When a node is ready for transmission, it senses the channel to
check whether the busy tone is active.
If not, it turns on the busy tone signal and starts data
transmissions
Otherwise, it reschedules the packet for transmission after
some random rescheduling delay.
Any other node which senses the carrier on the incoming
data channel also transmits the busy tone signal on the
control channel, thus, prevent two neighboring nodes from
transmitting at the same time.
27
Contention-based protocols
Dual Busy Tone Multiple Access Protocol
(DBTMAP) is an extension of the BTMA
scheme.
a data channel for data packet transmissions
a control channel used for control packet
transmissions (RTS and CTS packets) and also
for transmitting the busy tones.
28
Contention-based protocols
Receiver-Initiated Busy Tone Multiple Access Protocol
(RI-BTMA)
The transmission channel is split into two:
a data channel for data packet transmissions
a control channel used for transmitting the busy
tone signal
A node can transmit on the data channel only if it
finds the busy tone to be absent on the control
channel.
The data packet is divided into two portions: a
preamble and the actual data packet.
29
Contention-based protocols
MACA-By Invitation (MACA-BI) is a receiver-
initiated MAC protocol.
By eliminating the need for the RTS packet it
reduces the number of control packets used in
the MACA protocol which uses the three-way
handshake mechanism.
Media Access with Reduced Handshake
(MARCH) is a receiver-initiated protocol.
30
Contention-based Protocols with
Reservation Mechanisms
Contention-based Protocols with Reservation
Mechanisms
Contention occurs during the resource (bandwidth)
reservation phase.
Once the bandwidth is reserved, the node gets
exclusive access to the reserved bandwidth.
QoS support can be provided for real-time traffic.
31
Contention-based Protocols with
Reservation Mechanisms
Distributed packet reservation multiple access protocol
(D-PRMA)
It extends the centralized packet reservation multiple
access (PRMA) scheme into a distributed scheme that
can be used in ad hoc wireless networks.
PRMA was designed in a wireless LAN with a base
station.
D-PRMA extends PRMA protocol in a wireless
LAN.
D-PRMA is a TDMA-based scheme. The channel is
divided into fixed- and equal-sized frames along the
time axis.
32
Access method DAMA: Reservation-
TDMA
 Reservation Time Division Multiple Access
every frame consists of N mini-slots and x data-slots
every station has its own mini-slot and can reserve up to k
data-slots using this mini-slot (i.e. x = N * k).
other stations can send data in unused data-slots according to a
round-robin sending scheme (best-effort traffic)
N mini-slots N * k data-slots
reservations
for data-slots
other stations can use free data-slots
based on a round-robin scheme
e.g. N=6, k=2
33
Distributed Packet Reservation
Multiple Access Protocol (D-PRMA)
Implicit reservation (PRMA - Packet
Reservation Multiple Access)
frame1
frame2
frame3
frame4
frame5
1 2 3 4 5 6 7 8 time-slot
collision at
reservation
attempts
A C D A B A F
A C A B A
A B A F
A B A F D
A C E E B A F D
t
ACDABA-F
ACDABA-F
AC-ABAF-
A---BAFD
ACEEBAFD
reservation
33
Distributed Packet Reservation
Multiple Access Protocol (D-PRMA)
a certain number of slots form a frame, frames are
repeated
stations compete for empty slots according to the
slotted aloha principle
once a station reserves a slot successfully, this slot is
automatically assigned to this station in all following
frames as long as the station has data to send
competition for this slots starts again as soon as the
slot was empty in the last frame
34
35
Contention-based protocols
with Reservation Mechanisms
Collision avoidance time allocation protocol (CATA)
based on dynamic topology-dependent transmission
scheduling
Nodes contend for and reserve time slots by means
of a distributed reservation and handshake
mechanism.
Support broadcast, unicast, and multicast
transmissions.
36
Contention-based protocols
with Reservation Mechanisms
The operation is based on two basic principles:
The receiver(s) of a flow must inform the potential source
nodes about the reserved slot on which it is currently
receiving packets. The source node must inform the
potential destination node(s) about interferences in the
slot.
Usage of negative acknowledgements for reservation
requests, and control packet transmissions at the beginning
of each slot, for distributing slot reservation information to
senders of broadcast or multicast sessions.
37
Contention-based protocols
with Reservation Mechanisms
Hop reservation multiple access protocol (HRMA)
a multichannel MAC protocol which is based on
half-duplex, very slow frequency-hopping spread
spectrum (FHSS) radios
uses a reservation and handshake mechanism to
enable a pair of communicating nodes to reserve a
frequency hop, thereby guaranteeing collision-free
data transmission.
can be viewed as a time slot reservation protocol
where each time slot is assigned a separate frequency
channel.
38
Contention-based protocols
with Reservation Mechanisms
Soft reservation multiple access with priority
assignment (SRMA/PA)
Developed with the main objective of
supporting integrated services of real-time and
non-real-time application in ad hoc networks,
at the same time maximizing the statistical
multiplexing gain.
Nodes use a collision-avoidance handshake
mechanism and a soft reservation mechanism.
39
Five-Phase Reservation Protocol (FPRP)
a single-channel time division multiple access
(TDMA)-based broadcast scheduling protocol.
Nodes uses a contention mechanism in order to
acquire time slots.
The protocol assumes the availability of global time
at all nodes.
The reservation takes five phases: reservation,
collision report, reservation confirmation, reservation
acknowledgement, and packing and elimination
phase.
Contention-based protocols
with Reservation Mechanisms
40
MACA with Piggy-Backed Reservation (MACA/PR)
Provide real-time traffic support in multi-hop
wireless networks
Based on the MACAW protocol with non-persistent
CSMA
The main components of MACA/PR are:
A MAC protocol
A reservation protocol
A QoS routing protocol
Contention-based protocols
with Reservation Mechanisms
41
Real-Time Medium Access Control Protocol (RTMAC)
Provides a bandwidth reservation mechanism for
supporting real-time traffic in ad hoc wireless networks
RTMAC has two components
A MAC layer protocol is a real-time extension of the
IEEE 802.11 DCF.
A medium-access protocol for best-effort traffic
A reservation protocol for real-time traffic
A QoS routing protocol is responsible for end-to-end
reservation and release of bandwidth resources.
Contention-based protocols
with Reservation Mechanisms
42
Protocols in this category focus on packet
scheduling at the nodes and transmission
scheduling of the nodes.
The factors that affects scheduling decisions
Delay targets of packets
Traffic load at nodes
Battery power
Contention-based protocols
with Scheduling Mechanisms
43
Distributed priority scheduling and medium
access in Ad Hoc Networks present two
mechanisms for providing quality of service
(QoS)
Distributed priority scheduling (DPS) – piggy-backs
the priority tag of a node’s current and head-of-line
packets o the control and data packets
Multi-hop coordination – extends the DPS scheme to
carry out scheduling over multi-hop paths.
Contention-based protocols
with Scheduling Mechanisms
44
Distributed Wireless Ordering Protocol (DWOP)
A media access scheme along with a scheduling
mechanism
Based on the distributed priority scheduling scheme
Contention-based protocols
with Scheduling Mechanisms
45
Distributed Laxity-based Priority Scheduling (DLPS)
Scheme
Scheduling decisions are made based on
The states of neighboring nodes and feed back from
destination nodes regarding packet losses
Packets are recorded based on their uniform laxity
budgets (ULBs) and the packet delivery ratios of the
flows. The laxity of a packet is the time remaining
before its deadline.
Contention-based protocols
with Scheduling Mechanisms
46
MAC protocols that use directional antennas have
several advantages:
Reduce signal interference
Increase in the system throughput
Improved channel reuse
MAC protocol using directional antennas
Make use of an RTS/CTS exchange mechanism
Use directional antennas for transmitting and
receiving data packets
MAC Protocols that use directional
Antennas
47
Directional Busy Tone-based MAC Protocol (DBTMA)
It uses directional antennas for transmitting the RTS,
CTS, data frames, and the busy tones.
Directional MAC Protocols for Ad Hoc Wireless
Networks
DMAC-1, a directional antenna is used for
transmitting RTS packets and omni-directional antenna
for CTS packets.
DMAC-1, both directional RTS and omni-directional
RTS transmission are used.
MAC Protocols that use directional
Antennas
48
Other MAC Protocols
Multi-channel MAC Protocol (MMAC)
Multiple channels for data transmission
There is no dedicated control channel.
Based on channel usage channels can be classified into three types: high
preference channel (HIGH), medium preference channel (MID), low
preference channel (LOW)
Multi-channel CSMA MAC Protocol (MCSMA)
The available bandwidth is divided into several channels
Power Control MAC Protocol (PCM) for Ad Hoc Networks
Allows nodes to vary their transmission power levels on a per-packet basis
Receiver-based Autorate Protocol (RBAR)
Use a rate adaptation approach
Interleaved Carrier-Sense Multiple Access Protocol (ICSMA)
The available bandwidth is split into tow equal channels
The handshaking process is interleaved between the two channels.
What is IEEE 802.11?
Standard for wireless local area networks (wireless
LANs) developed in 1990 by IEEE
Intended for home or office use (primarily indoor)
802.11 standard describes the MAC layer, while
other substandards (802.11a, 802.11b) describe the
physical layer
Wireless version of the Ethernet (802.3) standard
49
Network Setup
Ethernet
MT
AP AP AP
MT MT
Basic Network Setup is Cellular
Mobile Terminals (MT) connect with Access Points (AP)
Standard also supports ad-hoc networking where MT’s talk directly to MT’s
50
IEEE 802.11 Physical Layers
802.11b 802.11a
Modulation Scheme DSSS OFDM
Spectrum (GHz) 2.4 – 2.485 5.15-5.35, 5.725-5.825
Data Rate (Mbps) 1 – 11 6 - 54
Subchannels 11 overlapping 8 independent
Interference Microwave, Cordless
Phones,Bluetooth,
HomeRF, Light Bulbs!
HyperLAN II
Availability Today Late August?
Cost $250 AP, $100 PC Card ??? (same)
51
Media Access Control - Ethernet
 CSMA/CD (Carrier Sense Multiple Access with Collision
Detection)
If media is sensed idle, transmit
If media is sensed busy, wait until idle and then transmit
immediately
 Collisions can occur if more than one user transmits at the same
time
If a collision is detected, stop transmitting.
Reschedule transmission according to exponential backoff
Desktop System Desktop System Desktop System
Ethernet
52
Media Access Control (802.11)
Would like to use CSMA
Nice for bursty traffic
Make for seamless replacement of wired LANs with
wireless LANS
Use CSMA, but can’t use CD
PT/PR ratio is too high
Don’t want to waste energy on mobiles
Use Collision Avoidance instead
Don’t always start transmitting immediately after
someone else
53
CSMA/CA Details
SIFS (Short Interframe Space)
DIFS (Distributed Interframe Space)
Packet A ACK
B C
SIFS DIFS
Packet C ACK
SIFS DIFS
Packet B
Scenario:
B and C want to transmit, but A currently has control of medium
B randomly selects 7 slots of backoff, C selects 4 slots
C transmits first, then B
54
What is HIPERLAN/2?
European standard developed by ETSI/BRAN
(European Telecommunications Standards
Institute/Broadband Radio Access Networks)
Physical Layer is very similar to 802.11a
(OFDM operating in the 5 GHz spectrum)
Standard based on wireless ATM
(Asynchronous Transfer Mode)
55
HIPERLAN/2 MAC
BCH – Miscellaneous header
FCH – Details how the DL and UL phases will be allocated
ACH – Feedback on which resource requests were received
RCH – Random access resource request
56
Performance Comparison
57
IEEE 802.11
IEEE 802.11 is a widely accepted standard in the United
States for wireless LANs
Primarily a “cellular” random access scheme with
provisions for ad hoc networking and contention free
access
802.11b products are available now, but better to wait
for 802.11a products later this year
HIPERLAN/2 is being pushed in Europe
Wireless ATM solution for real-time traffic
Standard reflects the network topology
58
Questions ?

More Related Content

PPTX
Routing Protocols in WSN
PPTX
PPTX
Contention based MAC protocols
PPTX
WSN NETWORK -MAC PROTOCOLS - Low Duty Cycle Protocols And Wakeup Concepts – ...
PPT
Small scale fading
PDF
Sensor Networks Introduction and Architecture
PDF
EC8702 adhoc and wireless sensor networks iv ece
PPTX
MEDIUM ACCESS CONTROL
Routing Protocols in WSN
Contention based MAC protocols
WSN NETWORK -MAC PROTOCOLS - Low Duty Cycle Protocols And Wakeup Concepts – ...
Small scale fading
Sensor Networks Introduction and Architecture
EC8702 adhoc and wireless sensor networks iv ece
MEDIUM ACCESS CONTROL

What's hot (20)

PDF
Issues in routing protocol
PDF
Lecture 19 22. transport protocol for ad-hoc
PPT
SPACE DIVISION MULTIPLEXING (SDMA)
PPTX
Classification of routing protocols
PDF
EIA / TIA IS-136 Digital Cellular System
PPT
Mobile computing unit2,SDMA,FDMA,CDMA,TDMA Space Division Multi Access,Frequ...
PPT
Channel assignment strategies
PPT
Hamming codes
PPTX
WSN-IEEE 802.15.4 -MAC Protocol
PPTX
TDMA Time Division Multiple Access
PDF
Lecture 23 27. quality of services in ad hoc wireless networks
PPTX
WSN network architecture -Sensor Network Scenarios & Transceiver Design Consi...
PPT
Wsn 08
PPSX
Adhoc and routing protocols
PPTX
T mac protocol
PPTX
Chap 5 (small scale fading)
PPT
Mobile ad hoc networks (manets)
PDF
2.1 introduction to cellular architecture
PPTX
Adhoc wireless networks and its issues
PDF
Satellite Link Design: Basic Transmission Theory & Noise Temperature
Issues in routing protocol
Lecture 19 22. transport protocol for ad-hoc
SPACE DIVISION MULTIPLEXING (SDMA)
Classification of routing protocols
EIA / TIA IS-136 Digital Cellular System
Mobile computing unit2,SDMA,FDMA,CDMA,TDMA Space Division Multi Access,Frequ...
Channel assignment strategies
Hamming codes
WSN-IEEE 802.15.4 -MAC Protocol
TDMA Time Division Multiple Access
Lecture 23 27. quality of services in ad hoc wireless networks
WSN network architecture -Sensor Network Scenarios & Transceiver Design Consi...
Wsn 08
Adhoc and routing protocols
T mac protocol
Chap 5 (small scale fading)
Mobile ad hoc networks (manets)
2.1 introduction to cellular architecture
Adhoc wireless networks and its issues
Satellite Link Design: Basic Transmission Theory & Noise Temperature
Ad

Viewers also liked (20)

PPT
CS6003 AD HOC AND SENSOR NETWORKS
PDF
CS6003 AD HOC AND SENSOR NETWORKS
PPTX
Ad-Hoc Networks
PPT
Mac adhoc
PPSX
Mac protocols of adhoc network
PPTX
Wsn ppt original
PPTX
wireless sensor network my seminar ppt
PPT
Mac adhoc
PPT
Adhoc and Sensor Networks - Chapter 02
PDF
Advanced Networking on GloMoSim
PDF
Advanced Computing Techonologies
PDF
CS6551 COMPUTER NETWORKS
PDF
CS6551 COMPUTER NETWORKS
PPT
Transportlayer tanenbaum
PDF
Advanced Computing Techonologies
PDF
VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015
PDF
CS6551 COMPUTER NETWORKS
PDF
CS6551 COMPUTER NETWORKS
PDF
IT6601 MOBILE COMPUTING
PDF
CS6601 DISTRIBUTED SYSTEMS
CS6003 AD HOC AND SENSOR NETWORKS
CS6003 AD HOC AND SENSOR NETWORKS
Ad-Hoc Networks
Mac adhoc
Mac protocols of adhoc network
Wsn ppt original
wireless sensor network my seminar ppt
Mac adhoc
Adhoc and Sensor Networks - Chapter 02
Advanced Networking on GloMoSim
Advanced Computing Techonologies
CS6551 COMPUTER NETWORKS
CS6551 COMPUTER NETWORKS
Transportlayer tanenbaum
Advanced Computing Techonologies
VTU 8TH SEM CSE ADHOC NETWORKS SOLVED PAPERS OF JUNE-2014 DEC-14 & JUNE-2015
CS6551 COMPUTER NETWORKS
CS6551 COMPUTER NETWORKS
IT6601 MOBILE COMPUTING
CS6601 DISTRIBUTED SYSTEMS
Ad

Similar to CS6003 ADHOC & SENSOR NETWORKS (20)

PPT
mac-adhoc.ppt
PPT
mac-adhoc.ppt
PPT
Mac adhoc (1)
PPT
14653128.ppt
PPTX
Wireless sensor networks unit 3 ppt is rhere
PPTX
Technical seminar
PPTX
Mac protocols for ad hoc wireless networks
PPT
lecture-mac-802.111111111111111111111111.ppt
PPT
lecture-mac-823VDVDVDVDFVFVFDVDFVDFV02.11.ppt
PPTX
Mac protocols
PPTX
Unit_3_WSN.pptx
PDF
Lect04 (1)
PDF
Lect04
PPTX
W13-L1&2.pptx
PPTX
wireless sensor network
PPTX
Wireless sensors networks protocols
PPT
wireless.ppt
PPTX
Chapter_03_Data Link Layer and its protocols.pptx
PPT
mac-adhoc.ppt
mac-adhoc.ppt
Mac adhoc (1)
14653128.ppt
Wireless sensor networks unit 3 ppt is rhere
Technical seminar
Mac protocols for ad hoc wireless networks
lecture-mac-802.111111111111111111111111.ppt
lecture-mac-823VDVDVDVDFVFVFDVDFVDFV02.11.ppt
Mac protocols
Unit_3_WSN.pptx
Lect04 (1)
Lect04
W13-L1&2.pptx
wireless sensor network
Wireless sensors networks protocols
wireless.ppt
Chapter_03_Data Link Layer and its protocols.pptx

More from Kathirvel Ayyaswamy (20)

PDF
22CS201 COA
PDF
22cs201 COMPUTER ORGANIZATION AND ARCHITECTURE
PDF
22CS201 COA
PDF
18CS3040_Distributed Systems
PDF
20CS2021-Distributed Computing module 2
PDF
18CS3040 Distributed System
PDF
20CS2021 Distributed Computing
PDF
20CS2021 DISTRIBUTED COMPUTING
PDF
18CS3040 DISTRIBUTED SYSTEMS
PDF
Recent Trends in IoT and Sustainability
PDF
20CS2008 Computer Networks
PDF
18CS2005 Cryptography and Network Security
PDF
18CS2005 Cryptography and Network Security
PDF
18CS2005 Cryptography and Network Security
PDF
18CS2005 Cryptography and Network Security
PDF
18CS2005 Cryptography and Network Security
PDF
18CS2005 Cryptography and Network Security
PDF
20CS2008 Computer Networks
PDF
20CS2008 Computer Networks
PDF
20CS024 Ethics in Information Technology
22CS201 COA
22cs201 COMPUTER ORGANIZATION AND ARCHITECTURE
22CS201 COA
18CS3040_Distributed Systems
20CS2021-Distributed Computing module 2
18CS3040 Distributed System
20CS2021 Distributed Computing
20CS2021 DISTRIBUTED COMPUTING
18CS3040 DISTRIBUTED SYSTEMS
Recent Trends in IoT and Sustainability
20CS2008 Computer Networks
18CS2005 Cryptography and Network Security
18CS2005 Cryptography and Network Security
18CS2005 Cryptography and Network Security
18CS2005 Cryptography and Network Security
18CS2005 Cryptography and Network Security
18CS2005 Cryptography and Network Security
20CS2008 Computer Networks
20CS2008 Computer Networks
20CS024 Ethics in Information Technology

Recently uploaded (20)

PPTX
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
PDF
Digital Logic Computer Design lecture notes
PPTX
CYBER-CRIMES AND SECURITY A guide to understanding
PDF
PPT on Performance Review to get promotions
PDF
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
PDF
TFEC-4-2020-Design-Guide-for-Timber-Roof-Trusses.pdf
PPTX
CH1 Production IntroductoryConcepts.pptx
PDF
Enhancing Cyber Defense Against Zero-Day Attacks using Ensemble Neural Networks
PDF
R24 SURVEYING LAB MANUAL for civil enggi
DOCX
573137875-Attendance-Management-System-original
PPTX
KTU 2019 -S7-MCN 401 MODULE 2-VINAY.pptx
PDF
Evaluating the Democratization of the Turkish Armed Forces from a Normative P...
PPTX
MCN 401 KTU-2019-PPE KITS-MODULE 2.pptx
PDF
BMEC211 - INTRODUCTION TO MECHATRONICS-1.pdf
PDF
The CXO Playbook 2025 – Future-Ready Strategies for C-Suite Leaders Cerebrai...
PPT
Project quality management in manufacturing
PPTX
Welding lecture in detail for understanding
PDF
Embodied AI: Ushering in the Next Era of Intelligent Systems
PDF
Operating System & Kernel Study Guide-1 - converted.pdf
PDF
Automation-in-Manufacturing-Chapter-Introduction.pdf
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
Digital Logic Computer Design lecture notes
CYBER-CRIMES AND SECURITY A guide to understanding
PPT on Performance Review to get promotions
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
TFEC-4-2020-Design-Guide-for-Timber-Roof-Trusses.pdf
CH1 Production IntroductoryConcepts.pptx
Enhancing Cyber Defense Against Zero-Day Attacks using Ensemble Neural Networks
R24 SURVEYING LAB MANUAL for civil enggi
573137875-Attendance-Management-System-original
KTU 2019 -S7-MCN 401 MODULE 2-VINAY.pptx
Evaluating the Democratization of the Turkish Armed Forces from a Normative P...
MCN 401 KTU-2019-PPE KITS-MODULE 2.pptx
BMEC211 - INTRODUCTION TO MECHATRONICS-1.pdf
The CXO Playbook 2025 – Future-Ready Strategies for C-Suite Leaders Cerebrai...
Project quality management in manufacturing
Welding lecture in detail for understanding
Embodied AI: Ushering in the Next Era of Intelligent Systems
Operating System & Kernel Study Guide-1 - converted.pdf
Automation-in-Manufacturing-Chapter-Introduction.pdf

CS6003 ADHOC & SENSOR NETWORKS

  • 1. CS6003 ADHOC & SENSOR NETWORKS UNIT – II Dr.A.Kathirvel, Professor and Head, Dept of CSE Anand Institute of Higher Technology, Chennai
  • 2. Unit - II MAC PROTOCOLS FOR AD HOC WIRELESS NETWORKS Issues in designing a MAC Protocol- Classification of MAC Protocols- Contention based protocols- Contention based protocols with Reservation Mechanisms- Contention based protocols with Scheduling Mechanisms – Multi channel MAC-IEEE 802.11 2
  • 3. 3 Issues The main issues need to be addressed while designing a MAC protocol for ad hoc wireless networks: Bandwidth efficiency is defined at the ratio of the bandwidth used for actual data transmission to the total available bandwidth. The MAC protocol for ad-hoc networks should maximize it. Quality of service support is essential for time- critical applications. The MAC protocol for ad-hoc networks should consider the constraint of ad-hoc networks. Synchronization can be achieved by exchange of control packets.
  • 4. 4 Issues The main issues need to be addressed while designing a MAC protocol for ad hoc wireless networks: Hidden and exposed terminal problems: Hidden nodes: Hidden stations: Carrier sensing may fail to detect another station. For example, A and D. Fading: The strength of radio signals diminished rapidly with the distance from the transmitter. For example, A and C. Exposed nodes: Exposed stations: B is sending to A. C can detect it. C might want to send to E but conclude it cannot transmit because C hears B. Collision masking: The local signal might drown out the remote transmission. Error-Prone Shared Broadcast Channel Distributed Nature/Lack of Central Coordination Mobility of Nodes: Nodes are mobile most of the time.
  • 5. A)THE HIDDEN STATION PROBLEM. (B) THE EXPOSED STATION PROBLEM. Hidden & exposed terminal problem 5
  • 6. 6 The Hidden Terminal Problem Wireless stations have transmission ranges and not all stations are within radio range of each other. Simple CSMA will not work! C transmits to B. If A “senses” the channel, it will not hear C’s transmission and falsely conclude that A can begin a transmission to B.
  • 7. 7 The Exposed Station Problem The inverse problem. B wants to send to C and listens to the channel. When B hears A’s transmission, B falsely assumes that it cannot send to C.
  • 8. 8 Wireless LAN configuration LAN Server Wireless LAN Laptops Base station/ access point Palmtop radio obstruction A B C D E
  • 9. 9 Design goals of a MAC Protocol Design goals of a MAC protocol for ad hoc wireless networks The operation of the protocol should be distributed. The protocol should provide QoS support for real- time traffic. The access delay, which refers to the average delay experienced by any packet to get transmitted, must be kept low. The available bandwidth must be utilized efficiently. The protocol should ensure fair allocation of bandwidth to nodes.
  • 10. 10 Design goals of a MAC Protocol Control overhead must be kept as low as possible. The protocol should minimize the effects of hidden and exposed terminal problems. The protocol must be scalable to large networks. It should have power control mechanisms. The protocol should have mechanisms for adaptive data rate control. It should try to use directional antennas. The protocol should provide synchronization among nodes.
  • 11. 11 Classifications of MAC protocols Ad hoc network MAC protocols can be classified into three types: Contention-based protocols Contention-based protocols with reservation mechanisms Contention-based protocols with scheduling mechanisms Other MAC protocols
  • 12. 12 Classifications of MAC protocols MAC Protocols for Ad Hoc Wireless Networks Contention-Based Protocols Contention-based protocols with reservation mechanisms Other MAC Protocols Contention-based protocols with scheduling mechanisms Sender-Initiated Protocols Receiver-Initiated Protocols Synchronous Protocols Asynchronous Protocols Single-Channel Protocols Multichannel Protocols MACAW FAMA BTMA DBTMA ICSMA RI-BTMA MACA-BI MARCH D-PRMA CATA HRMA RI-BTMA MACA-BI MARCH SRMA/PA FPRP MACA/PR RTMAC Directional Antennas MMAC MCSMA PCM RBAR
  • 13. 13 Classifications of MAC Protocols Contention-based protocols Sender-initiated protocols: Packet transmissions are initiated by the sender node. Single-channel sender-initiated protocols: A node that wins the contention to the channel can make use of the entire bandwidth. Multichannel sender-initiated protocols: The available bandwidth is divided into multiple channels. Receiver-initiated protocols: The receiver node initiates the contention resolution protocol.
  • 14. 14 Classifications of MAC Protocols Contention-based protocols with reservation mechanisms Synchronous protocols All nodes need to be synchronized. Global time synchronization is difficult to achieve. Asynchronous protocols These protocols use relative time information for effecting reservations.
  • 15. 15 Classifications of MAC Protocols Contention-based protocols with scheduling mechanisms Node scheduling is done in a manner so that all nodes are treated fairly and no node is starved of bandwidth. Scheduling-based schemes are also used for enforcing priorities among flows whose packets are queued at nodes. Some scheduling schemes also consider battery characteristics. Other protocols are those MAC protocols that do not strictly fall under the above categories.
  • 16. 16 Contention-based protocols MACAW: A Media Access Protocol for Wireless LANs is based on MACA (Multiple Access Collision Avoidance) Protocol MACA When a node wants to transmit a data packet, it first transmit a RTS (Request To Send) frame. The receiver node, on receiving the RTS packet, if it is ready to receive the data packet, transmits a CTS (Clear to Send) packet.
  • 17. 17 Contention-based protocols Once the sender receives the CTS packet without any error, it starts transmitting the data packet. If a packet transmitted by a node is lost, the node uses the binary exponential back-off (BEB) algorithm to back off a random interval of time before retrying. The binary exponential back-off mechanism used in MACA might starves flows sometimes. The problem is solved by MACAW.
  • 18. 18 MACA Protocol The MACA protocol. (a) A sending an RTS to B. (b) B responding with a CTS to A.
  • 19. 19 MACA avoids the problem of hidden terminals A and C want to send to B A sends RTS first C waits after receiving CTS from B MACA examples A B C RTS CTSCTS
  • 20. 20 MACA avoids the problem of exposed terminals B wants to send to A, C to another terminal now C does not have to wait for it cannot receive CTS from A MACA examples A B C RTS CTS RTS
  • 21. 21 MACAW Variants of this method can be found in IEEE 802.11 as DFWMAC (Distributed Foundation Wireless MAC), MACAW (MACA for Wireless) is a revision of MACA. The sender senses the carrier to see and transmits a RTS (Request To Send) frame if no nearby station transmits a RTS. The receiver replies with a CTS (Clear To Send) frame.
  • 22. 22 MACAW Neighbors see CTS, then keep quiet. see RTS but not CTS, then keep quiet until the CTS is back to the sender. The receiver sends an ACK when receiving an frame. Neighbors keep silent until see ACK. Collisions There is no collision detection. The senders know collision when they don’t receive CTS. They each wait for the exponential backoff time.
  • 23. 23 MACA variant:DFWMAC in 802.11 idle wait for the right to send wait for ACK sender receiver packet ready to send; RTS time-out; RTS CTS; data ACK RxBusy idle wait for data RTS; RxBusy RTS; CTS data; ACK time-out  data; NAK ACK: positive acknowledgement NAK: negative acknowledgement RxBusy: receiver busy time-out  NAK; RTS
  • 24. 24 Contention-based protocols Floor acquisition Multiple Access Protocols (FAMA) Based on a channel access discipline which consists of a carrier-sensing operation and a collision- avoidance dialog between the sender and the intended receiver of a packet. Floor acquisition refers to the process of gaining control of the channel. At any time only one node is assigned to use the channel.
  • 25. 25 Contention-based protocols Carrier-sensing by the sender, followed by the RTS- CTS control packet exchange, enables the protocol to perform as efficiently as MACA. Two variations of FAMA RTS-CTS exchange with no carrier-sensing uses the ALOHA protocol for transmitting RTS packets. RTS-CTS exchange with non-persistent carrier- sensing uses non-persistent CSMA for the same purpose.
  • 26. 26 Contention-based protocols Busy Tone Multiple Access Protocols (BTMA) The transmission channel is split into two: a data channel for data packet transmissions a control channel used to transmit the busy tone signal When a node is ready for transmission, it senses the channel to check whether the busy tone is active. If not, it turns on the busy tone signal and starts data transmissions Otherwise, it reschedules the packet for transmission after some random rescheduling delay. Any other node which senses the carrier on the incoming data channel also transmits the busy tone signal on the control channel, thus, prevent two neighboring nodes from transmitting at the same time.
  • 27. 27 Contention-based protocols Dual Busy Tone Multiple Access Protocol (DBTMAP) is an extension of the BTMA scheme. a data channel for data packet transmissions a control channel used for control packet transmissions (RTS and CTS packets) and also for transmitting the busy tones.
  • 28. 28 Contention-based protocols Receiver-Initiated Busy Tone Multiple Access Protocol (RI-BTMA) The transmission channel is split into two: a data channel for data packet transmissions a control channel used for transmitting the busy tone signal A node can transmit on the data channel only if it finds the busy tone to be absent on the control channel. The data packet is divided into two portions: a preamble and the actual data packet.
  • 29. 29 Contention-based protocols MACA-By Invitation (MACA-BI) is a receiver- initiated MAC protocol. By eliminating the need for the RTS packet it reduces the number of control packets used in the MACA protocol which uses the three-way handshake mechanism. Media Access with Reduced Handshake (MARCH) is a receiver-initiated protocol.
  • 30. 30 Contention-based Protocols with Reservation Mechanisms Contention-based Protocols with Reservation Mechanisms Contention occurs during the resource (bandwidth) reservation phase. Once the bandwidth is reserved, the node gets exclusive access to the reserved bandwidth. QoS support can be provided for real-time traffic.
  • 31. 31 Contention-based Protocols with Reservation Mechanisms Distributed packet reservation multiple access protocol (D-PRMA) It extends the centralized packet reservation multiple access (PRMA) scheme into a distributed scheme that can be used in ad hoc wireless networks. PRMA was designed in a wireless LAN with a base station. D-PRMA extends PRMA protocol in a wireless LAN. D-PRMA is a TDMA-based scheme. The channel is divided into fixed- and equal-sized frames along the time axis.
  • 32. 32 Access method DAMA: Reservation- TDMA  Reservation Time Division Multiple Access every frame consists of N mini-slots and x data-slots every station has its own mini-slot and can reserve up to k data-slots using this mini-slot (i.e. x = N * k). other stations can send data in unused data-slots according to a round-robin sending scheme (best-effort traffic) N mini-slots N * k data-slots reservations for data-slots other stations can use free data-slots based on a round-robin scheme e.g. N=6, k=2
  • 33. 33 Distributed Packet Reservation Multiple Access Protocol (D-PRMA) Implicit reservation (PRMA - Packet Reservation Multiple Access) frame1 frame2 frame3 frame4 frame5 1 2 3 4 5 6 7 8 time-slot collision at reservation attempts A C D A B A F A C A B A A B A F A B A F D A C E E B A F D t ACDABA-F ACDABA-F AC-ABAF- A---BAFD ACEEBAFD reservation 33
  • 34. Distributed Packet Reservation Multiple Access Protocol (D-PRMA) a certain number of slots form a frame, frames are repeated stations compete for empty slots according to the slotted aloha principle once a station reserves a slot successfully, this slot is automatically assigned to this station in all following frames as long as the station has data to send competition for this slots starts again as soon as the slot was empty in the last frame 34
  • 35. 35 Contention-based protocols with Reservation Mechanisms Collision avoidance time allocation protocol (CATA) based on dynamic topology-dependent transmission scheduling Nodes contend for and reserve time slots by means of a distributed reservation and handshake mechanism. Support broadcast, unicast, and multicast transmissions.
  • 36. 36 Contention-based protocols with Reservation Mechanisms The operation is based on two basic principles: The receiver(s) of a flow must inform the potential source nodes about the reserved slot on which it is currently receiving packets. The source node must inform the potential destination node(s) about interferences in the slot. Usage of negative acknowledgements for reservation requests, and control packet transmissions at the beginning of each slot, for distributing slot reservation information to senders of broadcast or multicast sessions.
  • 37. 37 Contention-based protocols with Reservation Mechanisms Hop reservation multiple access protocol (HRMA) a multichannel MAC protocol which is based on half-duplex, very slow frequency-hopping spread spectrum (FHSS) radios uses a reservation and handshake mechanism to enable a pair of communicating nodes to reserve a frequency hop, thereby guaranteeing collision-free data transmission. can be viewed as a time slot reservation protocol where each time slot is assigned a separate frequency channel.
  • 38. 38 Contention-based protocols with Reservation Mechanisms Soft reservation multiple access with priority assignment (SRMA/PA) Developed with the main objective of supporting integrated services of real-time and non-real-time application in ad hoc networks, at the same time maximizing the statistical multiplexing gain. Nodes use a collision-avoidance handshake mechanism and a soft reservation mechanism.
  • 39. 39 Five-Phase Reservation Protocol (FPRP) a single-channel time division multiple access (TDMA)-based broadcast scheduling protocol. Nodes uses a contention mechanism in order to acquire time slots. The protocol assumes the availability of global time at all nodes. The reservation takes five phases: reservation, collision report, reservation confirmation, reservation acknowledgement, and packing and elimination phase. Contention-based protocols with Reservation Mechanisms
  • 40. 40 MACA with Piggy-Backed Reservation (MACA/PR) Provide real-time traffic support in multi-hop wireless networks Based on the MACAW protocol with non-persistent CSMA The main components of MACA/PR are: A MAC protocol A reservation protocol A QoS routing protocol Contention-based protocols with Reservation Mechanisms
  • 41. 41 Real-Time Medium Access Control Protocol (RTMAC) Provides a bandwidth reservation mechanism for supporting real-time traffic in ad hoc wireless networks RTMAC has two components A MAC layer protocol is a real-time extension of the IEEE 802.11 DCF. A medium-access protocol for best-effort traffic A reservation protocol for real-time traffic A QoS routing protocol is responsible for end-to-end reservation and release of bandwidth resources. Contention-based protocols with Reservation Mechanisms
  • 42. 42 Protocols in this category focus on packet scheduling at the nodes and transmission scheduling of the nodes. The factors that affects scheduling decisions Delay targets of packets Traffic load at nodes Battery power Contention-based protocols with Scheduling Mechanisms
  • 43. 43 Distributed priority scheduling and medium access in Ad Hoc Networks present two mechanisms for providing quality of service (QoS) Distributed priority scheduling (DPS) – piggy-backs the priority tag of a node’s current and head-of-line packets o the control and data packets Multi-hop coordination – extends the DPS scheme to carry out scheduling over multi-hop paths. Contention-based protocols with Scheduling Mechanisms
  • 44. 44 Distributed Wireless Ordering Protocol (DWOP) A media access scheme along with a scheduling mechanism Based on the distributed priority scheduling scheme Contention-based protocols with Scheduling Mechanisms
  • 45. 45 Distributed Laxity-based Priority Scheduling (DLPS) Scheme Scheduling decisions are made based on The states of neighboring nodes and feed back from destination nodes regarding packet losses Packets are recorded based on their uniform laxity budgets (ULBs) and the packet delivery ratios of the flows. The laxity of a packet is the time remaining before its deadline. Contention-based protocols with Scheduling Mechanisms
  • 46. 46 MAC protocols that use directional antennas have several advantages: Reduce signal interference Increase in the system throughput Improved channel reuse MAC protocol using directional antennas Make use of an RTS/CTS exchange mechanism Use directional antennas for transmitting and receiving data packets MAC Protocols that use directional Antennas
  • 47. 47 Directional Busy Tone-based MAC Protocol (DBTMA) It uses directional antennas for transmitting the RTS, CTS, data frames, and the busy tones. Directional MAC Protocols for Ad Hoc Wireless Networks DMAC-1, a directional antenna is used for transmitting RTS packets and omni-directional antenna for CTS packets. DMAC-1, both directional RTS and omni-directional RTS transmission are used. MAC Protocols that use directional Antennas
  • 48. 48 Other MAC Protocols Multi-channel MAC Protocol (MMAC) Multiple channels for data transmission There is no dedicated control channel. Based on channel usage channels can be classified into three types: high preference channel (HIGH), medium preference channel (MID), low preference channel (LOW) Multi-channel CSMA MAC Protocol (MCSMA) The available bandwidth is divided into several channels Power Control MAC Protocol (PCM) for Ad Hoc Networks Allows nodes to vary their transmission power levels on a per-packet basis Receiver-based Autorate Protocol (RBAR) Use a rate adaptation approach Interleaved Carrier-Sense Multiple Access Protocol (ICSMA) The available bandwidth is split into tow equal channels The handshaking process is interleaved between the two channels.
  • 49. What is IEEE 802.11? Standard for wireless local area networks (wireless LANs) developed in 1990 by IEEE Intended for home or office use (primarily indoor) 802.11 standard describes the MAC layer, while other substandards (802.11a, 802.11b) describe the physical layer Wireless version of the Ethernet (802.3) standard 49
  • 50. Network Setup Ethernet MT AP AP AP MT MT Basic Network Setup is Cellular Mobile Terminals (MT) connect with Access Points (AP) Standard also supports ad-hoc networking where MT’s talk directly to MT’s 50
  • 51. IEEE 802.11 Physical Layers 802.11b 802.11a Modulation Scheme DSSS OFDM Spectrum (GHz) 2.4 – 2.485 5.15-5.35, 5.725-5.825 Data Rate (Mbps) 1 – 11 6 - 54 Subchannels 11 overlapping 8 independent Interference Microwave, Cordless Phones,Bluetooth, HomeRF, Light Bulbs! HyperLAN II Availability Today Late August? Cost $250 AP, $100 PC Card ??? (same) 51
  • 52. Media Access Control - Ethernet  CSMA/CD (Carrier Sense Multiple Access with Collision Detection) If media is sensed idle, transmit If media is sensed busy, wait until idle and then transmit immediately  Collisions can occur if more than one user transmits at the same time If a collision is detected, stop transmitting. Reschedule transmission according to exponential backoff Desktop System Desktop System Desktop System Ethernet 52
  • 53. Media Access Control (802.11) Would like to use CSMA Nice for bursty traffic Make for seamless replacement of wired LANs with wireless LANS Use CSMA, but can’t use CD PT/PR ratio is too high Don’t want to waste energy on mobiles Use Collision Avoidance instead Don’t always start transmitting immediately after someone else 53
  • 54. CSMA/CA Details SIFS (Short Interframe Space) DIFS (Distributed Interframe Space) Packet A ACK B C SIFS DIFS Packet C ACK SIFS DIFS Packet B Scenario: B and C want to transmit, but A currently has control of medium B randomly selects 7 slots of backoff, C selects 4 slots C transmits first, then B 54
  • 55. What is HIPERLAN/2? European standard developed by ETSI/BRAN (European Telecommunications Standards Institute/Broadband Radio Access Networks) Physical Layer is very similar to 802.11a (OFDM operating in the 5 GHz spectrum) Standard based on wireless ATM (Asynchronous Transfer Mode) 55
  • 56. HIPERLAN/2 MAC BCH – Miscellaneous header FCH – Details how the DL and UL phases will be allocated ACH – Feedback on which resource requests were received RCH – Random access resource request 56
  • 58. IEEE 802.11 IEEE 802.11 is a widely accepted standard in the United States for wireless LANs Primarily a “cellular” random access scheme with provisions for ad hoc networking and contention free access 802.11b products are available now, but better to wait for 802.11a products later this year HIPERLAN/2 is being pushed in Europe Wireless ATM solution for real-time traffic Standard reflects the network topology 58