Interference aware routing for minimum frame length schedules in wireless mesh networks

Friderikos, Vasilis and Papadaki, Katerina ORCID: 0000-0002-0755-1281 (2008) Interference aware routing for minimum frame length schedules in wireless mesh networks. Eurasip Journal on Wireless Communications and Networking. ISSN 1687-1499

Preview

PDF Download (689kB) | Preview

Abstract

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

Item Type:	Article
Official URL:	http://www.hindawi.com/journals/wcn/
Additional Information:	© 2008 Vasilis Friderikos and Katerina Papadaki. 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.
Divisions:	Management
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited:	08 Dec 2009 10:02
Last Modified:	12 Nov 2024 19:42
URI:	http://eprints.lse.ac.uk/id/eprint/26208

Actions (login required)

View Item