Abstract
We consider the problem of capacity in wireless networks in the physical model. The goal of this paper is to compare different power assignments and models from the perspective of this problem. We show a family of power assignments, including the mean power assignment, which yield larger capacity than uniform and linear power assignments, for each network instance. On the other hand, uniform and linear power assignments are not worse (in the same sense) than any power assignment, which is decreasing as a function of link-length, or increasing faster than linear power assignment. We also compare the directed and bidirectional communication models, and show upper and lower bounds on the gap between optimal capacities using any power assignment in these communication models.
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
Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In: Proc. of 28th Annual IEEE Conference on Computer Communications, INFOCOM (2009)
Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks. In: Proc. of 28th Annual Symposium on Principles of Distributed Computing, PODC (2009)
Avin, C., Lotker, Z., Pasquale, F., Pignolet, Y.-A.: A Note on Uniform Power Connectivity in the SINR Model. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol. 5804, pp. 116–127. Springer, Heidelberg (2009)
Chafekar, D., Kumar, V., Marathe, M., Parthasarathi, S., Srinivasan, A.: Cross-layer Latency Minimization for Wireless Networks using SINR Constraints. In: Proc. of ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2007)
Erlebach, T., Grant, T.: Scheduling Multicast Transmissions under SINR Constraints. In: Scheideler, C. (ed.) ALGOSENSORS 2010. LNCS, vol. 6451, pp. 47–61. Springer, Heidelberg (2010)
Fanghänel, A., Kesselheim, T., Räcke, H., Vöcking, B.: Oblivious interference scheduling. In: Proc. 28th Symposium on Principles of Distributed Computing, PODC (2009)
Fanghänel, A., Keßelheim, T., Vöcking, B.: Improved Algorithms for Latency Minimization in Wireless Networks. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 447–458. Springer, Heidelberg (2009)
Goussevskaia, O., Halldórsson, M.M., Wattenhofer, R., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: Proc. of 28th Annual IEEE Conference on Computer Communications, INFOCOM (2009)
Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: Proc. of 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2007)
Gronkvist, J., Hansson, A.: Comparison between Graph-Based and Interference-Based STDMA scheduling. In: Proc. of ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2001)
Halldórsson, M.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.M.: Wireless Scheduling with Power Control, http://arxiv.org/abs/1010.3427
Halldórsson, M.M., Mitra, P.: Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 625–636. Springer, Heidelberg (2011)
Halldórsson, M.M., Mitra, P.: Wireless Capacity with Oblivious Power in General Metrics. In: Proc. of ACM-SIAM Symposiun on Discrete Algorithms, SODA (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)
Hardy, G.H., Littlewood, J.E., Pólya, G.: Inequalities. Cambridge University Press (1934)
Kesselheim, T.: A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. In: Proc. of 22nd ACM-SIAM Symposium on Discrete Algorithms, SODA (2011)
Kesselheim, T., Vöcking, B.: Distributed Contention Resolution in Wireless Networks. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 163–178. Springer, Heidelberg (2010)
Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In: Proc. of 26th Annual IEEE Conference on Computer Communications, INFOCOM (2006)
Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: Proc. of 26th Annual IEEE Conference on Computer Communications, INFOCOM (2006)
Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol design beyond Graph-Based models. In: Hot Topics in Networks, HotNets (2006)
Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology Control meets SINR: The Scheduling Complexity of Arbitrary Topologies. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2006)
Brar, G., Blough, D., Santi, P.: Computationally Efficient Scheduling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks. In: Proc. of the 12th ACM Annual International Conference on Mobile Computing and Networking, MobiCom (2006)
Tonoyan, T.: A constant factor algorithm for scheduling with linear powers. In: Proc. of 2010 International Conference on Intelligent Network and Computing, ICINC (2010)
Tonoyan, T.: Algorithms for Scheduling with Power Control in Wireless Networks. In: Marchetti-Spaccamela, A., Segal, M. (eds.) TAPAS 2011. LNCS, vol. 6595, pp. 252–263. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tonoyan, T. (2012). On the Capacity of Oblivious Powers. 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_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-28209-6_18
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)