Energy Efficient Scheduling with Individual Packet Delay Constraints: Offline and Online Results

Chen, Wanshi; Neely, Michael J.; Mitra, Urbashi

doi:10.1109/infcom.2007.136

Cited by 48 publications

(105 citation statements)

References 15 publications

Supporting

Mentioning

104

Contrasting

Order By: Relevance

“…Reference [4] deals with the tradeoffs between average delay and average power. In [5], an exact solution for the average packet delay under the optimal offline scheduler has been presented and the results of [4] have been extended to the multiuser context in [6].…”

Section: Introductionmentioning

confidence: 99%

Multiuser Opportunistic Scheduling for Hard Delay Constrained Systems

Butt

Kansanen

Müller

2008

2008 IEEE Sarnoff Symposium

View full text Add to dashboard Cite

Abstract-In this work, an opportunistic group scheduling scheme is proposed which schedules a group of users based upon the instantaneous channel conditions. The users empty the buffer partially corresponding to short term fast fading. The task is to provide a maximum hard delay guarantee to each user and minimize the consumption of the overall system energy. The scheme performs well for large networks because all the users perform scheduling independent of each other and no state information is required about the other users for the scheduling task, making the task simpler. The hard delay constraint is proposed as a system parameter to control the maximum delayenergy tradeoff and the results demonstrate the energy efficiency of the scheme for the multiuser environment.

show abstract

Section: Introductionmentioning

confidence: 99%

Multiuser Opportunistic Scheduling for Hard Delay Constrained Systems

Butt

Kansanen

Müller

2008

2008 IEEE Sarnoff Symposium

View full text Add to dashboard Cite

show abstract

“…Extensive studies were conducted along the line for offline packet scheduling, in which all packet timing information is available offline in order to determine packet transmission rates, or service times similarly. Researchers have studied the problem with different focuses, such as on a special application model (periodic streams) [19], offline generalization [23], distinguished characteristics of different packets [15], properties of offline schedulers [2] [3].…”

Section: Introductionmentioning

confidence: 99%

“…The decision must be made efficiently with a low time complexity. There are only limited results for online packet scheduling [13] [3]. Packets are assumed to have identical delay constraints in [3].…”

Section: Introductionmentioning

confidence: 99%

“…There are only limited results for online packet scheduling [13] [3]. Packets are assumed to have identical delay constraints in [3]. Both work assume packets have identical power characteristics and they only minimize the transmission power consumption.…”

Section: Introductionmentioning

confidence: 99%

“…In such cases, our problem formulation is similar to those in [13] [3]. Our proposed algorithm can be reduced to an algorithm with a linear time complexity in the number of backlogged arrivals, in contrast to the algorithms in [13] [3] with a square time complexity.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Online Energy Efficient Packet Scheduling with Delay Constraints in Wireless Networks

Zhong¹,

Xu²

2008

2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-We study online energy-efficient packet scheduling in a multi-user AWGN channel. The objective is to minimize the overall energy consumption in both transmission and circuit by adapting packet transmission rates with individual packet delay constraints. The scheduling is online in the sense that the transmission rates are determined without any assumption about future packet arrivals. We consider a transmitter with a general input and the transmitter communicates with multiple receivers with different distances, which means packets may have different power characteristics and delay constraints. We propose to conduct online rate assignment based on backlogged packets and derive the optimal algorithm in transmitting the packets. We compare the proposed scheduler with existing online algorithms via simulation in terms of energy consumption and algorithms efficiency. Results demonstrate the effectiveness of the online algorithms in striking a better energy-delay trade-off.

show abstract

Optimal on-off control for a class of discrete event systems with real-time constraints

Miao

Jiang

2019

Discrete Event Dyn Syst

View full text Add to dashboard Cite

This paper studies an optimal ON-OFF control problem for a class of discrete event systems with real-time constraints. Our goal is to minimize the overall costs, including the operating cost and the wake-up cost, while still guaranteeing the deadline of each individual task. In particular, we consider the homogeneous case in which it takes the same amount of time to serve each task and each task needs to be served by d seconds upon arrival. The problem involves two subproblems: (i) finding the best time to wake up the system and (ii) finding the best time to let the system go to sleep. We study the two subproblems in both off-line and on-line settings. In the off-line case that all task information is known a priori, we combine sample path analysis and dynamic programming to come up with the optimal solution. In the on-line scenario where future task information is completely unknown, we show that the optimal time to wake up the system can be obtained without relying on fu-

show abstract

Energy Efficient Scheduling with Individual Packet Delay Constraints: Offline and Online Results

Cited by 48 publications

References 15 publications

Multiuser Opportunistic Scheduling for Hard Delay Constrained Systems

Multiuser Opportunistic Scheduling for Hard Delay Constrained Systems

Online Energy Efficient Packet Scheduling with Delay Constraints in Wireless Networks

Optimal on-off control for a class of discrete event systems with real-time constraints

Contact Info

Product

Resources

About