移动自组织网络中基于链路折衷度量的安全多路径路由

M. Naheed, H. Mahmood, Iqbal Murtza
{"title":"移动自组织网络中基于链路折衷度量的安全多路径路由","authors":"M. Naheed, H. Mahmood, Iqbal Murtza","doi":"10.1109/RAEE.2015.7352761","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel routing protocol by overcoming the security issues of node disjoint multipath routing protocols to ensure the reliability by discovering multiple secure paths. The proposed protocol considers link compromise probabilities to generate multiple routes with low compromise probabilities. Contrary to contemporary distance metric multipath routing protocols, our proposed work is. In the end, simulation results show improvement in path compromise probability and reliability in comparison with Distance routing Metric. Simulations show that the ratio of compromised paths is dropped significantly by implementing the proposed routing algorithm and consequently security aspect of the data routing is also improved. The proposed routing protocol is suitable for dynamic ad hoc networks where topology changes frequently.","PeriodicalId":424263,"journal":{"name":"2015 Symposium on Recent Advances in Electrical Engineering (RAEE)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Secure multipath routing using link compromise metric in mobile ad hoc networks\",\"authors\":\"M. Naheed, H. Mahmood, Iqbal Murtza\",\"doi\":\"10.1109/RAEE.2015.7352761\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel routing protocol by overcoming the security issues of node disjoint multipath routing protocols to ensure the reliability by discovering multiple secure paths. The proposed protocol considers link compromise probabilities to generate multiple routes with low compromise probabilities. Contrary to contemporary distance metric multipath routing protocols, our proposed work is. In the end, simulation results show improvement in path compromise probability and reliability in comparison with Distance routing Metric. Simulations show that the ratio of compromised paths is dropped significantly by implementing the proposed routing algorithm and consequently security aspect of the data routing is also improved. The proposed routing protocol is suitable for dynamic ad hoc networks where topology changes frequently.\",\"PeriodicalId\":424263,\"journal\":{\"name\":\"2015 Symposium on Recent Advances in Electrical Engineering (RAEE)\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Symposium on Recent Advances in Electrical Engineering (RAEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAEE.2015.7352761\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Symposium on Recent Advances in Electrical Engineering (RAEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAEE.2015.7352761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种新的路由协议,克服了节点不相交多路径路由协议的安全问题,通过发现多条安全路径来保证路由协议的可靠性。该协议考虑链路妥协概率,生成多条低妥协概率的路由。与当代距离度量多路径路由协议相反,我们提出的工作是。最后,仿真结果表明,与距离路由度量相比,该方法在路径妥协概率和可靠性方面有所提高。仿真结果表明,所提出的路由算法大大降低了被破坏路径的比例,从而提高了数据路由的安全性。该路由协议适用于拓扑变化频繁的动态自组织网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Secure multipath routing using link compromise metric in mobile ad hoc networks
In this paper, we propose a novel routing protocol by overcoming the security issues of node disjoint multipath routing protocols to ensure the reliability by discovering multiple secure paths. The proposed protocol considers link compromise probabilities to generate multiple routes with low compromise probabilities. Contrary to contemporary distance metric multipath routing protocols, our proposed work is. In the end, simulation results show improvement in path compromise probability and reliability in comparison with Distance routing Metric. Simulations show that the ratio of compromised paths is dropped significantly by implementing the proposed routing algorithm and consequently security aspect of the data routing is also improved. The proposed routing protocol is suitable for dynamic ad hoc networks where topology changes frequently.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信