Network planning, analysis and design are an iterative process aimed at ensuring that a new network service meets the needs of subscribers and operators. During the initial start-up phase, coverage is the big issue and coverage in telecommunications systems is related to the service area where a bare minimum access in the wireless network is possible. In order to guarantee visibility of at least one satellite above a certain satellite elevation, more satellites are required in the constellation to provide Global network services. Hence, the aim of this paper is to develop wide area network coverage for sparsely distributed earth stations in the world. A hybrid geometrical topology model using spherical coordinate framework was devised to provide wide area network coverage for sparsely distributed earth stations in the world. This topology model ensures Global satellite continuous network coverage for terrestrial networks. A computation of path lengths between any two satellites put in place to provide network services to selected cities in the world was carried out. A consideration of a suitable routing decision mechanism, routing protocols and algorithms were considered in the work while the shortest paths as well as the alternate paths between located nodes were computed. It was observed that a particular satellite with the central angle of 27° can provide services into the diameter of the instantaneous coverage distance of 4081.3 Km which is typical of wide area network coverage. This implies that link-state database routing scheme can be applied, continuous global geographical coverage with minimum span, minimum traffic pattern and latency are guaranteed. Traffic handover rerouting strategies need further research. Also, traffic engineering resources such as channel capacity and bandwidth utilization schemes need to be investigated. Satellite ATM network architecture will benefit and needs further study.
[1] Penttinen, A. (1999) Chapter 10-Network Planning and Dimensioing, Lecture Note: S-38, 145-Introduction to Tele-Traffic Theory. University of Technology, Helsink. Sourced at Network Planning and Technology and Design-Wil-kepedia, The Free encyclopedia, 11/12012.
[2] Garg, V.K. and Wilkes, J.E. (1999) Principles and Applications of GSM. Pearson Education, Inc., India, 294.
[3] Pahlavan, K. andKrishnamurthy, P. (2003) Principles of Wireless Network—A Unified Approach. Pearson Education Inc. (Singapore), India, 108, 549.
[4] Eke Vincent, O.C. and Nzeako, A.N. (2013) An Analysis and Computation of Optimum Earth Geographical Coverage for Global Communications. Journal of Communications and Network, 5, 337-343.
[5] Lo, M.W. (1999) Satellite Constellation Design. Computer Science Engineering, 1, 58-67.
[6] Wood, L. (2003) Satellite Constellation Networks, Chapter 2 of Internetworking and Computing over Satellite Networks’ by Zhang. 13-34.
[7] Irridium (2014). http://www.irridium.com
[8] Wood, L., Clerget, A., Andri Kopoulos, I., Palvlou, G. and Dabbous, W. (2000) Internet Protocol (IP) Routing Issues in Satellite Constellation Networks. International Journal of Satellite Communications, 18.
[9] Houyou, A.M., Holzer, R., De Meer, H. and Heindl, M. (2005) Performance of Transport Layer Protocols in LEO Pico-Satellite Constellations. Technical Report MIP-0502.
[10] Sturza, M.A. The Teledesic Satellite System: Overview and Design Trades.
[11] Wood, L. (2014) Teledesic News and Information-Maintained.
http://www.ee.survey.ac.uk/personal/L.Wood/constellation/teledesic.ht
[12] Pavlidou, F.N., Annoni, M., Aracil, J., Cruickshank, H., Franck, L., Ors, T. and Papapetrou, E. (1999) Traffic Characterization, Routing, and Security Issues in High Speed Networks Interconnected through Low Earth Orbit (LEO) Constellations. Joint Workshop COST255/252/253, Touloues.
[13] Pratt, T., Bostian, C. and Allnut, J. (2003) Satellite Communicaions. 2nd Edition, John Willey and Sons Inc., New York.
[14] Paxson, V. (1999) End-to-End Internet Packet Dynamics. IEEE/ACM Transactions on Networking, 7, 277-292.http://dx.doi.org/10.1109/90.779192
[15] Dobosiewicz, W. and Gburzynki, P. (1996) A Bounded-Hop-Count Deflection Scheme for Manhattan Street Network. Proceedings of Institute of Electrical and Electronics Engineering (IEEE), Computer Communications, Vol. 1, 172-179.
[16] Ekici, E., Akyildiz, I.F. and Benden, M.D. (2000) Datagram Routing Algorithm for LEO Satellite Networks. Institute of Electrical and Electronics Engineering (IEEE) Information and Communication (INFOCOM).
[17] Kucukates, R. and Ersoy, C. (2003) High Performance Routing in a LEO Satellite Network. Proceeding of the IEEE ISCC, Antalya, 1403-1408.
[18] Carr, H.H. and Snynder, C.A. (2003) The Management of Telecommunications. 2nd Edition, McGraw Hill, Irwin, 229.
[19] Gupta, P.C. (2009) Data Communications and Computer Networks. PHI Learning Private Limited, New Delhi, 30, 611.
[20] Hwang, K. Advanced Computer Architecture: Parallelism, Scalability, Programmability. 383.