Mod-3

HIPERLAN -1
HIPERLAN1 is a WLAN supporting node mobility and used
with infrastructure and adhoc based topologies.
HIPERLAN is High Performance Radio LAN
HIPERLAN1 was originally one out of four HIPERLANs
envisaged, as ETSI decided to have different types of
networks for different purposes.
The key feature of all four networks is their integration of
time-sensitive data transfer services.
HIPERLANs 2, 3, and 4 are now called HiperLAN2,
HIPERACCESS, and HIPERLINK
HIPERLAN 1comprises many elements from ETSI’s BRAN
(broadband radio access networks) and wireless ATM
activities.
Features
HIPERLAN 1 as a wireless LAN supporting priorities and
packet life time for data transfer at 23.5 Mbit/s, including
forwarding mechanisms, topology discovery, user data
encryption, network identification and power conservation
mechanisms.
HIPERLAN 1 should operate at 5.1–5.3 GHz.
The service offered by a HIPERLAN 1 is compatible with the
standard MAC services known from IEEE 802.x LANs.
 A special HIPERLAN 1 identification scheme allows the
concurrent operation of two or more physically overlapping
HIPERLANs without mingling their communication.
Confidentiality is ensured by an encryption/decryption
algorithm that requires the identical keys and initialization
vectors for successful decryption of a data stream encrypted by
a sender.
An innovative feature of HIPERLAN 1, which many other
wireless networks do not offer, is its ability to forward data
packets using several relays.
Relays can extend the communication on the MAC layer
beyond the radio range.
 For power conservation, a node may set up a specific wake-
up pattern.
This pattern determines at what time the node is ready to
receive, so that at other times, the node can turn off its receiver
and save energy.
These nodes are called p-savers and need so-called p-
supporters that contain information about the wake-up
patterns of all the p-savers they are responsible for.
A p-supporter only forwards data to a p-saver at the moment
the p-saver is awake.
This action also requires buffering mechanisms for packets
on p-supporting forwarders.
Protocol Architecture
HIPERLAN standard covers a part of the data link layer and
physical layer w.r.to OSI reference model.
The service provided at the HIPERLAN MAC layer is
compatible with the ISO MAC service definition.
HIPERLAN subdivides the MAC layer into MAC and Channel
Access Control(CCA).
The HIPERLAN MAC layer offers its service to next higher
layer at MAC service Access point(MSAP). This is the LLC
layer.
The MAC service includes a communication service, transport
of MAC Service data unit (MSDU).
The HIPERLAN MAC entities use MAC protocol to exchange
an HMPDU(HIPERLAN MAC PDU).
The HIPERLAN CAC layer provide channel access with
priorities and to free the higher layers from special wireless
channel characteristics.
The CAC service accepts HIPERLAN CAC SDUs(HCSDU) at
the HCSAP and HC entities.
This layer has the access scheme EY-NPMA.
The PHY offers transfer of bit streams and specifies radio
channels, modulation technique etc.
Data is sent in the form of different bit rates.
Physical layer
Lower layer responsible for modulation/demodulation of radio
carrier with a bit stream ,forward error correction mechanism,
measuring signal strength and channel sensing.
The three carriers are mandatory and two are optional.
Mandatory carriers are:
F(0) = 5.176 GHz
F(1) =5.1999 GHz
F(2)= 5.223 GHz
Optional carriers are:
F(3)= 5.247 GHz
F(4)=5.270 GHz
HIPERLAN supports two types of data bursts:
1. LBR-HBR data burst: It has a low bit rate stream , a
synchronization and training sequence and a number of high
bit rate data blocks.
2. LBR data burst:it has low bit rate part with receiver
identification. Data rate is 1.47 Mbits/s.
Channel access control sublayer
CAC sublayer offers a connection less data transfer service
to higher MAC layer.
The data unit transferred is called HIPERLAN CAC Service
data unit(HCSDU).
Transfer starts at the source HIPERLAN CAC service Access
Point(HCSAPs).
It also has HIPERLAN CAC QoS.
HCSAP address can be individual address or a group address.
The two service primitives for data transfer in the CAC
sublayer are:
1.HC-UNITDATA.req(source ,destination
HCSAP,HCSDU,HIPERLAN identifier, channel assess
priority)- for sending data
2.HC - ---
UNITDATA.ind(source,destinationHCSAP,HCSDU,HIPERLAN
identifier)-indicates incoming data.
Elimination-yield non-preemptive priority multiple access
(EY-NPMA) is the heart of the channel access providing
priorities and different access schemes.
EY-NPMA divides the medium access of different competing
nodes into three phases:
1.Prioritization: Determine the highest priority of a data packet
ready to be sent by competing nodes.
2. Contention: Eliminate all but one of the contenders, if more
than one sender has the highest current priority.
3.Transmission: Finally, transmit the packet of the remaining
node.
In a case where several nodes compete for the medium, all three
phases are necessary (called ‘channel access in synchronized
channel condition’).
If the channel is free for at least 2,000 so-called high rate bit-
periods plus a dynamic extension, only the third phase, i.e.
transmission, is needed (called ‘channel access in channel-
free condition’).
• The contention phase is further subdivided into an
elimination phase and a yield phase.
• The purpose of the elimination phase is to eliminate as
many contending nodes as possible (but surely not all).
• The result of the elimination phase is a more or less
constant number of remaining nodes, almost independent
of the initial number of competing nodes.
• Finally, the yield phase completes the work of the
elimination phase with the goal of only one remaining
node.
1.Prioritization phase
HIPERLAN 1 offers five different priorities for data
packets ready to be sent.
After one node has finished sending, many other
nodes can compete for the right to send.
The first objective of the prioritization phase is to
make sure that no node with a lower priority gains
access to the medium while packets with higher
priority are waiting at other nodes.
This mechanism always grants nodes with higher
priority access to the medium, no matter how high
the load on lower priorities.
In the first step of the prioritization phase, the priority
detection, time is divided into five slots, slot 0 (highest
priority) to slot 4 (lowest priority).
Each slot has a duration of IPS = 168 high rate bit-periods.
(Interval of Prioritization Slot)
If a node has the access priority p, it has to listen into the
medium for p slots (priority detection).
 If the node senses the medium is idle for the whole period of p
slots, the node asserts the priority by immediately transmitting
a burst for the duration IPA = 168 highrate bit-periods (priority
assertion)
Let us assume, for example, that there are three nodes with
data ready to be sent, the packets of node 1 and node 2 having
the priority 2, the packet of node 3 having the priority 4.
Then nodes 1, 2 and 3 listen into the medium and sense slots 0
and 1 are idle.
Nodes 1 and 2 both send a burst in slot 2 as priority assertion.
Node 3 stops its attempt to transmit its packet. In this example,
the prioritization phase has taken three slots.
After this first phase at least one of the contending nodes will
survive, the surviving nodes being all nodes with the highest
priority of this cycle.
2.Elimination phase
Several nodes may now enter the elimination phase.
Again, time is divided into slots, using the elimination slot
interval IES = 212 high rate bit periods. (Interval of
Elimination Slot)
The length of an individual elimination burst is 0 to 12 slot
intervals long, the probability of bursting within a slot is 0.5.
The probability PE(n) of an elimination burst to be n
elimination slot intervals long is given by:
PE(n) = 0.5n+1 for 0 ≤ n < 12
PE(n) = 0.512 for n = 12
• The elimination phase now resolves contention by means
of elimination bursting and elimination survival
verification.
• Each contending node sends an elimination burst with
length n as determined via the probabilities and then
listens to the channel during the survival verification
interval IESV = 256 high rate bit periods.
.
Yield phase
During the yield phase, the remaining nodes only listen into
the medium without sending any additional bursts.
Again, time is divided into slots, this time called yield
slots with a duration of IYS = 168 high rate bit-periods.
The length of an individual yield listening period can be 0 to 9
slots with equal likelihood.
The probability PY(n) for a yield listening period to be n slots
long is 0.1 for all n, 0 ≤ n ≤ 9.
Each node now listens for its yield listening period. If it senses
the channel is idle during the whole period, it has survived the
yield listening.
Otherwise, it withdraws for the rest of the current transmission
cycle
Quality of service support and other specialties
• The speciality of HIPERLAN 1 is its QoS support. The quality
of service offered by the MAC layer is based on three
parameters (HMQoS-parameters).
• The user can set a priority for data, priority = 0 denotes a high
priority, priority = 1, a low priority.
• The user can determine the lifetime of an MSDU to specify
time bounded delivery.
• The MSDU lifetime specifies the maximum time that can
elapse between sending and receiving an MSDU.
• Beyond this, delivery of the MSDU becomes unnecessary. The
MSDU lifetime has a range of 0–16,000 ms.
• The residual MSDU lifetime shows the remaining lifetime
of a packet
• Besides data transfer, the MAC layer offers functions for
looking up other
• HIPERLANs within radio range as well as special power
conserving functions. Power
• conservation is achieved by setting up certain
recurring patterns when a node can
• receive data instead of constantly being ready to receive.
Special group-attendance
• patterns can be defined to enable multicasting. All nodes
participating in a multicast
• group must be ready to receive at the same time when a
sender transmits data.
• HIPERLAN 1 MAC also offers user data encryption and
decryption using a simple XOR-scheme together with random
numbers.
• A key is chosen from a set of keys using a key identifier (KID)
and is used together with an initialization vector IV to initialize
the pseudo random number generator.
• This random sequence is XORed with the user data (UD) to
generate the encrypted data.
• Decryption of the encrypted UD works the same way, using the
same random number sequence.
• This is not a strong encryption scheme – encryption is left to
higher layers.
HIPERLAN 1 MAC layer selects the next PDU for
transmission if several PDUs are ready and how the
waiting time of a PDU before transmission is reflected in
its channel access priority.
The selection hasto reflect the user priority (0 or 1) and
the residual lifetime to guarantee a timebounded service.
The MAC layer then has to map this information onto a
channel access priority used by the CAC, competing
with other nodes for the transmit rights.
First of all, the MAC layer determines the normalized
residual HMPDUnlifetime (NRL).
This is the residual lifetime divided by the estimated
number of hops the PDU has to travel. The computation
reflects both the waiting time of a PDU in the node and the
distance, and the additional waiting times in other nodes.
 Then the MAC layer computes the channel access priority for
each PDU following the mapping shown in Table
Mapping of the normalized residual lifetime to
the CAC priority
The final selection of the most important HMPDU
(HIPERLAN 1 MAC PDU) is performed in the following
order:
● HMPDUs with the highest priority are selected;
● from these, all HMPDUs with the shortest NRL are selected;
● from which finally any one without further preferences is
selected from the remaining HMPDUs.
Besides transferring data from a sender to a receiver within the
same radio coverage, HIPERLAN 1 offers functions to forward
traffic via several other wireless nodes – a feature which is
especially important in wireless ad-hoc networks without an
infrastructure.
This forwarding mechanism can also be used if a node can
only reach an access point via other HIPERLAN 1 nodes
Format of HCPDU
Frame transmitted in HIPERLAN consists of low bit
rate(LBR) part, synchronization period, and a hugh bit
rate(HBR).
LBR part has a fixed bit pattern 1010101001.
The next field is HBR-part Indicator(HI) .
The next is the hashed address of service access point of
destination called Hashed destination HCSAP address
field HDA.
HDA is protected by a simple 4 bit checksum ,the HDA
checksum HDACS.
The Block Length Indicator Replica field(BLIR)
contains the number of blocks in the HBR part.
BLI is Block Length Indicator(BLI).
PLI is Padding Length Indicator(PLI) has the number
of padding bytes used in the padding field PAD.
HID is HIPERLAN Identifier.
DA is destination HCSAP address field.
User data has 1 to 2,422 bytes of data.
PAD is padding field with 0 to 51 bytes.
A strong checksum(CS) protects the HBR part.
DataPDU of CAC sublayer.
Medium Access Control
Sublayer
MAC sublayer provides connectionless service to transport an
MSDU from source MSAP to a destination MSAP.
There are three parameters for QoS: priority determines the
priority of data, MSDU lifetime specifies the maximum time
between sending and receiving an MSDU, residual MSDU
lifetime shows the remaining lifetime of a packet.
For data transfer MAC layer offers:
1.HM-UNITDATA.req
2.HM-UNITDATA.ind
Power conservation is achieved by setting up certain
recurring patterns when a node can receive data.
It performs encryption and decryption using a single
XOR scheme.
The Normalised Residual HMPDU lifetime(NRL)
is the residual lifetime divided by the estimated
number of hops the PDU has to travel.
Data PDU of the MAC sublayer
Length Indicator(LI)
Type Indicator(TI)
Residual lifetime(RL)
PDU sequence number(PSN)
DA –Destination Address(Destination MSAP address)
SA- Source Address(Source MSAP address)
ASA-Alias Source Address
MSDU lifetime(ML)
 Initialization Vector(IV)
User Data(UD)
Sanity Check(SC) is a special sum over the unencrypted
octets.
Information bases and networking
HIPERLAN forwards data via several wireless nodes.
Nodes can function as packet relays and called as
forwarders.
For routing and forwarding of packets nodes
maintain a Route Information Base(RIB).
RIB has Rnext, Rdist,Rdest.
HIPERLAN nodes also has Neighbour Information
Base(NIB) which records information about each
communication link of the node with its neighbour.
Nstatus has N_Asym,N_sym,N_multiRelay.
Hello Information Base(HIB) records information
about the neighbours of a HIPERLAN node.
HIPERLAN nodes which are called as forwarder has
two databases, the source multipoint relay
information base and topology information base.
Forwarders also has a topology Information base(TIB)
which has information about forwarders and source
multipoint relays.
The duplication detection information base(DDIB)
contains information about duplicate packets.