淡江大學機構典藏:Item 987654321/55096
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3984545      Online Users : 306
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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/55096


    Title: Broadcasting Data Items with Time Constraints Based on On-Demand Multichannel in Ubiquitous Environments
    Authors: Chiang, Ding-Jung;Chen, Chien-Liang;Lin, Chi-Yi;Shih, Timothy K.
    Contributors: 淡江大學資訊工程學系
    Keywords: Ubiquitous computing;On-demand mode;Time constraint
    Date: 2011-05
    Issue Date: 2011-08-11 13:29:40 (UTC+8)
    Abstract: This study proposes mobile services with time constraints in ubiquitous computing environments based on on-demand multichannel broadcasting. For real-time mobile service, the need of mobile service for a real-time database management model is strong and providing real-time response to mobile transaction has became basic strategies in mobile data management. However, the resource constraints of ubiquitous computing systems make it difficult to satisfy timing requirements of supported strategies. This study provides on-line scheduling strategies for mobile data with timing constraint on multichannel broadcasting environments based on on-demand mode. The goal of this study ensures the most requests meeting their deadlines, which differs from previously proposed scheduling algorithms that aim to minimize the mean access time. The study presents a study of the performance of traditional real-time strategies and demonstrates traditional real-time algorithms which do not always perform the best in a mobile environment. The experimental results show the proposed algorithm, called on-demand broadcast program with time constraint (BPTC), outperforms miss rate for data timely delivery to mobile clients.
    Relation: Journal of Networks 6(5), pp.689-696
    DOI: 10.4304/jnw.6.5.689-696
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML404View/Open
    JON_v6_no5_May2011.pdf717KbAdobe PDF3View/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