移动自组网中不相交多径路由的分析框架

A. Abbas, T. A. Abbasi
{"title":"移动自组网中不相交多径路由的分析框架","authors":"A. Abbas, T. A. Abbasi","doi":"10.1109/WOCN.2006.1666620","DOIUrl":null,"url":null,"abstract":"Design of disjoint multipath routing protocols in an ad hoc environment is a challenging task. In this paper, we discuss an analytical framework for disjoint multipath routing in mobile ad hoc networks. We analyze the probability that there exist k node disjoint paths between a pair of nodes. A major issue in the discovery of node disjoint paths is path diminution. We discuss the probability of path diminution in schemes commonly used to discover disjoint paths","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"An analytical framework for disjoint multipath routing in mobile ad hoc networks\",\"authors\":\"A. Abbas, T. A. Abbasi\",\"doi\":\"10.1109/WOCN.2006.1666620\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Design of disjoint multipath routing protocols in an ad hoc environment is a challenging task. In this paper, we discuss an analytical framework for disjoint multipath routing in mobile ad hoc networks. We analyze the probability that there exist k node disjoint paths between a pair of nodes. A major issue in the discovery of node disjoint paths is path diminution. We discuss the probability of path diminution in schemes commonly used to discover disjoint paths\",\"PeriodicalId\":275012,\"journal\":{\"name\":\"2006 IFIP International Conference on Wireless and Optical Communications Networks\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IFIP International Conference on Wireless and Optical Communications Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCN.2006.1666620\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IFIP International Conference on Wireless and Optical Communications Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2006.1666620","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

在自组织环境下设计不相交的多路径路由协议是一项具有挑战性的任务。本文讨论了移动自组织网络中不相交多路径路由的分析框架。我们分析了一对节点之间存在k个节点不相交路径的概率。发现节点不相交路径的一个主要问题是路径缩减。我们讨论了通常用于发现不相交路径的格式中路径缩减的概率
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An analytical framework for disjoint multipath routing in mobile ad hoc networks
Design of disjoint multipath routing protocols in an ad hoc environment is a challenging task. In this paper, we discuss an analytical framework for disjoint multipath routing in mobile ad hoc networks. We analyze the probability that there exist k node disjoint paths between a pair of nodes. A major issue in the discovery of node disjoint paths is path diminution. We discuss the probability of path diminution in schemes commonly used to discover disjoint paths
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信