Abstract | ||
---|---|---|
We propose a lightweight localisation approach for supporting distance and range queries in ad hoc wireless sensor networks. In contrast to most previous localisation approaches we use a distance graph as spatial representation where edges between nodes are labelled with distance constraints. This approach has been carefully designed to satisfy the requirements of a concrete application scenario with respect to the spatial queries that need to be supported, the required accuracy of location information, and the capabilities of the target hardware. We show that this approach satisfies the accuracy requirements of the example application using simulations. We describe the implementation of the algorithms on wireless sensor nodes. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1007/11669463_7 | EWSN |
Keywords | Field | DocType |
required accuracy,distance graph,ad-hoc wireless,distance constraint,spatial query,accuracy requirement,previous localisation,example application,constraint-based distance estimation,lightweight localisation approach,sensor network,spatial representation,concrete application scenario,wireless sensor network,satisfiability,range query | Sensor node,Wireless network,Key distribution in wireless sensor networks,Wireless,Computer science,Sensor array,Real-time computing,Mobile wireless sensor network,Wireless ad hoc network,Wireless sensor network,Distributed computing | Conference |
Volume | ISSN | ISBN |
3868 | 0302-9743 | 3-540-32158-6 |
Citations | PageRank | References |
6 | 0.67 | 14 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Urs Bischoff | 1 | 17 | 2.11 |
Martin Strohbach | 2 | 224 | 31.60 |
Mike Hazas | 3 | 785 | 61.73 |
Gerd Kortuem | 4 | 1411 | 163.93 |