Loading...

A new distributed uplink packet scheduling algorithm in WiMAX newtorks

Nazari, S ; Sharif University of Technology | 2010

1035 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICFCC.2010.5497385
  3. Publisher: 2010
  4. Abstract:
  5. Worldwide interoperability for Microwave Access (WiMAX) is designed to support a wide range of Quality of Service (QoS) requirements for different applications. Unlike the single service networks, a priority based mechanism is needed for specifying the transmission order of packets belonging to different traffic sources according to their QoS characteristics, which is called packet scheduling. In WiMAX standard, packet scheduling algorithm is not defined and its design is left for researchers. In this work, we propose a distributed uplink packet scheduling algorithm. In the proposed algorithm, when uplink capacity cannot satisfy the required resource of connections, according to traffic characteristics of the connection and their QoS requirement, the traffic of one or some user terminals from user terminals in the overlapping cells are selected for transferring to the neighboring under-loaded cells. The simulation results show that, the proposed algorithm increases the overall throughput of the network
  6. Keywords:
  7. Component ; Load balancing handovver ; Uplink packet scheduling ; Component ; Load-Balancing ; Overlapping cells ; Packet scheduling ; Packet scheduling algorithm ; Priority-based ; QoS requirements ; Service network ; Simulation result ; Traffic characteristics ; Traffic sources ; Transmission order ; Uplink capacity ; User terminals ; WiMAX standards ; Worldwide interoperability for microwave access ; Channel estimation ; Computer simulation ; Packet networks ; Parallel architectures ; Quality of service ; Wimax ; Scheduling algorithms
  8. Source: Proceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010, 21 May 2010 through 24 May 2010 ; Volume 2 , May , 2010 , Pages V2232-V2236 ; 9781424458226 (ISBN)
  9. URL: http://ieeexplore.ieee.org/document/5497385