A Boundary Approximation Algorithm for Distributed Sensor Networks

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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 decentralized computation executed within the sensor network. Moreover, the algorithm identifies boundaries based on differences between neighboring sensor readings, and 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Boundary Approximation Algorithm for Distributed Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Boundary Approximation Algorithm for Distributed Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Boundary Approximation Algorithm for Distributed Sensor Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-188943

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.