{"title":"检测无线网络中的虫洞攻击","authors":"R. Maheshwari, Jie Gao, S.R. Das","doi":"10.1109/WIMESH.2006.288607","DOIUrl":null,"url":null,"abstract":"We study and propose a novel algorithm for detecting Wormhole Attacks in wireless ad hoc and sensor networks. The algorithm uses only local connectivity information and utilizes disk packing argument to detect such attacks. The success of the detection algorithm depends on the density of nodes in the network. Preliminary simulation results indicate that for uniformly distributed UDG networks, wormholes can be detected with very high probabilities for average degrees as low as 8.","PeriodicalId":426713,"journal":{"name":"2006 2nd IEEE Workshop on Wireless Mesh Networks","volume":"108 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Detecting wormhole attacks in wireless networks\",\"authors\":\"R. Maheshwari, Jie Gao, S.R. Das\",\"doi\":\"10.1109/WIMESH.2006.288607\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study and propose a novel algorithm for detecting Wormhole Attacks in wireless ad hoc and sensor networks. The algorithm uses only local connectivity information and utilizes disk packing argument to detect such attacks. The success of the detection algorithm depends on the density of nodes in the network. Preliminary simulation results indicate that for uniformly distributed UDG networks, wormholes can be detected with very high probabilities for average degrees as low as 8.\",\"PeriodicalId\":426713,\"journal\":{\"name\":\"2006 2nd IEEE Workshop on Wireless Mesh Networks\",\"volume\":\"108 2\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 2nd IEEE Workshop on Wireless Mesh Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIMESH.2006.288607\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 2nd IEEE Workshop on Wireless Mesh Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIMESH.2006.288607","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We study and propose a novel algorithm for detecting Wormhole Attacks in wireless ad hoc and sensor networks. The algorithm uses only local connectivity information and utilizes disk packing argument to detect such attacks. The success of the detection algorithm depends on the density of nodes in the network. Preliminary simulation results indicate that for uniformly distributed UDG networks, wormholes can be detected with very high probabilities for average degrees as low as 8.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
