In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route for the transmission of the packets of data in the direction of their destination by taking into consideration the status of the traffic segment when selecting the next intersection. Through this algorithm, a new formula for assessing the status of the segment is presented based on three elements: density, connectivity, and distance. To evaluate this routing algorithm, simulations are performed, once the results are obtained, they are compared with the existing routing algorithms. The evaluation of results offered evidence that our routing algorithm did well in terms of packet delivery ratio and packet delivery delay.
This study has contributed to identify convenience of the land Usifiya of Mahmudiya district baghdad province for the cultivation of sensitive and salt resisting crops and growing pasture .The nine pedons (tracks) of the study have spread over three transects to cover the whole area the north, middle and south .
Depending on Visual Space tupe (TM) for 2007 which is super classified, samples are distributed on all classes of land cover
It is detected the presence of nine series soils namely
MM5- MW96- DM 115 for 1st transect
MF12- DM46 - DM96 for 2nd transect
DM56- DF56 - MW5 for 3rd transect
Soils are classified to the level of sub great group according to (soil Survey Staff) to :
*Typic Torri Fluvents , Typic Haplos
A submoduleA of amodule M is said to be strongly pure , if for each finite subset {ai} in A , (equivalently, for each a ?A) there exists ahomomorphism f : M ?A such that f(ai) = ai, ?i(f(a)=a).A module M is said to be strongly F–regular if each submodule of M is strongly pure .The main purpose of this paper is to develop the properties of strongly F–regular modules and study modules with the property that the intersection of any two strongly pure submodules is strongly pure .
Artificial pancreas is simulated to handle Type I diabetic patients under intensive care by automatically controlling the insulin infusion rate. A Backstepping technique is used to apply the effect of PID controller to blood glucose level since there is no direct relation between insulin infusion (the manipulated variable) and glucose level in Bergman’s system model subjected to an oral glucose tolerance test by applying a meal translated into a disturbance. Backstepping technique is usually recommended to stabilize and control the states of Bergman's class of nonlinear systems. The results showed a very satisfactory behavior of glucose deviation to a sudden rise represented by the meal that increase the blood glucose
... Show More
<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T
... Show MoreCommunity detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem. In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a
... Show MoreThe recent development in communication technologies between individuals allows for the establishment of more informal collaborative map data projects which are called volunteered geographic information (VGI). These projects, such as OpenStreetMap (OSM) project, seek to create free alternative maps which let users add or input new materials to the data of others. The information of different VGI data sources is often not compliant to any standard and each organization is producing a dataset at various level of richness. In this research the assessment of semantic data quality provided by web sources, e.g. OSM will depend on a comparison with the information from standard sources. This will include the validity of semantic accuracy a
... Show MoreThe recent development in communication technologies between individuals allows for the establishment of more informal collaborative map data projects which are called volunteered geographic information (VGI). These projects, such as OpenStreetMap (OSM) project, seek to create free alternative maps which let users add or input new materials to the data of others. The information of different VGI data sources is often not compliant to any standard and each organization is producing a dataset at various level of richness. In this research the assessment of semantic data quality provided by web sources, e.g. OSM will depend on a comparison with the information from standard sources. This will include the validity of semanti
... Show MoreThe information required for construction quantities surveying is not only generated by various participants in different construction phases but also stored in different forms including graphics, text, tables, or various combinations of the three. To report a bill of quantities (BOQ), the project manager has to continuously excerpt information from various resources and record it on papers. Without adequate staff and time, this repetitive and tedious process is difficult for the project manager to handle properly and thus reduces the effectiveness and the accuracy of the quantities surveying process which creates problems during the design, tender, and construction supervision of construction projects for designers and contractors pract
... Show MoreAs cities across the world grow and the mobility of populations increases, there has also been a corresponding increase in the number of vehicles on roads. The result of this has been a proliferation of challenges for authorities with regard to road traffic management. A consequence of this has been congestion of traffic, more accidents, and pollution. Accidents are a still major cause of death, despite the development of sophisticated systems for traffic management and other technologies linked with vehicles. Hence, it is necessary that a common system for accident management is developed. For instance, traffic congestion in most urban areas can be alleviated by the real-time planning of routes. However, the designing of an efficie
... Show MoreIn this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons
... Show More