Abstract
Interference is a fundamental limiting factor in wireless networks. Due to interaction among transmissions of neighboring nodes and need for multi-hop routing in large networks, it is a non-trivial problem to estimate how much throughput a network can deliver. In an important piece of work, Gupta and Kumar [3] showed that in a random model, where n identical nodes are distributed uniformly in a unit square and each node is communicating with a random destination, the capacity of the network as measured in bit-meters/sec is \({O}(\sqrt{n})\). This result articulates the packing constraint of the n paths: on average each path is \(\Theta (\sqrt{n})\) hops long, and thus in the space of size O(n), only \({O}(\sqrt{n})\) paths can be accommodated.
The research of Chiranjeeb Buragohain and Subhash Suri was supported in part by the National Science Foundation under grants CNS-0626954 and CCF-0514738.
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
Alicherry, M., Bhatia, R., Li, L.: Joint channel assignment and routing for throughput optimization in multiradio wireless mesh networks. In: Proc. Mobicom, ACM Press, New York (2005)
Draves, R.P., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh network. In: Proc. MobiCom, ACM Press, New York (2004)
Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 388–404 (2000)
Jain, K., Padhye, J., Padmanabhan, V., Qiu, L.: Impact of interference on multi-hop wireless network performance. In: Proc. Mobicom, ACM Press, New York (2003)
Kodialam, M., Nandagopal, T.: Characterizing the achievable rates in multihop wireless networks. In: Proc. MobiCom, ACM Press, New York (2003)
Kodialam, M., Nandagopal, T.: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In: Proc. MobiCom, ACM Press, New York (2005)
Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-end packet-scheduling in wireless ad-hoc networks. In: Proc. SODA, pp. 1021–1030. ACM Press, New York (2004)
Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Algorithmic aspects of capacity in wireless networks. In: Proc. SIGMETRICS, ACM Press, New York (2005)
Kyasanur, P., Vaidya, N.H.: Capacity of multi-channel wireless networks: Impact of number of channels and interfaces. In: Proc. MobiCom, ACM Press, New York (2005)
Li, J., Blake, C., Couto, D.S.J.D., Lee, H.I., Morris, R.: Capacity of ad hoc wireless networks. In: Proc. MobiCom, ACM Press, New York (2001)
Padhye, J., Agarwal, S., Padmanabhan, V., Qiu, L., Rao, A., Zill, B.: Estimation of link interference in static multi-hop wireless networks. In: Proc. Internet Measurement Conf. ACM Press, New York (2005)
Raniwala, A., Chiueh, T.-C.: Architecture and algorithms for an ieee 802.11-based multi-channel wireless mesh network. In: Proc. INFOCOM, IEEE (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buragohain, C., Suri, S., Tóth, C.D., Zhou, Y. (2007). Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. In: Lin, G. (eds) Computing and Combinatorics. COCOON 2007. Lecture Notes in Computer Science, vol 4598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73545-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-73545-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73544-1
Online ISBN: 978-3-540-73545-8
eBook Packages: Computer ScienceComputer Science (R0)