{"title":"具有路由树覆盖的wsn的分布式容错","authors":"Shanti Chilukuri, A. Sahoo","doi":"10.1109/COMSNETS.2011.5716433","DOIUrl":null,"url":null,"abstract":"WSNs are inherently power constrained and are often deployed in harsh environments. As such, node death is a possibility that must be considered while designing protocols for such networks. Rerouting of data is generally necessary so that data from the descendant nodes of the dead node can reach the sink. Since slot allocation in TDMA MAC protocols is generally done based on the routing tree, all the nodes must switch to the new routing tree to avoid collisions. This necessitates disseminating the fault information to all the nodes reliably. We propose a flooding algorithm for disseminating fault info to the network reliably even in a lossy channel. Simulation results show that the proposed flooding scheme consumes lesser energy and converges faster than a simple flooding scheme.","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed fault tolerance for WSNs with routing tree overlays\",\"authors\":\"Shanti Chilukuri, A. Sahoo\",\"doi\":\"10.1109/COMSNETS.2011.5716433\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"WSNs are inherently power constrained and are often deployed in harsh environments. As such, node death is a possibility that must be considered while designing protocols for such networks. Rerouting of data is generally necessary so that data from the descendant nodes of the dead node can reach the sink. Since slot allocation in TDMA MAC protocols is generally done based on the routing tree, all the nodes must switch to the new routing tree to avoid collisions. This necessitates disseminating the fault information to all the nodes reliably. We propose a flooding algorithm for disseminating fault info to the network reliably even in a lossy channel. Simulation results show that the proposed flooding scheme consumes lesser energy and converges faster than a simple flooding scheme.\",\"PeriodicalId\":302678,\"journal\":{\"name\":\"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-02-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS.2011.5716433\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2011.5716433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distributed fault tolerance for WSNs with routing tree overlays
WSNs are inherently power constrained and are often deployed in harsh environments. As such, node death is a possibility that must be considered while designing protocols for such networks. Rerouting of data is generally necessary so that data from the descendant nodes of the dead node can reach the sink. Since slot allocation in TDMA MAC protocols is generally done based on the routing tree, all the nodes must switch to the new routing tree to avoid collisions. This necessitates disseminating the fault information to all the nodes reliably. We propose a flooding algorithm for disseminating fault info to the network reliably even in a lossy channel. Simulation results show that the proposed flooding scheme consumes lesser energy and converges faster than a simple flooding scheme.