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


Share/Save/Bookmark

Coenen, T.J.M. and Graaf, M. and Boucherie, Richard J. (2008) An upper bound on multi-hop multi-channel wireless network performance. In: International Conference on Mobile Technology, Applications, and Systems, Mobility 2008, 10-12 September 2008, Ilan, Taiwan.

[img]PDF
Restricted to UT campus only
: Request a copy
147Kb
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.
Item Type:Conference or Workshop Item
Copyright:© 2008 ACM
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65211
Official URL:http://dx.doi.org/10.1145/1506270.1506386
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 254533