QoS-Aware Reference Station Placement for Regional Network RTK

Maolin Tang

Queensland University of Technology, Australia.

DOI: 10.4236/jsea.2009.21007                

Abstract

Network RTK (Real-Time Kinematic) is a technology that is based on GPS (Global Positioning System) or more gener-ally on GNSS (Global Navigation Satellite System) measurements to achieve centimeter-level accuracy positioning in real-time. Reference station placement is an important problem in the design and deployment of network RTK systems as it directly affects the quality of the positioning service and the cost of the network RTK systems. This paper identifies a new reference station placement for network RTK, namely QoS-aware regional network RTK reference station placement problem, and proposes an algorithm for the new reference station placement problem. The algorithm can always produce a reference station placement solution that completely covers the region of network RTK.

Keywords

Reference Station, Placement, Regional Network RTK, QoS

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	L. Wanninger, “Introduction to Network RTK,” http://www. networkrtk. info/intro/introduction.html.
[2]	C. Rizos, “Network RTK research and implementation-A geodetic perspective,” Journal of Global Positioning Sys-tems, Vol. 1, No. 2, pp. 144-150, 2003.
[3]	L. Wanninger, “GPS on the web: Virtual reference stations VRS,” GPS Solutions, Vol. 7, pp. 143-144, 2003.
[4]	G. Fotopoulos and M. E. Cannon, “An overview of multi- reference station methods for Cm-Level positioning,” GPS Solutions, Vol. 4, No. 3, pp. 1-10, 2001.
[5]	M. Tang, Y. Feng, L. Burnett, R. Hayward, and K. Ray-mond, “A reference station placement scheme in deploy-ment of network real-time kinematic positioning systems,” Proceedings International Global Navigation Satellite Sys-tems Society Symposium, Sydney, pp. 123-132, December 2007.
[6]	M. Tang and Y. Feng, “Area-oriented reference station placement for network RTK,” Proceedings International Conference on Computer Science and Software Engineer-ing, Wuhan, December 2008.
[7]	M. Garey and D. Johnson, “Computers and intractability: A guide to the theory of NP-Completeness,” W. H. Free-man, San Francisco, 1979.