TMBT:一种有效的多通道数据广播索引分配方法

Shuoi Wang, Hsing-Lung Chen
{"title":"TMBT:一种有效的多通道数据广播索引分配方法","authors":"Shuoi Wang, Hsing-Lung Chen","doi":"10.1109/AINAW.2007.354","DOIUrl":null,"url":null,"abstract":"Broadcast is an attractive data dissemination means over multiple wireless channels due to its scalability. Since mobile clients have limited battery power and broadcast data have different popularities, how these data are fast accessed becomes an important issue. Our solution consists of first allocating data among channels near-optimally, and adopting flat broadcast per channel. Then, a binary tree indexing structure is built for each channel and nodes of all index trees are multiplexed onto a well-known physical channel, named as TMBT (time-multiplexed multiple binary trees) Our method organizes data and index into a popularity hierarchy which results in a skewed transmission of data and index. Skewed transmission has been shown to reduce the average access time effectively. Simulation results show that the reduction of access time is on average about 48% over previous work with little tuning time overhead.","PeriodicalId":338799,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"TMBT: An Efficient Index Allocation Method for Multi-Channel Data Broadcast\",\"authors\":\"Shuoi Wang, Hsing-Lung Chen\",\"doi\":\"10.1109/AINAW.2007.354\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Broadcast is an attractive data dissemination means over multiple wireless channels due to its scalability. Since mobile clients have limited battery power and broadcast data have different popularities, how these data are fast accessed becomes an important issue. Our solution consists of first allocating data among channels near-optimally, and adopting flat broadcast per channel. Then, a binary tree indexing structure is built for each channel and nodes of all index trees are multiplexed onto a well-known physical channel, named as TMBT (time-multiplexed multiple binary trees) Our method organizes data and index into a popularity hierarchy which results in a skewed transmission of data and index. Skewed transmission has been shown to reduce the average access time effectively. Simulation results show that the reduction of access time is on average about 48% over previous work with little tuning time overhead.\",\"PeriodicalId\":338799,\"journal\":{\"name\":\"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINAW.2007.354\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINAW.2007.354","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

广播由于其可扩展性而成为一种有吸引力的多无线信道数据传播手段。由于移动客户端电池电量有限,广播数据的普及程度不同,如何快速访问这些数据成为一个重要问题。我们的解决方案包括首先在频道之间近乎最优地分配数据,并采用每个频道的平面广播。然后,为每个通道构建二叉树索引结构,并将所有索引树的节点多路复用到一个已知的物理通道上,称为TMBT (time-multiplexed multiple binary tree)。斜向传输可以有效地缩短平均接入时间。仿真结果表明,与以前的工作相比,访问时间平均减少了48%左右,并且调优时间开销很小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
TMBT: An Efficient Index Allocation Method for Multi-Channel Data Broadcast
Broadcast is an attractive data dissemination means over multiple wireless channels due to its scalability. Since mobile clients have limited battery power and broadcast data have different popularities, how these data are fast accessed becomes an important issue. Our solution consists of first allocating data among channels near-optimally, and adopting flat broadcast per channel. Then, a binary tree indexing structure is built for each channel and nodes of all index trees are multiplexed onto a well-known physical channel, named as TMBT (time-multiplexed multiple binary trees) Our method organizes data and index into a popularity hierarchy which results in a skewed transmission of data and index. Skewed transmission has been shown to reduce the average access time effectively. Simulation results show that the reduction of access time is on average about 48% over previous work with little tuning time overhead.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信