{"title":"针对自组织网络的抗虫洞攻击安全路由","authors":"X. Qiu, Jianwei Liu, A. Sangi","doi":"10.1109/YCICT.2010.5713134","DOIUrl":null,"url":null,"abstract":"Routing security is an important and well known issue in Ad hoc network applications and development. Various kinds of solutions have been proposed but they are impractical to be fully applied. In this paper, firstly the wormhole attack topology is analyzed, then cryptography and trust mechanism are combined to design a new multipath trust-based secure routing protocol(MTSR). MTSR based on AODV and SAODV, is distributed and can resist almost all available routing attacks such as discarding, Sybil, spoofing, jamming, flooding, rushing, and especially wormhole attack. Its trust value computation follows the principle of slowly increasing but sharply decreasing, and it does not require any additional equipment, strict assumptions, node location and precise time information.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"MTSR: Wormhole attack resistant secure routing for Ad hoc network\",\"authors\":\"X. Qiu, Jianwei Liu, A. Sangi\",\"doi\":\"10.1109/YCICT.2010.5713134\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Routing security is an important and well known issue in Ad hoc network applications and development. Various kinds of solutions have been proposed but they are impractical to be fully applied. In this paper, firstly the wormhole attack topology is analyzed, then cryptography and trust mechanism are combined to design a new multipath trust-based secure routing protocol(MTSR). MTSR based on AODV and SAODV, is distributed and can resist almost all available routing attacks such as discarding, Sybil, spoofing, jamming, flooding, rushing, and especially wormhole attack. Its trust value computation follows the principle of slowly increasing but sharply decreasing, and it does not require any additional equipment, strict assumptions, node location and precise time information.\",\"PeriodicalId\":179847,\"journal\":{\"name\":\"2010 IEEE Youth Conference on Information, Computing and Telecommunications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Youth Conference on Information, Computing and Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YCICT.2010.5713134\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2010.5713134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
MTSR: Wormhole attack resistant secure routing for Ad hoc network
Routing security is an important and well known issue in Ad hoc network applications and development. Various kinds of solutions have been proposed but they are impractical to be fully applied. In this paper, firstly the wormhole attack topology is analyzed, then cryptography and trust mechanism are combined to design a new multipath trust-based secure routing protocol(MTSR). MTSR based on AODV and SAODV, is distributed and can resist almost all available routing attacks such as discarding, Sybil, spoofing, jamming, flooding, rushing, and especially wormhole attack. Its trust value computation follows the principle of slowly increasing but sharply decreasing, and it does not require any additional equipment, strict assumptions, node location and precise time information.