On Barrier Graphs of Sensor Networks

<p>The study of sensor networks begins with a model, which usually has a geometric component. This thesis focuses on networks of sensors modeled as collections of rays in the plane whose use is to detect intruders, and in particular a graph derived from this geometry, called the <em>barrier graph</em> of the network, which captures information about the network's coverage. Every such ray-barrier sensor network corresponds to a barrier graph, but not every graph is the barrier graph of some network.</p> <p>We show that any barrier graph is not just tripartite, but perfect. We describe how to find networks which have certain designated graphs as their barrier graphs. We show that the size of a minimum vertex cover (in this context called the resilience) of a given graph can yield information about whether and how one can find a sensor network whose barrier graph is the given graph. Finally, we demonstrate that barrier graphs have certain strong structural properties, as a result of the geometry of ray-barrier networks, which represent progress towards a full characterization of barrier graphs.</p>

Name thesis:degree_name

M.S.

Level thesis:degree_level

Masters Thesis

Year dc:date.available

2017

Author dc:creator

• Boyer, Kirk Anthony

Contributors dc:contributor

• Mario A. Lopez, Ph.D.
• Paul Horn
• Chris Gauthier-Dickey
• Jing Li

• Barrier
• Computational geometry
• Coverage
• Sensor networks
• Computer Sciences
• Other Computer Sciences

Statement dc:rights

• <p>Copyright is held by the author. User is responsible for all copyright compliance.</p>

Language dc:language

en

Repository record dc:identifier

https://digitalcommons.du.edu/etd/1420

OAI identifier oai:identifier

oai:digitalcommons.du.edu:etd-2420