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

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

13 Downloads (Pure)

Abstract

Given a placement of wireless multi-radio nodes in space and a traffic demand between pairs of nodes, can these traffic demands be supported by the resulting network? The key issue in this setting is the wireless interference between neighbouring nodes using the same channel, including self-interference along multi-hop paths. We extend previous work addressing this problem taking into consideration the availability of multiple channels. As such, this paper presents a generic model for sustainable network load in a multi-hop multi-channel setting and recasts this model in a multicommodity flow problem with interference constraints. A theorem is stated which gives a necessary and sufficient condition for the feasibility of this multicommodity flow problem. From this theorem an upper bound is derived for the throughput that can be achieved by the network, which is illustrated by examples. We indicate how the results can be used as a basis for a channel allocating algorithm.
Original languageUndefined
Title of host publicationProceedings of Mobility 2008
Place of PublicationNew York
PublisherAssociation for Computing Machinery (ACM)
Pages94
Number of pages6
ISBN (Print)978-1-60558-089-0
DOIs
Publication statusPublished - 12 Sep 2008

Publication series

Name
PublisherACM

Keywords

  • IR-65211
  • METIS-254533
  • EWI-14597

Cite this

Coenen, T. J. M., de Graaf, M., & Boucherie, R. J. (2008). An upper bound on multi-hop multi-channel wireless network performance. In Proceedings of Mobility 2008 (pp. 94). New York: Association for Computing Machinery (ACM). https://doi.org/10.1145/1506270.1506386