{"title":"无线自组织网络中按需节点分离多路径路由","authors":"Xuefei Li, L. Cuthbert","doi":"10.1109/LCN.2004.90","DOIUrl":null,"url":null,"abstract":"An on-demand node-disjoint multipath routing protocol is proposed to overcome the shortcomings of on-demand unipath routing protocols like AODV and DSR. The protocol has two novel aspects compared to the other on-demand multipath protocols: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. Simulation results show that the proposed protocol achieves lower data delay and control overhead as well as higher packet delivery ratio.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"99","resultStr":"{\"title\":\"On-demand node-disjoint multipath routing in wireless ad hoc networks\",\"authors\":\"Xuefei Li, L. Cuthbert\",\"doi\":\"10.1109/LCN.2004.90\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An on-demand node-disjoint multipath routing protocol is proposed to overcome the shortcomings of on-demand unipath routing protocols like AODV and DSR. The protocol has two novel aspects compared to the other on-demand multipath protocols: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. Simulation results show that the proposed protocol achieves lower data delay and control overhead as well as higher packet delivery ratio.\",\"PeriodicalId\":366183,\"journal\":{\"name\":\"29th Annual IEEE International Conference on Local Computer Networks\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"99\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"29th Annual IEEE International Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2004.90\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"29th Annual IEEE International Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2004.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On-demand node-disjoint multipath routing in wireless ad hoc networks
An on-demand node-disjoint multipath routing protocol is proposed to overcome the shortcomings of on-demand unipath routing protocols like AODV and DSR. The protocol has two novel aspects compared to the other on-demand multipath protocols: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. Simulation results show that the proposed protocol achieves lower data delay and control overhead as well as higher packet delivery ratio.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
