Abstract
In this paper the capacity and scheduling problems for wireless networks are considered. It is shown that when using the mean power scheme for the capacity problem, the conflict graph based interference model approximates the SINR model within a constant factor of approximation. Such an approximation does not take place for the uniform and linear power schemes. Using this result, it is also shown that under certain assumptions on the underlying metric space, the mean power scheme yields shorter (asymptotically) schedules than the uniform and linear power schemes, for any set of links. This supports the theoretical evidence that the mean power scheme is more efficient and scalable to different network topologies than more traditional uniform and linear power schemes, and could be a better candidate for MAC protocols.
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
References
Grönkvist, J., Hansson, A.: Comparison between graph-based and interference-based STDMA scheduling. In: 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 255–258 (2001)
Moscibroda, T., Wattenhofer, R., Yves, W.: Protocol design beyond graph-based models. In: 5th ACM SIGCOMM Workshop on Hot Topics in Networks (2006)
Behzad, A., Rubin, I.: On the performance of graph-based scheduling algorithms for packet radio networks. In: IEEE Global Telecommunications Conference, pp. 3432–3436 (2003)
Chafekar, D., Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for computing capacity of wireless networks with SINR constraints. In: 27th IEEE International Conference on Computer Communications, pp. 1166–1174 (2008)
Halldórsson, M.M.: Wireless scheduling with power control. ACM Trans. Algorithms 9(1), 7 (2012)
Tonoyan, T.: Comparing schedules in the SINR and conflict-graph models with different power schemes. In: 12th International Conference on Ad Hoc Networks and Wireless, pp. 317–328 (2013)
Tonoyan, T.: On the capacity of oblivious powers. In: 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, pp. 225–237 (2012)
Halldórsson, M.M., Holzer, S., Mitra, P., Wattenhofer, R.: The power of non-uniform wireless power. In: 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1595–1606 (2013)
Rappaport, T.S.: Wireless Communications: Principles and Practice, 2nd edn. Prentice Hall, Upper Saddle River (2002)
Heinonen, J.: Lectures on Analysis on Metric Spaces, 1st edn. Springer, New York (2000)
Halldórsson, M.M., Mitra, P.: Wireless capacity with oblivious power in general metrics. In: 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1538–1548 (2011)
Halldórsson, M.M., Wattenhofer, R.: Wireless communication is in APX. In: 36th International Colloquium on Automata, Languages and Programming, pp. 525–536 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tonoyan, T. (2014). Conflict Graphs and the Capacity of the Mean Power Scheme. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2013. Lecture Notes in Computer Science(), vol 8243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45346-5_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-45346-5_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45345-8
Online ISBN: 978-3-642-45346-5
eBook Packages: Computer ScienceComputer Science (R0)