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