IEEE 802.16 Mesh Schedulers: Issues and Design Challenges

UAE Univ., Al-Ain
IEEE Network (Impact Factor: 2.85). 02/2008; DOI: 10.1109/MNET.2008.4435904
Source: IEEE Xplore

ABSTRACT IEEE 802.16 mesh mode defines three types of resource scheduling: coordinated centralized, coordinated distributed, and uncoordinated distributed. While the standard defines the required procedures and messages for each scheduler, it does not offer encouraging means to provide performance, reliability, or QoS. In this article we outline the issues of IEEE 802.16 mesh schedulers. We also survey representative proposals and qualitatively evaluate them against these issues. More critically, we identify key challenges that have not been addressed so far in the literature to motivate work in this area of research.

  • [Show abstract] [Hide abstract]
    ABSTRACT: IEEE 802.16j-based wireless relay networks adopt time division multiple access, where time slots are assigned to communication links as transmission opportunities. When we employ adaptive modulation and coding for data transmission on wireless links, the transmission bitrate is affected by the signal to interference and noise ratio. Therefore, algorithms that assign time slots to links are important for enhancing the performance of relay networks. When we employ relay networks to access backhaul networks, the bottleneck link is likely to be located near the gateway node, and dominates the performance of the relay network. In this paper, we propose a time slot-adding algorithm to improve bottleneck link throughput in IEEE 802.16j relay networks. Although we employ an existing method for the initial assignment of time slots to links in the network, we introduce novel algorithm to add more time slots to the bottleneck link. Performance evaluations confirm that the proposed method improves data transfer throuzhput by up to around 30%.
    Information Networking (ICOIN), 2013 International Conference on; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present an analytical framework for the delay analysis of the Distributed Coordinated Scheduling in the IEEE 802.16 Wireless Network in mesh mode. We designed a queuing model that expresses the network limits accurately. The queuing model is of the type M/G/1/L developed using Linear Algebraic Queuing Theory. After modeling one node, an iterative method is used to calculate the traffic flowing in the whole network. With this model, it is possible to calculate the end-to-end delay and the throughput limit of the link layer. An algorithm is presented that applies a strategy to provide fair resource sharing. The numerical results and simulations for different topologies show that the model is accurate and that the fairness strategy effectively reduces the end-to-end delay.
    Ad Hoc Networks. 01/2014;
  • [Show abstract] [Hide abstract]
    ABSTRACT: An efficient scheduling scheme is a crucial part of Wireless Mesh Networks (WMNs)—an emerging communication infrastructure solution for autonomy, scalability, higher throughput, lower delay metrics, energy efficiency, and other service-level guarantees. Distributed schedulers are preferred due to better scalability, smaller setup delays, smaller management overheads, no single point of failure, and for avoiding bottlenecks. Based on the sequence in which nodes access the shared medium, repetitiveness, and determinism, distributed schedulers that are supported by wireless mesh standards can be classified as either random, pseudo-random, or cyclic schemes. We performed qualitative and quantitative studies that show the strengths and weaknesses of each category, and how the schemes complement each other. We discuss how wireless standards with mesh definitions have evolved by incorporating and enhancing one or more of these schemes. Emerging trends and research problems remaining for future research also have been identified.
    ACM Computing Surveys (CSUR). 10/2013; 46(1).

Full-text (3 Sources)

Available from
May 28, 2014