{"title":"简单加权生成树(SWST)与能量感知生成树(EAST)的比较研究","authors":"L. McLauchlan, Soumya Saha, R. Challoo","doi":"10.2991/ijndc.2014.2.3.4","DOIUrl":null,"url":null,"abstract":"Wireless Sensors Networks (WSNs) are utilized in many diverse applications ranging from security, environmental monitoring, landslide detection, patient monitoring, reconnaissance operations, structural health monitoring and smart buildings. Since in many applications the WSN nodes are randomly deployed, WSNs need to be able to arrange and self-organize. Nodes in WSNs generally possess low or limited power resources such as batteries. Energy utilization thus is an important design consideration for WSN deployment. There have been many energy aware protocols proposed in the literature to increase the longevity of the network. Recently, two novel Connected Dominating Set (CDS) based topology construction (TC) protocols- SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree), have been proposed which aim to balance the load among the nodes of the network and thus to reduce the probability of dying for a particular node. The SWST and EAST protocols aim to reduce the number of broken links that may have been caused by a single node becoming dead or comatose in the communication backbone of the network. In this paper, a comparative study of the SWST and EAST algorithms is conducted to evaluate the performance of the two algorithms. From the MATLAB simulations it was observed that the EAST protocol generally performs better than the SWST algorithms in delivering messages to the sink node.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree)\",\"authors\":\"L. McLauchlan, Soumya Saha, R. Challoo\",\"doi\":\"10.2991/ijndc.2014.2.3.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless Sensors Networks (WSNs) are utilized in many diverse applications ranging from security, environmental monitoring, landslide detection, patient monitoring, reconnaissance operations, structural health monitoring and smart buildings. Since in many applications the WSN nodes are randomly deployed, WSNs need to be able to arrange and self-organize. Nodes in WSNs generally possess low or limited power resources such as batteries. Energy utilization thus is an important design consideration for WSN deployment. There have been many energy aware protocols proposed in the literature to increase the longevity of the network. Recently, two novel Connected Dominating Set (CDS) based topology construction (TC) protocols- SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree), have been proposed which aim to balance the load among the nodes of the network and thus to reduce the probability of dying for a particular node. The SWST and EAST protocols aim to reduce the number of broken links that may have been caused by a single node becoming dead or comatose in the communication backbone of the network. In this paper, a comparative study of the SWST and EAST algorithms is conducted to evaluate the performance of the two algorithms. From the MATLAB simulations it was observed that the EAST protocol generally performs better than the SWST algorithms in delivering messages to the sink node.\",\"PeriodicalId\":318936,\"journal\":{\"name\":\"Int. J. Networked Distributed Comput.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Networked Distributed Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2991/ijndc.2014.2.3.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Networked Distributed Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2991/ijndc.2014.2.3.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree)
Wireless Sensors Networks (WSNs) are utilized in many diverse applications ranging from security, environmental monitoring, landslide detection, patient monitoring, reconnaissance operations, structural health monitoring and smart buildings. Since in many applications the WSN nodes are randomly deployed, WSNs need to be able to arrange and self-organize. Nodes in WSNs generally possess low or limited power resources such as batteries. Energy utilization thus is an important design consideration for WSN deployment. There have been many energy aware protocols proposed in the literature to increase the longevity of the network. Recently, two novel Connected Dominating Set (CDS) based topology construction (TC) protocols- SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree), have been proposed which aim to balance the load among the nodes of the network and thus to reduce the probability of dying for a particular node. The SWST and EAST protocols aim to reduce the number of broken links that may have been caused by a single node becoming dead or comatose in the communication backbone of the network. In this paper, a comparative study of the SWST and EAST algorithms is conducted to evaluate the performance of the two algorithms. From the MATLAB simulations it was observed that the EAST protocol generally performs better than the SWST algorithms in delivering messages to the sink node.