English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51296/86412 (59%)
Visitors : 8176417      Online Users : 171
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/75792


    Title: Quality of Service Provisioning Scheme for Data Dissemination with Time Constraints in Ubiquitous Environments
    Authors: Chiang, Ding-Jung;Chen, Chien-Liang;Deng, Der-Jiunn;Shih, Timothy K.;Hsu, Hui-Huang
    Contributors: 淡江大學資訊工程學系
    Keywords: Ubiquitous computing;Quality of service;Time constraint;User mobility;Multichannel broadcasting
    Date: 2010-11-01
    Issue Date: 2012-04-16 09:10:41 (UTC+8)
    Publisher: 臺北市:臺灣學術網路管理委員會
    Abstract: This paper considers the support of time-constraint services to mobile users in a ubiquitous environment. The challenge for a database with time constraint services becomes more important in a ubiquitous computing environment. Low bandwidth, unreliable wireless links, and frequent disconnections of ubiquitous environments make it difficult to satisfy the timing requirements of supported strategies. This study investigates broadcast scheduling strategies for push-based broadcast with timing constraints in the form of deadlines, and proposes a multichannel scheduling algorithm for push-based broadcast with timing constraints. Under such a scheme, modifying the access method in the broadcast period supports data allocation on multiple channels, allowing time-constraint property to be satisfied in ubiquitous environments. The proposed dissemination policy and adaptive bandwidth allocation scheme obtain sufficient conditions such that all the time- bounded traffic sources satisfy their timing constraints to provide various quality-of-service (QoS) guarantees in the broadcast period. Our goal is to identify scheduling algorithms for broadcast systems that ensure requests meet their deadlines. This study examines the performance of traditional real-time strategies and mobile broadcasting strategies, and demonstrates that traditional real-time algorithms do not always perform the best in a mobile environment. The proposed design indeed achieves good performance in ubiquitous environments.
    Relation: 網際網路技術學刊=Journal of Internet Technology 11(6),頁777-786
    DOI: 10.6138/JIT.2010.11.6.05
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    1607-9264_11(6)p777-786.pdf1323KbAdobe PDF288View/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