Abstract
The coverage problem is a fundamental issue in the research of sensor network. A novel Voronoi tessellation based rapid coverage decision algorithm is proposed, in which the region of interest is partitioned into some square grids firstly, and then the complex area coverage problem is transformed into simple vertices coverage problem, on the basis of the good characteristics of Voronoi tessellation such as being able to divide the planner area into a set of simple geometric simplexes. Theoretical analysis and simulation results show that, the new algorithm can decrease the computation complexity of networks, especially for sensor networks with n different sensors, it can solve the coverage problem correctly for any given region of interest with time costs of O(nlogn) only.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Meguerdichian, S., et al.: Coverage Problems in Wireless Ad Hoc Sensor Networks. IEEE INFORCOM 3, 1380–1387 (2001)
Li, X., Wan, P., Frieder, O.: Coverage in Wireless Ad Hoc Sensor Networks. IEEE Transactions on Computers 6, 753–763 (2003)
Tian, D., Georganas, N.D.: A coverage-preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: Proceedings of 1st ACM International Conference on Wireless Sensor Networks and Applications, pp. 32–41. ACM Press, New York (2002)
Ye, F., Zhong, G., Cheng, J., et al.: PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 28–37 (2003)
Zhou, Z., Das, S., Gupta, H.: Connected K-Coverage Problem in Sensor Networks. In: Proceedings of the 13th International Conference on Computer Communications and Networks, pp. 373–378 (2004)
Huang, C.F., Tseng, Y.C.: The Coverage Problem in a Wireless Sensor Net-work. In: Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications, pp. 115–121. ACM Press, New York (2003)
Huang, C.F., Tseng, Y.C., Lo, L.C.: The Coverage Problem in Three Dimensional Wireless Sensor Networks. In: Shah, R. (ed.) Proc. of the GLOBECOM, pp. 3182–3186. IEEE Press, Dallas (2004)
So, A.M.-C., Ye, Y.: On Sloving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams. In: Proceedings of the 1st Workshop on Internet and Network Economics, pp. 584–593 (2005)
Bogdan, C., Ananth, G.: Jan Vitek: Coverage Preserving Redundancy Elimination in Sensor Networks. In: Proceedings of the 1st IEEE International Conference on Sensor and Ad Hoc Communications and Networks, pp. 377–386. IEEE Computer Society Press, Los Alamitos (2004)
Aggarwal, A., Leonidas, J., et al.: A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. Discreate and Computational Geometry 6, 591–604 (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, L., Shen, H., Chen, Z., Lin, Y. (2007). Voronoi Tessellation Based Rapid Coverage Decision Algorithm for Wireless Sensor Networks. In: Indulska, J., Ma, J., Yang, L.T., Ungerer, T., Cao, J. (eds) Ubiquitous Intelligence and Computing. UIC 2007. Lecture Notes in Computer Science, vol 4611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73549-6_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-73549-6_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73548-9
Online ISBN: 978-3-540-73549-6
eBook Packages: Computer ScienceComputer Science (R0)