ACM Home Page
Please provide us with feedback. Feedback
An upper bound on multi-hop multi-channel wireless network performance
Full text PdfPdf (410 KB)
Source International Conference On Mobile Technology, Applications, And Systems archive
Proceedings of the International Conference on Mobile Technology, Applications, and Systems table of contents
Yilan, Taiwan
WORKSHOP SESSION: IPAWN workshop table of contents
Article No. 94  
Year of Publication: 2008
ISBN:978-1-60558-089-0
Authors
T. J. M. Coenen  University of Twente, The Netherlands
M. de Graaf  Huizen, The Netherlands
Richard J. Boucherie  University of Twente, The Netherlands
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 15,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1506270.1506386
What is a DOI?

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


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Coenen, T. J. M, de Graaf, M. and Boucherie, R. J., An upper bound on multi-hop wireless network performance, Lecture Notes on Computer Science, vol. 4516/2007, p 335--347, 2007.
 
2
Ford, L. R. and Fulkerson, D. R., Maximal flow through a network, Canadian Journal of Mathematics, vol. 8, p 399--404, 1956.
 
3
Ford, L. R. and Fulkerson, D. R., Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
 
4
Gupta, K. and Kumar, P. R., The capacity of wireless networks, IEEE Transactions on Information Theory, 46(2), p 388--404, 2000.
 
5
Gupta, R., Musacchio, J. and Walrand, J., Sufficient rate constraints for QoS flows in ad-hoc networks, UCB/ERL Technical Memorandum M04/42, 2004.
 
6
Haan, R. de, Boucherie, R. J. and Ommeren, J. C. W. van, The impact of interference on optimal multi-path routing in ad hoc networks, Lecture Notes on Computer Science, vol. 4516/2007, p 803--815, 2007.
7
8
9
 
10
Kyasanur, P. N. and Vaidya, N. H., Multi-channel wireless networks: Capacity and protocols, Technical Report, University of Illinois at Urbana-Champaign, 2005.
11
 
12
Schrijver, A., Combinatorial Optimization: Polyhedra and efficiency, Springer, Berlin, 2003.
 
13
Stemerdink, J., A Simulation Approach to a Robust Multi-radio Multi-channel Wireless Ad Hoc Network, Proceedings of the IST Mobile Summit 2007, Budapest, Hungary, June 2007.

Collaborative Colleagues:
T. J. M. Coenen: colleagues
M. de Graaf: colleagues
Richard J. Boucherie: colleagues