Koordinatenfreies Lokationsbewusstsein (Localization without Coordinates)

  title={Koordinatenfreies Lokationsbewusstsein (Localization without Coordinates)},
  author={S{\'a}ndor P. Fekete and Alexander Kr{\"o}ller and Carsten Buschmann and Stefan Fischer and Dennis Pfisterer},
  journal={it - Information Technology},
  pages={70 - 78}
Zusammenfassung Eines der fundamentalen Probleme in Sensornetzwerken besteht darin, ein Bewusstsein für die Position eines Knotens im Netz zu entwickeln. Dabei wird fast immer davon ausgegangen, dass dies durch die Zuweisung von Koordinaten zu erfolgen hat. In diesem Artikel wird auf theoretischer, praktischer und simulativer Ebene ein kritischer Blick auf entsprechende Verfahren geworfen, und es werden Grenzen aufgezeigt. Es wird ein Ansatz vorgestellt, mit dem in der Zukunft eine abstrakte… 
Erkennung und Nutzung von Struktur in drahtlosen Sensornetzen
Kommentaren sehr geholfen, die Worte dieser Schrift in einen sinnvollen Zusammenhang zu bringen.
Topology and Routing in Sensor Networks
An overview over the boundary recognition problem is given and how to use the boundaries for higher-order topology knowledge is shown; 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.
Deterministic boundary recognition and topology extraction for large sensor networks
The objective is to develop algorithms and protocols that allow self-organization of the swarm into large-scale structures that reflect the structure of the street network, setting the stage for global routing, tracking and guiding algorithms.
Self-organised swarm display
An image construction algorithm designed to be robust under mobility of the devices is proposed, which allows for the creation and maintenance of a display even when the devices are thrown into water of moved by the wind.
Algorithms and Simulation Methods for Topology-Aware Sensor Networks
A number of fundamental algorithmic issues are described: boundary recognition without node coordinates, clustering, routing, and energy-constrained flows, and the most important challenges and how they can be tackled with the network simulator Shawn.
Integrating sensor networks in pervasive computing environments using symbolic coordinates
  • M. Gauger, P. Marrón, K. Rothermel
  • Computer Science
    2008 3rd International Conference on Communication Systems Software and Middleware and Workshops (COMSWARE '08)
  • 2008
An extensive evaluation of the approach and its properties is given, showing that the use of symbolic coordinates in these environments is a viable alternative to more traditional types of routing.
Location-Free Object Tracking on Graph Structures
This work presents an algorithm that decomposes the network into sections, tracks objects within using binary sensors and, if required, hands them over to the next section, and shows that it is robust against sensor failures and packet loss.
Improved Weighted Centroid Localization in Smart Ubiquitous Environments
An improved scheme of the Weighted Centroid Localization algorithm is proposed that is robust and provides higher location accuracy than the original WCL algorithm and provides a simple, cost-efficient, and battery-conserving, but yet adequate technique for getting the accurate location information of mobile devices.
Building Evacuation with Mobile Devices
This work presents a concept for a building evacuation system based on mobile devices, and various algorithms for route planning with mobile devices and for indoor localization of mobile devices are addressed.


The bits and flops of the n-hop multilateration primitive for node localization problems
The collaborative multilateration presented here, enables ad-hoc deployed sensor nodes to accurately estimate their locations by using known beacon locations that are several hops away and distance measurements to neighboring nodes to prevent error accumulation in the network.
Anchor-Free Distributed Localization in Sensor Networks
A fully decentralized algorithm called AFL (Anchor-Free Localization) where nodes start from a random initial coordinate assignment and converge to a consistent solution using only local node interactions, which is superior to previously proposed methods that incrementally compute the coordinates of nodes in the network.
Distributed localization in wireless sensor networks: a quantitative compariso
On the Computational Complexity of Sensor Network Localization
It is shown that no polynomial-time algorithm can solve the localization problem for sensor networks in the worst case, even for sets of distance pairs for which a unique solution exists, unless RP = NP.
Rigidity, computation, and randomization in network localization
We provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their
Unit disk graph approximation
A non-approximability result is proved for the problem of embedding a given unit disk graph that if non-neighboring nodes are not allowed to be closer to each other than distance 1, then two neighbors can be as far apart as √3/2 - ε, where ε goes to 0 as n goes to infinity, unless P=NP.
The Design of Calamari : an Ad-hoc Localization System for Sensor Networks
Preliminary experiments show that this ranging error with Calamari is sufficient to give rise to position estimates that are on average 20% of the maximum distance between connected nodes in the network.
Neighborhood-Based Topology Recognition in Sensor Networks
This work considers a crucial aspect of self-organization of a sensor network consisting of a large set of simple sensor nodes with no location hardware and only very limited communication range, and describes algorithmic approaches for determining the structure of boundary nodes of the region, and the topology of the Region.
A Scalable Routing Scheme for Self-Organized Terminode Network
A new mobility model is designed, the restricted random waypoint model, which represents more realistic mo-bility pattern in a large scale mobile ad hoc environment and is implemented and evaluated using GloMoSim simulator.
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
A distributed algorithm for determining the positions of nodes in an ad-hoc, wireless sensor network is explained in detail and shows that, given an average connectivity of at least 12 nodes and 10% anchors, the algorithm performs well with up to 40% errors in distance measurements.