A sensor placement algorithm for redundant covering based on Riesz energy minimization

We present an algorithm for sensor placement with redundancy where each point in a 2-dimensional space is covered by at least k sensors under the constraint that all the sensors are located away from each other. We reduce the problem to distributing points evenly on the surface of a torus manifold a...

Full description

Saved in:
Bibliographic Details
Published in:2008 IEEE International Symposium on Circuits and Systems pp. 2074 - 2077
Main Authors: Chai Wah Wu, Verma, Dinesh
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 01.01.2008
Subjects:
Distributed computing
Lattices
Minimization methods
Robustness
Sensor fusion
ISBN:9781424416837, 1424416833
ISSN:0271-4302
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present an algorithm for sensor placement with redundancy where each point in a 2-dimensional space is covered by at least k sensors under the constraint that all the sensors are located away from each other. We reduce the problem to distributing points evenly on the surface of a torus manifold and solve it computationally by minimizing the Riesz energy. We also study the case where the coverings are incrementally constructed. We illustrate our approach with numerical results and compare it to similar approaches in dispersed dither mask halftoning.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISBN:9781424416837
1424416833
ISSN:0271-4302
DOI:10.1109/ISCAS.2008.4541857