A Hierarchical Scheduling Scheme in WSNs Based on Node-Failure Pretreatment
One of the most important challenges in designing wireless sensor networks is how to recover a broken network within a very short time as the active nodes are failed or out-of-energy. Focusing on this problem, a hierarchical scheduling scheme based on node-failure pretreatment is proposed, in which...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2015-07-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2015/397615 |
| _version_ | 1826998526865833984 |
|---|---|
| author | Hai-yuan Liu Yi-nan Guo Mei-rong Chen Yuan-shun Zhu |
| author_facet | Hai-yuan Liu Yi-nan Guo Mei-rong Chen Yuan-shun Zhu |
| author_sort | Hai-yuan Liu |
| collection | DOAJ |
| description | One of the most important challenges in designing wireless sensor networks is how to recover a broken network within a very short time as the active nodes are failed or out-of-energy. Focusing on this problem, a hierarchical scheduling scheme based on node-failure pretreatment is proposed, in which the global optimization method is used to find the minimum connected tree and the local multilayer recovery algorithm is used to find a candidate sensor node instead of the failed one. Three highlights of this scheme are as follows: (1) The importance of sensor nodes is defined in terms of their locations in minimum connected tree and coverage acreage. (2) The neighborhood radius of failed sensor node varies with its importance, and then its candidate-node set is dynamically constructed. (3) A novel multilayer recovery strategy including node recovery and regional recovery is presented. Simulation results show that hierarchical scheduling scheme finds the optimal candidate sensor node in less time to make the repaired network with lowest energy consumption. Though the less sensor nodes are activated, the network lifetime is slightly shorter. Moreover, this scheme can be applied in the problem that the communication radius of sensor node is less than two times of its sensing radius. |
| first_indexed | 2024-03-12T10:42:54Z |
| format | Article |
| id | doaj.art-ab10e59afd204b87a10d21a61bcf5b3a |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2025-02-18T10:15:33Z |
| publishDate | 2015-07-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-ab10e59afd204b87a10d21a61bcf5b3a2024-11-02T05:32:16ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772015-07-011110.1155/2015/397615397615A Hierarchical Scheduling Scheme in WSNs Based on Node-Failure PretreatmentHai-yuan Liu0Yi-nan Guo1Mei-rong Chen2Yuan-shun Zhu3 College of Sciences, China University of Mining and Technology, Xuzhou 221116, China School of Information and Electrical Engineering, China University of Mining and Technology, Xuzhou 221116, China College of Sciences, China University of Mining and Technology, Xuzhou 221116, China School of Information and Electrical Engineering, China University of Mining and Technology, Xuzhou 221116, ChinaOne of the most important challenges in designing wireless sensor networks is how to recover a broken network within a very short time as the active nodes are failed or out-of-energy. Focusing on this problem, a hierarchical scheduling scheme based on node-failure pretreatment is proposed, in which the global optimization method is used to find the minimum connected tree and the local multilayer recovery algorithm is used to find a candidate sensor node instead of the failed one. Three highlights of this scheme are as follows: (1) The importance of sensor nodes is defined in terms of their locations in minimum connected tree and coverage acreage. (2) The neighborhood radius of failed sensor node varies with its importance, and then its candidate-node set is dynamically constructed. (3) A novel multilayer recovery strategy including node recovery and regional recovery is presented. Simulation results show that hierarchical scheduling scheme finds the optimal candidate sensor node in less time to make the repaired network with lowest energy consumption. Though the less sensor nodes are activated, the network lifetime is slightly shorter. Moreover, this scheme can be applied in the problem that the communication radius of sensor node is less than two times of its sensing radius.https://doi.org/10.1155/2015/397615 |
| spellingShingle | Hai-yuan Liu Yi-nan Guo Mei-rong Chen Yuan-shun Zhu A Hierarchical Scheduling Scheme in WSNs Based on Node-Failure Pretreatment International Journal of Distributed Sensor Networks |
| title | A Hierarchical Scheduling Scheme in WSNs Based on Node-Failure Pretreatment |
| title_full | A Hierarchical Scheduling Scheme in WSNs Based on Node-Failure Pretreatment |
| title_fullStr | A Hierarchical Scheduling Scheme in WSNs Based on Node-Failure Pretreatment |
| title_full_unstemmed | A Hierarchical Scheduling Scheme in WSNs Based on Node-Failure Pretreatment |
| title_short | A Hierarchical Scheduling Scheme in WSNs Based on Node-Failure Pretreatment |
| title_sort | hierarchical scheduling scheme in wsns based on node failure pretreatment |
| url | https://doi.org/10.1155/2015/397615 |
| work_keys_str_mv | AT haiyuanliu ahierarchicalschedulingschemeinwsnsbasedonnodefailurepretreatment AT yinanguo ahierarchicalschedulingschemeinwsnsbasedonnodefailurepretreatment AT meirongchen ahierarchicalschedulingschemeinwsnsbasedonnodefailurepretreatment AT yuanshunzhu ahierarchicalschedulingschemeinwsnsbasedonnodefailurepretreatment AT haiyuanliu hierarchicalschedulingschemeinwsnsbasedonnodefailurepretreatment AT yinanguo hierarchicalschedulingschemeinwsnsbasedonnodefailurepretreatment AT meirongchen hierarchicalschedulingschemeinwsnsbasedonnodefailurepretreatment AT yuanshunzhu hierarchicalschedulingschemeinwsnsbasedonnodefailurepretreatment |