Arunai Engineering College, Tiruvannamalai

A learning automata-based uplink scheduler for supporting real-time multimedia interactive traffic in IEEE 802.16 WiMAX networks

Presented by Siva.S (510411427013) M.E Network Engineering

Guided by Mr.S.Elango,M.E., HOD/ECE

Abstract
WiMAX mesh is acting as a promising alternative to construct high speed and wide range multi-hop wireless access network; however the resource scheduling with respect to user fairness and system efficiency in such networks is still remained unspecified. To perform the global fair bandwidth allocation for all competing traffic flows, we design a new fairness model called multihop max min fair (MMF) to be applied in WiMAX mesh network. The MMF fairness is firstly designed based on the homogenous scenario where every link holds the same transmission capacity; then it is extended to the heterogeneous scenario where different links have different transmission capacity. As for the scheduling for all those competing traffic flows over the mesh network, we first get the global fair share of scheduling opportunities for each flow according to the MMF principle, then determine the resource allocation for each flow and each traffic link..

Literature Survey
The WiMAX support two networking modes: point to multipoint (PMP) and multipoint to multipoint (mesh). WiMAX standard specified two scheduling modes, i.e., the centralized scheduling mode and distributed scheduling mode for external and intranet traffics respectively. IEEE 802.16 standard has defined five QoS class, namely UGS (Unsolicited Grant Service), rtPS (Real Time Polling Service), ertPS (Extended Real Time Polling Service), nrtPS (Non- Real Time Polling Service) and BE (best effort) respectively. The former four classes have a QoS demand on either bandwidth or delay, and all such sessions are handled via an admission control process. The BE has lowest priority and all BE traffic sessions are served in a best effort manner. A BE flow is also termed as a competing flow.

Literature Survey (contd.)

Single-hop fair allocation schemes: proposed a scheme to achieve the maximin fairness in wireless networks using the flow contention graph. [17] proposed a two-phase scheduling scheme to achieve fairness among one-hop flows in wireless networks. [19,20] employed the token-based mechanism to provide the maxmin fairness over the wireless ad hoc networks. Multi-hop fairness schemes: [21] proposed a flow based fair scheme to attain the global fair bandwidth allocation by calculating the probability of transmission at each node. But the scheme is with increased delay and also low efficiency. [25] designed a two-queue based scheduling scheme at each node to enforce the end to end fairness over the multi-hop networks. But these schemes require too much hardware and processing budget. [26] proposed an effective approach with two algorithms to achieve the fairness in wireless back haul networks. However only homogenous link capacities are considered in the scheme.

Proposed System

Thank you...