Ungjin Jang, Sunggu Lee, Jun-Y. Park, Sung-Joo Yoo
{"title":"容错WSN时间同步","authors":"Ungjin Jang, Sunggu Lee, Jun-Y. Park, Sung-Joo Yoo","doi":"10.4236/wsn.2010.210089","DOIUrl":null,"url":null,"abstract":"This paper proposes a new fault-tolerant time synchronization algorithm for wireless sensor networks that requires a short time for synchronization, achieves a guaranteed time synchronization level for all non-faulty nodes, accommodates nodes that enter suspended mode and then wake up, is computationally efficient, operates in a completely decentralized manner and tolerates up to f (out of 2 f + 1 total) faulty nodes. The performance of the proposed algorithm is analyzed, and an equation is derived for the resynchronization interval required for a specific level of synchronization precision. Results obtained from real runs on multi-hop networks are used to demonstrate the claimed features of the proposed algorithm.","PeriodicalId":251051,"journal":{"name":"Wirel. Sens. Netw.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fault-Tolerant WSN Time Synchronization\",\"authors\":\"Ungjin Jang, Sunggu Lee, Jun-Y. Park, Sung-Joo Yoo\",\"doi\":\"10.4236/wsn.2010.210089\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new fault-tolerant time synchronization algorithm for wireless sensor networks that requires a short time for synchronization, achieves a guaranteed time synchronization level for all non-faulty nodes, accommodates nodes that enter suspended mode and then wake up, is computationally efficient, operates in a completely decentralized manner and tolerates up to f (out of 2 f + 1 total) faulty nodes. The performance of the proposed algorithm is analyzed, and an equation is derived for the resynchronization interval required for a specific level of synchronization precision. Results obtained from real runs on multi-hop networks are used to demonstrate the claimed features of the proposed algorithm.\",\"PeriodicalId\":251051,\"journal\":{\"name\":\"Wirel. Sens. Netw.\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Wirel. Sens. Netw.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4236/wsn.2010.210089\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wirel. Sens. Netw.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4236/wsn.2010.210089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes a new fault-tolerant time synchronization algorithm for wireless sensor networks that requires a short time for synchronization, achieves a guaranteed time synchronization level for all non-faulty nodes, accommodates nodes that enter suspended mode and then wake up, is computationally efficient, operates in a completely decentralized manner and tolerates up to f (out of 2 f + 1 total) faulty nodes. The performance of the proposed algorithm is analyzed, and an equation is derived for the resynchronization interval required for a specific level of synchronization precision. Results obtained from real runs on multi-hop networks are used to demonstrate the claimed features of the proposed algorithm.