A boundary approximation algorithm for distributed sensor networks

  title={A boundary approximation algorithm for distributed sensor networks},
  author={Michael I. Ham and Michael A. Rodriguez},
  journal={Int. J. Sens. Networks},
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… 

Figures and Tables from this paper

Overhearing-Based Efficient Boundary Detection in Dense Mobile Wireless Sensor Networks
An efficient boundary detection method in dense mobile wireless sensor networks, which makes use of overhearing sensor data, and determines whether it exists close to a boundary or not based on sensor data overheard from its neighboring nodes.
A Sampling-based Boundary Detection Method with Consideration of Boundary Shape in Dense Mobile Wireless Sensor Networks
A method which efficiently detects the geographical boundaries of sensor readings in mobile wireless sensor networks, in situations where sensor data must be gathered within a short period, by taking samples of nodes.
A convex hull-based approximation of forest fire shape with distributed wireless sensor networks
This work assumes that network nodes are able to collaborate in order to obtain an approximation of the forest fire shape without any base station, in a completely distributed way, and proposes and analyzes two techniques for performing this approximation.
Hull-based approximation to forest fires with distributed wireless sensor networks
This work focuses on forest fire fighting operations, proposing a distributed way for approximating the shape of the fire, and analyzes the employ of a shape composed of several convex hulls to represent the forest fire in a more compact way.
Balanced Density-Based Clustering Technique Based on Distributed Spatial Analysis in Wireless Sensor Network
Simulation results show that the proposed technique achieves less power consumption and therefore longer network lifetime when compared with other clustering techniques.
Sensor Distribution on Coverage in Sensor Networks
A distribution-free approach to study network coverage is adopted, in which no assumption of probability distribution of sensor node locations is needed, which has yielded good estimations of network coverage.
Adaptive edge detection with distributed behaviour-based agents in WSNs
A novel computational method of edge detecting for wireless sensor networks which utilises a collection of distributed autonomous agents to efficiently locate and label various homogeneous regions of the monitored field is proposed.
Distributed Forest Fire Monitoring Using Wireless Sensor Networks
Performance evaluation of realistic fire models on computer simulations reveals that the method based on arbitrary polygons obtains an improvement of 20% in terms of accuracy of the fire shape approximation, reducing the overhead in-network resources to 10% in the best case.


Boundary Estimation in Sensor Networks: Theory and Methods
This paper investigates a strategy by which sensor nodes detect and estimate non-localized phenomena such as "boundaries" and "edges"(e.g., temperature gradients, variations in illumination or contamination levels).
Robust Edge Detection in Wireless Sensor Networks
  • C. Mallery, M. Medidi
  • Computer Science
    IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference
  • 2008
Results show that the proposed distributed edge detection technique provides accurate perimeters for all sensed phenomena within a wireless sensor network even in the presence of irregularly shaped phenomena.
Deterministic boundary recognition and topology extraction for large sensor networks
The objective is to develop algorithms and protocols that allow self-organization of the swarm into large-scale structures that reflect the structure of the street network, setting the stage for global routing, tracking and guiding algorithms.
Monitoring Environmental Boundaries With a Robotic Sensor Network
An algorithm to monitor an environmental boundary with mobile agents to optimally approximate the boundary with a polygon is proposed and an algorithm that distributes the vertices of the approximating polygon uniformly along the boundary is designed.
Shape Segmentation and Applications in Sensor Networks
A segmentation algorithm that partitions an irregular sensor field into nicely shaped pieces such that algorithms and protocols that assume a nice sensor field can be applied inside each piece are proposed.
Localized edge detection in sensor fields
It is shown that localized edge detection techniques are non-trivial to design in an arbitrarily deployed sensor network and the notion of an edge is defined and performance metrics for evaluating localized edge Detection algorithms are developed.
Distributed edge detection with composite hypothesis test in wireless sensor networks
A statistical approach to distributed edge sensor detection with wireless sensor networks is proposed in this research and data fusion as well as decision fusion methods for edge Sensor detection are proposed to fulfill the aforementioned constraints.
Locating and Bypassing Holes in Sensor Networks
Holes are defined to be the regions enclosed by a polygonal cycle which contains all the nodes where local minima can appear and the boundaries of holes marked using BoundHole can be used in many applications such as geographic routing, path migration, information storage mechanisms and identification of regions of interest.
NED: An Efficient Noise-Tolerant Event and Event Boundary Detection Algorithm in Wireless Sensor Networks
An efficient algorithm, named NED, to support event and event boundary detection in wireless sensor networks, which encodes partial event estimation results into variable length messages exchanged locally among neighboring nodes and scales well to very large networks.
Coverage in wireless ad-hoc sensor networks
  • Xiangyang Li, P. Wan, O. Frieder
  • Computer Science, Mathematics
    2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333)
  • 2002
Efficient distributed algorithms are given to optimally solve the best-coverage problem raised in Meguerdichian, and it is shown that the search space of the best coverage problem can be confined to the relative neighborhood graph, which can be constructed locally.