RPR: high-reliable low-cost geographical routing protocol in wireless sensor networks
暂无分享,去创建一个
[1] Fabian Kuhn,et al. Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.
[2] Young-Jin Kim,et al. Geographic routing made practical , 2005, NSDI.
[3] Brad Karp,et al. GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.
[4] Yan Zhang,et al. Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.
[5] Jorge Urrutia,et al. Compass routing on geometric networks , 1999, CCCG.
[6] Ivan Stojmenovic,et al. Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.
[7] Hong Shen,et al. Developing Energy-Efficient Topologies and Routing for Wireless Sensor Networks , 2005, NPC.
[8] Ivan Stojmenovic,et al. On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks , 2006, MobiCom '06.
[9] Hong Cheng,et al. Clustering Large Attributed Graphs: An Efficient Incremental Approach , 2010, 2010 IEEE International Conference on Data Mining.
[10] Jignesh M. Patel,et al. Efficient aggregation for graph summarization , 2008, SIGMOD Conference.
[11] Li Jian-Zhong,et al. Concepts, Issues and Advance of Sensor Networks and Data Management of Sensor Networks , 2003 .
[12] Young-Jin Kim,et al. Lazy cross-link removal for geographic routing , 2006, SenSys '06.
[13] Ben Leong,et al. Path vector face routing: geographic routing with local face information , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).
[14] Godfried T. Toussaint,et al. The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..
[15] Xiang-Yang Li,et al. Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[16] George Karypis,et al. GREW - a scalable frequent subgraph discovery algorithm , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).