Sensor Network Deployment Using Circle Packings

Authors:
Miu-Ling Lam;Yun-Hui Liu
Affiliations:
Department of Mechanical and Computer-Aided Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong,;Department of Mechanical and Computer-Aided Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong,
Venue:
Information Networking. Towards Ubiquitous Networking and Services
Year:
2008

Citing 3
Cited 0

A simple algorithm for computing the smallest enclosing circle

Information Processing Letters
Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel algorithm for autonomous deployment of active sensor networks. It enhances the sensing coverage based on an initial placement of sensor nodes. The problem of placing a number of circular discs (which model sensing coverage) of different radii to cover a field is intuitively transformed to the circle packing problem. Due to the fact that a unique maximal packing exists for a given set of combinatorics (triangulations) and boundary conditions, we can always find the minimum sensing range required for every interior node to satisfy these conditions. Though an extension from tangency packing to overlap packing, the interstices among triples (which represent coverage holes) can be eliminated. Based on a number of numerical simulations, we have verified that the proposed algorithm always yields sensor deployments of wide coverage and minimizes sensing range required for every interior sensing node to satisfy the packing and boundary conditions.