Exploiting replication on dependent data allocation for ordered queries over multiple broadcast channels
檔案
- 000282914100002.pdf (732.4 KB, Adobe PDF)
日期
2010-10-01
類型
系所
期刊名稱
WIRELESS NETWORKS
卷期與頁次
第 16 卷第 7 期,頁 1817–1836
ISSN
1022-0038
語言
英文
摘要
Data broadcasting has been recognized as an important means for information dissemination in mobile computing environments. In some mobile applications, the data items broadcast are dependent upon one another. However, most prior studies on broadcasting dependent data do not employ replication in broadcast program generation. In view of this, we explore in this paper the problem of broadcasting dependent data in multiple broadcast channels, and explicitly investigate the effect of data replication. After analyzing the model of dependent data broadcasting, we derive several theoretical properties to formulate the average access time of broadcast programs. In light of the theoretical results, we develop an algorithm to exploit replication on broadcast program generation. Our experimental results show that the proposed algorithm is able to generate broadcast programs of very high quality. In addition, the results also show that broadcast programs with replication is more robust than those without replication in error-prone environments.
所屬典藏
期刊論文引用此條目
Huang, J.-L., & Huang, J.-H. (2010). Exploiting replication on dependent data allocation for ordered queries over multiple broadcast channels. WIRELESS NETWORKS, 16(7), 1817–1836. https://doi.org/10.1007/s11276-009-0230-x
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/32158