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 条
[1]   Graphical properties of easily localizable sensor networks [J].
Anderson, Brian D. O. ;
Belhumeur, Peter N. ;
Eren, Tolga ;
Goldenberg, David K. ;
Morse, A. Stephen ;
Whiteley, Walter ;
Yang, Y. Richard .
WIRELESS NETWORKS, 2009, 15 (02) :177-191
[2]  
Angelini P, 2009, LECT NOTES COMPUT SC, V5417, P26, DOI 10.1007/978-3-642-00219-9_4
[3]  
[Anonymous], 2001, UCBCSD011141
[4]  
[Anonymous], 2001, MOBICOM 2001 P 7 ANN
[5]  
[Anonymous], TR9909 SITE U OTT
[6]  
[Anonymous], UCLACSDTR020013
[7]  
[Anonymous], 2001, 13 ANN ACM S PAR ALG, DOI DOI 10.1145/378580.378581
[8]  
[Anonymous], P 8 INT S INF PROC S
[9]  
[Anonymous], 27 C COMP COMM INFOC
[10]  
[Anonymous], 1999, P 11 CAN C COMP GEOM