참고문헌
- Y. Hu and V.O.K. Li. Satellite-based internet: a tutorial. Communications Magazine, IEEE, vol. 39, no. 3, pp.154-162, 2001. https://doi.org/10.1109/35.910603
- Ferreira A, Caltier J, Penna P. Topological design, routing and hand-over in satellite networks. In Stojmenovic I. ed. Handbook of Wireless Networks and Mobile Computing, John Wiley and Sons. 2002.
- I. F. Akyildiz, H. Uzunalioglu, and M. D. Bender, "Handover management in low earth orbit (LEO) satellite networks" Mobile Networks and Applications, vol. 4, no. 4, pp.301-310, Dec 1999. https://doi.org/10.1023/A:1019167303222
- P. K. Chowdhury, M. Atiquzzaman, and W. Ivancic, "Handover schemes in satellite networks: state-of-the-art and future research directions," IEEE Communications Surveys, vol. 8, no. 4, 4th Quarter 2006. Link).
- Junfeng Wang, Lei Li, and Mingtian Zhou, "Topological dynamics characterization for LEO satellite networks", Computer Networks, vol. 51, no. 1, pp. 43-53, 2007. https://doi.org/10.1016/j.comnet.2006.04.010
- H. Uzunalio˘glu, "Probabilistic routing protocol for low Earth orbit satellite networks", in IEEE ICC, pp. 88-93, 1998.
- H. Uzunalio glu, I.F. Akyildiz, Y. Yesha, and W. Yen,"Footprint handover rerouting protocol for low Earth orbit satellite networks",ACM Journal on Wireless Networks, vol. 5, no. 5, pp.327-337, Oct 1999. https://doi.org/10.1023/A:1019127801155
- M. Werner et al., "ATM-based Routing in LEO/MEO Satellite Networks with Intersatellite Links," IEEE JSAC, vol. 15, no. 1, Jan. 1997, pp. 69-82.
- E. Ekici, I.F. Akyildiz and M.D. Bender, "A distributed routing algorithm for datagram traffic in LEO satellite networks", IEEE/ACM Transaction on Networking, vol. 9, no. 2, ,pp. 137-147, 2001. https://doi.org/10.1109/90.917071
- F.Alagoz, O. Korcak, A. Jamalipour, "Exploring the routing strategies in next generation satellite networks", IEEE Wireless Communications Magazine 14, vol. 3, pp. 79-88, 2007.
- Brunt P. IRIDIUM: Overview and Status, Space Communication, vol. 14, no. 2, pp. 61-68, 1997.
- D.B. Johnson. A note on dijkstra's shortest path algorithm. Journal of the ACM, vol. 20, no. 3, pp. 385-388, 1973. https://doi.org/10.1145/321765.321768