Distributed Graph Reduction Algorithm with Parallel Rigidity Maintenance

Abstract

Precise localization in wireless sensor networks depends on distributed algorithms running on a large number of wireless nodes with reduced energy, processing and memory resources. Prerequisite for the estimation of unique nodes locations is rigid network graph. To satisfy this prerequisite network graph needs to be well connected. On the other hand… (More)
DOI: 10.1109/MIPRO.2016.7522144

Topics

5 Figures and Tables

Slides referencing similar topics