Expected k-coverage in wireless sensor networks

Li-Hsing Yen*, Chang Wu Yu, Yang Min Cheng


研究成果: Article同行評審

87 引文 斯高帕斯(Scopus)


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.

頁(從 - 到)636-650
期刊Ad Hoc Networks
出版狀態Published - 1 9月 2006


深入研究「Expected k-coverage in wireless sensor networks」主題。共同形成了獨特的指紋。