Optimizing Navigation Satellite Enhancement Information Distribution Network Based on X10 and MPI

Abstract:

To meet large-scale and time-sensitive needs of navigation Satellite enhance information distribution network in Global Position System(GPS)/Beidou and other systems [1], use small-world network model of complex network to study the topology. Small-world model has a large clustering coefficient and smaller average shortest path length so it can meet performance requirements better. Use Python language to product WS model, and simulate the important parameter-the average shortest path length. Use Dijkstra parallel algorithm and sparse matrix storage method to simulate under the use of X10 parallel language. Analyze the relationship between average shortest path length and random reconnection probability. Additionally, simulate in parallel MPI library and compare the two.

• Periodical: Applied Mechanics and Materials (Volumes 58-60)
• Pages: 2177-2182
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.58-60.2177
• Online since: June 2011
• Authors: Jun Xia Liu, Shao Hua Liu, Jun Sheng Yu, Peng Xie, Ze Jian Lu, Xiao Dong Chen
• Keywords: Distribution Network WS Model, Parallel Computing, Shortest Path, X10 Language

References

[1] GPS Positioning Guide: A user guide to the Global Positioning System. Natural Resources, Canada.

[2] China Satellite Navigation Project Center. Overview of Compass/BeiDou Navigation Satellite System (CNSS) Feb. (2008).

[3] S. H. Strogatz. Exploring Complex Networks, Nature Vol. 410 (2001) 268-276.

[4] S. Boccaletti et al. Complex Networks: Structure and Dynamics, Phys. Rep., 424 (2006), 175-308.

[5] V. Buldyrev, R. Parshani, G. Paul, H. E. Stanley, S. Havlin, Catastrophic cascade of failures in interdependent networks. Nature 465, 08932 (2010).

DOI: 10.1038/nature08932

[6] D. J. Watts and S. H. Strogatz. Collective dynamics of small-world, networks, Nature Vol. 393 (1998) 440-442S.

DOI: 10.1038/30918

[7] Mhabbal , Hkoutsopoulos , Slerman. A composition algorithm for the all pairs shortest path problem on massively parallel computer architectures. Transportation Science, 1994, 28 (3): 26 – 33.

DOI: 10.1287/trsc.28.4.292

[8] Castro, M., Druschel, P., et al, Scalable Application-level Anycast for Highly Dynamic Groups, Proc. of NGC'03, September (2003).

[9] Philippe Charles, Christopher Donawa, Kemal Ebcioglu etc. X10: An Object-Oriented Approach to Non-Uniform Cluster Computing. OOPSLA'05, October 16–20, (2005).

DOI: 10.1145/1094811.1094852

[10] Peter S. Pacheo, Parallel Programming with MPI, Morgan Kaufmann Publisher, (1997).