✦ LIBER ✦

Opportunistic Fair Scheduling in Wireless Networks: An Approximate Dynamic Programming Approach

✍ Scribed by Zhi Zhang; Sudhir Moola; Edwin K. P. Chong

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 484 KB
Volume: 15
Category: Article
ISSN: 1383-469X
DOI: 10.1007/s11036-009-0198-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A unified framework for opportunistic fa

A unified framework for opportunistic fair scheduling in wireless networks: a dual approach

✍ Jeong-Ahn Kwon; Byung-Gook Kim; Jang-Won Lee 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 609 KB

Minimum-energy broadcast and multicast i

Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms

✍ Di Yuan; Joanna Bauer; Dag Haugland 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 835 KB

Both integer programming models and heuristic algorithms have been proposed for finding minimum-energy broadcast and multicast trees in wireless ad hoc networks. Among heuristic algorithms, the broadcast/multicast incremental power (BIP/MIP) algorithm is most known. The theoretical performance of BI

An approximate dynamic programing approa

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

✍ Dong Li; Kevin D. Glazebrook 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB

A dynamic programming approach of findin

A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time

✍ Wun-Tat Chan; Francis Y. L. Chin; Yong Zhang; Hong Zhu; Hong Shen; Prudence W. H 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 293 KB