Hong Zhu, Qiusheng Li, Mingchi Shao, Lei Wei, Peng Lin
{"title":"基于负载均衡和容错的无线传感器网络路由规划算法","authors":"Hong Zhu, Qiusheng Li, Mingchi Shao, Lei Wei, Peng Lin","doi":"10.1109/ICECOME.2018.8644804","DOIUrl":null,"url":null,"abstract":"Wireless sensors have been widely used in various fields of social activities. To better use the limited energy resource, a Load-balancing and Fault-tolerant based Route Planning Algorithm for Wireless Sensor Networks (LFRP) is proposed in this paper. The algorithm proposes an inter-cluster routing planning mechanism based on service priority. The algorithm can select the appropriate cluster-head node to relay according to the service priority, so as to form an optimized end-to-end route to achieve energy saving and load balancing. In order to ensure the reliability of data transmission, the algorithm also proposes a fault backup mechanism based on residual energy and optimal energy consumption. This mechanism includes link backup and node backup. The routing planning mechanism designed in this paper can include link backup function. At the same time, each node automatically generates weight based on remaining energy and communication efficiency. When a cluster-head node fails, the cluster node with the largest weight replaces the failure node. The simulation results show that LFRP algorithm can effectively balance the energy consumption of each cluster-head node under the premise of guaranteeing the service quality requirements of the transmission service, and finally extend the life cycle of the network.","PeriodicalId":320397,"journal":{"name":"2018 IEEE International Conference on Electronics and Communication Engineering (ICECE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Load-balancing and Fault-tolerant based Route Planning Algorithm for Wireless Sensor Networks\",\"authors\":\"Hong Zhu, Qiusheng Li, Mingchi Shao, Lei Wei, Peng Lin\",\"doi\":\"10.1109/ICECOME.2018.8644804\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless sensors have been widely used in various fields of social activities. To better use the limited energy resource, a Load-balancing and Fault-tolerant based Route Planning Algorithm for Wireless Sensor Networks (LFRP) is proposed in this paper. The algorithm proposes an inter-cluster routing planning mechanism based on service priority. The algorithm can select the appropriate cluster-head node to relay according to the service priority, so as to form an optimized end-to-end route to achieve energy saving and load balancing. In order to ensure the reliability of data transmission, the algorithm also proposes a fault backup mechanism based on residual energy and optimal energy consumption. This mechanism includes link backup and node backup. The routing planning mechanism designed in this paper can include link backup function. At the same time, each node automatically generates weight based on remaining energy and communication efficiency. When a cluster-head node fails, the cluster node with the largest weight replaces the failure node. The simulation results show that LFRP algorithm can effectively balance the energy consumption of each cluster-head node under the premise of guaranteeing the service quality requirements of the transmission service, and finally extend the life cycle of the network.\",\"PeriodicalId\":320397,\"journal\":{\"name\":\"2018 IEEE International Conference on Electronics and Communication Engineering (ICECE)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Electronics and Communication Engineering (ICECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECOME.2018.8644804\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Electronics and Communication Engineering (ICECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECOME.2018.8644804","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Load-balancing and Fault-tolerant based Route Planning Algorithm for Wireless Sensor Networks
Wireless sensors have been widely used in various fields of social activities. To better use the limited energy resource, a Load-balancing and Fault-tolerant based Route Planning Algorithm for Wireless Sensor Networks (LFRP) is proposed in this paper. The algorithm proposes an inter-cluster routing planning mechanism based on service priority. The algorithm can select the appropriate cluster-head node to relay according to the service priority, so as to form an optimized end-to-end route to achieve energy saving and load balancing. In order to ensure the reliability of data transmission, the algorithm also proposes a fault backup mechanism based on residual energy and optimal energy consumption. This mechanism includes link backup and node backup. The routing planning mechanism designed in this paper can include link backup function. At the same time, each node automatically generates weight based on remaining energy and communication efficiency. When a cluster-head node fails, the cluster node with the largest weight replaces the failure node. The simulation results show that LFRP algorithm can effectively balance the energy consumption of each cluster-head node under the premise of guaranteeing the service quality requirements of the transmission service, and finally extend the life cycle of the network.