Joint routing and scheduling via iterative link pruning in Wireless Mesh Networks

Friderikos, Vasilis and Papadaki, Katerina P. ORCID: 0000-0002-0755-1281 (2007) Joint routing and scheduling via iterative link pruning in Wireless Mesh Networks. Operational Research working papers (LSEOR 07.94). Operational Research Group, Department of Management, London School of Economics and Political Science, London, UK. ISBN 9780853280491

Preview

PDF Download (244kB) | Preview

Abstract

The focus of this paper is on routing in Wireless Mesh Networks (WMNs) that results in STDMA schedules with minimum frame length. In particular we focus on spanning tree construction and formulate the joint routing, power control and scheduling problem as a Mixed Integer Linear Program (MILP). Since this is an NP-complete problem, we propose an iterative pruning based routing scheme that utilizes scheduling information. Numerical investigations reveal that the iterative pruning algorithm outperforms previously proposed routing schemes that aim to minimize the transmitted power or interference produced without explicitly taking into account scheduling decisions.

Item Type:	Monograph (Working Paper)
Official URL:	http://www.lse.ac.uk/collections/operationalResear...
Additional Information:	© 2007 The London School of Economics and Political Science
Divisions:	Management
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics Q Science > QA Mathematics > QA76 Computer software
Date Deposited:	13 Feb 2009 14:38
Last Modified:	11 Dec 2024 18:49
URI:	http://eprints.lse.ac.uk/id/eprint/22706

Actions (login required)

View Item