Conflict graphs and the SINR-capacity of the mean power scheme

DOI10.1016/J.TCS.2015.01.031zbMath1332.68007OpenAlexW2053865002MaRDI QIDQ896135

Tigran Tonoyan

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.031

zbMATH Keywords

capacitywireless networksconflict graphsSINR

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model

Cites Work

• Unnamed Item
• Unnamed Item
• Nearly optimal bounds for distributed wireless scheduling in the SINR model
• Lectures on analysis on metric spaces
• Wireless scheduling with power control
• Splitting digraphs
• Distributed Contention Resolution in Wireless Networks
• Wireless Communication Is in APX
• Oblivious interference scheduling
• On Some Bounds on the Optimum Schedule Length in the SINR Model
• The Power of Non-Uniform Wireless Power

This page was built for publication: Conflict graphs and the SINR-capacity of the mean power scheme