By Topic

G-BFS: A Scheme for Scheduling Real-Time CBR Traffic in IEEE 802.11-Based Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jun Zou ; Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, Ont. ; Dongmei Zhao

A bottleneck first scheduling (BFS) scheme was proposed in our previous work for scheduling constant bit rate (CBR) real-time traffic in a wireless mesh network with a tree topology. In this paper we extend the BFS scheme for scheduling CBR real-time traffic in a mesh network with a more general topology. We consider an IEEE 802.11-based infrastructure wireless mesh network, where access points (APs) form a graph topology for forwarding traffic inside the mesh network or between the mesh network and the wireline backbone network. The new scheduling scheme is referred to as G-BFS, where "G" stands for "graph". We also model the scheduling problem and find the suboptimal performance. Our results show that the proposed G-BFS scheduling scheme achieves a capacity very close to the suboptimal capacity, while keeping low packet transmission delay.

Published in:

2007 IEEE Wireless Communications and Networking Conference

Date of Conference:

11-15 March 2007