Localization without coordinates;Koordinatenfreies Lokationsbewusstsein

IT - Information Technology

Volumn 47, Issue 2, 2005, Pages 70-78

  Fekete, Sándor P ^a   Kröller, Alexander ^a   Buschmann, Carsten ^b   Fischer, Stefan ^b   Pfisterer, Dennis ^b  

^a Institut FürMathematischeOptimierung   (Germany)

^b Institut für Telematik   (Germany)

Author keywords

C.2.2 Network Protocols ; Cluster; F.2 Analysis of Algorithms and Problem Complexity ; G.2.2 Graph Theory sensor networks; Graphs; Localization; Routing

Indexed keywords

ABSTRACTING; COMPUTATIONAL COMPLEXITY; NETWORK PROTOCOLS; SENSOR NETWORKS;

ALGORITHMS COMPLEXITY; ANALYSIS OF ALGORITHMS; C.2.2 [NETWORK PROTOCOL]; CLUSTER; F.2 [ANALYSE OF ALGORITHM AND PROBLEM COMPLEXITY]; G.2.2 [GRAPH THEORY] SENSOR NETWORK; LOCALISATION; PROBLEM COMPLEXITY; ROUTINGS; SENSORS NETWORK;

GRAPH THEORY;

EID: 48349091266     PISSN: 16112776     EISSN: 21967032     Source Type: Journal    
DOI: 10.1524/itit.47.2.70.62258     Document Type: Article

References (15)

1. J. Aspnes, D. Goldenberg, and Y.R. Yang. On the computational complexity of sensor network localization. In: ALGOSENSORS 2004, Lecture Notes in Computer Science, Vol. 3121, pp. 32-44. Springer Verlag, 2004.
2. L. Blazevic, J.-Y. Le Boudec, and S. Giorda No. A scalable routing scheme for self-organized terminode network. In: Communication Networks and Distributed systems modelling and Simulation conference (CNDS), San Antonio, Texas, 2002.
3. H. Breu and D.G. Kirkpatrick. Unit disk graph recognition is NP-hard. In: Computational Geometry: Theory and Applications 9(1-2):3-24. Elsevier, 1998.
4. C. Buschmann und S. Fischer. Eigenschaften der Funkschnittstelle in Sensornetzen und Auswirkungen für Anwendungen. In: 2. GI/ITG Fachgespräch "Sensornetze", 2004.
5. T. Eren, D. Goldenberg, W. Whiteley, Y.R. Yang, A.S. Morse, B.D.O. Anderson, and P.N. Belhumeur. Rigidity, computation, and randomization in network localization. In: Int'l Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM 2004), Hong Kong, pp. 2673-2684, 2004.
6. S.P. Fekete, A. Kröller, D. Pfisterer, S. Fischer, and C. Buschmann. Neighborhood-based topology recognition in sensor networks. In: ALGOSENSORS 2004, Lecture Notes in Computer Science, Vol. 3121, pp. 123-136. Springer Verlag, 2004.
7. F. Kuhn, T. Moscibroda, and R. Wattenhofer. Unit disk graph approximation. In: ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2004), Philadelphia, ACM Press, 2004.
8. K. Langendoen and N. Reijers. Distributed localization in wireless sensor networks: A quantitative comparison. In: Computer Networks 43(4):499-518, Elsevier, 2003.
9. U. Leonhardt. Supporting locationawareness in open distributed systems. Dissertation, Dep. of Computing, Imperial College, London, 1998.
10. D. Niculescu and B. Nath. Adhoc positioning system. In: IEEE Global Telecommunications Conf. (GLOBECOM 2001), Vol. 5, pp. 2926-2931, 2001.
11. C.E. Perkins. Ad Hoc Networking, Addison Wesley, 2001.
12. N.B. Priyantha, H. Balakrishnan, E. Demaine, and S. Teller. Anchor- Free Distributed Localization in Sensor Networks. MIT Technical Report MITLCS- TR-892, 2003.
13. C. Savarese, J. Rabaey, and K. Langendoen. Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In USENIX Technical Annual Conf. 2002, Monterey, CA, pp. 317-327, 2002.
14. A. Savvides, H. Park, and M.B. Srivastava. The bits and flops of the N-hop multilateration primitive for node localization problems. In First ACM Int'l Workshop on Wireless Sensor Networks and Applications (WSNA 2002), Atlanta, GA, pp. 112-121, ACM Press, 2002.
15. K. Whitehouse. The Design of Calamari: An ad-hoc localization system for sensor networks. Master thesis, University of California at Berkeley, 2002.