High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination by considering the traffic segment status when choosing the next intersection. RTISAR presents a new formula for assessing segment status based on connectivity, density, load segment, and cumulative distance toward the destination. A verity period mechanism is proposed to denote the projected period when a network failure is likely to occur in a particular segment. This mechanism can be calculated for each collector packet to minimize the frequency of RTISAR execution and to control the generation of collector packets. As a result, this mechanism minimizes the communication overhead generated during the segment status computation process. Simulations are performed to evaluate RTISAR, and the results are compared with those of intersection-based connectivity aware routing and traffic flow oriented routing. The evaluation results provided evidence that RTISAR outperforms in terms of packet delivery ratio, packet delivery delay, and communication overhead.
In this article, we will present a quasi-contraction mapping approach for D iteration, and we will prove that this iteration with modified SP iteration has the same convergence rate. At the other hand, we prove that the D iteration approach for quasi-contraction maps is faster than certain current leading iteration methods such as, Mann and Ishikawa. We are giving a numerical example, too.
With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied to some special graphs.
Brachytherapy treatment is primarily used for the certain handling kinds of cancerous tumors. Using radionuclides for the study of tumors has been studied for a very long time, but the introduction of mathematical models or radiobiological models has made treatment planning easy. Using mathematical models helps to compute the survival probabilities of irradiated tissues and cancer cells. With the expansion of using HDR-High dose rate Brachytherapy and LDR-low dose rate Brachytherapy for the treatment of cancer, it requires fractionated does treatment plan to irradiate the tumor. In this paper, authors have discussed dose calculation algorithms that are used in Brachytherapy treatment planning. Precise and less time-consuming calculations
... Show MoreGas hydrate formation poses a significant threat to the production, processing, and transportation of natural gas. Accurate predictions of gas hydrate equilibrium conditions are essential for designing the gas production systems at safe operating conditions and mitigating the problems caused by hydrates formation. A new hydrate correlation for predicting gas hydrate equilibrium conditions was obtained for different gas mixtures containing methane, nitrogen and carbon dioxide. The new correlation is proposed for a pressure range of 1.7-330 MPa, a temperature range of 273-320 K, and for gas mixtures with specific gravity range of 0.553 to 1. The nonlinear regression technique was applie
In this paper, we introduce and discuss an algorithm for the numerical solution of two- dimensional fractional dispersion equation. The algorithm for the numerical solution of this equation is based on explicit finite difference approximation. Consistency, conditional stability, and convergence of this numerical method are described. Finally, numerical example is presented to show the dispersion behavior according to the order of the fractional derivative and we demonstrate that our explicit finite difference approximation is a computationally efficient method for solving two-dimensional fractional dispersion equation
In This paper generalized spline method and Caputo differential operator is applied to solve linear fractional integro-differential equations of the second kind. Comparison of the applied method with exact solutions reveals that the method is tremendously effective.