Geometric Approaches to Ad Hoc and Sensor Networks: Full Report of the 2006 NSF Workshop
暂无分享,去创建一个
[1] Young-Jin Kim,et al. Multi-dimensional range queries in sensor networks , 2003, SenSys '03.
[2] Deborah Estrin,et al. GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.
[3] Deborah Estrin,et al. DIFS: a distributed index for features in sensor networks , 2003, Ad Hoc Networks.
[4] D. Caron,et al. Networked Aquatic Microbial Observing System , 2006 .
[5] Roger Wattenhofer,et al. Local approximation schemes for ad hoc and sensor networks , 2005, DIALM-POMC '05.
[6] Deborah Estrin,et al. Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.
[7] Héctor H. González-Baños,et al. A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.
[8] Roger Wattenhofer,et al. The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[9] Robert Haining,et al. Statistics for spatial data: by Noel Cressie, 1991, John Wiley & Sons, New York, 900 p., ISBN 0-471-84336-9, US $89.95 , 1993 .
[10] Andreas Krause,et al. Near-optimal sensor placements in Gaussian processes , 2005, ICML.
[11] D. Sims,et al. Sunfleck frequency and duration affects growth rate of the understorey plant, Alocasia macrorrhiza , 1993 .
[12] Charles J. Colbourn,et al. Unit disk graphs , 1991, Discret. Math..
[13] Miodrag Potkonjak,et al. Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[14] Avi Ostfeld,et al. The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms , 2008 .
[15] Wei Hong,et al. Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .
[16] Brad Karp,et al. GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.
[17] Fabian Kuhn,et al. Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.
[18] Lali Barrière,et al. Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges , 2001, DIALM '01.
[19] Roger Wattenhofer,et al. Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.
[20] C. Guestrin,et al. Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.
[21] Robert Tappan Morris,et al. Geographic Routing Without Planarization , 2006, NSDI.
[22] Abubakr Muhammad,et al. Blind Swarms for Coverage in 2-D , 2005, Robotics: Science and Systems.
[23] Mani Srivastava,et al. Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..
[24] Theodore S. Rappaport,et al. Wireless communications - principles and practice , 1996 .
[25] Henri Koskinen,et al. ON THE COVERAGE OF A RANDOM SENSOR NETWORK IN A BOUNDED DOMAIN , 2004 .
[26] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[27] David G. Kirkpatrick,et al. Unit disk graph recognition is NP-hard , 1998, Comput. Geom..
[28] Ivan Stojmenovic,et al. Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.
[29] David E. Culler,et al. Taming the underlying challenges of reliable multihop routing in sensor networks , 2003, SenSys '03.
[30] Scott Shenker,et al. Geographic routing without location information , 2003, MobiCom '03.
[31] Deborah Estrin,et al. Dimensions: why do we need a new data handling architecture for sensor networks? , 2003, CCRV.
[32] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[33] Deborah Estrin,et al. Data-centric storage in sensornets , 2003, CCRV.
[34] Gaurav S. Sukhatme,et al. Surrounding Nodes in Coordinate-Free Networks , 2006, WAFR.
[35] Robert W. Pearcy,et al. Photosynthetic responses to dynamic light under field conditions in six tropical rainforest shrubs occuring along a light gradient , 1997, Oecologia.
[36] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[37] Vin de Silva,et al. Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology , 2006, Int. J. Robotics Res..
[38] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[39] Yu-Chee Tseng,et al. The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.
[40] James Newsome,et al. GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information , 2003, SenSys '03.
[41] Jie Gao,et al. MAP: Medial axis based geometric routing in sensor networks , 2005, MobiCom '05.
[42] Ivan Stojmenovic,et al. Design guidelines for routing protocols in ad hoc and sensor networks with a realistic physical layer , 2005, IEEE Communications Magazine.
[43] Young-Jin Kim,et al. Geographic routing made practical , 2005, NSDI.
[44] Leonidas J. Guibas,et al. GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[45] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..