{"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}
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.