Routing Protocol Based on Grover’s Searching Algorithm for Mobile Ad-hoc Networks

In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.

Fast Parallel Algorithm for Slicing STL Based on Pipeline

In Additive Manufacturing field, the current researches of data processing mainly focus on a slicing process of large STL files or complicated CAD models. To improve the efficiency and reduce the slicing time, a parallel algorithm has great advantages. However, traditional algorithms can＇t make full use of multi-core CPU hardware resources. In the paper, a fast parallel algorithm is presented to speed up data processing. A pipeline mode is adopted to design the parallel algorithm. And the complexity of the pipeline algorithm is analyzed theoretically. To evaluate the performance of the new algorithm, effects of threads number and layers number are investigated by a serial of experiments. The experimental results show that the threads number and layers number are two remarkable factors to the speedup ratio. The tendency of speedup versus threads number reveals a positive relationship which greatly agrees with the Amdahl＇s law, and the tendency of speedup versus layers number also keeps a positive relationship agreeing with Gustafson＇s law. The new algorithm uses topological information to compute contours with a parallel method of speedup. Another parallel algorithm based on data parallel is used in experiments to show that pipeline parallel mode is more efficient. A case study at last shows a suspending performance of the new parallel algorithm. Compared with the serial slicing algorithm, the new pipeline parallel algorithm can make full use of the multi-core CPU hardware, accelerate the slicing process, and compared with the data parallel slicing algorithm, the new slicing algorithm in this paper adopts a pipeline parallel model, and a much higher speedup ratio and efficiency is achieved.

Monotone Additive Schwarz Algorithms for Solving Two-Side Obstacle Problems

Additive Schwarz algorithms for solving the discrete problems of twrvside obstacle problems are proposed. The monotone convergence of the algorithms is established for M-matrix and the h-independent convergence rate is proved for S-matrix. The so-called finite step convergence for coincident components is discussed for nondegenerate discreted problems.

Multilevel Constrained Pressure-Temperature Residual Preconditioners for Large-Scale Non-Isothermal Reservoir Simulation via Restricted Additive Schwarz Algorithms

The industry-standard constrained pressure residual(CPR)algorithm is often able to effectively improve the robustness behavior and the convergence speed of linear iterations for isothermal reservoir simulation.In this paper,we present and study an improved extension of CPR to the constrained pressure-temperature residual(CPTR)version for non-isothermal reservoir problems in heterogeneous porous media.In the proposed preconditioner,the corresponding approximations for the inverse of matrices are computed under a domain decomposition framework by using the restricted additive Schwarz(RAS)algorithm,to equally deal with the coupled thermalpressure-saturation reservoir system and highly exploit the parallelism of supercomputer platforms.Moreover,we introduce and develop a family of multilevel CPTR preconditioners with suitable coarse grid corrections,to further improve the applicability of this two-stage preconditioner for large-scale computation.Numerical results for strong heterogeneous flow problems show that the new approach can dramatically improve the convergence of linear iterations,and demonstrate the superiority of CPTR over the commonly used RAS preconditioners.The parallel scalability of the non-isothermal reservoir simulator is also studied versus a supercomputer with tens of thousands of processors.

CONVERGENCE RATE OF A GENERALIZED ADDITIVE SCHWARZ ALGORITHM

The convergence rate of a generalized additive Schwarz algorithm for solving boundary value problems of elliptic partial differential equations is studied. A quantitative analysis of the convergence rate is given for the model Dirichlet problem. It will be shown that a greater acceleration of the algorithm can be obtained by choosing the parameter suitably. Some numerical tests are also presented in this paper.

Numerical study of soil-rock mixture:Generation of random aggregate structure

The soil-rock mixture(SRM) is highly heterogeneous. Before carrying out numerical analysis,a structure model should be generated. A reliable way to obtain such structure is by generating random aggregate structure based on random sequential addition(RSA). The classical RSA is neither efficient nor robust since valid positions to place new inclusions are formulated by trial, which involves repetitive overlapping tests. In this paper, the algorithm of Entrance block between block A and B(EAB)is synergized with background mesh to redesign RSA so that permissible positions to place new inclusions can be predicted,resulting in dramatic improvement in efficiency and robustness.