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 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.

By: Chai Wah Wu; Dinesh Verma

Published in: RC24367 in 2007


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .