Wireless capacity with arbitrary gain matrix

DOI10.1016/j.tcs.2013.09.035zbMath1360.68153OpenAlexW2076403558MaRDI QIDQ742412

Pradipta Mitra, Magnús M. Halldórsson

Publication date: 18 September 2014

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

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

zbMATH Keywords

semidefinite programmingwireless networksSINR model

Mathematics Subject Classification ID

Semidefinite programming (90C22) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearly optimal bounds for distributed wireless scheduling in the SINR model
• Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates
• Convergence Time of Power-Control Dynamics
• Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
• Distributed Contention Resolution in Wireless Networks
• Wireless Communication Is in APX
• Approximate graph coloring by semidefinite programming
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Coloring -colorable graphs using relatively small palettes
• Semidefinite Programming
• Oblivious interference scheduling
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• The topology of wireless communication

This page was built for publication: Wireless capacity with arbitrary gain matrix