無線傳感器網絡包括多個節點，每個節點配備有無線收發器來彼此的對等傳輸溝通。
最近被提出了一個旋轉掃描（RS）算法，是一個里程碑。
在本文中，我們提出了一種變異的RS，稱為RT，在UDG通信模型中其具有相同的性能，RT更容易被擴展以及改善。
我們還顯示，在UDG通信模型中RT具有相同的性能RS。
此外在模擬實驗中，當使用UDG通信模型，RT比RS有更短的路徑長度。

[1] S. Ruehrup and I. Stojmenovic, "Optimizing communication overhead while reducing
path length in beaconless georouting with guaranteed delivery for wireless
sensor networks," IEEE Transactions on Computers, vol. 62, pp. 2440-2453,
2013.
[2] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guarantee
delivery in ad hoc networks," ACM Wireless Networks, vol. 7, pp. 609-616,
2001.
[3] B. Karp and H. T. Kung, "GPSR: Greedy perimeter stateless routing for wireless
networks," in ACM MobiCom, 2000.
[4] F. Kuhn, R. Wattenhofer, and A. Zollinger, "Worst-case optimal and averagecase
ecient geometric ad-hoc routing," in ACM MobiHoc, 2003.
[5] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric ad-hoc routing:
Of theory and practice," in ACM PODC, 2003.
[6] E. Kranakis, H. Singh, and J. Urrutia, "Compass routing on geometric networks,"
in CCCG, 1999.
[7] B. Leong, S. Mitra, and B. Liskov, "Path vector face routing: Geographic routing
with local face information," in IEEE ICNP, 2005.
23
[8] Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, "Geographic routing made
practical," in NSDI, 2005.
[9] H. Frey and I. Stojmenovic, "On delivery guarantees of face and combined
greedy-face routing in ad hoc and sensor networks," in ACM MobiCom, 2006.
[10] "On delivery guarantees and worst-case forwarding bounds of elementary
face routing components in ad hoc and sensor networks," IEEE Transactions on
Computers, vol. 59, pp. 1224-1238, 2010.
[11] K. R. Gabriel and R. R. Sokal, "A new statistical approach to grographic variation
analysis," Systematic Zoology, vol. 18, pp. 259-287, 1969.
[12] K. J. Supowit, "The relative neighborhood graph, with an application to minimum
spanning trees," Journal of the ACM, vol. 30, pp. 428-448, 1983.
[13] X.-Y. Li, I. Stojmenovic, and Y. Wang, "Partial delaunay triangulation and
degree limited localized bluetooth scatternet formation," IEEE Transactions on
Parallel and Distributed Systems, vol. 15, pp. 350 - 361, 2004.
[14] X. Li, N. Mitton, I. Simplot-Ryl, and D. Simplot-Ryl, "A novel family of geometric
planar graphs for wireless ad hoc networks," in IEEE INFOCOM, 2011.
[15] X.-Y. Li, "Approximate MST for UDG locally," in COCOON, 2003.
[16] A. Yao., "On constructing minimum spanning trees in k-dimensional spaces and
related problems," SIAM Journal on Computing, vol. 11, pp. 721-736, 1982.
[17] Q. Fang, J. Gao, and L. J. Guibas, "Landmark-based information storage and
retrieval in sensor networks," in IEEE INFOCOM, 2006, pp. 1-12.

[18] H. Kalosha, A. Nayak, S. Ruhrup, and I. Stojmenovic, "Select-and-protest-based
beaconless georouting with guaranteed delivery in wireless sensor networks," in
IEEE INFOCOM, 2008.