Open Access

Interference Aware Routing for Minimum Frame Length Schedules in Wireless Mesh Networks

EURASIP Journal on Wireless Communications and Networking20082008:817876

Received: 18 January 2008

Accepted: 15 August 2008

Published: 27 August 2008


The focus of this paper is on routing in wireless mesh networks (WMNs) that results in spatial TDMA (STDMA) schedules with minimum frame length. In particular, the emphasis is on spanning tree construction; and we formulate the joint routing, power control, and scheduling problem as a mixedinteger linear program (MILP). Since this is an -complete problem, we propose a low-complexity iterative pruning-based routing scheme that utilizes scheduling information to construct the spanning tree. A randomized version of this scheme is also discussed and numerical investigations reveal that the proposed iterative pruning algorithms outperform previously proposed routing schemes that aim to minimize the transmitted power or interference produced in the network without explicitly taking into account scheduling decisions.

Publisher note

To access the full article, please see PDF.

Authors’ Affiliations

Division of Engineering, Centre for Telecommunications Research, King's College London
Department of Management, Operational Research Group, London School of Economics


© V. Friderikos and K. Papadaki. 2008

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.