• DocumentCode
    2428199
  • Title

    Provisioning backhaul traffic flows in TDMA/OFDMA infrastructure Wireless Mesh Networks with near-perfect QoS

  • Author

    Szymanski, T.H.

  • Author_Institution
    Dept.ECE, McMaster Univ., Hamilton, ON, Canada
  • fYear
    2010
  • fDate
    12-14 April 2010
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    Scheduling and channel assignment algorithms to provision longer-term backhaul traffic flows in infrastructure TDMA/OFDMA Wireless Mesh Networks (WMNs) with near-perfect QoS are described. A recursive fair stochastic matrix decomposition algorithm is used to compute transmission schedules for all provisioned backhaul traffic flows between BSs. Each schedule consists of a sequence of permutations which specify active edges, which provide near-minimal delay and jitter and near-perfect QoS guarantees on a per-flow basis. A constrained graph coloring algorithm is used to color the permutations, to remove primary conflicts and minimize secondary conflicts. The colored edges are assigned to time-slots and are used to compute the antenna beamforming vectors and transmission power levels. The beamforming can use either a zero-forcing or an iterative MMSE algorithm. Each wireless link achieves a prescribed transmission rate and SINR such that the total transmission power in the WMN is minimized, subject to the per-flow QoS constraints. Extensive simulations of an essentially-saturated hexagonal TDMA/OFDMA WMN supporting backhaul traffic flows are reported.
  • Keywords
    OFDM modulation; array signal processing; channel allocation; frequency division multiple access; graph colouring; iterative methods; jitter; least mean squares methods; matrix decomposition; quality of service; radio links; scheduling; stochastic processes; telecommunication traffic; time division multiple access; wireless mesh networks; SINR; TDMA-OFDMA infrastructure; antenna beamforming vectors; channel assignment algorithms; constrained graph coloring algorithm; iterative MMSE algorithm; jitter; near-minimal delay; near-perfect QoS; provisioning backhaul traffic flow; recursive fair stochastic matrix decomposition algorithm; scheduling; transmission power levels; wireless link; wireless mesh networks; zero-forcing algorithm; Array signal processing; Delay; Iterative algorithms; Matrix decomposition; Processor scheduling; Scheduling algorithm; Stochastic processes; Telecommunication traffic; Time division multiple access; Wireless mesh networks; MIMO; Quality of Service; edge coloring; low jitter; recursive fair stochastic matrix decomposition; scheduling; wireless mesh network;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Sarnoff Symposium, 2010 IEEE
  • Conference_Location
    Princeton, NJ
  • Print_ISBN
    978-1-4244-5592-8
  • Type

    conf

  • DOI
    10.1109/SARNOF.2010.5469704
  • Filename
    5469704