P.S.Kumaresh, A.V.Ram Prasad, D.Luxiyah
WiMAX relay networks make resource allocation decisions once per frame. To achieve a performance gain possible under adaptive allocation. it is important to choose an appropriate practical algorithm feasible for real-time implementation. In this work, the allocation task is considered as a two-step process and several combinations of algorithms for each step are proposed. Performance of algorithms is evaluated on a WiMAX model with variable bit rate traffic. In our proposed method, we focus on multihop (relay based) bandwidth allocation schemes for IEEE 802.16j networks. This study reduces the well-known NP-hard problem called 0/1 knapsack problem to the network performance maximization problem, the key components in WiMAX, QOS guarantee are the admission control and the bandwidth allocation in BS. WiMAX standard defines adequate signaling schemes to support admission control and bandwidth allocation, but does not define the algorithms for them. This absence of definition allows more flexibility in the implementation of admission control and bandwidth allocation.