Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Characterizing the Impact of Routing Holes on Geographic Routing
ICW '05 Proceedings of the 2005 Systems Communications
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
Localised convex hulls to identify boundary nodes in sensor networks
International Journal of Sensor Networks
| Hi-index | 0.00 |
Intuitively, many wireless and sensing applications benefit from knowledge of network boundaries. Many virtual coordinate constructions rely on the furthest set of nodes as beacons. Network edges may also bound routing holes in the network, regions of failure due to environmental effects, or indicate the need for additional deployment. In this paper we propose an algorithm to identify nodes and links that sit on the boundaries of the physical network. Edge nodes may then participate to map the network boundaries. Our algorithm is provably correct and exploits the relationship between alphahulls, a generalisation of the convex hull, and communication range. This relationship allows nodes on network boundaries to identify themselves without outside intervention. We then show via simulation that our algorithm identifies meaningful boundaries even in networks of low-density and non-uniform distribution.