SINR maps: Properties and applications

David Peleg

doi:10.1007/978-3-642-22212-2_2

SINR maps: Properties and applications

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Proceedings
Pages	15-16
Number of pages	2
DOIs	https://doi.org/10.1007/978-3-642-22212-2_2
State	Published - 2011
Externally published	Yes
Event	18th Colloquium on Structural Information and Communication Complexity, SIROCCO 2011 - Gdansk, Poland Duration: 26 Jun 2011 → 29 Jun 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6796 LNCS

Conference

Conference	18th Colloquium on Structural Information and Communication Complexity, SIROCCO 2011
Country/Territory	Poland
City	Gdansk
Period	26/06/11 → 29/06/11

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-22212-2_2

Cite this

Peleg, D. (2011). SINR maps: Properties and applications. In Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Proceedings (pp. 15-16). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6796 LNCS). https://doi.org/10.1007/978-3-642-22212-2_2

@inproceedings{95215a2c993e4e82969cc82fa11aaf52,

title = "SINR maps: Properties and applications",

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.",

author = "David Peleg",

year = "2011",

doi = "10.1007/978-3-642-22212-2_2",

language = "الإنجليزيّة",

isbn = "9783642222115",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "15--16",

booktitle = "Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Proceedings",

note = "18th Colloquium on Structural Information and Communication Complexity, SIROCCO 2011 ; Conference date: 26-06-2011 Through 29-06-2011",

}

Peleg, D 2011, SINR maps: Properties and applications. in Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6796 LNCS, pp. 15-16, 18th Colloquium on Structural Information and Communication Complexity, SIROCCO 2011, Gdansk, Poland, 26/06/11. https://doi.org/10.1007/978-3-642-22212-2_2

SINR maps: Properties and applications. / Peleg, David.
Structural Information and Communication Complexity - 18th International Colloquium, SIROCCO 2011, Proceedings. 2011. p. 15-16 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6796 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - منشور من مؤتمر

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 -

SINR maps: Properties and applications

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this