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.
Empirical equations for estimating thickening time and compressive strength of bentonitic - class "G" cement slurries were derived as a function of water to cement ratio and apparent viscosity (for any ratios). How the presence of such an equations easily extract the thickening time and compressive strength values of the oil field saves time without reference to the untreated control laboratory tests such as pressurized consistometer for thickening time test and Hydraulic Cement Mortars including water bath ( 24 hours ) for compressive strength test those may have more than one day.
In this work, two different structures are proposed which is fuzzy real normed space (FRNS) and fuzzy real Pre-Hilbert space (FRPHS). The basic concept of fuzzy norm on a real linear space is first presented to construct space, which is a FRNS with some modification of the definition introduced by G. Rano and T. Bag. The structure of fuzzy real Pre-Hilbert space (FRPHS) is then presented which is based on the structure of FRNS. Then, some of the properties and related concepts for the suggested space FRN such as -neighborhood, closure of the set named , the necessary condition for separable, fuzzy linear manifold (FLM) are discussed. The definition for a fuzzy seminorm on is also introduced with the prove that a fuzzy seminorm on
... Show MoreAd-Hoc Networks are a generation of networks that are truly wireless, and can be easily constructed without any operator. There are protocols for management of these networks, in which the effectiveness and the important elements in these networks are the Quality of Service (QoS). In this work the evaluation of QoS performance of MANETs is done by comparing the results of using AODV, DSR, OLSR and TORA routing protocols using the Op-Net Modeler, then conduct an extensive set of performance experiments for these protocols with a wide variety of settings. The results show that the best protocol depends on QoS using two types of applications (+ve and –ve QoS in the FIS evaluation). QoS of the protocol varies from one prot
... Show MoreThe Ant System Algorithm (ASA) is a member of the ant colony algorithms family in swarm intelligence methods (part of the Artificial Intelligence field), which is based on the behavior of ants seeking a path and a source of food in their colonies. The aim of This algorithm is to search for an optimal solution for Combinational Optimization Problems (COP) for which is extremely difficult to find solution using the classical methods like linear and non-linear programming methods.
The Ant System Algorithm was used in the management of water resources field in Iraq, specifically for Haditha dam which is one of the most important dams in Iraq. The target is to find out an efficient management system for
... Show MoreThe rapid and enormous growth of the Internet of Things, as well as its widespread adoption, has resulted in the production of massive quantities of data that must be processed and sent to the cloud, but the delay in processing the data and the time it takes to send it to the cloud has resulted in the emergence of fog, a new generation of cloud in which the fog serves as an extension of cloud services at the edge of the network, reducing latency and traffic. The distribution of computational resources to minimize makespan and running costs is one of the disadvantages of fog computing. This paper provides a new approach for improving the task scheduling problem in a Cloud-Fog environme
The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul
... Show MoreString matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-co
... Show MoreSpraying pesticides is one of the most common procedures that is conducted to control pests. However, excessive use of these chemicals inversely affects the surrounding environments including the soil, plants, animals, and the operator itself. Therefore, researchers have been encouraged to...