• Corpus ID: 14565831

Adaptive Broadcast Protocols to Support E cient and Energy Conserving Retrieval from Databases in Mobile Computing Environments

@inproceedings{Datta1997AdaptiveBP,
  title={Adaptive Broadcast Protocols to Support E cient and Energy Conserving Retrieval from Databases in Mobile Computing Environments},
  author={Anindya Datta and Debra E. VanderMeer and Jeong Gun Kim and Aslihan Celik and Vijay P. Kumar and Michael H. Bohlen and Renato Busatto and Heidi Gregersen and Kristian Torp and Sudha Ram and Kwangwoo Nam and Keun-Ho Ryu},
  year={1997}
}
Mobile computing has the potential for managing information globally. Data management issues in mobile computing have received some attention in recent times, and the design of adaptive broadcast protocols has been posed as an important problem. Such protocols are employed by database servers to decide on the content of broadcasts dynamically, in response to client mobility and demand patterns. In this paper we design such protocols and also propose e cient retrieval strategies that may be… 

Figures and Tables from this paper

Adaptive broadcast protocols to support power conservant retrieval by mobile users
TLDR
The goal is to design cooperative strategies between server and client to provide access to information in such a way as to minimize energy expenditure by clients.
A Taxonomy of Data Managements Via Broadcasting in Mobile Computing
TLDR
This chapter gives executive summary and discusses topics such as data dissemination techniques, transaction models and caching strategies that utilize broadcasting medium for data management, and presents taxonomies that categorize algorithms proposed under each topic.
Scheduling data broadcast in asymmetric communication environments
TLDR
Algorithms for determining broadcast schedules that minimize the wait time for broadcasting data are presented and performance evaluation results are presented to demonstrate that the algorithms perform well.
Energy-efficient data broadcasting in mobile ad-hoc networks
TLDR
This paper proposes two groups of broadcast scheduling algorithms called adaptive broadcasting and popularity based adaptive broadcasting that consider time constraints on requests as well as energy limitation on both servers and clients.
E cient Algorithms for Scheduling Data BroadcastSohail
With the increasing acceptance of wireless technology, mechanisms to eeciently transmit information to wireless clients are of interest. The environment under consideration is asymmetric in that the
Efficient algorithms for scheduling data broadcast
TLDR
This paper presents a log‐time algorithm for scheduling broadcast, derived from an existing fair queueing algorithm, that significantly improves the time‐complexity over previously proposed broadcast scheduling algorithms.
Efficient data dissemination to mobile clients in e-commerce applications
  • R. Agrawal, Panos K. Chrysanthis
  • Computer Science
    Proceedings Third International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems. WECWIS 2001
  • 2001
TLDR
Detailed simulation results indicate that CI, which is a variant of the currently best-performing distributed indexing scheme, outperforms the latter for broadcast sizes of 12,000 or fewer data items, reducing the access time and the tuning time by up to 25% and up to 15%.
Adaptive Bandwidth Allocation for Realtime Wireless Data Dissemination
The combination of broadcast and on-demand data delivery services is an economic way to build a highly scalable wireless information system with limited bandwidth. The use of data broadcasting should
A generalized air-cache design for efficiently broadcasting on multiple physical channels
TLDR
This paper proposes a novel scheduling scheme called Generalized Broadcast Technique (GBT) which can adapt the content of the broadcasts according to the client mobility and demand patterns and substantiates the near-optimality and the advantages of GBT.
Adaptive dissemination of data in time-critical asymmetric communication environments
TLDR
This paper presents and evaluates an adaptive data dissemination model and the associated online scheduling algorithms, which improve the functionality and performance of current broadcast models, maximizing the total number of satisfied users in asymmetric communication environments with dynamic client profiles and time requirements.
...
1
2
3
4
...

References

SHOWING 1-10 OF 19 REFERENCES
Scheduling data broadcast in asymmetric communication environments
TLDR
Algorithms for determining broadcast schedules that minimize the wait time for broadcasting data are presented and performance evaluation results are presented to demonstrate that the algorithms perform well.
Data replication for mobile computers
TLDR
This paper presents and analyzes various static and dynamic data allocation methods to optimize the communication cost between a mobile computer and the stationary computer that stores the online database.
Location management in distributed mobile environments
  • P. Krishna, N. Vaidya, D. Pradhan
  • Computer Science
    Proceedings of 3rd International Conference on Parallel and Distributed Information Systems
  • 1994
TLDR
Simulations were carried out to evaluate the performance of different static strategies for various communication and mobility patterns and results indicate that performing search-updates significantly reduces the message overhead of location management.
Distributed algorithms for dynamic replication of data
TLDR
Two distributed algorithms for dynamic replication of a data-item in communication networks are presented, each of which continuously moves the replication scheme towards an optimal one, where optimality is defined with respect to different objective functions.
Mobile computing and databases: anything new?
TLDR
This paper focuses on discussing the differences between data management solutions in a mobile computing environment and those in a distributed database environment, and tries to convince the skeptics that there are new research topics in mobile computing worthy of further examination.
Sleepers and workaholics: caching strategies in mobile environments
TLDR
A taxonomy of different cache invalidation strategies is proposed and it is determined that for the units which are often disconnected (sleepers) the best cache invalidations strategy is based on signatures previously used for efficient file comparison, and for units which is connected most of the time (workaholics), the best Cache invalidation strategy isbased on the periodic broadcast of changed data items.
User profile replication for faster location lookup in mobile environments
TLDR
A minimum-cost maximum-flow based algorithm is presented to compute the set of sites at which a user profile should be replicated given known calling and user mobility patterns and schemes for replication plans that gracefully adapt to changes in the calling and mobility patterns are presented.
Replication and mobility
TLDR
The authors address some of the questions, by proposing an adaptive replication scheme for mobile data, which is dependent not only on the distance between them but also on the cost of search necessary to determine the exact value of location.
Querying in Highly Mobile Distributed Environments
TLDR
Preliminary solutions to two of the major problems, control of update volume and integration of query processing and data acquisition, are discussed along with the simulation results.
...
1
2
...