Abstract | ||
---|---|---|
Maximizing network lifetime while not sacrificing coverage and connectivity in wireless sensor networks (WSNs) has attracted many researches during the past few years. One common approach is node scheduling which dynamically schedules some redundant nodes to shut down and keeps alive some necessary nodes to preserve network performance. Previous researches focus either on guaranteeing coverage and connectivity or sacrificing coverage and connectivity to conserve energy. In this paper, we introduce a new hole-tolerant redundancy scheme (HRS) which can prolong network lifetime while maintaining coverage and connectivity performance. This HRS scheme can tolerate some coverage holes when determining redundancy eligibility, so it shuts down more nodes when hole tolerance is higher. Our work takes into account both homoradius WSNs and heteroradius WSNs. The simulation results show that (1) the average coverage percentage varies mildly but network lifetime is prolonged as hole tolerance increases; (2) HRS outperforms several existing lifetime maximization schemes. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1155/2012/320108 | INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS |
Field | DocType | Volume |
Scheduling (computing),Computer science,Computer network,Redundancy (engineering),Schedule,Wireless sensor network,Maximization,Network performance,Distributed computing | Journal | 2012 |
Issue | ISSN | Citations |
null | 1550-1477 | 5 |
PageRank | References | Authors |
0.44 | 13 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Juhua Pu | 1 | 50 | 11.90 |
Yu Gu 0004 | 2 | 2158 | 127.59 |
Zhang Yi | 3 | 1765 | 194.41 |
Jia Chen | 4 | 14 | 0.85 |
Zhang Xiong | 5 | 1069 | 102.45 |