Abstract
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such networks, namely the coverage problem, in which we would like to determine whether a region of interest is sufficiently covered by a given set of sensors. This problem is motivated by monitoring applications in sensor networks, as well as robustness concerns and protocol requirements. We show that the coverage problem and some of its variants can be treated in a unified manner using suitable generalizations of the Voronoi diagram. As a result, we are able to give algorithms that have better runtimes than those proposed in previous works (see, e.g., [5, 6]). Our approach also yields efficient algorithms for coverage problems where the sensing region of a sensor is an ellipse or an L p –ball, where p≥1.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal, A., Guibas, L.J., Saxe, J., Shor, P.W.: A Linear–Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. Discrete and Computational Geometry 4, 591–604 (1989)
Aurenhammer, F.: Power Diagrams: Properties, Algorithms and Applications. SIAM Journal of Computing 16(1), 78–96
Agarwal, P.K., Schwarzkopf, O., Sharir, M.: The Overlay of Lower Envelopes in Three Dimensions and Its Applications. In: Proceedings of the 11th Annual Symposium on Computational Geometry (1995)
Chazelle, B., Edelsbrunner, H.: An Improved Algorithm for Constructing k–th Order Voronoi Diagrams. IEEE Transactions on Computers C-36(11), 1349–1354 (1987)
Huang, C.-F., Tseng, Y.-C.: The Coverage Problem in a Wireless Sensor Network. In: Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications (WSNA), pp. 115–121 (2003)
Huang, C.-F., Tseng, Y.-C., Lo, L.-C.: The Coverage Problem in Three–Dimensional Wireless Sensor Networks. In: IEEE GLOBECOM (2004)
Lee, D.T.: Two–Dimensional Voronoi Diagram in the L p –Metric. Journal of the ACM 27(4), 604–618 (1980)
Lee, D.-T.: On k–Nearest Neighbor Voronoi Diagrams in the Plane. IEEE Transactions on Computers C-31(6), 478–487 (1982)
Li, X.-Y., Wan, P.-J., Frieder, O.: Coverage in Wireless Ad–Hoc Sensor Networks. In: Proceedings of the IEEE International Conference on Communications, ICC (2002)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage Problems in Wireless Ad–Hoc Sensor Networks. In: IEEE INFOCOM (2001)
Ratnasamy, S., Karp, B., Shenker, S., Estrin, D., Govindan, R., Yin, L., Yu, F.: Data–Centric Storage in Sensornets with GHT, a Geographic Hash Table. Mobile Networks and Applications 8(4), 427–442 (2003)
Shin, J., So, A.M.-C., Guibas, L.: Supporting Group Communication among Interacting Agents in Wireless Sensor Networks. In: Proceedings of the IEEE Wireless Communications and Networking Conference, WCNC (2005)
Szewczyk, R., Osterweil, E., Polastre, J., Hamilton, M., Mainwaring, A., Estrin, D.: Habitat Monitoring with Sensor Networks. Communications of the ACM 47(6), 34–40 (2004)
Tian, D., Georganas, N.D.: A Coverage–Preserving Node Scheduling Scheme for Large Wireless Sensor Networks. In: Proceedings of the 1st ACM International Conference on Wireless Sensor Networks and Applications (WSNA), pp. 32–41 (2002)
Ye, F., Zhong, G., Cheng, J., Lu, S., Zhang, L.: PEAS: A Robust Energy Conserving Protocol for Long–Lived Sensor Networks. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, ICDCS (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, ICCCN (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
So, A.MC., Ye, Y. (2005). On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_58
Download citation
DOI: https://doi.org/10.1007/11600930_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)