The Study Of Positioning Technology In Mobile Communication Network Based On Parallel Computing

With the development of the telecommunication technology, there are more and more applications about mobile positioning. There are many applications which are very helpful to our life, such as mobile maps, some SNS applications based on the positioning technology and so on. Moreover, positioning technology is a key point of network optimization and improving network service quality. Recently, there are more and more researches and achievement about positioning technology in mobile network. In this paper, we study some traditional positioning technologies such as TO A, AOA and so on. We find that there are some obstacles of applying those technologies. Based on the above reasons, we introduce a new positioning technology, which is positioning algorithm based on bayesian probability estimation theory and we also improve it by adding the information between agents to assist localization process. We call the algorithm is cooperative location.When we put that algorithm into practice, we find that we should wait for the location result for a very long period. We must find one solution to improve the efficiencies it. With the development of computing science, parallel computing and distributed computation have been applied into many industries. In this paper, we analyze the parallelization possibility of those algorithms. We try to utilize the parallel computing technology, which distribute the locate process to multiple computing resources, to improve the efficiency of the algorithm.In this paper, we use the real measurement data to verify the accuracy of the positioning algorithm based on bayesian probability estimation theory. We will compare the execution time of the non-parallel and parallel algorithm. Meanwhile, we verify the accuracy and the efficiency of cooperative location through simulation.