{"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}
引用次数: 0
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.