基于带宽约束的不相交最小生成树的移动自组网路由容错组播

Kumar B.R Arun, Lokanatha C. Reddy, P. S. Hiremath
{"title":"基于带宽约束的不相交最小生成树的移动自组网路由容错组播","authors":"Kumar B.R Arun, Lokanatha C. Reddy, P. S. Hiremath","doi":"10.1109/IADCC.2010.5422930","DOIUrl":null,"url":null,"abstract":"In this paper, we study the fundamental property of the ad hoc network using connectivity index. We investigate the construction of minimum cost multicast trees by selecting a link having minimum connectivity Index and comparing application required bandwidth with (available bandwidth - allocated bandwidth) of the link. We have shown that Increase in total connectivity Index of the entire network increases no. of spanning trees. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree Multicasting based on connectivity index with bandwidth constraint.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Route failure tolerant multicast in mobile ad hoc networks using disjoint minimum spanning trees based on connectivity index with bandwidth constraint\",\"authors\":\"Kumar B.R Arun, Lokanatha C. Reddy, P. S. Hiremath\",\"doi\":\"10.1109/IADCC.2010.5422930\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the fundamental property of the ad hoc network using connectivity index. We investigate the construction of minimum cost multicast trees by selecting a link having minimum connectivity Index and comparing application required bandwidth with (available bandwidth - allocated bandwidth) of the link. We have shown that Increase in total connectivity Index of the entire network increases no. of spanning trees. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree Multicasting based on connectivity index with bandwidth constraint.\",\"PeriodicalId\":249763,\"journal\":{\"name\":\"2010 IEEE 2nd International Advance Computing Conference (IACC)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 2nd International Advance Computing Conference (IACC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IADCC.2010.5422930\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 2nd International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2010.5422930","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

本文利用连通性指标研究了自组网的基本性质。我们通过选择具有最小连通性索引的链路,并将应用所需带宽与链路(可用带宽-分配带宽)进行比较,来研究最小开销组播树的构造。我们已经表明,整个网络的总连通性指数的增长为。生成树。由于多径和组播结构缺乏冗余,组播路由协议在自组织网络中容易失效。因此,我们迫切需要容错解决方案。提出了一种基于带宽约束的连通性索引的边不相交生成树组播算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Route failure tolerant multicast in mobile ad hoc networks using disjoint minimum spanning trees based on connectivity index with bandwidth constraint
In this paper, we study the fundamental property of the ad hoc network using connectivity index. We investigate the construction of minimum cost multicast trees by selecting a link having minimum connectivity Index and comparing application required bandwidth with (available bandwidth - allocated bandwidth) of the link. We have shown that Increase in total connectivity Index of the entire network increases no. of spanning trees. Due to the lack of redundancy in multi-path and multicast structures, the multicast routing protocols are vulnerable to the failure in ad-hoc networks. So it is the dire need to come across the fault tolerant solution. This paper proposes edge disjoint spanning tree Multicasting based on connectivity index with bandwidth constraint.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信