Wireless Link Scheduling With Power Control and SINR Constraints
From MaRDI portal
Publication:3548012
DOI10.1109/TIT.2006.883617zbMATH Open1320.90025MaRDI QIDQ3548012FDOQ3548012
Authors: Steven A. Borbash, Anthony Ephremides
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Deterministic scheduling theory in operations research (90B35) Communication theory (94A05) Communication networks in operations research (90B18)
Cited In (11)
- Leader election in SINR model with arbitrary power control
- The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication
- Optimal scheduling and power allocation in wireless networks with heavy traffic
- Algorithms for scheduling with power control in wireless networks
- Approximation algorithms for wireless link scheduling with flexible data rates
- The topology of wireless communication on a line
- Information dissemination in wireless ad-hoc networks under the weighted-TIM framework
- Energy efficient spatial TDMA scheduling in wireless networks
- On some bounds on the optimum schedule length in the SINR model
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model
- Wireless scheduling with power control
This page was built for publication: Wireless Link Scheduling With Power Control and SINR Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548012)