Title: A boundary approximation algorithm for distributed sensor networks

Authors: M.I. Ham, M.A. Rodriguez

Addresses: Physics Division P-21 & Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, New Mexico, USA. ' Theoretical Division – Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, New Mexico, USA

Abstract: We present an algorithm for boundary approximation in locally linked sensor networks that communicate with a remote monitoring station. Delaunay triangulations and Voronoi diagrams are used to generate a sensor communication network and define boundary segments between sensors, respectively. The proposed algorithm reduces remote station communication by approximating boundaries via a decentralised computation executed within the network. Moreover, the algorithm identifies boundaries based on differences between neighbouring sensor readings, not absolute sensor values. An analysis of the bandwidth consumption of the algorithm is presented and compared to two naive approaches. The proposed algorithm reduces the amount of remote communication (compared to the naive approaches) and becomes increasingly useful in networks with more nodes.

Keywords: boundary detection; low bandwidth communication; wireless sensor networks; WSNs; boundary approximation; wireless networks; remote monitoring; Delaunay triangulations; Voronoi diagrams; distributed networks.

DOI: 10.1504/IJSNET.2010.034065

International Journal of Sensor Networks, 2010 Vol.8 No.1, pp.41 - 46

Available online: 07 Jul 2010 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article