wireless mobile network lab. c.s. tku 1 hiperla n hiperlan high performance radio local area network...

Wireless Mobile Network Lab. C.S. TKU 1

HIHIgh PEPErformance RRadio LLocal AArea NNetwork

(HIPERLANHIPERLAN) – Type 1

Sean S. WangSean S. Wang

Department of Computer Science and Information EngineeringTamkang University


AgendaAgenda

OverviewOverview Medium Access Control Sub-layer (MAC)Medium Access Control Sub-layer (MAC) Channel Access Control Sub-layer (CAC)Channel Access Control Sub-layer (CAC) Physical Sub-layer (PHY)Physical Sub-layer (PHY)


AgendaAgenda

OverviewOverview ETSI ETR 069ETSI ETR 069 - Radio Equipment and Systems (RES);

HIgh PErformance Radio Local Area Network (HIPERLAN);Services and facilities

ETSI ETR 133ETSI ETR 133 - Radio Equipment and Systems (RES);HIgh PErformance Radio Local Area Networks (HIPERLAN);System definition

ETSI EN 300 652ETSI EN 300 652 - Broadband Radio Access Networks (BRAN);HIgh PErformance Radio Local Area Network (HIPERLAN) Type 1;Functional specification

Medium Access Control Sub-layer (MAC) Channel Access Control Sub-layer (CAC) Physical Sub-layer (PHY)


What’s HIPERLANWhat’s HIPERLAN

Developed within the EEuropean uropean TTelecommunication elecommunication SStandards tandards IInstitutenstitute (ETSIETSI) during the period 1991 to October 1996

A radio communication sub-system Intended for integrationintegration with computer systems Provides high speedhigh speed, shortshort distancedistance radio links Be used for locallocal, in-housein-house networking


HIPERLAN PropertiesHIPERLAN Properties

Provide a service that is compatible with the service in ISOISO 15802-115802-1 specificationspecification

Deploy in a pre-arrangedpre-arranged or ad-hocad-hoc fashion Support node mobilitymobility Support asynchronousasynchronous and time-boundedtime-bounded communication by

means of a ChannelChannel AccessAccess MechanismMechanism (CAMCAM) with prioritiespriorities Easy establishment of wirelesswireless ad-hocad-hoc LANLAN, by using

distributeddistributed topologytopology and routingrouting functionsfunctions in the MAC layer


HIPERLAN ApplicationsHIPERLAN Applications

Office automation Financial service Medical and hospital systems Education and training Industrial automation


HIPERLAN General Requirements (1)HIPERLAN General Requirements (1)

Distributed processing systems The extensions and alternatives of wired LANswired LANs based on EthernetEthernet

and Token RingToken Ring standards Short messageShort message exchange (the order of a few hundred bytes) HighHigh frequencyfrequency (the order of hundreds per second)

Asynchronous and time-bounded services AsynchronousAsynchronous: datadata Time-boundedTime-bounded: voice/videovoice/video


HIPERLAN General Requirements (2)HIPERLAN General Requirements (2)

Mobility Maximum linear speed: 10 m/s10 m/s (36 km/h)

Security Protects the users from eavesdroppingeavesdropping (竊聽 ) and data injectiondata injection

Power, size and costs Interoperability

All nodes in HIPERLAN can inter-operate to the basic common air interface


HIPERLAN Operating Requirements (1)HIPERLAN Operating Requirements (1)

Over air data rate: 23.5 Mbps23.5 Mbps Net data rate (overhead is not included)

AsynchronousAsynchronous: up to 20 Mbps20 Mbps Time-boundedTime-bounded

Video phone: at least 64 kbps64 kbps ISDN: 2048 kbps2048 kbps

100 MHz of spectrum at 5.15-5.25 GHz5.15-5.25 GHz (optional 5.25-5.30 optional 5.25-5.30 GHzGHz)

Three channels in 100 MHzThree channels in 100 MHz, five channels in 150 MHzfive channels in 150 MHz Transmit power classes

10 mW, 100 mW, and 1000 mW



Latency How quick the system is able to response to requests for service AsynchronousAsynchronous: less than 1 ms (at 30% capacity) Time-boundedTime-bounded: not defined

Delay Application-dependent, not definednot defined

Delay variance Asynchronous: no limit Time-bounded: < (3.0 ms)2

Systems throughput and system capacity Application-dependent



Range To 50 m50 m at 20 Mbps20 Mbps To 800 m at 1 Mbps

Error rate MPDU detected: better than 10-3

MPDU undetected: better than 8 10-8

MSDU undetected: better than 5 10-14


HIPERLAN InterworkingHIPERLAN Interworking

MAC level bridging model Network level interworking


HIPERLAN ServicesHIPERLAN Services

AsynchronousAsynchronous services Asynchronous packetpacket transfer/broadcasttransfer/broadcast service

Time-boundedTime-bounded services Require the establishment of a connectionestablishment of a connection between sender and

receiver Rely on connection-orientedconnection-oriented communication protocol Provide services at data rates of multiples of 64 kbps up to at least

2048 kbps These services in a HIPERLAN node are optionaloptional


HIPERLAN Architectures (1)HIPERLAN Architectures (1)

Ad hocAd hoc every device can communicate directlydirectly to each other device

InfrastructureInfrastructure Node has forwarderforwarder and nonforwardernonforwarder roles Each nonforwarder node should select at least one of its select at least one of its

neighbors as a forwarderneighbors as a forwarder ForwarderForwarder and nonforwardernonforwarder nodes need to periodicallyperiodically updateupdate

the databasesthe databases


HIPERLAN Reference ModelHIPERLAN Reference Model

Application layer

Presentation layer

Session layer

Transport layer

Network layer

Data Link layer

Physical layer

OSI Reference Model

higher layer protocols

Medium Access Control(MAC) Sublayer

Channel Access Control(CAC) Sublayer

Physical (PHY) layer

HIPERLAN Reference Model

LLC

MAC

PHY

IEEE IEEE 802.11802.11


HIPERLAN Communication ModelHIPERLAN Communication Model

data burst

HCPDU

HMPDU

HCSAP

MSAP

data burst

HCPDU

HMPDU

HCSAP

MSAP

HIPERLAN Physical Protocol

HIPERLAN CAC Protocol

higher layer protocols

MSDU MSDU

HCSDUHCSDU

HIPERLAN MAC Service

HIPERLAN MAC Protocol

HIPERLAN CAC Protocol

MSAP: MAC Service Access PointMSDU: MAC Service Data UnitHMPDU: HIPERLAN MAC Protocol Data Unit

HCSAP: HIPERLAN CAC Service Access PointHCSDU: HIPERLAN CAC Service Data UnitHCPDU: HIPERLAN CAC Protocol Data Unit

MTU = 2383 octets

MTU = 2422 octets


AgendaAgenda

Overview Medium Access Control Sub-layer (MAC)Medium Access Control Sub-layer (MAC)


Channel Access Control Sub-layer (CAC) Physical Sub-layer (PHY)


MAC Sub-layerMAC Sub-layer

MAC layer involved in the following procedures Network establishmentNetwork establishment, addition of a node in a network and

removal of a node from a network (LookLook Up functionUp function) Topology updatesTopology updates and packet routing determinationpacket routing determination as well

as packet forwardingpacket forwarding, controlled by the RoutingRouting InformationInformation Maintenance functionMaintenance function and the User Data Transfer functionUser Data Transfer function

Power ConservationPower Conservation by declaring periods in which the receiver of a node is active and can listen to transmitted to packets

Calculation of the channel access priorityaccess priority of packets to be transmitted


MAC ServicesMAC Services

The HIPERLAN MAC service definition is based on the ISO MAC service specification in ISO 15802-1ISO 15802-1

The maximum MSDU size is 23832383 octetsoctets The MAC services

HIPERLAN look-upHIPERLAN look-up Power conservationPower conservation User data transferUser data transfer Routing information maintenanceRouting information maintenance HMPDU transferHMPDU transfer


HIPERLAN Reference ModelHIPERLAN Reference Model

HIPERLANLook-upFunction

User DataTransferFunction

PowerConservation

Function

RoutingInformationMaintenance

Function

MAC PDU Transfer Function

Channel Access Control Layer

Physical Layer


MAC FunctionsMAC Functions

System Co-ordination Function (SCF) Data Transfer Service (DTS) Function HIPERLAN Addressing Function HIPERLAN Forwarding Function


System Co-ordination Function (SCF)System Co-ordination Function (SCF)

Include Multi-Channel Resource Sharing (MCRS) and Power Conservation Management (PCM) functions

Create a HIPERLAN Enable an individual node to join or leave a given HIPERLAN Control encryption of MSDU data Enable and disable HIPERLAN forwarding Enable co-operating HIPERLAN devices using power conservation

techniques to communication in a satisfactory manner Enable HIPERLAN operation in a multi-channel environment Collect statistics


Data Transfer Service (DTS) FunctionData Transfer Service (DTS) Function

Include equitable access and power conservation transmission functions

Aim to achieve equitable channel usage among competing HIPERLAN nodes and MPDUs given multiple levels of transmission priority

Define means for the delayed transmission of MPDUs destined for devices known to be applying power conservation techniques

Deliver to the MAC service user the MSDUs received


Addressing and Forwarding FunctionAddressing and Forwarding Function

HIPERLAN Addressing Function Support for broadcast, multicast and unicast transmission amongst

HIPERLAN nodes within the same HIPERLAN MAC service addressing and HIPERLAN addressing are

independent HIPERLAN Forwarding Function

Establish and maintain connectivity in s single HIPERLAN Forwarding routes MPDUs between source and destination via one

or more forwarder nodes


HIPERLAN Identification SchemeHIPERLAN Identification Scheme

Each HIPERLAN shall be assigned a numerical HIPERLANnumerical HIPERLAN identifieridentifier and a character-based HIPERLAN namecharacter-based HIPERLAN name

A special HIPERLAN identifier, Any_HIPERLANAny_HIPERLAN, is used for any group

The method of HIPERLAN identifier and name assignment are outside the scope of the ETSI


HIPERLAN Name/IdentifierHIPERLAN Name/Identifier

HIPERLAN name Fixed-length 32 16-bit32 16-bit characters (64 octets64 octets)

HIPERLAN identifier (4 octets4 octets)

HIPERLANidentifier

Valid range of value or reserved

valueDescription

Any_HIPERLAN 0 It identifies anyany (non-specific)(non-specific) HIPERLAN

- 1 ~ (231-1)It identifies a specific HIPERLAN withoutwithout applying encryption-decryptionencryption-decryption scheme

- 231 ~ (232-1)It identifies a specific HIPERLAN withwith applying encryption-decryptionencryption-decryption scheme


MAC Service Access Point AddressMAC Service Access Point Address(MSAP-address)(MSAP-address)

48-bit LAN MAC address48-bit LAN MAC address is adopted Individual-MSAP-addressIndividual-MSAP-address

Identify a single MSAP, its attached HMS-user and HM-entity For unicastunicast

Group-MSAP-addressGroup-MSAP-address Identify a group MSAPs and their attached HMS-users For multicastmulticast


HIPERLAN MAC Protocol Data UnitHIPERLAN MAC Protocol Data Unit

HMPDU DescriptionDefine HMPDU type

value

DT-HMPDUDT-HMPDU DaTa HMPDU 11

LR-HMPDULR-HMPDU Look-up Request HMPDU 22

LC-HMPDULC-HMPDU Look-up Confirm HMPDU 33

IP-HMPDUIP-HMPDU Individual-attention Pattern HMPDU 44

GP-HMPDUGP-HMPDU Group-attendance Pattern HMPDU 55

TC-HMPDUTC-HMPDU Topology Control HMPDU 66

HO-HMPDUHO-HMPDU HellO HMPDU 77


MAC Information Base (1)MAC Information Base (1)

p-saver information basep-saver information base p-supporter supports unicastunicast HCSDU transfer to its neighbouring

p-savers p-supporter records the individual-attention patternindividual-attention pattern

p-supporter information basep-supporter information base p-saver supports multicastmulticast HCSDU transfer by its neighbouring

p-supporters p-saver records the group-attendance patterngroup-attendance pattern

Duplicate detection information baseDuplicate detection information base To avoid redundant processingredundant processing Every HM-entity records {Dsrc, Dseq} to delete



Route information baseRoute information base Every HM-entity records {RDest, RNext, RDist} where RDist is the hop

count Relay roleRelay role

A HM-entity is either a non-forwardernon-forwarder or a forwarderforwarder

Relay typeValid reserved

valueDescription

R_NonForwarder 1 the relevant HM-entity is a non-forwardernon-forwarder

R_Forwarder 2 the relevant HM-entity is a forwarderforwarder



Neighbour information baseNeighbour information base Every HM-entity records {NNbour, NStatus}

NNbour : HCSAP-address (=HMSAP-address) NStatus : neighbour status

Neighbour status

Valid reserved

valueDescription

N_Asym 1 Local HM-entity has an asymmetricasymmetric link with neighbour

N-Sym 2 Local HM-entity has a symmetricsymmetric link with neighbour

N_MultiRelay 3Local HM-entity has a symmetricsymmetric link with neighbour and has selected this neighbourneighbour as its multi-point relay



Hello information baseHello information base Every HM-entity records {HDest, HStatus, HNext} where HDest has a status

HStatus and can be reached by HNext

HStatus Description

H_NeighbourNF HDest identifies a neighbouring non-forwardernon-forwarder

H_NeighbourF HDest identifies a neighbouring forwarderforwarder

H_TwoHopHDest is two hopstwo hops away from the local HM-entity and HNext

identifies a mutual neighbouring forwarder



Source Multipoint relay information baseSource Multipoint relay information base A forwarder records {SSMR, SSeq} where SSMR has selected it as a

multipoint relay with the sequence number SSeq

Topology information baseTopology information base A forwarder records {TDest, TLast, TSeq} where TDest has selected TLast

as a multipoint relay with the sequence number Tseq

Alias information baseAlias information base Every HM-entity records {AOri, AAlias} where address AOri is outsideoutside

HIPERLAN and associated with AAlias address


Look-up FunctionLook-up Function

HIPERLAN-AHIPERLAN-A

LC-HMPDU

LR-HMPDU

HIPERLAN-BHIPERLAN-B

Look-up process

An HM-entity which has notnot been assigned to any specific HIPERLAN may invoke HIPERLAN look-up requestsHIPERLAN look-up requests and collect HIPERLAN informationcollect HIPERLAN information


Look-up Function ProceduresLook-up Function Procedures

HIPERLAN information queryHIPERLAN information query The attached HMS-user issues an HM-LOOKUPHM-LOOKUP request primitive

to determine the HIPERLAN namesHIPERLAN names and the associated associated identifiersidentifiers

HIPERLAN information declarationHIPERLAN information declaration To declare the HIPERLAN nameHIPERLAN name and identifieridentifier of the local HM-

entity’s HIPERLAN upon receipt of an LR-HMPDULR-HMPDU HIPERLAN information collectionHIPERLAN information collection

To process a received LC-HMPDULC-HMPDU


Look-up Function Procedures (*)Look-up Function Procedures (*)

LR-HMPDU

HM-entity

LC-HMPDU

Neighbouring entity

HIPERLAN information query

HIPERLAN information collection

HIPERLAN information query


Power Conservation Function (1)Power Conservation Function (1)

Allow a node enter the power conservation statepower conservation state, and it should periodicallyperiodically wake up a period of time to receive the packets

HIPERLAN power conservation function is based on mutualmutual respect between p-saverp-saver and p-supporterp-supporter

Two roles of power conservation p-saverp-saver

Refer to a HM-entity when it will be able to receivereceive HMPDUs p-supporterp-supporter

Refer to a HM-entity when it will transfertransfer HMPDUs to its neighbouring p-savers


Power Conservation Function (2)Power Conservation Function (2)

p-supporterp-supporterdeclared deferred multicast pattern

p-saverp-saverdeclared wake pattern

actual wake pattern

Perform OR functionPerform OR function


The Recurring Patterns (1)The Recurring Patterns (1)

A p-saver/p-supporter is assigned one and only oneone and only one recurring recurring individual-attention/group-attendance patternindividual-attention/group-attendance pattern, of which it makes regular declarationregular declaration in IP-HMPDU/GP-HMPDUIP-HMPDU/GP-HMPDU

Three timing elementstiming elements

pattern period

pattern offset

practiceinterval

• practice interval: the duration of individual-attention/group-attendance interval • pattern offset: the amount of time which has elapsed since the most recent start of practice interval• pattern period: the amount of time between the start of successive practice intervals


The Recurring Patterns (2)The Recurring Patterns (2)

Valid values for the timing elements of a recurring pattern

The practice interval is no greater than the pattern period The practice offset is no greater than the pattern period

Timing elements Valid range of value (ms)

pattern offset 0 - 10000

pattern period 500 - 10000

practice interval 500 - 10000


Power Conservation Function Procedures (1)Power Conservation Function Procedures (1)

Individual-attention pattern declarationIndividual-attention pattern declaration p-saverp-saver

periodically declare a IP-HMPDUIP-HMPDU (Individual-attentionIndividual-attention PatternPattern) to tell its neighbouring p-supporters the wake up periodwake up period and the intervalinterval it awake (practice interval, pattern offset and pattern period)

Group-attendance pattern declarationGroup-attendance pattern declaration p-supporterp-supporter

transfer to p-savers while they are awake periodically declare a GP-HMPDUGP-HMPDU (Group-attendance(Group-attendance PatternPattern) to tell

its neighbouring p-savers the group-attendancegroup-attendance periodperiod which used to transfer the multicastmulticast packetspackets


Power Conservation Function Procedures (2)Power Conservation Function Procedures (2)

Individual-attention pattern recordingIndividual-attention pattern recording p-supporter records a neighbouring p-saver’s declared p-saver’s declared

individual-attention patternindividual-attention pattern upon receipt of an IP-HMPDUIP-HMPDU Group-attendanceGroup-attendance patternpattern recordingrecording

p-saver records a neighbouring p-supporter’s declared group-p-supporter’s declared group-attendance patternattendance pattern upon receipt of an GP-HMPDUGP-HMPDU

ExpiredExpired individual-attentionindividual-attention patternpattern entryentry removalremoval p-supporter removes an individual-attention pattern from the local

p-saver information basep-saver information base upon expiryexpiry ofof itsits holdingholding timetime ExpiredExpired group-attentiongroup-attention patternpattern entryentry removalremoval

p-saver removes a group-attention pattern from the local p-p-supporter information basesupporter information base upon expiryexpiry ofof itsits holdingholding timetime


Power Conservation Function Procedures (*)Power Conservation Function Procedures (*)

IP-HMPDU

p-saver p-supporter

Individual-attention pattern recording

Expires individual-attention pattern entry removal

holding time timeout

Individual-attention pattern declaration


Power Conservation Function Procedures (*)Power Conservation Function Procedures (*)

GP-HMPDU

p-saverp-supporter

Group-attendance pattern recording

Expires group-attendance pattern entry removal

holding time timeout

Group-attendance pattern declaration


User Data Transfer FunctionUser Data Transfer Function

Support MSDU transfer betweenbetween HMS-usersHMS-users in accordance with the HIPERLAN MAC service definitionHIPERLAN MAC service definition

MSDU is submitted by a HMS-user and transmitted by the attached HM-entity in the DT-HMPDUDT-HMPDU

DT-HMPDU is relayed towards the destination(s) if MSDU if MSDU lifetime has not expiredlifetime has not expired

When a DT-HMPDU arrives at the destination HM-entity, it is delivered to the HMS-user

If applying HIPERLAN encryption-decryptionencryption-decryption scheme MSDU may be encryptedencrypted at the HM-entity attached to the sourcesource

MSAPMSAP MSDU may be decrypteddecrypted at the HM-entit(y/ies) attached to the

destinationdestination MSAP(s)MSAP(s)


User Data Transfer Function Procedures (1)User Data Transfer Function Procedures (1)

SanitySanity checkcheck computationcomputation To compute the sanity check on the octet sequenceoctet sequence in the DT-DT-

HMPDUHMPDU from the KIDKID (Key IdentifierKey Identifier) to the SC SC (Sanity CheckSanity Check) UserUser datadata encryption-decryptionencryption-decryption

To obtain the encryptedencrypted or decrypteddecrypted contents of the UDUD (User User DataData) of the DT-HMPDUDT-HMPDU

HMQoSHMQoS failurefailure reportingreporting To inform the attached HMS-user that its previously issued HM-

UNITDATA request primitive cannot be honouredcannot be honoured because the associated HMQoSHMQoS measures cannot be met



UserUser datadata acceptanceacceptance To process the attached HMS-user’s MSDU transfer request, when

the attached HMS-user issues a HM-UNITDATAHM-UNITDATA request primitive UserUser datadata deliverydelivery

To delivery the received MSDU to the attached HMS-user upon receipt of a DT-HMPDUDT-HMPDU conveying a MSDU whose destinationdestination MSAP-addressMSAP-address identifies the attached HMS-user

UserUser datadata forwardingforwarding ForwarderForwarder forwardsforwards the received DT-HMPDU towards its

destination upon receipt of a DT-HMPDU


User Data Transfer Function Procedures (*)User Data Transfer Function Procedures (*)HM-user (S) HM-entity (S) HM-entity HM-user (D)

HM-UNITDATA request primitive

MSDU

HMQOSFAILURE

indication primitive

DT-HMPDU

QoS Failure

HM-UNITDATA indication primitive

MSDU

Unicast

Multicast

User data acceptance

User data decryption

User data delivery

User data forwarding

Sanity check computation

User data encryption

HMQoS failure reporting


Routing Information Maintenance FunctionRouting Information Maintenance Function

This function is concerned with the local HM-entity’s exchange exchange of routing informationrouting information with the other HM-entities and its maintenance maintenance of local routing informationlocal routing information

Neighborhood discoveryNeighborhood discovery EveryEvery HM-entity declare periodicallyperiodically Hello HIPERLAN MACHello HIPERLAN MAC

ProtocolProtocol DataData UnitUnit (HO-HMPDUHO-HMPDU) to exchange the neighbour exchange the neighbour informationinformation

The HO-HMPDU contains the addressesaddresses and statusesstatuses of the sender and all its neighbours to build a routingrouting informationinformation basebase


Routing Information Maintenance Function Routing Information Maintenance Function Procedures (1)Procedures (1)

Route determineRoute determine To determine the routeroute for a DT-HMPDUDT-HMPDU awaiting transmission

Route information base establishmentRoute information base establishment To (re-)establish the local route information route information basebase upon

modification of the local topologytopology informationinformation basebase and/or the neighbourneighbour informationinformation basebase

Multipoint relay selectionMultipoint relay selection To select a set of neighbouringneighbouring forwardersforwarders as the multipointmultipoint

relaysrelays for optimizing the distribution of HMPDUs Neighbour information declarationNeighbour information declaration

To declare periodically the neighbour informationneighbour information to the neighbouring HM-entities



Neighbour information recordingNeighbour information recording To record the neighbour information of a neighbouring HM-entity in

the local HM-entity’s neighbourneighbour informationinformation basebase, hellohello informationinformation basebase and sourcesource multipointmultipoint relayrelay informationinformation basebase upon receipt of a HO-HMPDUHO-HMPDU

Source multipoint relay information declarationSource multipoint relay information declaration A forwarder declares periodically its sourcesource multipointmultipoint relayrelay

informationinformation to the forwarders in the HIPERLAN Source multipoint relay information recordingSource multipoint relay information recording

To record the sourcesource multipointmultipoint relayrelay information of a forwarderinformation of a forwarder in the local HM-entity’s topology information basetopology information base upon receipt of a TC-HMPDUTC-HMPDU



TC-HMPDU forwardingTC-HMPDU forwarding A forwarderforwarder forwards the received TC-HMPDUTC-HMPDU to other forwarders

upon receipt of a TC-HMPDUTC-HMPDU from one of the local HM-entity’s source multipoint relays

Alias address learningAlias address learning To learn an alias address for a MSAP outsideoutside of the HIPERLAN

upon receipt of a DT-HMPDUDT-HMPDU Expired neighbour entry removalExpired neighbour entry removal

To remove a neighbour entry from the local neighbourneighbour informationinformation basebase upon expiry of its holding timeexpiry of its holding time



Expired source multipoint relay entry removalExpired source multipoint relay entry removal To remove a source multipoint relay entry from the local sourcesource

multipointmultipoint relayrelay informationinformation basebase upon expiry of its holding expiry of its holding timetime

Expired topology entry removalExpired topology entry removal To remove a topology entry from the local topologytopology informationinformation

basebase upon expiry of its holding timeexpiry of its holding time Expired alias entry removalExpired alias entry removal

To remove an alias entry from the local alias information basealias information base


Routing Information Maintenance Function Routing Information Maintenance Function Procedures (*)Procedures (*)

HM-user (S) HM-entity (S) HM-entity HM-user (D)HM-UNITDATA request primitive

MSDU

HMQOSFAILURE

indication primitive

DT-HMPDU

QoS Failure

HM-UNITDATA indication primitive

MSDU

Unicast

Multicast

User data acceptance

User data decryption

User data delivery

User data forwarding

Sanity check computation

User data encryption

HMQoS failure reporting


Encryption-decryption Scheme (1)Encryption-decryption Scheme (1)

Key lengthKey length in the HIPERLAN key-set is 30 bits30 bits Key identifier Key identifier ( in DT_HMPDUDT_HMPDU)

To encryptencrypt and decryptdecrypt the user data The assignmentassignment of the specific key to a key identifier value is

outsideoutside this document (EN 300 652) Valid key identifier values

Key identifierValid range of value

or reserve valueDescription

No_Key 0 the user data is notnot encryptedencrypted

- 1 - 3 the user data is encryptedencrypted


Encryption-decryption Scheme (2)Encryption-decryption Scheme (2)

The single encryption-decryption algorithm Requires an identical key (30-bit with key identifierkey identifier) and an

identical initialization vectorinitialization vector Referred from HIPERLAN key-setkey-set

HIPERLANkey-set

Random sequencegenerator


datadata

key vector

key

initialization

Transmitter

identifier

XOR

Keyidentifier

Initializationvector

Encrypteddata

EncryptedTransmission

HIPERLANkey-set



datadata

key

Receiver

XOR


HMPDU Transfer FunctionHMPDU Transfer Function

This function is concerned with the transmissiontransmission and receptionreception of a HMPDU using the CACCAC serviceservice

When the CAC service is ready to accept a HMPDU transmission attempt, the HM-entity selects for transmission the most importantmost important HMPDUHMPDU awaiting transmission

DT-HMPDUsDT-HMPDUs and TC-HMPDUsTC-HMPDUs which have previously transmitted or received are remembered to avoid redundant avoid redundant processingprocessing


HMPDU Transfer Function Procedures (1)HMPDU Transfer Function Procedures (1)

Expired HMPDU removalExpired HMPDU removal To remove a HMPDU awaiting transmission upon expiry of its

holding time HMPDU selectionHMPDU selection

Select the most important the most important HMPDU awaiting transmission for transmission

Refer to the part of “TheThe ChannelChannel AccessAccess PriorityPriority” HMPDU transmission and retransmissionHMPDU transmission and retransmission

To transmit or retransmit the most important HMPDU awaiting transmission for the following situationssituations

When the attached HCS-provider issues a HC-SYNC indication HC-SYNC indication primitiveprimitive

After the attached HCS-provider issues a HC-FREEHC-FREE indicationindication primitiveprimitive and before it issues a subsequentsubsequent HC-STATUSHC-STATUS indicationindication primitiveprimitive


HMPDU Transfer Function Procedures (2)HMPDU Transfer Function Procedures (2)

HMPDU receptionHMPDU reception To receive a HMPDU from the attached HCS-provider when it

issues a HC-UNITDATAHC-UNITDATA indication primitiveindication primitive Expired duplicate detection entry removalExpired duplicate detection entry removal

To remove a duplicateduplicate detection relay entry from the local duplicate detection information baseduplicate detection information base upon expiry of its holding time


Channel Access Priority (1)Channel Access Priority (1)

Generally, packets submitted to the MAC (HMQoSHMQoS) are assigned with one of two user priority leveltwo user priority level (00 for highhigh and 11 for lowlow), according to its HMPDU type

Every HMPDU has its lifetimelifetime (0-16000ms0-16000ms, , defaultdefault 500ms500ms) that it can remain available in its transmission journey

The remaining lifetimeremaining lifetime and remaining number ofremaining number of hopshops of a packet are taken into consideration

The NormalizedNormalized ResidualResidual lifetimelifetime (NRLNRL) is computed by dividing packet’s remaining lifetime with the remaining number of hops

hops ofnumber remaining

lifetime remainingNRL


Channel Access Priority (2)Channel Access Priority (2)

HMQoSHMQoS and channel access priority channel access priority mapping

HMPDU selection is performed in the following order With the high channel access priorityhigh channel access priority With the shortest normalized residual HMPDU lifetimeshortest normalized residual HMPDU lifetime Any oneAny one

Refer to the part of “CAC LayerCAC Layer”

Normalized residual HMPDU lifetime(NRL)

Channel access priority,if Cpri is 0

Channel access priority,if Cpri is 1

NRL 10 ms 0 1

10 ms NRL 20 ms 1 2

20 ms NRL 40 ms 2 3

40 ms NRL 80 ms 3 4

80 ms NRL 4 (default) 4

NOTE: The numerically lower value indicates higher channel access priority


General Structure of HMPDUGeneral Structure of HMPDU

Field name Octet

HMPDU length indicator field (LI) = n 1 – 2

HMPDU type indicator field (TI) 3

… 4 – n

LI: the number of octets in the whole HMPDU

TI: the HMPDU type


The Structure of DT-HMPDUThe Structure of DT-HMPDU

Field name Octet


HMPDU type indicator field (LI) = 1 3

Residual HMPDU lifetime field (RL) 4 –5

HMPDU sequence number field (PSN) 6 – 7

Destination MSAP-address field (DA) 8 – 13

Source MSAP-address field (SA) 14 – 19

Alias destination MSAP-address field (ADA) 20 – 25

Alias source MSAP-address field (ASA) 26 – 31

User priority field (UP) [bit

8]MSDU lifetime field 32

(ML) 33

Key identifier field (KID) [bit 8-7]

Initialization vector field 34

(IV) 35 – 37

User data field (UD) [1 – 2383 octets] 38 – (n-2)

Sanity check field (SC) (n-1) - n

RL: the residual HMPDU lifetime

PSN: the HMPDU sequence number

DA: the destination MSAP-address

SA: the source MSAP-address

ADA: the alias destination MSAP-address

ASA: the alias source MSAP-address

UP: the user priority

ML: the MSDU lifetime

KID: the identifier

IV: the initialization vector

UD: the unencrypted/encrypted MSDU

SC: the sanity check for the unencrypted MSDU


The Structure of LR-HMPDU/LC-HMPDUThe Structure of LR-HMPDU/LC-HMPDU

LR-HMPDU

LC-HMPDU

Field name Octet

HMPDU length indicator field (LI) = 3 1 – 2

HMPDU type indicator field (TI) = 2 3

Field name Octet



HIPERLAN identifier field (HID) 4 – 7

HIPERLAN name field (HN) 8 - 71 HN: the HIPERLAN name

HID: the HIPERLAN identifier


The Structure of IP-HMPDU/GP-HMPDUThe Structure of IP-HMPDU/GP-HMPDU

IP-HMPDU

GP-HMPDUField name Octet



Pattern offset field (PO) 4 – 5

Pattern period field (PP) 6 – 7

Pattern interval field (PI) 8 – 9

Field name Octet



Pattern offset field (PO) 4 – 5

Pattern period field (PP) 6 – 7

Pattern interval field (PI) 8 – 9

PP: the pattern period

PO: the pattern offset

PI: the pattern interval

PP: the pattern period

PO: the pattern offset

PI: the pattern interval


The Structure of TC-HMPDUThe Structure of TC-HMPDU

Field name Octet



Residual HMPDU lifetime field (RL) 4 –5

HMPDU sequence number field (PSN) 6 – 7

Originator HCSAP-address field (OA) 8 – 13

Multipoint relay set sequence number field (MSN) (see note) 14 – 15

Source multipoint relay HCSAP-address field (SMA) (see note) 16 – 21

{ MSN, SMA } pairs 22 – (n-8)

Multipoint relay set sequence number field (MSN) (see note) (n-7) – (n-6)

Source multipoint relay HCSAP-address field (SMA) (see note) (n-5) – n

OA: the HCSAP-address of the HM-entity which originates the TC_HMPDUMSN: the multipoint relay set sequence number

SMA: the HCSAP-address of a source multipoint relay

Note: The MSN and the SMA exists in pairs in a TC-HMPDU. There may be 0 up to any number of { MSN, SMA } pairs in a TC_HMPDU, subject to the maximum size of the TC-HMPDU.


The Structure of HO-HMPDUThe Structure of HO-HMPDU

Field name Octet



Relay type indicator field (RTI) 4

Multipoint relay set sequence number field (MSN) 5 – 6

neighbour HCSAP-address field (NA) (see note) 7 – 12

neighbour status field (NS) (see note) 13

{ NA, NS } pairs 14 – (n-7)

neighbour HCSAP-address field (NA) (see note) (n-6) – (n-1)

neighbour status field (NS) (see note) n

RTI: the relay type

NA: the HCSAP-address of a neighbouring HM-entity

NS: the neighbour status

Note: The NA and the NS exists in pairs in a HO-HMPDU. There may be 0 up to any number of { NA, NS } pairs in a HO_HMPDU, subject to the maximum size of the HO-HMPDU.


Predefined Values of HMPDUPredefined Values of HMPDU

Symbol Use Predefined valuetIP holding time for the individual-attention pattern 30000 mstGP holding time for the group-attendance pattern 30000 mstTC holding time for the information from the received TC-HMPDU 40000 mstHO holding time for the information from the received HO-HMPDU 20000 mstA holding time for an alias entry 30000 mslLR HMPDU lifetime of the LR-HMPDU 500 mslLC HMPDU lifetime of the LC-HMPDU 500 mslIP HMPDU lifetime of the IP-HMPDU 500 mslGP HMPDU lifetime of the GP-HMPDU 500 mslTC HMPDU lifetime of the TC-HMPDU 500 mslHO HMPDU lifetime of the HO-HMPDU 500 mspIP HMPDU priority of the IP-HMPDU 1pGP HMPDU priority of the GP-HMPDU 1pLR HMPDU priority of the LR-HMPDU 1pLC HMPDU priority of the LC-HMPDU 1pTC HMPDU priority of the TC-HMPDU 0pHO HMPDU priority of the HO-HMPDU 0tC HIPERLAN information collection interval 1000 msnUHD default hop distance for unicast MSDU transfer 1nMHD default hop distance for multicast MSDU transfer 5• Holding timeHolding time: the time HM-entities keep HMPDUs in their base

• Lift timeLift time: the time HMPDU is available in its transmission journey


AgendaAgenda

Overview Medium Access Control Sub-layer (MAC) Channel Access Control Sub-layer (CAC)Channel Access Control Sub-layer (CAC)


Physical Sub-layer (PHY)


CAC Sub-layerCAC Sub-layer

CAC layer deals with the decision to transmit a packet or notdecision to transmit a packet or not Channel Access CycleChannel Access Cycle Maximum HCSDU size : 2422 octets2422 octets Specify four operations/functions

The operation of EY-NPMAThe operation of EY-NPMA The channel permission functionThe channel permission function The user data transfer functionThe user data transfer function The HCPDU transfer functionThe HCPDU transfer function


HCPDUHCPDU

A HCPDU may have twotwo parts low-bit-rate partlow-bit-rate part (LBR-partLBR-part) high-bit-rate parthigh-bit-rate part (HBR-partHBR-part)

TwoTwo kindskinds of HCPDU The LBRLBR HCPDUHCPDU: the acknowledgement HCPDU (AK_HCPDUAK_HCPDU) The LBR-HBR HCPDULBR-HBR HCPDU

Contain both the LBR-partLBR-part and the HBR-partHBR-part The HBR-part may have 1-47 blocks of 52 octetsThe HBR-part may have 1-47 blocks of 52 octets

LBR-HBR HCPDU Description Defined HCPDU type value

CP-HCPDU channel permission HCPDU 0

DT-HCPDU data HCPDU 1


Non-Pre-emptive priority Multiple Access (NPMA)Non-Pre-emptive priority Multiple Access (NPMA)

Only data ready at the Only data ready at the startstart of a channel access cycle may of a channel access cycle may content for channel access, and content for channel access, and new datanew data is is not allowednot allowed to to accessaccess

NPMA defines threethree activity phases Prioritization phasePrioritization phase

Non-pre-emptive priority resolutionNon-pre-emptive priority resolution is performed Choose the nodes with the highest prioritythe highest priority among all contending

nodes to enter the contention phase Contention phaseContention phase

Decide who could transmit data among those nodes with the same same prioritypriority

Include the elimination phaseelimination phase and the yield phaseyield phase Transmission phaseTransmission phase


Contention Phase

elimination yield

phasephase

NPMA Channel Access CyclesNPMA Channel Access Cycles

Channel free channel access cycleChannel free channel access cycle Synchronized channel access cycleSynchronized channel access cycle

priority resolution contention resolution data transmission

Prioritization Phase Contention Phase Transmission Phase

channel freechannel access cycle

channel free condition

synchronized channel access cycle

synchronized channel condition


The EY-NPMA ActivitiesThe EY-NPMA Activities

transmission interval


channel freechannel access cycle

idle channel for at least the channel free interval

synchronized channel access cycle

idle channel in the channel synchronization interval,after synchronization to the end of previous channel access cycle

elimination yield

phasephase

priority detectionprioritization interval: 0 to 4 prioritization slot intervals

priority assertionpriority assertion intervalelimination bursting

elimination interval: 0 to 12 elimination slot intervalselimination survival verificationelimination survival verification interval

yield listeningyield interval: 0 to 9 yield slot intervals

data transmission

channel access burst



unicast data burst

unicast data burst

multicast data burst

ack burst

missing ackunicast w/o ack

unicast w/ ack

multicast


The EY-NPMA Activities ExampleThe EY-NPMA Activities Example


elimination yield

phasephase




channel access burst data

A(1)

B(4)

C(2)

D(1)

E(4)

F(1)

G(2)

H(1)

I(3)

J(2)

K(1)

e-burst

e-burst

e-burst

A, D, F, H, K

are survival

channel access burst e-burst

e-burst

D, F, K are survival, then sense the

channel

sense

sense

sense

XX

X

X

XX

X

X

X

X

sense

sense

listen

listen

listen

listen

listen

listen

listen

listen

listen

listen

listen

listen

listen

listen


Prioritization PhasePrioritization Phase

There are total total 55 channel access priority channel access priority, which are numbered from 0 to 40 to 4, with the 00 denoting the highesthighest channel access priority

The duration of prioritization phase is consisted of prioritization slot intervals, and there could be 5 slots at most5 slots at most

A node whose data transmission attempt has a channel access priority nn, shall listen for nn prioritization slot intervals

If the channel is sensed idle in the n prioritization slot intervalsin the n prioritization slot intervals, the node transmits immediately a channel access burstchannel access burst

Otherwise, the node stops its transmission attempt in the current channel access cycle

At least oneAt least one contending node will survive the prioritization contending node will survive the prioritization phasephase


Elimination PhaseElimination Phase

Every node survived in the first phase transmits transmits channel channel access burstaccess burst for several time slots for several time slots (each one being 212 high 212 high rate bit-periodrate bit-period), and the number of slots is obtained by a and the number of slots is obtained by a binomial distribution function, which may be binomial distribution function, which may be 0 to 120 to 12

After the transmission of the elimination burst, node listens to the channel for a period of time (called elimination survival elimination survival verification – 256 high-rate bit periodverification – 256 high-rate bit period), to verify if it is eliminated by other contending nodes (i.e. if the channel is sensed idle, then it is the survival)

The duration of the elimination interval is the longestlongest elimination burst among the contending nodes

At least one At least one contending node will survive the elimination contending node will survive the elimination phasephase


Yield PhaseYield Phase

Every survival node from last phase senses the channel for a period which is a multiplemultiple ( 0 to 90 to 9) ofof 168 high rate bit-period168 high rate bit-period, decided by a probability function

If the channel is sensed idle for its yield interval, it could start to transmit data

The duration of the yield interval is the shortestshortest yield listening among the contending nodes

At least one At least one contending node will survive the yield phasecontending node will survive the yield phase


Transmission PhaseTransmission Phase

The transmission of data by the nodes survived in the channel access cycle

TwoTwo kinds of data transmissions A multicastmulticast transmission A unicastunicast transmission

For multicastmulticast, transmission is always successfulalways successful For unicastunicast, if no collision happensno collision happens, the phase would end

followed by a ACKACK packet (AK-HCPDUAK-HCPDU) indicating that the packet was received correctly

A new channel access cyclenew channel access cycle is started after the transmission the transmission of an ACK packetof an ACK packet or the end of the expected transmission the end of the expected transmission of an ACK packet of an ACK packet in unicast


Channel Permission FunctionChannel Permission Function

There are 55 defined communication channels Channel 00, channel 11and channel 22 are the mandatorymandatory defaultdefault

channels, in which transmission access is always permitted Channel 33 and channel 44 are non-defaultnon-default channels, whose

availability is subject to national administration national administration Before having obtained permission to use a non-default

channel, an HC entities shallshall not transmitnot transmit and shallshall ignoreignore allall receivedreceived HCPDUHCPDU except the CP-HCPDUCP-HCPDU (channelchannel permissionpermission) in that non-default channel


Channel Permission Function ProceduresChannel Permission Function Procedures

Channel permission declarationChannel permission declaration To declare the applied channel permission informationapplied channel permission information CP-HCPDU transmitted by the LBR-HBR HCPDU transmission

procedure with the channel access priority 0channel access priority 0 is generated Channel permission recordingChannel permission recording

To record the channel permission information upon receipt of a CP-CP-HCPDUHCPDU

Channel permission invalidationChannel permission invalidation To invalidate the permission to use the non-default channelsnon-default channels upon

expiry of the permission validity timeexpiry of the permission validity time


User Data Transfer FunctionUser Data Transfer Function

Support HCSDU transfer betweenbetween HCS-usersHCS-users in accordance with the HIPERLAN CAC service definitionHIPERLAN CAC service definition

HCSDU is submitted by a HCS-user with a specified channel with a specified channel access priorityaccess priority for transmission to a specified destination

HCSDU is transmitted by the attached HC-entity in the DT-DT-HCPDUHCPDU

When a DT-HCPDUDT-HCPDU is received by the destination HC-entity, it is delivered to the HCS-user



Synchronized transfer invitationSynchronized transfer invitation To invite the attached HCS-user to immediatelyimmediately initiateinitiate a HCSDU

transfer upon detection of the synchronized channel conditiondetection of the synchronized channel condition Free transfer invitationFree transfer invitation

To invite the attached HCS-user to initiateinitiate a HCSDU transfer atat anyany timetime upon detection of the channel free conditiondetection of the channel free condition

Free transfer cancellationFree transfer cancellation To inform the attached HCS-user that the previous free transfer the previous free transfer

invitation is cancelledinvitation is cancelled and the local HC-entity is no longer the local HC-entity is no longer ready to accept any HCSDU transfer requestready to accept any HCSDU transfer request upon nullification nullification of the channel free conditionof the channel free condition



User data refusalUser data refusal To refuse a HCSDU transfer request from the attached HCS-user

User data acceptanceUser data acceptance To process the attached HCS-user’s transfer request

User data deliveryUser data delivery To deliver the received HCSDU to the attached HCS-user upon

receipt of a DT-HCPDUreceipt of a DT-HCPDU


HCPDU Transfer FunctionHCPDU Transfer Function

Support the transmissiontransmission and receptionreception of a HCPDU A multicastmulticast LBR-HBR transmission is always successfulsuccessful A unicastunicast LBR-HBR transmission is successful if and only if it it

is acknowledged by a corresponding AK-HCPDUis acknowledged by a corresponding AK-HCPDU


HCPDU Transfer Function ProceduresHCPDU Transfer Function Procedures

LBR-part checksum computationLBR-part checksum computation To compute separate 4-bit checksumseparate 4-bit checksum for the HAD, the BLIR and

the AID of the LBR-part of a HCPDU HBR-part checksum computationHBR-part checksum computation

To compute separate 32-bit checksumseparate 32-bit checksum for the entire HBR-part of a LBR-HBR HCPDU except the CS

Hashed destination address computationHashed destination address computation To compute the hashedhashed destinationdestination addressaddress for a given LBR-HBR

HCPDU LBR-HBR HCPDU transmissionLBR-HBR HCPDU transmission

To transmit a generated LBR-HBR HCPDU HCPDU receptionHCPDU reception

To process an HCPDU received from the physical layer


General Structure of LBR HCPDUGeneral Structure of LBR HCPDU

HI: a value specifying if the HCPDU has the LBR-part

LBR-part Bit

1 0 1 0 1 0 1 0 0 1 0 - 9

HBR-part Indicator field (HI) = 0 10

… 11 - n


General Structure of LBR-HBR HCPDU (1)General Structure of LBR-HBR HCPDU (1)

HI: a value specifying if the HCPDU has the LBR-part

LBR-part Bit

1 0 1 0 1 0 1 0 0 1 0 - 9

HBR-part Indicator field (HI) = 1 10

Hashed Destination HCSAP-Address field (HDA) 11 – 19

Hashed Destination HCSAP-Address CheckSum field (HDACS)

20 – 23

Block Length Indicator Replica field (BLIR) 24 – 29

Block Length Indicator Replica checkSum field (BLIRCS)

30 – 33

1 34

HDA: the hashed destination HCSAP-address

HDACS: the checksum for the HDA

BLIR: the number of blocks in the HBR-part

BLIRCS: the checksum for the BLR


General Structure of LBR-HBR HCPDU(2)General Structure of LBR-HBR HCPDU(2)

TI: the LBR-HBR HCPDU type

HBR-part Octet

HCPDU Type Indicator field (TI) [bit 8-7]

Block Length Indicator field (BLI) [bit 6-1] = n

1

Padding Length Indicator field (PLI) = m 2

HIPERLAN Identifier field (HID) 3 – 6

Destination HCSAP-Address field (DA) 7 – 12

Source HCSAP-Address field (SA) 13 – 18

… 19 – (52n-m-4)

PADding field (PAD) (52n-m-3) – (52n-4)

CheckSum field (CS) (52n-3) – 52n

BLI: the number of blocks in the HBR-part

PLI: the number of padding octets used in PAD

HID: the HIPERLAN identifier

DA: the destination HCSAP-address

SA: the source HCSAP-address

PAD: the padding octets of any values if PLI is 0, the PAD does not existCS: the checksum for the entire HBR-part except the CS


The Structure of AK-HCPDUThe Structure of AK-HCPDU

LBR-part Bit

1 0 1 0 1 0 1 0 0 1 0 - 9

HBR-part Indicator field(HI) = 0

10

Acknowledgement IDentifier field (AID) 11 – 18

Acknowledgement Identifier CheckSum field (AIDCS) 19 – 22

AID: the acknowledgement identifier

AIDCS: the checksum for the AID


The Structure of CP-HCPDUThe Structure of CP-HCPDU

HBR-part Octet

HCPDU Type Indicator field (TI) [bit 8-7] = 0

Block Length Indicator field (BLI) [bit 6-1] = 1

1

Padding Length Indicator field (PLI) = 29 2

HIPERLAN Identifier field(HID) = Any_HIPERLAN

3 – 6

Destination HCSAP-Address field(DA) = All_Neighbours

7 – 12

Source HCSAP-Address field

(SA) = FF FF FF FF FF FF13 – 18

Channel 3 field(C3) [bit 8]

Channel 4 field(C4) [bit 7]

Reserved field

[bit 6-1] = 019

PADding field (PAD) 20 - 48

CheckSum field (CS) 49 - 52

Cx: a value specifying if channel x is permitted to be used

Reserved field: unused, the value is 0


The Structure of DT-HCPDUThe Structure of DT-HCPDU

HBR-part Octet

HCPDU Type Indicator field (TI) [bit 8-7] = 1

Block Length Indicator field (BLI) [bit 6-1] = n

1

Padding Length Indicator field (PLI) = m 2

HIPERLAN Identifier field (HID) 3 – 6

Destination HCSAP-Address field (DA) 7 – 12

Source HCSAP-Address field (SA) 13 – 18

User Data field (UD) 19 – (52n-m-4)

PADding field (PAD) (52n-m-3) – (52n-4)

CheckSum field (CS) (52n-3) – 52n

UD: the HCSDU in the same octet ordering of the HCSDU


AgendaAgenda

Overview Medium Access Control Sub-layer (MAC) Channel Access Control Sub-layer (CAC) Physical Sub-layer (PHY)Physical Sub-layer (PHY)



PHY Sub-layerPHY Sub-layer

Over air data rate: 23.5 Mbps23.5 Mbps Maximum user data rate (per channel): over 18Mbpsover 18Mbps 30-5030-50 meter range in typical indoor environments 100 MHz100 MHz of spectrum at 5.15-5.25 5.15-5.25 GHzGHz (optional 5.25-5.305.25-5.30

GHzGHz) ThreeThree channelschannels inin 100100 MHzMHz, fivefive channelschannels inin 150150 MHzMHz Three transmit power classes

10 mW 100 mW 1000 mW


Nominal Frequencies of RF CarrierNominal Frequencies of RF Carrier

All the node which belong to the same HIPERLAN/1same HIPERLAN/1 network should use the same carriersame carrier

Carrier numberCarrier number Centre Frequency, MHzCentre Frequency, MHz

0 5 176,468 0

1 5 199,997 4

2 5 223,526 8

3 5 247,056 2

4 5 270,585 6

defaultcarriers

illegal insome countries


Approved 5 GHz Spectrum for USA and EuropeApproved 5 GHz Spectrum for USA and Europe

1 W 1 W*

50 mW

2.5 mW/MHz 12.5 mW/MHz

+ 6 dBi

5.15 5.20 5.25 5.30 5.35Frequency(GHz)

Antennagain

Spectraldensity

Radio outputpower

1 W

50 mW/MHz

+ 6 dBi

HIPERLAN band (Europe)

U-NII band(USA)

250 mW

5.725 5.775 5.825

* Extensions on national bases


Channel Access BurstChannel Access Burst

Channel access burst Used for priority assertionpriority assertion and eliminationelimination burstingbursting defined in

EY-NPMAEY-NPMA Conveyed in HBRHBR

Bits

11111010100010011100000110010110

Note: Bit transmission order is from left to rightleft to right

Bit sequence used in an access burst


Data BurstsData Bursts

Data bursts The packets that contain upper layer informationupper layer information, or MAC control MAC control

informationinformation consist of two parts, a low bit rate part (LBR)a low bit rate part (LBR) and a a high bit rate part (HBR)high bit rate part (HBR)

LBRLBR data bursts Data rate: 1.5 Mbps1.5 Mbps FSKFSK (Frequency Shift KeyingFrequency Shift Keying) modulation

LBR-HBRLBR-HBR data bursts Data rate: 23 Mbps23 Mbps GMSKGMSK (Gaussian Minimum Shift KeyingGaussian Minimum Shift Keying) modulation


LBR Data BurstLBR Data Burst

The bit sequence in the AK-HCPDUAK-HCPDU is transmitted starting with bit 0bit 0, using the low bit rate modulationlow bit rate modulation scheme (FSK)scheme (FSK)

low rate bit stream

time


LBR-HBR Data Burst (1)LBR-HBR Data Burst (1)

low ratebit stream

time

high rate bit stream

synchronizationand training

sequence data block 0 data block 1 data block (m-1)

496 bits 496 bits496 bits450 bits

NOTE: 1 m 47


LBR-HBR Data Burst (2)LBR-HBR Data Burst (2)

A data burst contains the following fields A number of low rate bitsA number of low rate bits A synchronization sequence of A synchronization sequence of 450450 high rate bits high rate bits A number (at least one) of blocks of A number (at least one) of blocks of 496496 high rate bits of high rate bits of

interleaved, coded datainterleaved, coded data Each data block consists of 416416 data high bit rate bits, divided

into 16 segments of 26 bits16 segments of 26 bits and each coded with a BCHBCH (31,2631,26) code

The resulting 16*31=16*31=496496 bits are block interleaved


HIPERLAN FamilyHIPERLAN Family

HIPERLANHIPERLANType 1Type 1

Wireless 8802Wireless 8802LANLAN


Wireless 8802Wireless 8802LANLAN

PHYPHY(5 GHz)(5 GHz)

(23.5 Mbps)(23.5 Mbps)

MACMAC


Wireless IP,Wireless IP,ATM and ATM and

UMTS Short UMTS Short Range Access Range Access


Wireless IP,Wireless IP,ATM and ATM and

UMTS Short UMTS Short Range Access Range Access


(54 Mbps)(54 Mbps)

DLCDLC

HIPER-HIPER-ACCESSACCESS

Wireless IPWireless IPand ATMand ATM

Remote AccessRemote Access(outdoor)(outdoor)

HIPER-HIPER-ACCESSACCESS

Wireless IPWireless IPand ATMand ATM

Remote AccessRemote Access(outdoor)(outdoor)

PHYPHY(various bands)(various bands)

(25 Mbps)(25 Mbps)

DLCDLC

HIPERLINKHIPERLINKWirelessWireless

BroadbandBroadbandInterconnectInterconnect

HIPERLINKHIPERLINKWirelessWireless

BroadbandBroadbandInterconnectInterconnect


(155 Mbps)(155 Mbps)

DLCDLC

wireless mobile network lab. c.s. tku 1 hiperla n hiperlan high performance radio local area network...

Documents