{"title":"Overheads and Mean Route Failure Time of a Hybrid Protocol for Node-Disjoint Multipath Routing in Mobile Ad Hoc Networks","authors":"A. Abbas","doi":"10.1109/ICIT.2008.26","DOIUrl":null,"url":null,"abstract":"Identification of node-disjoint paths in an ad hoc network is a challenging task. A protocol that is hybrid of an incremental protocol and a protocol that tries to identify multiple node-disjoint paths in a single route discovery, can be used to identify a maximal set of node-disjoint paths between a given source and destination. In this paper, we analyze the communication and computational overheads and the time after which all node-disjoint paths between a given source and a destination are expected to fail.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"142 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2008.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Identification of node-disjoint paths in an ad hoc network is a challenging task. A protocol that is hybrid of an incremental protocol and a protocol that tries to identify multiple node-disjoint paths in a single route discovery, can be used to identify a maximal set of node-disjoint paths between a given source and destination. In this paper, we analyze the communication and computational overheads and the time after which all node-disjoint paths between a given source and a destination are expected to fail.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
