English  |  正體中文  |  简体中文  |  Items with full text/Total items : 53694/88316 (61%)
Visitors : 10277333      Online Users : 29
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/59956


    Title: Providing Data Items with Time Constraints in Multi-Channel Broadcasting Environments
    Authors: Chiang, Ding-Jung;Lin, Hwei-Jen;Shih, Timothy K.
    Contributors: 淡江大學資訊工程學系
    Keywords: mobile computing;multichannel broadcasting;time constrain
    Date: 2008-11
    Issue Date: 2011-10-05 22:30:16 (UTC+8)
    Publisher: Oulu: Academy Publisher
    Abstract: In a mobile computing system, users carrying portable devices can access database services from any location without requiring a fixed position in the networking environment. Some examples of strategies supported by databases in mobile computing include location dependent queries, long-lived transactions that require migration of data into the portable devices, form-based transactions, and online information report. Within a mobile computing environment, the need for a realtime database management model is strong, because one of the basic requirements in mobile data management is to provide real-time response to transactions of the underlying strategies. However, the resource constraints of mobile computing systems make it difficult to satisfy timing requirements of supported strategies. Low bandwidth, unreliable wireless links, and frequent disconnections increase the overhead of communication between mobile hosts and fixed hosts of the system. There are many situations in which we need to incorporate real-time constraints in broadcasting systems for mobile environments. In this paper, we study broadcast scheduling strategies for pushbased broadcast with timing constraints in the form of deadlines. Unlike previously proposed scheduling algorithms for broadcast systems which aim to minimize the mean access time, our goal is to identify scheduling algorithms for broadcast systems that ensure requests meet their deadlines. We present a study of the performance of traditional real-time strategies and mobile broadcasting strategies, and demonstrate that traditional realtime algorithms do not always perform the best in a mobile environment. We propose a multichannel model based on pushbased real-time broadcast system and also provide an efficient scheduling algorithm, called dynamic adjustment with time constraint (DATC), which is designed for timely delivery of data to mobile clients.
    Relation: Journal of Software 3(8), pp.65-72
    DOI: 10.4304/jsw.3.8.65-72
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML243View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback