Author:
Yu Zhaochun,Xiao Bin,Zhou Shuigeng
Subject
Computer Networks and Communications
Reference20 articles.
1. S. Arora, P. Raghavan, S. Rao, Polynomial time approximation schemes for euclidean k-medians and related problems, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC’98), Dallas, TX, USA, May 1998, pp. 106–113.
2. Q. Fang, J. Gao, L.J. Guibas, Landmark-based information storage and retrieval in sensor networks, in: Proceedings of the 25th Conference of the IEEE Communication Society (INFOCOM’06), Barcelona, Catalunya, Spain, April 2006, pp. 1–12.
3. Dimensions: why do we need a new data handling architecture for sensor networks?;Ganesan;Computer Communication Review,2003
4. T.M. Gil, S. Madden, Scoop: an adaptive indexing scheme for stored data in sensor networks, in: Proceedings of the 23rd International Conference on Data Engineering (ICDE’07), 2007, pp. 1345–1349.
5. B. Greenstein, D. Estrin, R. Govindan, S. Ratnasamy, S. Shenker. Difs: a distributed index for features in sensor networks, in: Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications (SNPA’03), Anchorage, Alaska, USA, May 2003, pp. 163–173.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献