Abstract
Most algorithmic studies in wireless networking to date employ simplified graphbased models such as the unit disk graph (UDG) model. These models conveniently abstract away complications stemming from interference and attenuation, and thus make it easier to deal with algorithmic issues. On the negative side, the simplifying assumptions adopted by the graph-based models result in network representations that fail to capture accurately some of the essential aspects of wireless communication.
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
Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: SINR diagrams: Towards algorithmically usable SINR models of wireless networks. In: Proc. 28th ACM Symp. on Principles of Distributed Computing (2009)
Kantor, E., Lotker, Z., Parter, M., Peleg, D.: The topology of wireless communication. In: Proc. 43rd ACM Symp. on Theory of Computing (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D. (2011). SINR Maps: Properties and Applications. In: Kosowski, A., Yamashita, M. (eds) Structural Information and Communication Complexity. SIROCCO 2011. Lecture Notes in Computer Science, vol 6796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-22212-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22211-5
Online ISBN: 978-3-642-22212-2
eBook Packages: Computer ScienceComputer Science (R0)