TY - GEN
T1 - SINR maps
T2 - 18th Colloquium on Structural Information and Communication Complexity, SIROCCO 2011
AU - Peleg, David
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=79961143967&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22212-2_2
DO - 10.1007/978-3-642-22212-2_2
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:79961143967
SN - 9783642222115
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 15
EP - 16
BT - Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Proceedings
Y2 - 26 June 2011 through 29 June 2011
ER -