The Experts below are selected from a list of 18 Experts worldwide ranked by ideXlab platform

Abdelkarim Al Tamimi - One of the best experts on this subject based on the ideXlab platform.

  • ocsa an algorithm for burst mapping in ieee 802 16e mobile wimax networks
    Asia-Pacific Conference on Communications, 2009
    Co-Authors: Chakchai Soin, Raj Jain, Abdelkarim Al Tamimi
    Abstract:

    Most of IEEE 802.16e resource allocation proposals only focus on how to allocate the resources to meet QoS parameters such as throughput, delay, and delay-jitter. As described in the standard, the mapping from the allocation into Downlink Subframe for each burst needs to be in a rectangular shape. The rectangular mapping problem is a variation of a bin or strip packing problem, which is known to be NP complete. However, the mapping decision needs to be made within a few milliseconds for each Mobile WiMAX frame. In this paper, we introduce a heuristic algorithm, called One Column Striping with non-increasing Area first mapping (OCSA). The algorithm is fast and simple to implement and minimizes the unused slots in the frame.

Yusheng Ji - One of the best experts on this subject based on the ideXlab platform.

  • resource allocation for guaranteed service in ofdma based systems
    Wireless Communications and Networking Conference, 2009
    Co-Authors: Nararat Ruangchaijatupon, Yusheng Ji
    Abstract:

    Orthogonal Frequency Division Multiple Access (OFDMA) is the access technique adopted in the new generation wireless networks such as WiMAX. In this paper, we consider resource allocation of OFDMA in Time Division Duplex (TDD) mode in which the new transmission frame with multiple time slots is popped up on every pre-specified period. Frame resource is divided into chunks that are composed of a group of subcarriers with equal and constant time duration. Our centralized resource allocation scheme aims to provide the guaranteed service to users by converting the required service into the network cost. The users whose network costs are too high are not guaranteed in order not to waste the precious bandwidth. We formulate the optimization problem with the objective of minimizing the total cost. Furthermore, a heuristic method is proposed to schedule users' data into the Downlink Subframe by exploiting multiuser multichannel diversity to guarantee the service and to utilize system's bandwidth wisely. Intensive simulation shows that our scheme provides satisfied throughput, low packet drop rate, and low queuing delay. Moreover, the results also show that the scheme is fair to users in both throughput and service time.

Chakchai Soin - One of the best experts on this subject based on the ideXlab platform.

  • ocsa an algorithm for burst mapping in ieee 802 16e mobile wimax networks
    Asia-Pacific Conference on Communications, 2009
    Co-Authors: Chakchai Soin, Raj Jain, Abdelkarim Al Tamimi
    Abstract:

    Most of IEEE 802.16e resource allocation proposals only focus on how to allocate the resources to meet QoS parameters such as throughput, delay, and delay-jitter. As described in the standard, the mapping from the allocation into Downlink Subframe for each burst needs to be in a rectangular shape. The rectangular mapping problem is a variation of a bin or strip packing problem, which is known to be NP complete. However, the mapping decision needs to be made within a few milliseconds for each Mobile WiMAX frame. In this paper, we introduce a heuristic algorithm, called One Column Striping with non-increasing Area first mapping (OCSA). The algorithm is fast and simple to implement and minimizes the unused slots in the frame.

Nararat Ruangchaijatupon - One of the best experts on this subject based on the ideXlab platform.

  • resource allocation for guaranteed service in ofdma based systems
    Wireless Communications and Networking Conference, 2009
    Co-Authors: Nararat Ruangchaijatupon, Yusheng Ji
    Abstract:

    Orthogonal Frequency Division Multiple Access (OFDMA) is the access technique adopted in the new generation wireless networks such as WiMAX. In this paper, we consider resource allocation of OFDMA in Time Division Duplex (TDD) mode in which the new transmission frame with multiple time slots is popped up on every pre-specified period. Frame resource is divided into chunks that are composed of a group of subcarriers with equal and constant time duration. Our centralized resource allocation scheme aims to provide the guaranteed service to users by converting the required service into the network cost. The users whose network costs are too high are not guaranteed in order not to waste the precious bandwidth. We formulate the optimization problem with the objective of minimizing the total cost. Furthermore, a heuristic method is proposed to schedule users' data into the Downlink Subframe by exploiting multiuser multichannel diversity to guarantee the service and to utilize system's bandwidth wisely. Intensive simulation shows that our scheme provides satisfied throughput, low packet drop rate, and low queuing delay. Moreover, the results also show that the scheme is fair to users in both throughput and service time.

Raj Jain - One of the best experts on this subject based on the ideXlab platform.

  • ocsa an algorithm for burst mapping in ieee 802 16e mobile wimax networks
    Asia-Pacific Conference on Communications, 2009
    Co-Authors: Chakchai Soin, Raj Jain, Abdelkarim Al Tamimi
    Abstract:

    Most of IEEE 802.16e resource allocation proposals only focus on how to allocate the resources to meet QoS parameters such as throughput, delay, and delay-jitter. As described in the standard, the mapping from the allocation into Downlink Subframe for each burst needs to be in a rectangular shape. The rectangular mapping problem is a variation of a bin or strip packing problem, which is known to be NP complete. However, the mapping decision needs to be made within a few milliseconds for each Mobile WiMAX frame. In this paper, we introduce a heuristic algorithm, called One Column Striping with non-increasing Area first mapping (OCSA). The algorithm is fast and simple to implement and minimizes the unused slots in the frame.