QoS Routing and Scheduling iQoS Routing and Scheduling in TDMA based Wireless Mesh n TDMA based Wireless Mesh

Backhaul NetworksBackhaul Networks

Chi-Yao Hong, Ai-Chun Pang ,and Jean-Lien C. Wu

IEEE Wireless Communications and Networking Conference, 2007.IEEE Wireless Communications and Networking Conference, 2007.WCNC 2007.WCNC 2007.

Mei-zhen ChenMei-zhen Chen

OutlineOutline

IntroductionIntroduction MotivationMotivation The Proposed MechanismThe Proposed Mechanism Performance EvaluationPerformance Evaluation ConclusionsConclusions

IntroductionIntroduction

(WMBNs)

wired connectionswireless connectionswired/wireless connections

(MR)

Introduction Introduction (cont.)(cont.)

Authors present an integrated mechanism for real-time applications over TDMA-based WMBNs ,and propose QoS-aware routing and scheduling algorithms under the integrated mechanism.

The algorithms can work with any type of network topologies, and the link capacity and interference are taken into account to guarantee QoS .

MotivationMotivation

An appropriate routing algorithm needs to find one or more feasible routes for each pair

interference

• signal-to-interference-and-noise ratio (SINR) Selected routed paths

• a linear-programming optimization technique The routes shall not be restricted by a particular topology The actual traffic demand of an MR varies as depending on

application needs of its serving clients

• a dynamic routing strategy

The Proposed Mechanism The Proposed Mechanism -assumptions (1/4)-assumptions (1/4)

Consider a single-channel single-transceiver MAC. There is only one gateway in the network. Packet loss is assumed to be neglected. The TDD (time division duplexing) mode is chosen h

ere for uplink and downlink transmissions.

the traffic demand of an MR v, D[v]

The Proposed Mechanism The Proposed Mechanism -assumptions (2/4)-assumptions (2/4)

The IEEE 802.16 standard provides multiple transmission rates by applying different modulation schemes and coding rates.

The receiver minimum input level sensitivity, RSS

The receiver signal-to-noise

ratio (SNR)

The number of OFDM subcarriers

usedN2log2The number of allocated subch

annelsThe sampling

frequency in MHz

BW is the channel bandwidth and η is a constant sampling factor.

The Proposed Mechanism The Proposed Mechanism -assumptions (3/4)-assumptions (3/4)

On the other hand, RSS is also given by

where EIRP is the effective isotropically-radiated power

Gt(dBi) : transmitter antenna gain. Gr(dBi) : receiver antenna gain. SLt : transmitter loss SLr : receiver loss. TxPower(dBW) : the transmission power. LM(dB) : the link margin. PL(dB): the transmission path loss.

The Proposed Mechanism The Proposed Mechanism -assumptions (4/4)-assumptions (4/4)

The MRs in WMBNs are assumed to be stationary and communicate without obstructions, the fading effects are negligible.

Adopt two-ray ground reflection model as our path loss model.

The Proposed Mechanism The Proposed Mechanism -flowchart-flowchart

gateway

The Proposed Mechanism The Proposed Mechanism -routing algorithm (1/4)-routing algorithm (1/4)

Authors slightly modify the Dijkstra’s algorithm to find a path from the gateway to a particular MR. the weights of wireless links could be changed as t

he alteration of network flows. the modified algorithm terminates immediately aft

er the path from the gateway to the target MR is discovered

The Proposed Mechanism The Proposed Mechanism -routing algorithm (2/4)-routing algorithm (2/4)

A mesh network is modeled as an undirected graph G = (V,E) V : MRs E : wireless links

E[G] : set of the wireless links. R[i, j] : the bit rate of link (i, j) derived. B[i, j] : the available bandwidth of link (i, j). D[v] : the traffic demand of router v. I[v] : the granted bandwidth of router v. (initially set by 0) U[G] : a subset of the nodes whose demands have not been sat

isfied. P[G] : a subset of the wireless links along the selected path.

The Proposed Mechanism The Proposed Mechanism -routing algorithm (3/4)-routing algorithm (3/4)

W[i, j] : the occupancy ratio of a link (i, j).

S[m, n] : the subtracted bandwidth quantity of link (m, n) interfered by link (i, j).

The Proposed Mechanism The Proposed Mechanism -routing algorithm (4/4)-routing algorithm (4/4)

to maximize the achievable traffic demand of router v, D’[v]

The Proposed Mechanism The Proposed Mechanism -scheduling algorithm-scheduling algorithm

F[i, j] : whether the demand of link (i, j) is already scheduled in the current schedule period

S[i, j] : whether link (i, j) is interfered by any other active links

The Proposed Mechanism The Proposed Mechanism -scheduling algorithm (cont.)-scheduling algorithm (cont.)

Q[G]: the subset of the links whose demands are satisfied.

extract non-blocking links

Performance Evaluation Performance Evaluation (1/5)(1/5)

20MRs are randomly distributed20MRs are randomly distributed 25 × 25 km25 × 25 km22 area area A gateway is placed in the center of the areaA gateway is placed in the center of the area The packet overheads conform to the RTP, UDP, IP

and IEEE 802.16 packet formats. The event-driven simulation is implemented by C++

programs.

Performance Evaluation Performance Evaluation (2/5)(2/5)

Performance Evaluation Performance Evaluation (3/5)(3/5)

Performance Evaluation Performance Evaluation (4/5)(4/5)

Performance Evaluation Performance Evaluation (5/5)(5/5)

the mean traffic demand: 150Kbps

ConclusionsConclusions

Authors considered the QoS problem for routing and scheduling in TDMA-based WMBNs.

Authors proposed an integrated routing and scheduling mechanism to provides QoS guarantees.

A linear programming optimization was devised to solve the amount of non-collision bandwidth.