HIPERLAN 1

HIGH PERFORMANCE LOCAL AREA NETWORK

HIPERLAN

European Alternative to IEEE 802.11 ( ETSI )

4 Different versions

2,3,4 = > HiperLAN2, HiperAccess, HiperLink

Not a commercial success

Key Feature : Integration of Time Sensitive Data Transfer Services

HIPERLAN 1
Wireless LAN, supporting the following,

Data transfer at 23.5 Mbit/s

Forwarding mechanism
User data encryption
Network identification
Topology discovery
Power conservation mechanism

Should operate at 5.1 - 5.3 GHz with a range of 50m in buildings at 1 W

transmit power. Addressing based on std. 48 bit MAC Address.

Innovative Features of HIPERLAN 1

Ability to forward packets using several relays. ( Relays can extend the
communication on the MAC Layer beyond the radio range. )
Power Conservation ( P-Savers and P-Supporters )

Vada Poche Moment

We ll be looking about the Medium Access Scheme of HIPERLAN 1, mainly
provides,

QoS
Power Prioritization Scheme

But. :(

EY-NPMA
Elimination Yield Non-Preemptive Priority Multiple Access
Divides medium access of different competing nodes into 3 Phases
Prioritization
Contention
Transmission

Channel Access in,

- Sync. Channel Condition ( several nodes - all 3 phases )
- Channel Free Condition ( free channel, 2000 + dynamic bit periods free only 3rd phase - [ dynamic = randomInt(0:3) * 200 ]=> Collisions Less )
- Hidden Elimination Condition ( hidden terminal problem )

Prioritization Phase
-

Offers 5 different priorities

1st Objective :
-

Fairness ( does not consider the load from that node )

Steps Involved
-

Priority Detection
- Time is divided into 5 slots ( 0 -high 4- low )
- Each slot duration IPS 168 high rate bit periods
- If access priority p then listen for p slots
Priority Assertion
- If medium is idle for that whole period of p slots
- Asserts by transmitting a burst for IPA
- If medium is busy, then waits for next cycle

Example
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.

Elimination Phase
-

Several nodes may enter this

Time is divided into slots
Stages
-

Elimination Burst ( Pe(n) with a slot 0.5, length 0 - 12 slots )

Elimination Survival Verification

Each contending node sends an elimnation burst with length n and then
listens
A contending node survives this IFF it senses the channel is idle durign the
survival verification period. Else, eliminate!
One or more nodes survive this elimination phase.

Yield Phase
-

Remaining nodes just listen into the medium, No bursts.

Again, time is divided into slots ( yield slots, length 0 -9 slots with equal prob.)
If the node senses channel is idle it survives, else bye bye!
Characterised by : Shortest Yield Period among all => at least one node ll
survive and transmit data

Transmission Phase
-

Low bit-rate High bit-rate HIPERLAN 1 CAC Protocol data unit (LBR-HBR
HCPDU)
Multicast or Unicast PDU
In unicast,
-

Sender expects to receive immediate ACK, AK-HCPDU ( contains only LBR )

Quality Of Service
-

Priority Assignment
Power Conservation
Encryption and Decryption

Bluetooth

Bluetooth
-

Ad-hoc piconets, local area networks with a very limited coverage and
without need for an infrastructure
Close promixity connectivity
1 Mbit/sec gross data rate
Many devices offer Infra Red, slower tranmission rates, line of sight is
necessary, limited range, one to one - only two participants usually, no media
access, no internet fucntions ( big adv = low cost )
User Scenarios ( connection of pheripheral devices, ad-hoc networking,
bridging small gaps in networks )

Bluetooth Architecture
-

Operates on 79 Channels in 2.4 GHz band.

Implements Frequency Hopping Spread Spectrum for interference mitigation
PICONET
-

Is a collection of Bluetooth devices which are sync to the same hopping sequence
Master decides the hopping patterns, salves sync
Unique hopping pattern
Parked - does not participate, are visible can be reactivated in milliseconds
Standby - does not participate
Max 7 Slaves and 1 Master only ( More than 200 devices can be parked)
Why 8 devices ? 3 bit address

Piconet

Formation

Bluetooth Scatternet

Protocol
Stack