Lean and Robust Phenomenon Boundary Approximation

Carsten Buschmann, Daniela Krüger, Stefan Fischer


We present an algorithm for computing a compact polygonal boundary of physical phenomena that nodes in a wireless sensor network can detect. It works strictly local and is robust against measurement errors and packet loss. It can deal with non-convex shapes and assumes nothing but location awareness at the nodes and a loose time synchronization. Other than different schemes described in literature our algorithm does not rely on a hierarchical clustered communication structure. After discussing related approaches and introducing our boundary approximation scheme in detail, we show through an extensive set of simulations that it is robust and accurate.

Original languageEnglish
Title of host publication2007 IEEE Conference on Emerging Technologies and Factory Automation (EFTA 2007)
Number of pages8
Publication date01.12.2007
Article number4416918
ISBN (Print)978-1-4244-0825-2, 978-1-4244-0826-9
Publication statusPublished - 01.12.2007
Event12th IEEE International Conference on Emerging Technologies and Factory Automation
- Patras, Greece
Duration: 25.09.200728.09.2007
Conference number: 72709


Dive into the research topics of 'Lean and Robust Phenomenon Boundary Approximation'. Together they form a unique fingerprint.

Cite this