TY - GEN
T1 - Analysis on the Redundancy of Wireless Sensor Networks
AU - Gao, Yong
AU - Wu, Kui
AU - Li, Fulu
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2003
Y1 - 2003
N2 - Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain long network lifetime as well as sufficient sensing area. To achieve this goal, a broadly-used method is to turn off redundant sensors. In this paper, the problem of estimating redundant sensing areas among neighbouring wireless sensors is analysed. We present an interesting observation concerning the minimum and maximum number of neighbours that are required to provide complete redundancy and introduce simple methods to estimate the degree of redundancy without the knowledge of location or directional information. We also provide tight upper and lower bounds on the probability of complete redundancy and on the average partial redundancy. With random sensor deployment, our analysis shows that partial redundancy is more realistic for real applications, as complete redundancy is expensive, requiring up to 11 neighbouring sensors to provide a 90 percent chance of complete redundancy. Our results can be utilised in designing effective sensor scheduling algorithms to reduce energy consumption and in the mean time maintain a reasonable sensing area.
AB - Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain long network lifetime as well as sufficient sensing area. To achieve this goal, a broadly-used method is to turn off redundant sensors. In this paper, the problem of estimating redundant sensing areas among neighbouring wireless sensors is analysed. We present an interesting observation concerning the minimum and maximum number of neighbours that are required to provide complete redundancy and introduce simple methods to estimate the degree of redundancy without the knowledge of location or directional information. We also provide tight upper and lower bounds on the probability of complete redundancy and on the average partial redundancy. With random sensor deployment, our analysis shows that partial redundancy is more realistic for real applications, as complete redundancy is expensive, requiring up to 11 neighbouring sensors to provide a 90 percent chance of complete redundancy. Our results can be utilised in designing effective sensor scheduling algorithms to reduce energy consumption and in the mean time maintain a reasonable sensing area.
KW - Coverage
KW - Redundancy Analysis
KW - Wireless Sensor Networks
UR - http://www.scopus.com/inward/record.url?scp=1542317079&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-1542317079&origin=recordpage
U2 - 10.1145/941365.941366
DO - 10.1145/941365.941366
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 1581137648
SN - 9781581137644
T3 - Proceedings of the Second ACM International Workshop on Wireless Sensor networks and Applications, WSNA 2003
SP - 108
EP - 114
BT - Proceedings of the Second ACM International Workshop on Wireless Sensor Networks and Applications, WSNA 2003
PB - Association for Computing Machinery
T2 - Proceedings of the Second ACM International Workshop on Wireless Sensor Networks and Applications, WSNA 2003
Y2 - 19 September 2003 through 19 September 2003
ER -