Abstract
We present an algorithm for multi-hop routing and scheduling of requests in wireless networks in the sinr model. The goal of our algorithm is to maximize the throughput or maximize the minimum ratio between the flow and the demand.
Our algorithm partitions the links into buckets. Every bucket consists of a set of links that have nearly equivalent reception powers. We denote the number of nonempty buckets by σ. Our algorithm obtains an approximation ratio of O(σ·logn), where n denotes the number of nodes. For the case of linear powers σ = 1, hence the approximation ratio of the algorithm is O(logn). This is the first practical approximation algorithm for linear powers with an approximation ratio that depends only on n (and not on the max-to-min distance ratio).
If the transmission power of each link is part of the input (and arbitrary), then σ ≤ logΓ + logΔ, where Γ denotes the ratio of the max-to-min power, and Δ denotes the ratio of the max-to-min distance. Hence, the approximation ratio is O(logn ·(logΓ + logΔ)).
Finally, we consider the case that the algorithm needs to assign powers to each link in a range [P min ,P max ]. An extension of the algorithm to this case achieves an approximation ratio of O[(logn + loglogΓ) ·(logΓ + logΔ)].
The full version of this paper can be found in http://arxiv.org/abs/1104.1330
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.E.: Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. In: MobiCom, pp. 58–72. ACM (2005)
Chafekar, D.R.: Capacity Characterization of Multi-Hop Wireless Networks-A Cross Layer Approach. PhD thesis, Virginia Polytechnic Institute and State University (2009)
Chafekar, D., Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Cross-layer latency minimization in wireless networks with SINR constraints. In: MobiHoc, pp. 110–119. ACM (2007)
Chafekar, D., Kumart, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for computing capacity of wireless networks with SINR constraints. In: INFOCOM 2008, pp. 1166–1174 (2008)
Fanghänel, A., Kesselheim, T., Vöcking, B.: Improved algorithms for latency minimization in wireless networks. Theoretical Computer Science (2010)
Gallager, R.G.: Information theory and reliable communication. John Wiley & Sons, Inc., New York (1968)
Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)
Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: MobiHoc, pp. 100–109. ACM (2007)
Goussevskaia, O., Wattenhofer, R., Halldórsson, M., Welzl, E.: Capacity of arbitrary wireless networks. In: INFOCOM 2009, pp. 1872–1880 (2009)
Halldórsson, M.: Wireless Scheduling with Power Control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 361–372. Springer, Heidelberg (2009)
Halldórsson, M., Mitra, P.: Wireless Capacity with Oblivious Power in General Metrics. In: SODA (2011)
Halldorsson, M.M., Mitra, P.: Nearly optimal bounds for distributed wireless scheduling in the sinr model. Arxiv preprint arXiv:1104.5200 (2011)
Halldórsson, M.M., Wattenhofer, R.: Wireless Communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 525–536. Springer, Heidelberg (2009)
Kesselheim, T.: A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In: Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms, SODA (2011)
Kesselheim, T., Vöcking, B.: Distributed contention resolution in wireless networks. Distributed Computing, 163–178 (2010)
Lin, X., Shroff, N.B., Srikant, R.: A tutorial on cross-layer optimization in wireless networks. IEEE Journal on Selected Areas in Communications 24(8), 1452–1463 (2006)
Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proc. of the 25th IEEE INFOCOM. Citeseer (2006)
Tonoyan, T.: Algorithms for Scheduling with Power Control in Wireless Networks. Arxiv preprint arXiv:1010.5493 (2010)
Wan, P.J.: Multiflows in multihop wireless networks. In: MobiHoc, pp. 85–94. ACM (2009)
Wan, P.J., Frieder, O., Jia, X., Yao, F., Xu, X., Tang, S.: Wireless link scheduling under physical interference model (2011)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Even, G., Matsri, Y., Medina, M. (2012). Multi-hop Routing and Scheduling in Wireless Networks in the SINR Model. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2011. Lecture Notes in Computer Science, vol 7111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-28209-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28208-9
Online ISBN: 978-3-642-28209-6
eBook Packages: Computer ScienceComputer Science (R0)