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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399–404 (1956)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
Gupta, K., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)
Gupta, R., Musacchio, J., Walrand, J.: Sufficient rate constraints for QoS flows in ad-hoc networks, UCB/ERL Technical Memorandum M04/42 (2004)
de Haan, R., Boucherie, R.J., van Ommeren, J-K.: Modelling multi-path signal interference in ad-hoc networks, Technical Memorandum, Dep. of Applied Mathematics, University of Twente (2006)
Jain, K., et al.: Impact of interference on multihop wireless network performance. In: Proc. of ACM Mobicom 2003, pp. 66–80. ACM Press, New York (2003)
Jia, Z., et al.: Bandwidth guaranteed routing for ad-hoc networks with interference constraints. In: Proc. of ISCC (2005)
Johansson, T., Carr-Motyckova, L.: Reducing interference in ad-hoc networks through topology control. In: Proc. of DIALM-POMC ’05, pp. 17–23 (2005)
Kodialam, M., Nandagopal, T.: Characterizing achievable rates in multihop wireless networks: The joint routing and scheduling problem. In: Proc. of ACM Mobicom 2003, pp. 42–54. ACM Press, New York (2003)
Kodialam, M., Nandagopal, T.: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In: Proc. of ACM Mobicom, ACM Press, New York (2005)
Litjens, R., et al.: Analysis of flow transfer times in IEEE 802.11 wireless LANs. Annales de télécommunications 59, 1407–1432 (2004)
von Rickenbach, P., et al.: A robust interference model for wireless ad-hoc networks. In: Proc. of IPDPS’05, vol. 13, p. 239.1 (2005)
Schrijver, A.: Combinatorial Optimization: Polyhedra and efficiency. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coenen, T., de Graaf, M., Boucherie, R.J. (2007). An Upper Bound on Multi-hop Wireless Network Performance. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)