The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
MAP: medial axis based geometric routing in sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Geometry-based reasoning for a large sensor network
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
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II"
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On Boundary Recognition without Location Information in Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Time-Bounded and Space-Bounded Sensing in Wireless Sensor Networks
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Segmenting a sensor field: Algorithms and applications in network design
ACM Transactions on Sensor Networks (TOSN)
Localised convex hulls to identify boundary nodes in sensor networks
International Journal of Sensor Networks
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Distributed coordinate-free algorithm for full sensing coverage
International Journal of Sensor Networks
Connectivity-based localization of large-scale sensor networks with complex shape
ACM Transactions on Sensor Networks (TOSN)
On boundary recognition without location information in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Information brokerage via location-free double rulings
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Topology and routing in sensor networks
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Obstacle discovery in distributed actuator and sensor networks
ACM Transactions on Sensor Networks (TOSN)
Computer Networks: The International Journal of Computer and Telecommunications Networking
A mapping of wireless network boundaries using localised alpha-shapes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Contaminated areas monitoring via distributed rateless coding with constrained data gathering
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Map estimation using GPS-equipped mobile wireless nodes
Pervasive and Mobile Computing
Topology mining of sensor networks for smart home environments
International Journal of Ad Hoc and Ubiquitous Computing
Efficient algorithms for distributed detection of holes and boundaries in wireless networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Journal of Network and Computer Applications
Perimeter detection in wireless sensor networks
Robotics and Autonomous Systems
Quorum based sink location service for irregular wireless sensor networks
Computer Communications
Hi-index | 0.00 |
Wireless sensor networks typically consist of small, very simple network nodes without any positioning device like GPS. After an initialization phase, the nodes know with whom they can talk directly, but have no idea about their relative geographic locations. We examine how much geometry information is nevertheless hidden in the communication graph of the network: Assuming that the connectivity is determined by the well-known unit-disk graph model, we prove that using an extremely simple linear-time algorithm one can identify nodes on the boundaries of holes of the network. That is, there is enough geometry information hidden in the connectivity structure to identify topological features—in our example the holes in the network. While the theoretical analysis turns out to be quite conservative,an actual implementation shows that the algorithm works well under less stringent conditions.