An upper bound on multi-hop wireless network performance

Coenen, Tom and Graaf de, Maurits and Boucherie, Richard J. (2007) An upper bound on multi-hop wireless network performance. In: International Teletraffic Congress, ITC20, 17-21 June 2007, Ottawa, Canada.

PDF
Restricted to UT campus only: Request a copy
424Kb

Abstract:	Given a placement of wireless nodes in space and a traffic demand between pairs of nodes, can these traffic demands be supported by the resulting network? A key issue for answering this question is wireless interference between neighbouring nodes including self interference along multi-hop paths. This paper presents a generic model for sustainable network load in a multi-hop wireless network under interference constraints, and recasts this model into a multicommodity flow problem with interference constraints. Using Farkas’ Lemma, we obtain a necessary and sufficient condition for feasibility of this multicommodity flow problem, leading to a tight upper bound on network throughput. Our results are illustrated by examples.
Item Type:	Conference or Workshop Item
Copyright:	© 2007 Springer
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Stochastic Operations Research (SOR)
Link to this item:	http://purl.utwente.nl/publications/62016
Official URL:	http://dx.doi.org/10.1007/978-3-540-72990-7_32
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 245773