Expected k-coverage in wireless sensor networks |
| |
Authors: | Li-Hsing Chang Wu Yang-Min |
| |
Affiliation: | aDepartment of Computer Science and Information Engineering, Chung Hua University, No. 707, Sec. 2, WuFu Road, Hsinchu, Taiwan 300, China |
| |
Abstract: | We are concerned with wireless sensor networks where n sensors are independently and uniformly distributed at random in a finite plane. Events that are within a fixed distance from some sensor are assumed to be detectable and the sensor is said to cover that point. In this paper, we have formulated an exact mathematical expression for the expected area that can be covered by at least k out of n sensors. Our results are important in predicting the degree of coverage a sensor network may provide and in determining related parameters (sensory range, number of sensors, etc.) for a desired level of coverage. We demonstrate the utility of our results by presenting a node scheduling scheme that conserves energy while retaining network coverage. Additional simulation results have confirmed the accuracy of our analysis. |
| |
Keywords: | Sensor network Coverage Border effect Node scheduling Uniform distribution |
本文献已被 ScienceDirect 等数据库收录! |
|