Exploiting Wireless Channel State Information for Throughput Maximization

DOI10.1109/TIT.2004.836687MaRDI QIDQ3547725zbMATH OpenFDO

Authors Vagelis Tsibonis, Leonidas Georgiadis, Leandros Tassiulas

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2004.836687

Mathematics Subject Classification ID

Communication theory (94A05) Coding theorems (Shannon theory) (94A24)

Recommendations

• A state action frequency approach to throughput maximization over uncertain wireless channels
• Pathwise optimality of the exponential scheduling rule for wireless channels
• scientific article; zbMATH DE number 1936539
• A framework for opportunistic scheduling in wireless networks.
• Wireless scheduling with partial channel state information: large deviations and optimality

Cited in

(24)

• A framework for opportunistic scheduling in wireless networks.
• Scheduling real-time traffic with deadlines over a wireless channel
• Adaptive packet scheduling over a wireless channel under constrained jamming
• Throughput analysis in wireless networks with multiple users and multiple channels
• Wireless scheduling with partial channel state information: large deviations and optimality
• A state action frequency approach to throughput maximization over uncertain wireless channels
• Scheduling weighted packets with deadlines over a fading channel
• New Algorithms for Online Rectangle Filling with k-Lookahead
• Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity
• Optimal Transmission Policies for Noisy Channels
• On distributed scheduling with heterogeneously delayed network-state information
• Scheduling with pairwise XORing of packets under statistical overhearing information and feedback
• Queueing systems with hard delay constraints: a framework for real-time communication over unreliable wireless channels
• Optimal size-based opportunistic scheduler for wireless systems
• An improved algorithm for online rectangle filling
• Scheduling and performance limits of networks with constantly changing topology
• scientific article; zbMATH DE number 1936539 (Why is no real title available?)
• Pathwise optimality of the exponential scheduling rule for wireless channels
• scientific article; zbMATH DE number 5208521 (Why is no real title available?)
• Structural results on optimal transmission scheduling over dynamical fading channels: a constrained Markov decision process approach
• Scheduling and control of multi-node mobile communications systems with randomly-varying channels by stability methods
• Online Rectangle Filling
• New algorithms for online rectangle filling with k-lookahead
• Online rectangle filling

This page was built for publication: Exploiting Wireless Channel State Information for Throughput Maximization

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