Fair Scheduling for On-Demand Time-Critical Data Broadcast

Hu, Chih‐Lin

doi:10.1109/icc.2007.966

Cited by 9 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…EDF [12] used to be one of the most classical task scheduling algorithms in realtime systems. However, when system load is high, the EDF strategy for scheduling real-time requests in broadcast environment loses its advantage, as most of the requests are likely to miss their deadlines [6,7,17]. Recently, an on-line scheduling algorithm for time critical on-demand broadcast has been proposed.…”

Section: Related Workmentioning

confidence: 99%

Scheduling Real-Time Multi-item Requests in On-Demand Broadcast

Chen

Lee

2008

2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and capability to handle dynamic user access patterns. Previous studies on time-critical on-demand data broadcast were under the assumption that each client requests only one data item at a time. With rapid growth of time-critical information dissemination services in emerging applications, there is an increasing need for systems to support efficient processing of real-time multi-item requests. Little work, however, has considered on-demand broadcast environment with time-critical multi-item requests. In this paper, we investigate the scheduling problem arising in this new environment and observe that existing single item request based algorithms are unable to manage multi-item requests efficiently. Thus, an innovative algorithm that combines the strengths of data item scheduling and request scheduling is proposed. The performance results of our simulation show that the proposed algorithm is superior to other classical algorithms under a variety of circumstances. Our algorithm not only reduces deadline miss ratio of requests, but also saves broadcast channel bandwidth.

show abstract

Section: Related Workmentioning

confidence: 99%

Scheduling Real-Time Multi-item Requests in On-Demand Broadcast

Chen

Lee

2008

2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

View full text Add to dashboard Cite

show abstract

“…The probability (P i ) that there is at least one arriving frame in the ith sleep cycle during sleep mode operation is derived as (5). We assume that the frame arrival rate follows a Poisson distribution with arrival rate l. T i is the length of the ith sleep window, and L is the length of the listening window.…”

Section: Analytical Model: Optimize Final Sleep Windowmentioning

confidence: 99%

“…To address the need of reducing carbon dioxide emission for energy generation, people are finding solutions to reduce energy consumption and improve the energy-saving efficiency in network communication. Reservation-based bandwidth polling mechanisms and an adaptive scheduling strategy were designed to optimize scarce network resource management [4,5]. Moreover, efficiently utilizing limited network resources, including network bandwidths, battery energy and network devices capacity in wireless networks, greatly affects the performance of energy-efficient networks.…”

Section: Introductionmentioning

confidence: 99%

“…Efficient energy saving is an important and challenging issue because all mobile stations are powered by limited battery lifetimes. Reservation-based bandwidth polling mechanisms and an adaptive scheduling strategy were designed to optimize scarce network resource management [4,5]. Adaptively adjusting these parameters to improve energy-efficient communication is an open research topic.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Improving energy‐efficient communications with a battery lifetime‐aware mechanism in IEEE802.16e wireless networks

Chou

Hong

2012

Concurrency and Computation

View full text Add to dashboard Cite

Green network communication has recently received attention because of its economic and environmentally friendly benefits. Energy consumption significantly affects mobile subscriber stations in wireless broadband access networks. Efficient energy saving is an important and challenging issue because all mobile stations are powered by limited battery lifetimes. The IEEE 802.16e standard adopts the sleep mode operation for energy saving with three important parameters: idle threshold, initial sleep window and final sleep window. Adaptively adjusting these parameters to improve energy-efficient communication is an open research topic. This paper proposes a battery lifetime-aware energy-saving mechanism to adaptively adjust three sleep mode parameters for mobile stations and extend batteries lives. The new mechanism considers effect factors, including residual battery lifetime and traffic load on mobile stations. Analytical sleep mode operation models were explored in this work. Our proposed mechanism was examined with a computer simulation using QualNet. The simulation results demonstrate that the proposed mechanism outperforms the IEEE 802.16e standard in the average lives of mobile stations, improving them by up to 30.08% with little increase in the average waiting delay. INTRODUCTIONGreen network communication has recently received much attention because of its significant properties, which offer important economic and environmentally friendly benefits. Gradual energy scarcity and the impact of global warming on the environment are inevitable. To address the need of reducing carbon dioxide emission for energy generation, people are finding solutions to reduce energy consumption and improve the energy-saving efficiency in network communication. The trade-off between saving energy and efficient network communication is a subtle research issue in green wireless communication [1]. Moreover, efficiently utilizing limited network resources, including network bandwidths, battery energy and network devices capacity in wireless networks, greatly affects the performance of energy-efficient networks. Cross-layer approaches to green networks are increasingly proposed, addressing energy consumption minimization, power management, network management (handover and mobility management) and practical implementations [2]. Medium access protocols in wireless sensor networks were modified to reduce energy consumption due to transmission channel contention with guaranteed Quality of Service (QoS) [3]. Reservation-based bandwidth polling mechanisms and an adaptive scheduling strategy were designed to optimize scarce network resource management [4,5]. In the network layer, energy-efficient routing protocols in wireless ad hoc networks were widely studied to

show abstract

“…A time-critical request is associated with a deadline imposed by either the application or the user, the result of a request is useful only if all the required data items can be received before the deadline. For such kind of applications, some real-time broadcast scheduling algorithms have been proposed [14], [6], [22], which take queries' deadlines into account. But unfortunately, almost all the existing real-time broadcast scheduling algorithms only support single data item [2] or one-shot queries [7], [16], and thus can be of low performance, or even not applicable in some practical applications.…”

Section: Introductionmentioning

confidence: 99%

A Novel Scheduling Algorithm for Supporting Periodic Queries in Broadcast Environments

Zhou

2015

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Being a proven efficient approach to answering queries that have common data needs, data broadcast has received much attention in the past decade, especially for dynamic and large-scale data dissemination. An important class of emerging data broadcast applications must monitor multiple data items continuously in order to enable data-driven decision making. For such applications, an important problem that must be addressed is how to disseminate data to periodic continuous queries so that all the requests can be satisfied while the bandwidth utilization is minimized. To our best knowledge, the only known work on this topic is the RM-UO algorithm proposed in [27]. However, the RM-UO algorithm simply utilizes the Sr algorithm introduced in [13] to transform the original queries into 2-harmonic tasks, which would lead to a considerable waste of available bandwidth. In this paper, based on the observation that some queries can be merged to save bandwidth consumption, we propose two merging polices namely Multiple Query Merging (MQM) and Redundant Query Merging (RQM), and show that both can lead to notable bandwidth savings. Further, to disseminate data to periodic continuous queries, we implement a unified scheduling algorithm called UM, which combines both MQM and RQM. Extensive experiments have been conducted to compare our UM algorithm with RM-UO, and the results show that UM outperforms RM-UO considerably in terms of wireless bandwidth consumption and query service ratio.

show abstract

Fair Scheduling for On-Demand Time-Critical Data Broadcast

Cited by 9 publications

References 15 publications

Scheduling Real-Time Multi-item Requests in On-Demand Broadcast

Scheduling Real-Time Multi-item Requests in On-Demand Broadcast

Improving energy‐efficient communications with a battery lifetime‐aware mechanism in IEEE802.16e wireless networks

A Novel Scheduling Algorithm for Supporting Periodic Queries in Broadcast Environments

Contact Info

Product

Resources

About