Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
The bits and flops of the n-hop multilateration primitive for node localization problems
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Poster abstract: anchor-free distributed localization in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
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
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
Geometry-based reasoning for a large sensor network
Proceedings of the twenty-second annual symposium on Computational geometry
Radio propagation-aware distance estimation based on neighborhood comparison
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Probabilistic Protocols for Fair Communication in Wireless Sensor Networks
Algorithmic Aspects of Wireless Sensor Networks
| Hi-index | 0.00 |
At ALGOSENSORS 2004 we presented a first algorithm to detect the boundary in a dense sensor network. This has started a new field of research: how to establish topology awareness in sensor networks without using localization. Three years later, at ALGOSENSORS 2007, we present a number of further results. After discussing issues of distance estimation and computation of coordinates, we give an overview over the boundary recognition problem and show a new approach to solving it. Then we show how to use the boundaries for higher-order topology knowledge; the outcome is a graph that describes the network topology on a very high level, while being small enough to be distributed to all nodes. This allows every node in the network to obtain knowledge about the global topology. Finally, we show how to use these structures for efficient routing.