Abstract
AbstractWe present a hole boundary detection algorithm for sensor network which identifies the geographical boundary of voids in the network assuming the relative geographic information of only 2‐hop neighbors. We formalize the fuzzy notion of a hole by relating it to the graph theoretic concept of a chordless cycle enclosing a face in an arrangement of lines. Furthermore, the algorithm for detecting such topological holes is distributed, O(k) per node computation (for k 2‐hop neighbors) and requires synchronization between nodes that are no more than 2‐hops away. The algorithm takes a local best‐effort approach and does not verify if the nodes indeed form a closed polygonal loop. We believe that this local effort is sufficient based on theoretical observations and experiments. In the simulation tests we conducted, this was hardly a restriction in correctly identifying the simple, closed polygonal loops. We discuss the security implications of the hole detection framework in the context of sensor networks. Copyright © 2011 John Wiley & Sons, Ltd.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call