 |
English
|
正體中文
|
简体中文
|
Post-Print筆數 : 27 |
Items with full text/Total items : 93889/124336 (76%)
Visitors : 28945736
Online Users : 462
|
|
|
Loading...
|
Please use this identifier to cite or link to this item:
http://nccur.lib.nccu.edu.tw/handle/140.119/69148
|
Title: | An adaptive access method for broadcast data under an error-prone mobile environment |
Authors: | 陳良弼 Lo,Shou-Chih Chen,Arbee L. P. |
Contributors: | 資科系 |
Date: | 2000-07 |
Issue Date: | 2014-08-21 15:08:34 (UTC+8) |
Abstract: | A ubiquitous information environment can be achieved by the mobile computing technologies. In this environment, users carrying their portable computers can retrieve local or remote information anywhere and at anytime. Data broadcast, with its advantages, has become a powerful means to disseminate data in wireless communications. Indexing methods for the broadcast data have been proposed to speedup access time and reduce power consumption. However, the influence of access failures has not been discussed. For the error-prone mobile environment, the occurrence of access failures is often due to disconnections, handoffs, and communication noises. Based on the distributed indexing scheme, we propose an adaptive access method which tolerates the access failures. The basic idea is to use index replication to recover from the access failures. One mechanism, named search range, is provided to dynamically record the range where the desired data item may exist. According to the search range, an unfinished search can be efficiently resumed by finding an available index replicate. A performance analysis is given to show the benefits of the method. Also, the concept of version bits is applied to deal with the updates of the broadcast data |
Relation: | IEEE Transactions on Knowledge and Data Engineering (EI,SCI),12(4),609-620 |
Data Type: | article |
Appears in Collections: | [資訊科學系] 期刊論文
|
Files in This Item:
File |
Description |
Size | Format | |
index.html | | 0Kb | HTML | 1433 | View/Open |
|
All items in 政大典藏 are protected by copyright, with all rights reserved.
|