### Abstract

Original language | Undefined |
---|---|

Title of host publication | Proceedings of Mobility 2008 |

Place of Publication | New York |

Publisher | Association for Computing Machinery (ACM) |

Pages | 94 |

Number of pages | 6 |

ISBN (Print) | 978-1-60558-089-0 |

DOIs | |

Publication status | Published - 12 Sep 2008 |

### Publication series

Name | |
---|---|

Publisher | ACM |

### Keywords

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

### Cite this

*Proceedings of Mobility 2008*(pp. 94). New York: Association for Computing Machinery (ACM). https://doi.org/10.1145/1506270.1506386

}

*Proceedings of Mobility 2008.*Association for Computing Machinery (ACM), New York, pp. 94. https://doi.org/10.1145/1506270.1506386

**An upper bound on multi-hop multi-channel wireless network performance.** / Coenen, Tom Johannes Maria; de Graaf, Maurits; Boucherie, Richardus J.

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

TY - GEN

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

AU - Coenen, Tom Johannes Maria

AU - de Graaf, Maurits

AU - Boucherie, Richardus J.

PY - 2008/9/12

Y1 - 2008/9/12

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

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

KW - IR-65211

KW - METIS-254533

KW - EWI-14597

U2 - 10.1145/1506270.1506386

DO - 10.1145/1506270.1506386

M3 - Conference contribution

SN - 978-1-60558-089-0

SP - 94

BT - Proceedings of Mobility 2008

PB - Association for Computing Machinery (ACM)

CY - New York

ER -