An efficient partition and matching algorithm for query-set-based broadcasting in multiple channel mobile environment

Authors:
Jing-Feng Lin;Guang-Ming Wu;Derchian Tsaih
Affiliations:
Department of Computer Science and Information Engineering, Nan-Hua University, Dalin, Chiayi, Taiwan;Department of Information Management, Nan-Hua University, Dalin, Chiayi, Taiwan;Department of Electronic Commerce Management, Nan-Hua University, Dalin, Chiayi, Taiwan
Venue:
WSEAS TRANSACTIONS on COMMUNICATIONS
Year:
2009

Citing 22
Cited 1

Energy efficient indexing on air

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Broadcast disks: data management for asymmetric communication environments

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Broadcast scheduling for information distribution

Wireless Networks
Scheduling data broadcast in asymmetric communication environments

Wireless Networks
Efficient algorithms for scheduling data broadcast

Wireless Networks
Approaches for broadcasting temporal data in mobile computing systems

Journal of Systems and Software
An index replication scheme for wireless data broadcasting

Journal of Systems and Software
Dynamic generation of data broadcasting programs for a broadcast disk array in a mobile computing environment

Proceedings of the ninth international conference on Information and knowledge management
Introduction to Algorithms

Introduction to Algorithms
A complementary approach to data broadcasting in mobile information systems

Data & Knowledge Engineering
Effective Data Placement for Wireless Broadcast

Distributed and Parallel Databases
Efficient Data Allocation over Multiple Channels at Broadcast Servers

IEEE Transactions on Computers
Data Allocation on Wireless Broadcast Channels for Efficient Query Processing

IEEE Transactions on Computers
Data on Air: Organization and Access

IEEE Transactions on Knowledge and Data Engineering
Generating Broadcast Programs that Support Range Queries

IEEE Transactions on Knowledge and Data Engineering
Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing

IEEE Transactions on Knowledge and Data Engineering
Disseminating Updates on Broadcast Disks

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Multi-Level Multi-Channel Air Cache Designs for Broadcasting in a Mobile Environment

ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Broadcasting Consistent Data in Mobile Computing Environments

RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Broadcast data allocation for efficient access of multiple data items in mobile environments

Mobile Networks and Applications
An Efficient Scheduling Method for Query-Set-Based Broadcasting in Mobile Environments

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
An efficient data placement for query-set-based broadcasting in mobile environments

Computer Communications

An adaptive cross-layer bandwidth scheduling strategy for the speed-sensitive strategy in hierarchical cellular networks

WSEAS TRANSACTIONS on COMMUNICATIONS

Quantified Score

Hi-index	0.00

Visualization

Abstract

Broadcast is an efficient and scalable method for resolving the bandwidth limitation in a wireless environment. In many applications, mobile clients might need more than one data item. However, most previous researches on query-set-based broadcasting are restricted to a single broadcast channel environment. The results are limited applicability to the upcoming mobile environments. In this paper, we relax this restriction and explore the problem of query-set-based broadcasting in multiple broadcast channels. In multi-channel query-set-based broadcasting, we discover data collision (two data items in the same query set are arranged on two channels at the same time slot) is an important factor to affect users' access time. In this paper, we introduce the new data collision problem motivated by multi-channel query-set-based broadcasting environment. We then present a two-stage scheme of data partitioning and data matching to solve the new data collision problem. Experiments are performed to justify the benefit of our approach.