Analysis of higher order Voronoi diagram for fuzzy information coverage

Authors:
Weixin Xie;Rui Wang;Wenming Cao
Affiliations:
School of Electronic Engineering, Xidian University, Xi'an, China and ATR National Key Laboratory of Defense Technology, Shenzhen University, Guangdong, China;School of Electronic Engineering, Xidian University, Xi'an, China;ATR National Key Laboratory of Defense Technology, Shenzhen University, Guangdong, China
Venue:
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Year:
2007

Citing 5
Cited 1

A linear-time algorithm for computing the Voronoi diagram of a convex polygon

Discrete & Computational Geometry
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
The coverage problem in a wireless sensor network

Mobile Networks and Applications
On k-Nearest Neighbor Voronoi Diagrams in the Plane

IEEE Transactions on Computers
On solving coverage problems in a wireless sensor network using voronoi diagrams

WINE'05 Proceedings of the First international conference on Internet and Network Economics

Map segmentation for geospatial data mining through generalized higher-order Voronoi diagrams with sequential scan algorithms

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Coverage is one of the most important issues in sensor networks. For random sensor deployment, one would like to know whether the deployed sensors can cover the whole field sufficiently. In this paper, we attempt to find a set of critical points in a sensor field so as to answer the yes/no question of complete coverage only by checking whether these points are covered, which is based on a new model of fuzzy information coverage. The higher order Voronoi diagram is analyzed and a sufficient condition is provided for a sensor field which is completely fuzzy information covered by a given set of sensors. The corresponding algorithm in O (K2N+NlogN) runtime is also presented.