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

Friderikos, V. & Papadaki, K.ORCID logo (2008). Interference aware routing for minimum frame length schedules in wireless mesh networks. Eurasip Journal on Wireless Communications and Networking, https://doi.org/10.1155/2008/817876
Copy

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
Copyright holders © 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 properl
Departments LSE > Academic Departments > Management
DOI 10.1155/2008/817876
Date Deposited 08 Dec 2009
URI https://researchonline.lse.ac.uk/id/eprint/26208

Explore Further

picture_as_pdf
Download

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics