An upper bound on multi-hop wireless network performance

Tom Johannes Maria Coenen; Maurits de Graaf; Richardus J. Boucherie

doi:10.1007/978-3-540-72990-7_32

An upper bound on multi-hop wireless network performance

Tom Johannes Maria Coenen, Maurits de Graaf, Richardus J. Boucherie

Stochastic Operations Research

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

7 Downloads (Pure)

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.

Original language	Undefined
Title of host publication	International Teletraffic Congress, ITC-20 2007
Editors	Lorne Mason, Tadeusz Drwiega, James Yan
Place of Publication	Berlin/Heidelberg
Publisher	Springer
Pages	335-347
Number of pages	13
ISBN (Print)	9783540729907
DOIs	https://doi.org/10.1007/978-3-540-72990-7_32
Publication status	Published - 2007
Event	20th International Teletraffic Congress 2007 - Ottawa, Canada Duration: 17 Jun 2007 → 21 Jun 2007 Conference number: 20

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Verlag
Number	Paper P-NS
Volume	4516
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th International Teletraffic Congress 2007
Abbreviated title	ITC 2007
Country/Territory	Canada
City	Ottawa
Period	17/06/07 → 21/06/07

Keywords

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

Access to Document

10.1007/978-3-540-72990-7_32

http://eprints.eemcs.utwente.nl/secure2/11400/01/2007-XCoenenGraafBoucherie.pdf

Cite this

@inproceedings{350c0ad73cdb43e9ab6547d323728ae3,

title = "An upper bound on multi-hop wireless network performance",

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{\textquoteright} 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.",

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

author = "Coenen, {Tom Johannes Maria} and {de Graaf}, Maurits and Boucherie, {Richardus J.}",

note = "10.1007/978-3-540-72990-7_32 ; 20th International Teletraffic Congress 2007 ; Conference date: 17-06-2007 Through 21-06-2007",

year = "2007",

doi = "10.1007/978-3-540-72990-7_32",

language = "Undefined",

isbn = "9783540729907",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "Paper P-NS",

pages = "335--347",

editor = "Lorne Mason and Tadeusz Drwiega and James Yan",

booktitle = "International Teletraffic Congress, ITC-20 2007",

address = "Germany",

}

Coenen, TJM, de Graaf, M & Boucherie, RJ 2007, An upper bound on multi-hop wireless network performance. in L Mason, T Drwiega & J Yan (eds), International Teletraffic Congress, ITC-20 2007. Lecture Notes in Computer Science, no. Paper P-NS, vol. 4516, Springer, Berlin/Heidelberg, pp. 335-347, 20th International Teletraffic Congress 2007, Ottawa, Canada, 17/06/07. https://doi.org/10.1007/978-3-540-72990-7_32

An upper bound on multi-hop wireless network performance. / Coenen, Tom Johannes Maria; de Graaf, Maurits; Boucherie, Richardus J.
International Teletraffic Congress, ITC-20 2007. ed. / Lorne Mason; Tadeusz Drwiega; James Yan. Berlin/Heidelberg: Springer, 2007. p. 335-347 (Lecture Notes in Computer Science; Vol. 4516, No. Paper P-NS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - An upper bound on multi-hop wireless network performance

AU - Coenen, Tom Johannes Maria

AU - de Graaf, Maurits

AU - Boucherie, Richardus J.

N1 - Conference code: 20

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - MSC-90B18

KW - Wireless multi-hop network - interference - multicommodity flow problem - cut condition

KW - IR-62016

KW - METIS-245773

KW - EWI-11400

U2 - 10.1007/978-3-540-72990-7_32

DO - 10.1007/978-3-540-72990-7_32

M3 - Conference contribution

SN - 9783540729907

T3 - Lecture Notes in Computer Science

SP - 335

EP - 347

BT - International Teletraffic Congress, ITC-20 2007

A2 - Mason, Lorne

A2 - Drwiega, Tadeusz

A2 - Yan, James

PB - Springer

CY - Berlin/Heidelberg

T2 - 20th International Teletraffic Congress 2007

Y2 - 17 June 2007 through 21 June 2007

ER -