{"title":"有限真值者无线传感器网络中节点的安全定位","authors":"Joaquín García, M. Barbeau, E. Kranakis","doi":"10.1109/CNSR.2009.23","DOIUrl":null,"url":null,"abstract":"We provide in this paper three algorithms that enable the sensor nodes of a Wireless Sensor Network (WSN) to determine their location in presence of neighbor sensors that may lie about their position. Our algorithms minimize the number of trusted nodes required by regular nodes to complete their process of localization. The algorithms always work for a given number of neighbors provided that the number of liars is below a certain threshold value, which is also determined.","PeriodicalId":103090,"journal":{"name":"2009 Seventh Annual Communication Networks and Services Research Conference","volume":"193 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":"{\"title\":\"Secure Localization of Nodes in Wireless Sensor Networks with Limited Number of Truth Tellers\",\"authors\":\"Joaquín García, M. Barbeau, E. Kranakis\",\"doi\":\"10.1109/CNSR.2009.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We provide in this paper three algorithms that enable the sensor nodes of a Wireless Sensor Network (WSN) to determine their location in presence of neighbor sensors that may lie about their position. Our algorithms minimize the number of trusted nodes required by regular nodes to complete their process of localization. The algorithms always work for a given number of neighbors provided that the number of liars is below a certain threshold value, which is also determined.\",\"PeriodicalId\":103090,\"journal\":{\"name\":\"2009 Seventh Annual Communication Networks and Services Research Conference\",\"volume\":\"193 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"46\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Seventh Annual Communication Networks and Services Research Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNSR.2009.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Seventh Annual Communication Networks and Services Research Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2009.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Secure Localization of Nodes in Wireless Sensor Networks with Limited Number of Truth Tellers
We provide in this paper three algorithms that enable the sensor nodes of a Wireless Sensor Network (WSN) to determine their location in presence of neighbor sensors that may lie about their position. Our algorithms minimize the number of trusted nodes required by regular nodes to complete their process of localization. The algorithms always work for a given number of neighbors provided that the number of liars is below a certain threshold value, which is also determined.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
