Title :
Distributed techniques for area computation in sensor networks [wireless networks]
Author :
Greenstein, Ben ; Kohler, Eddie ; Culler, David ; Estrin, Deborah
Author_Institution :
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
Abstract :
We study four distributed techniques for computing the area of a region in a sensor network. Area calculation is a fundamental sensor network primitive, and distributed, in-network approaches prove more scalable than centralized collection in terms of energy consumption. The four techniques - Delaunay triangulations, Voronoi diagrams, and two new, simpler algorithms, inverse neighborhood and inverse neighborhood with location - vary in computational complexity, communication cost, and information required from the sensor network. We conclude that when sensors know their physical locations, our simple and efficient inverse-neighborhood approach performs comparably to more systematic, but more expensive, computational geometry algorithms. We also analyze the effects of radio range and deployment density on accuracy, and show that topologies derived from real testbeds behave quite differently from commonly seen random topologies with unit disk connectivity.
Keywords :
area measurement; computational geometry; mesh generation; wireless sensor networks; Delaunay triangulation; Voronoi diagrams; Voronoi polygonization; area calculation; communication cost; computational complexity; computational geometry; deployment density; distributed area computation techniques; in-network-evaluation system; inverse neighborhood with location method; radio range; wireless sensor networks; Computational complexity; Computational efficiency; Computational geometry; Computer networks; Distributed computing; Energy consumption; Network topology; Sensor systems; Testing; Wireless sensor networks;
Conference_Titel :
Local Computer Networks, 2004. 29th Annual IEEE International Conference on
Print_ISBN :
0-7695-2260-2
DOI :
10.1109/LCN.2004.45