Disseminating data with time constraint based on multichannel over ubiquitous computing environments

Authors:
Ding-Jung Chiang;Timothy K. Shih;Chien-Liang Chen
Affiliations:
Department of Digital Multimedia Design, Technology and Science Institute of Northern Taiwan, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Central University, Taoyuan, Taiwan;Department of Tourism Information, Aletheia University, Taipei, Taiwan
Venue:
World Wide Web
Year:
2011

Citing 20
Cited 4

Introduction to algorithms

Introduction to algorithms
Scheduling real-time transactions: a performance evaluation

ACM Transactions on Database Systems (TODS)
Broadcast disks: data management for asymmetric communication environments

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Integrated services packet networks with mobile hosts: architecture and performance

Wireless Networks
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
R × W: a scheduling approach for large-scale on-demand data broadcast

IEEE/ACM Transactions on Networking (TON)
Cache invalidation scheme for mobile computing systems with real-time data

ACM SIGMOD Record
Internet QoS: Architectures and Mechanisms for Quality of Service

Internet QoS: Architectures and Mechanisms for Quality of Service
Dynamic Data Delivery in Wireless Communication Environments

ER '98 Proceedings of the Workshops on Data Warehousing and Data Mining: Advances in Database Technologies
Pinwheel Scheduling for Fault-Tolerant Broadcast Disks in Real-time Database Systems

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Priority assignment in real-time active databases

The VLDB Journal — The International Journal on Very Large Data Bases
AIDA-based real-time fault-tolerant broadcast disks

RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Multi-Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment

ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Efficient data access to multi-channel broadcast programs

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Media synchronization and QoS packet scheduling algorithms for wireless systems

Mobile Networks and Applications
Time-Constrained Service on Air

ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Real-time traffic support in heterogeneous mobile networks

Wireless Networks
Traffic driven multiple constraint-optimisation for QoS routing

International Journal of Internet Protocol Technology
Scheduling real-time multi-item requests in wireless on-demand broadcast networks

Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
A Computing Resource Management Framework for Software-Defined Radios

IEEE Transactions on Computers

Advances in ubiquitous media technologies and applications

World Wide Web
Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments

Information Sciences: an International Journal
A Transformation Technique for Scheduling Broadcast Programs of Multiple-Item Queries

International Journal of Grid and High Performance Computing
A Transformation Technique for Scheduling Broadcast Programs of Multiple-Item Queries

International Journal of Grid and High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Time-constrained service plays an important role in ubiquitous services. However, the resource constraints of ubiquitous computing systems make it difficult to satisfy timing requirements of supported strategies. In this study, we study scheduling strategies for mobile data program with timing constraints in the form of deadlines. Unlike previously proposed scheduling algorithms for mobile systems which aim to minimize the mean access time, our goal is to identify scheduling algorithms for ubiquitous systems that ensure requests meet their deadlines. We present a study of the performance of traditional real-time strategies, and demonstrate that traditional real-time algorithms do not always perform the best in a mobile environment. We propose an efficient scheduling algorithm, called scheduling priority of mobile data with time constraint(SPMT), which is designed for timely delivery of data to mobile clients. The experimental results show that our approach outperforms other approaches over performance criteria.