Distributed Euler Characteristic Calculation for Sensor Network Coverage Hole

Report No. ARL-TN-0970
Authors: Terrence J Moore
Date/Pages: September 2019; 23 pages
Abstract: In the tactical network environment, GPS might not be reliable. Algebraic topology using homology is one alternative for enabling certain wireless sensor network coverage operations without location information. The only information needed at the sensor node can be obtained from the local connectivity details in the network communication graph. One basic problem is the detection of coverage gaps and counting the number of such "holes". This is usually accomplished via homology calculations in a centralized or distributed manner. A recent work develops a centralized method based on the Euler characteristic as a solution to the problem. This note produces a distributed approach for Euler characteristic calculation and corrects a mistaken assumption in that work.
Distribution: Approved for public release
  Download Report ( 0.754 MBytes )
If you are visually impaired or need a physical copy of this report, please visit and contact DTIC.
 

Last Update / Reviewed: September 1, 2019