Neighborhood-based topology recognition in sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3121, Issue , 2004, Pages 123-136

  Fekete, S P ^a   Kroller A ^a   Pfisterer, D ^a   Fischer, S ^a   Buschmann, C ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Boundary recognition; Geometric properties of sensor networks; Location awareness; Neighborhood based computation; Random distribution; Sensor networks; Smart dust; Topology recognition; Voronoi regions

Indexed keywords

GEOMETRY; NETWORK ARCHITECTURE; SENSOR NETWORKS; SENSOR NODES; TOPOLOGY;

BOUNDARY RECOGNITION; GEOMETRIC PROPERTIES; LOCATION AWARENESS; RANDOM DISTRIBUTION; SMART DUST; TOPOLOGY RECOGNITION; VORONOI REGIONS;

WIRELESS SENSOR NETWORKS;

EID: 33244496340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27820-7_12     Document Type: Article

References (14)

1. [AGY04] J. Aspnes, D. Goldenberg, and Y.R. Yang. On the computational complexity of sensor network localization. In Proc. ALGOSENSORS, 2004.
2. d. Adv. Applied Probability, 29:567-581, 1997.
3. [Bea03] J. Beal. Near-optimal distributed failure circumscription. Technical Report AIM-2003-17, MIT Artificial Intelligence Laboratory, 2003.
4. [BK98] H. Breu and D.G. Kirkpatrick. Unit disk graph recognition is NP-hard. Comp. Geom.: Theory Appi, 9(1-2):3-24, 1998.
5. [BKKM96] J. Brunekreef, J.-P. Katoen, R. Koymans, and S. Mauw. Design and analysis of dynamic leader election protocols in broadcast networks. Distributed Computing, 9(4):157-171, 1996.
6. [CCHH01] S. Čapkun, M. Hamdi, and J. Hubaux. GPS-free positioning in mobile ad-hoc networks. In Proc. IEEE HICSS-34 - vol.9, page 9008, 2001.
7. [DPG01] L. Doherty, K.S.J. Pister, and L. El Ghaoui. Convex position estimation in wireless sensor networks. In Proc. IEEE Infocom '01, pages 1655-1663, 2001.
8. [FGG04] Q. Fang, J. Gao, and L. J. Guibas. Locating and bypassing routing holes in sensor networks. In Proceedings IEEE Infocom '04, 2004.
9. [GHS83] R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems, 5(1):66-77, 1983.
10. [HT03] C.-F. Huang and Y.-C. Tsent. The coverage problem in a wireless sensor network. In Proc. ACM Int. WSNA, pages 115-121, 2003.
11. [PBDT03] N.B. Priyantha, H. Balakrishnan, E. Demaine, and S. Teller. Anchor-free distributed localization in sensor networks. Technical Report MIT-LCSTR-892, MIT Laboratory for Computer Science, APR 2003.
12. [SB03] C. Stachniss and W. Burgard. Mapping and exploration with mobile robots using coverage maps. In Proc. IEEE/RSJ Int. Conf. IROS, 2003.
13. [SR02] N. Sundaram and P. Ramanathan. Connectivity-based location estimation scheme for wireless ad hoc networks. In Proc. IEEE Globecom '02, volume 1, pages 143-147, 2002.
14. [SRL02] C. Savarese, J.M. Rabaey, and K. Langendoen. Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In Proc. 2002 USENIX Ann. Tech. Conf., pages 317-327, 2002.