An upper bound on multi-hop wireless network performance

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)


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.
Original languageUndefined
Title of host publicationInternational Teletraffic Congress, ITC-20 2007
EditorsLorne Mason, Tadeusz Drwiega, James Yan
Place of PublicationBerlin/Heidelberg
Number of pages13
ISBN (Print)9783540729907
Publication statusPublished - 2007
Event20th International Teletraffic Congress 2007 - Ottawa, Canada
Duration: 17 Jun 200721 Jun 2007
Conference number: 20

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
NumberPaper P-NS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference20th International Teletraffic Congress 2007
Abbreviated titleITC 2007


  • MSC-90B18
  • Wireless multi-hop network - interference - multicommodity flow problem - cut condition
  • IR-62016
  • METIS-245773
  • EWI-11400

Cite this

Coenen, T. J. M., de Graaf, M., & Boucherie, R. J. (2007). An upper bound on multi-hop wireless network performance. In L. Mason, T. Drwiega, & J. Yan (Eds.), International Teletraffic Congress, ITC-20 2007 (pp. 335-347). (Lecture Notes in Computer Science; Vol. 4516, No. Paper P-NS). Berlin/Heidelberg: Springer.