WiMAX Worldwide Interoperability for Microwave Access

1. WiMAXWorldwide Interoperability for Microwave Access Marina Yankelovich, Hadar Hen-zion, Michael Reznik

2. Why WiMAX? • Over the past years we witness growing demand for Voice, Multimedia and Internet Access. • The problem is that running wired communication infrastructure is expensive and complicated. • The answer is broadband wireless. Erecting a big antenna on hill just outside of town is much easier and cheaper.

3. Why WiMAX? • WiMAX is a MAN (Metropolitan Aria Network) protocol that will be a wireless alternative to DSL and TI level services for last mile broadband access. Internet/ Telephone Network

4. WiFi vs. WiMAX • 802.16 provides service to building, unlike 802.11 that was designed to be mobile Ethernet. • Wi-Fi has a range of about 100m. WiMAX provide services over several Kms.

5. WiFi vs. WiMAX • WiFi operates using CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) in its MAC layer while WiMAX uses a scheduler at the BSs (base stations) that allows better utilization of the bandwidth. • Another issue is Qos. While 802.11 provides some support for real-time traffic , it was not really designed for telephony and heavy-duty multimedia usage.

6. WiFi vs. WiMAX • In contrast, 802.16 is expected to support these applications completely because it is intended for residential as well as business use. • Wi-Fi channels occupy a fixed width of the spectrum while WiMAX allow channel sizes to be decided based on requirements.

7. Scope of 802 Standard

8. WiMAXPhisycal Features • The physical layers, as named in the standard, are: • SC – A Single carrier physical layer used for 10-66 GHz and 2-11 GHz frequencies. • OFDM – An OFDM physical layer used for 2-11GHz frequencies. • OFDMA – An OFDMA physical layer used for 2-11GHz frequencies. • All the above features, support both TDD and FDD .

9. OFDM • OFDM is a very powerful transmission technology that subdivides the bandwidth into multiple frequency sub-carriers. • Each sub-carrier is actually a narrow-band signal that is orthogonal to others signals like it. • All the signals are transmitted simultaneously without being able to interrupt each other due to their orthogonality.

10. OFDMA • Originally the OFDM was designed for single signal transmission which was divided to sub-carriers. • To realize the multiple user access a TDMA or FDMA scheme has to be added, allowing different users to use the same OFDM signal and turning it to OFDMA. • The sub-carriers are divided into sets creating sub-channels.

11. OFDMA • Now the system has to coordinate the time and the frequency allocations to transmit data that belongs to different users.

12. Duplexing Scheme in WiMAX • Duplexing refers to the way downlink and uplink data is arranged in a two-way wireless transmission.

13. Duplexing Scheme in WiMAX • There are two types of duplexing scheme: FDD and TDD. • FDD (Frequency division duplexing) - divides the bandwidth into two channels and if one of them is temporarily empty of data, the other uses only half of the allocated resources. • TDD (Time division duplexing) - achieves the full-duplex communication goal by dividing the time dimension while sharing the same frequency.

14. Duplexing Scheme in WiMAX • An example of a TDD frame that is always divided to pair of sub-frames, the downlink followed by the uplink, having a guard interval between them.

15. TDD Frame Structure in WiMAX

16. The MAC Sublayer • The WiMAXbase station schedules uplink (UL) and downlink (DL) packets wise. • The scheduling is done with respect to priority of services. • The scheduling information is broadcasted by the BS through the uplink map message(UL-MAP) at the beginning of each frame. • After receiving the UL-MAP, each SS will transmit data in the predefined time slots.

17. The MAC sublayer • The BS uplink scheduling module allocates bandwidth according to BW request sent from SSs to BS. • In IEEE 802.16 standard, there are two modes of transmitting the BW-Request: contention mode and contention-free mode (polling). • IEEE 802.16 defines four types of service flows, each with different QoS requirements and corresponding uplink scheduler policy.

18. Types of service flow • Unsolicited grant service (UGS)- this service supports constant bit-rate flows such as Voice over IP. These applications require constant bandwidth allocation. • BW-Request: Not required.

19. Types of service flow • Real-time polling service (rtPS)- this service is for real-time flows such as MPEG video. These applications have specific bandwidth requirements as well as a deadline. Late packets that miss the deadline will be useless. • BW-Request: used only in the contention-free mode. The current queue size represents the current bandwidth demand and included in the BW-Request.

20. Types of service flow • Non-real-time polling service (nrtPS)- this service is for non-real-time flows which require better than best effort service, e.g. bandwidth intensive file transfer. These applications are time-insensitive and require minimum bandwidth allocation. • BW-request: uses either contention-free mode or contention mode. Current queue size is included in BW-request.

21. Types of service flow • Best effort service (BE)- this service is for best effort traffic such as HTTP. There is no QoS guarantee. The applications in this service flow receive the available bandwidth after the bandwidth is allocated to the previous three service flows. • BW-request: uses only contention mode. Current queue size is included in BW request.

22. The MAC sublayer scheduler • IEEE 802.16 standard left the QoS based packet scheduling algorithms, that determine the uplink and downlink bandwidth allocation, undefined. • In recent years, several schedulers were published. We would like to present a basic uplink scheduler.

23. Uplink Scheduler Article “Packet scheduling for QoS support in IEEE 802.16 broadband wireless access systems” INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS By KittiWongthavarawatn and Aura Ganzz

24. Uplink Scheduler Proposed Module • Uplink packet scheduling (UPS) resides in the BS to control all the uplink packet transmissions.

25. Uplink Scheduler Proposed Module • The article suggest: • At the BS • A detailed description of the uplink packet scheduling module. • Admission control module. • At the SS • The Traffic Policing module.

26. Traffic Policing-Token bucket • A token bucket is a common algorithm used to control the amount of data that is injected into a network. • The main idea of Token Bucket is to permit transmission of data burst, yet to control the maximum transmission rate. • Packets arriving cannot be transmitted if a token is not available in the bucket. Tokens are filled in the bucket according to a specific rate defined by the algorithm. The tokens arrival rate equals the average transmission rate.

27. Token Bucket illustration

28. Admission control module • Admission control is the QoS mechanism that decides whether a new session (connection) can be established. • This mechanism will ensure that existing sessions’ QoS will not be degraded and the new session will be provided QoS support.

29. Admission control for rtPSconnections • The admission control policy for rtPS connections is given by the following algorithm: • Input: • A new rtPS connection requests with parameters: • bi- token bucket size of connection i. • ri- token bucket rate (average data rate) of connection i. • di- maximum delay requirement of connection i (ms). • Current network parameters: • average capacity (bps) allocated for all current connections. • total capacity (bps) allocated for uplinktransmission. • f= duration of a time frame (ms) which includes uplink and downlink subframes.

30. Example for Admission control procedure • Check for available bandwidth: If ri ≤ Cuplink-CUGS-CrtPS –CnrtPS, there is available bandwidth for the new rtPS connection. Otherwise reject the new connection. • Check for delay guarantees: If we can provide delay guarantees for the new rtPS connection. Otherwise reject the new connection. • Check for delay violations of existing rtPS connections: If for any connection this condition is not satisfied, reject the new connection. • Update CrtPS: CrtPS←CrtPS+ri. • Pass token bucket parameters ri, bi to the traffic policing module.

31. The proposed scheduler • One of the modes of uplink arbitration uses a TDMA MAC. • The BS determines the number of time slots that each SS will be allowed to transmit in an uplink subframe.

32. The proposed scheduler (cont.) • Overall bandwidth allocation:Bandwidth allocation per flow follows strict priority, from highest to lowest: UGS, rtPS, nrtPS and BE.

33. The proposed scheduler (cont.) • Bandwidth allocation within UGS connections: The Scheduler allocates fixed bandwidth as defined by IEEE 802.16. • Bandwidth allocation within rtPS connections: Apply earliest deadline first (EDF) service discipline to this service flow. Packets with earliest deadline will be scheduled first.

34. The proposed scheduler (cont.) • Bandwidth allocation within nrtPS connections: We apply weight fair queue (WFQ) service discipline to this service flow. We schedule nrtPS packets based on the weight of the connection. • Bandwidth allocation within BE connections: The remaining bandwidth is equally allocated to each BE connection.

35. Service Assignment • The service assignment module determines the uplink subframeallocation in terms of the number of bits per connection. • The number of bits will eventually be converted to the number of time slots which are the units used in the UL-MAP. • The number of bits per time slot is determined by the physical layer of the wireless network.

36. Service Assignment • UGS packet scheduling - schedule predetermined time slots for each UGS connection. • After scheduling the packets, update Nuplink: • Nuplink = total number of bits that SSs are allowed to transmit in an uplink subframe. Assume: current time = t

37. Service Assignment • rtPS packet scheduling - schedule the rtPS packets until either there are no rtPS packets left or there is no more bandwidth left. • After scheduling the packets, update Nuplink:

38. Service Assignment • In case the total number of bits in the column is greater than Nuplink, Nuplinkwill be distributed to each connection based on its weight.

39. Service Assignment • ri= average data rate of connection i. • For example, connection i will be scheduled with Wi∙ Nuplinkbits. • We can take the following two actions for the packets that missed their deadline: (1) drop the packets. (2) reduce the priority of the packets by moving them to the BE database, i.e. these packets will be scheduled with the same priority as BE.

40. Service Assignment • nrtPS packet scheduling - schedule the packets based on connections’ weights • Also update the Nuplink: Assume: current time = t

41. Service Assignment • BE packet scheduling - schedule packets equally, i.e. provide the same amount of bandwidth to each BE connection. Assume: current time = t

42. Simulation Results • In the article, they perform the experiment that shows the QoS support provided by the uplink packet scheduling. • Assumptions: • There are only two types of traffic (rtPS and BE). • All traffic is already admitted to the network. • BE traffic requires uplink bandwidth at all times. • Ctotal =10 Mbps, Cuplink = 5 Mbps, Cdownlink = 5 Mbps. (Ctotal =total capacity (bps) of the wireless network, Ctotal = Cuplink ‏+Cdownlink) • Frame size (f) = 10 ms • Input traffic: Three rtPS sessions with average total bandwidth (CrtPS) of 3 Mbps:

43. The bandwidth allocation for rtPS and BE connections.

44. Arrival and service curves • The graphs clearly show that the service curve adapts and follows the arrival curve. • We observe that the horizontal distance between these two curves (arrival curve and service curve) is bound by the maximum delay.

45. Downlink Scheduler • On the downlink (from BS to SS), the transmission is relatively simple because the BS is the only one that transmits during the downlink subframe. • The data packets are broadcasted to all SSs and an SS only picks up the packets destined to it. • As it was said the IEEE 802.16 standard doesn’t define Downlink scheduler, many algorithms were proposed, but we will not present them here.

46. The End Thank You