Coverage analysis for wireless sensor networks

Authors:
Ming Liu;Jiannong Cao;Wei Lou;Li-jun Chen;Xie Li
Affiliations:
Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China
Venue:
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Year:
2005

Citing 7
Cited 0

Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Infrastructure tradeoffs for sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Analysis on the redundancy of wireless sensor networks

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Position-based routing in ad hoc networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of the WSN by turning off redundant nodes. In this paper, we propose a mathematical model for coverage analysis of WSNs. Based on the model, given the ratio of the sensing range of a sensor node to the range of the entire deployment area, the number of the active nodes needed to reach the expected coverage can be derived. Different from most existing works, our approach does not require the knowledge about the locations of sensor nodes, thus can save considerably the cost of hardware and the energy consumption on sensor nodes needed for deriving and maintaining location information. We have also carried out an experimental study by simulations. The analytical results are very close to the simulations results. The proposed method can be widely applied to designing protocols for handling sensor deployment, topology control and other issues in WSNs.