{"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}
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
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
