By Topic

Routing with Minimum Frame Length Schedules in Wireless 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
$31 $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)
Friderikos, V. ; Centre for Telecommun. Res., King''s Coll. London, London ; Papadaki, Katerina

In this article we focus on constructing routing paths in Wireless Mesh Networks (WMNs) that optimize STDMA scheduling. The optimal joint scheduling and routing problem is formulated as a Mixed Integer Linear Program (MILP). The chief difficulty is that this is an MV-complete problem, which naturally invites a study for suboptimal solutions. To this end, an iterative pruning routing algorithm is proposed that explicitly takes into account scheduling information in a STDMA WMN to construct shortest path rooted spanning trees. The pruning algorithm outperforms previously proposed routing schemes, which aim to minimize the transmitted power or interference produced without explicitly taking into account scheduling decisions.

Published in:

Globecom Workshops, 2007 IEEE

Date of Conference:

26-30 Nov. 2007