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

DOI10.1016/J.TCS.2015.01.031zbMATH Open1332.68007OpenAlexW2053865002MaRDI QIDQ896135FDOQ896135

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

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

Cites Work

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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896135)