A linear algorithm for embedding planar graphs using PQ-trees
Journal of Computer and System Sciences
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
Coverage and hole-detection in sensor networks via homology
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
Discrete Applied Mathematics
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
International Journal of Robotics Research
On Boundary Recognition without Location Information in Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
Mobile element assisted cooperative localization for wireless sensor networks with obstacles
IEEE Transactions on Wireless Communications
Efficient algorithms for distributed detection of holes and boundaries in wireless networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
UNFOLD: uniform fast on-line boundary detection for dynamic 3D wireless sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.00 |
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grained, fail to accurately locate boundaries, especially when small holes exist. To address this issue, we propose a fine-grained boundary recognition approach using connectivity information only. This algorithm accurately discovers inner and outer boundary cycles without using location information. To the best of our knowledge, this is the first design being able to determinately locate all hole boundaries no matter how small the holes are. Also, this distributed algorithm does not rely on high node density. We formally prove the correctness of our design, and evaluate its effectiveness through extensive simulations.