Sciweavers

Share
INFOCOM
2010
IEEE

Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints

8 years 2 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with stringent delay requirements. However, distributed scheduling under delay constraints is not well understood and remains an under-explored area. A main goal of this study is to take some steps in this direction and explore the distributed opportunistic scheduling (DOS) with delay constraints. Consider a network with M links which contend for the channel using random access. Distributed scheduling in such a network requires joint channel probing and distributed scheduling. Using optimal stopping theory, we explore DOS for throughput maximization, under two different types of average delay constraints: 1) a network-wide constraint where the average delay should be no greater than α; or 2) individual user constraints where the average delay per user should be no greater than αm, m = 1, . . . , M. Since the sta...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R.
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where INFOCOM
Authors Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R. Zeidler
Comments (0)
books