Skip to Main Content
ASME Press Select Proceedings

International Conference on Instrumentation, Measurement, Circuits and Systems (ICIMCS 2011)

By
Chen Ming
Chen Ming
Search for other works by this author on:
ISBN:
9780791859902
No. of Pages:
1400
Publisher:
ASME Press
Publication date:
2011

For ensuring robustness of wireless sensor networks in three-dimensional space, this paper presents a k-coverage algorithm in large-scale three-dimensional wireless sensor networks and the target environment can be irregular to a certain extent. Firstly, the three-dimensional target environment is split in the form of points according to a certain granularity. And then, determine the position of sensors in the processed space with the iterative greedy heuristic method. Each iteration later, complete the placement of a sensor node until all the split points can be k-covered. From the simulation experiments we can see this algorithm can solve large-scale and irregular target area k-coverage problem quickly and efficiently, and compare with the algorithm of random strategy, our algorithm has obvious advantages to achieve the same target.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal