Geometric algorithms for sensor networks

被引：24
作者：
Gao, Jie [1 ]
Guibas, Leonidas [2 ]
机构：
[1] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA
[2] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
来源：
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES | 2012年 / 370卷 / 1958期
关键词：
geometric algorithms; wireless sensor networks; localization; routing; topology discovery; GUARANTEED DELIVERY; RECOGNITION; INFORMATION; CONJECTURE; EMBEDDINGS; SPANNERS;
D O I：
10.1098/rsta.2011.0215
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
This paper surveys the use of geometric methods for wireless sensor networks. The close relationship of sensor nodes with their embedded physical space imposes a unique geometric character on such systems. The physical locations of the sensor nodes greatly impact on system design in all aspects, from low-level networking and organization to high-level information processing and applications. This paper reviews work in the past 10 years on topics such as network localization, geometric routing, information discovery, data-centric routing and topology discovery.
引用
收藏
页码：27 / 51
页数：25
相关论文
共 132 条
[101]  
Niculescu D., 2003, 22 ANN JOINT C IEEE, V3, P1734, DOI DOI 10.1109/INFCOM.2003.1209196
[102]   Geodesic Delaunay Triangulations in Bounded Planar Domains [J].
Oudot, Steve Y. ;
Guibas, Leonidas J. ;
Gao, Jie ;
Wang, Yue .
ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (04)
[103]   On a conjecture related to geometric routing [J].
Papadimitriou, CH ;
Ratajczak, D .
THEORETICAL COMPUTER SCIENCE, 2005, 344 (01) :3-14
[104]  
Popa L, 2007, MOBIHOC'07: PROCEEDINGS OF THE EIGHTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P170
[105]  
Priyantha N. B., 2000, MobiCom 2000. Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking, P32, DOI 10.1145/345910.345917
[106]   PROBABILISTIC CONSTRUCTION OF DETERMINISTIC ALGORITHMS - APPROXIMATING PACKING INTEGER PROGRAMS [J].
RAGHAVAN, P .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 37 (02) :130-143
[107]  
Raghavan P., 1985, STOC 85, P79
[108]  
Rao A., 2003, Proceedings of the 9th ACM International Conference on Mobile Computing and Networking (MobiCom), P96, DOI [10.1145/938985.938996, DOI 10.1145/938985.938996]
[109]   A scalable Content-Addressable Network [J].
Ratnasamy, S ;
Francis, P ;
Handley, M ;
Karp, R ;
Shenker, S .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2001, 31 (04) :161-172
[110]  
Rowstron A., 2001, Proceedings of the Middleware 2001, P329, DOI DOI 10.1007/3-540-45518-3_18
567891011121314