Contour Approximation in Sensor Networks

Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algorithm is well suited to the distributed computing architecture of sensor networks, and we prove that its approximation quality is within a constant factor of the optimal. We also show through simulation that our scheme outperforms several other alternatives in preserving important shape features, and achieves approximation quality almost as good as the optimal, centralized scheme. Because many applications of sensor networks involve observations and monitoring of physical phenomena, the ability to represent complex geometric shapes faithfully but using small memory is vital in many settings.

• Type: Conference
• Year: 2006
• Where: DCOSS
• Authors: Chiranjeeb Buragohain, Sorabh Gandhi, John Hershberger, Subhash Suri
• Keywords: Approximation Quality, DCOSS 2006, Distributed And Parallel Computing, Geometric Shapes, Sensor Networks