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 条
[91]   Composable information gradients in wireless sensor networks [J].
Lin, Huijia ;
Lu, Maohua ;
Milosavljevic, Nikola ;
Gao, Jie ;
Guibas, Leonidas J. .
2008 INTERNATIONAL CONFERENCE ON INFORMATION PROCESSING IN SENSOR NETWORKS, PROCEEDINGS, 2008, :121-+
[92]   RUBBER BANDS, CONVEX EMBEDDINGS AND GRAPH CONNECTIVITY [J].
LINIAL, N ;
LOVASZ, L ;
WIGDERSON, A .
COMBINATORICA, 1988, 8 (01) :91-102
[93]  
Liu X., 2004, Proc. 2nd IntT Conference on Embedded Network Sensor Systems, P122
[94]  
Lotker Zvi, 2010, SIGACT News, V41, P74, DOI 10.1145/1814370.1814391
[95]   TAG:: a Tiny AGgregation service for ad-hoc sensor networks [J].
Madden, S ;
Franklin, MJ ;
Hellerstein, JM ;
Wei, H .
USENIX ASSOCIATION PROCEEDINGS OF THE FIFTH SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, 2002, :131-146
[96]  
Maymounkov Petar., 2006, GREEDY EMBEDDINGS TR
[97]  
Mei A, 2008, MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P23
[98]   Landmark selection and greedy landmark-descent routing for sensor networks [J].
Nguyen, An ;
Milosavljevic, Nikola ;
Fang, Qing ;
Gao, Jie ;
Guibas, Leonidas J. .
INFOCOM 2007, VOLS 1-5, 2007, :661-+
[99]  
Niculescu D, 2001, GLOB TELECOMM CONF, P2926, DOI 10.1109/GLOCOM.2001.965964
[100]  
Niculescu D., 2004, MOBIHOC 04, P20, DOI DOI 10.1145/989459.989463
567891011121314