Time-critical on-demand data broadcast: algorithms, analysis, and performance evaluation

Abstract

On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and deal with dynamic user access patterns. With the rapid growth of time-critical information services in emerging applications, there is an increasing need for the system to support timely data dissemination. This paper investigates online scheduling algorithms for time-critical on-demand data broadcast. We propose a novel scheduling algorithm called SIN-α that takes the urgency and number of outstanding requests into consideration. An efficient implementation of SIN-α is presented. We also analyze the theoretical bound of request drop rate when the request arrival rate rises towards infinity. Trace-driven experiments show that SIN-α significantly outperforms existing algorithms over a wide range of workloads and approaches the analytical bound at high request rates.

On-demand data broadcast with deadlines for avoiding conflicts in wireless networks

“…Xuan et al (1997) proposed a scheme, called EDF (earliest deadline first), that considers the deadline of request and also broadcasts the request with minimal deadline. sin −α (Xu et al, 2006) is a new scheme to broadcast the request with minimal sin −α value, where α is an urgent factor. Aksoy and Franklin (1998) introduced a parameterized algorithm that considers all elements, such as the balance between individual and overall performance, the scale of data set sizes, scalability and bandwidth.…”

QoS Aware Service Scheduling Scheme for VANETs

“…LTSF optimizes stretch and maintains balance between worst case and average case but implementation of LTSF for large system is not practical because server needs to recalculate stretch for every pending request to find next data to be broadcasted. In [18] Xu et al proposed online scheduling algorithm for time critical on demand data broadcast, but they assumed that data can only be updated by server; that is, vehicles can only download and it does not allow vehicles to update urgent data. Jiang and Vaidya [19] proposed periodic push based broadcast, which is not well suited to VANET applications.…”

Ordered Reverse k Nearest Neighbor Search via On-demand Broadcast

“…Data broadcast is a large research area, and we introduce a few of the most relevant studies here. Various scheduling algorithms have been proposed to determine the broadcast sequence of data items in on-demand broadcast environments [22][23][24][25][26][27][28]. A data selection and scheduling algorithm using a modified EDF is proposed in [27].…”

“…A data selection and scheduling algorithm using a modified EDF is proposed in [27]. The scheduling algorithm termed SINα [22] takes into accounts both timelines and the number of data requests. A number of data productivity-based scheduling algorithms are extended in [29].…”