A Maximum Degree Base Station(MDBS) Multicast Routing Algorithm for Mobile Computing Environment

R. Kalai Magal, K. Ramar
{"title":"A Maximum Degree Base Station(MDBS) Multicast Routing Algorithm for Mobile Computing Environment","authors":"R. Kalai Magal, K. Ramar","doi":"10.1109/ISAHUC.2006.4290673","DOIUrl":null,"url":null,"abstract":"We propose the new infrastructure and an algorithm for multicast routing in heterogeneous mobile computing (wireline/wireless) environments. The goal of the proposed architecture is to reduce the latency and overheads of joins, leaves and handoffs in the regions that experience high group dynamics and mobility. The proposed architecture focuses on a maximum degree base station tree (MDBST) routing algorithm and an infrastructure that is designed to support low latency joins, leaves and hands off, though the resulting multicast tree may be sub-optimal. Our new infrastructure uses the maximum degree base tree algorithm in dynamic regions.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAHUC.2006.4290673","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We propose the new infrastructure and an algorithm for multicast routing in heterogeneous mobile computing (wireline/wireless) environments. The goal of the proposed architecture is to reduce the latency and overheads of joins, leaves and handoffs in the regions that experience high group dynamics and mobility. The proposed architecture focuses on a maximum degree base station tree (MDBST) routing algorithm and an infrastructure that is designed to support low latency joins, leaves and hands off, though the resulting multicast tree may be sub-optimal. Our new infrastructure uses the maximum degree base tree algorithm in dynamic regions.
移动计算环境下的最大度基站组播路由算法
我们提出了异构移动计算(有线/无线)环境下新的组播路由基础结构和算法。所提出的体系结构的目标是在经历高组动态和移动性的区域中减少连接、叶子和移交的延迟和开销。所提出的体系结构侧重于最大程度基站树(MDBST)路由算法和基础设施,该基础设施旨在支持低延迟连接,叶子和手离开,尽管最终的多播树可能不是最优的。我们的新结构在动态区域中使用了最大度基树算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信