Future generations of wireless networks are expected to heavily rely on unmanned aerial vehicles (UAVs). UAV networks have extraordinary features like high mobility, frequent topology change, tolerance to link failure, and extending the coverage area by adding external UAVs. UAV network provides several advantages for civilian, commercial, search and rescue applications. A realistic mobility model must be used to assess the dependability and effectiveness of UAV protocols and algorithms. In this research paper, the performance of the Gauss Markov (GM) and Random Waypoint (RWP) mobility models in multi-UAV networks for a search and rescue scenario is analyzed and evaluated. Additionally, the two mobility models GM and RWP are described in depth, together with the movement patterns they are related with. Furthermore, two-simulation scenarios conduct with help of an NS-3 simulator. The first scenario investigates the effect of UAV Speed by varying it from 10 to 50 m/s. the second scenario investigates the effect of the size of the transmitting packet by varying it from 64 to 1024 bytes. The performance of GM and RWP was compared based on packet delivery ratio (PDR), goodput, and latency metrics. Results indicate that the GM model provides the highest PDR and lowest latency in such high mobility environments.
This paper investigated an Iraqi dataset from Korek Telecom Company as Call Detail Recorded (CDRs) for six months falling between Sep. 2020-Feb. 2021. This data covers 18 governorates, and it falls within the period of COVID-19. The Gravity algorithm was applied into two levels of abstraction in deriving the results as the macroscopic and mesoscopic levels respectively. The goal of this study was to reveal the strength and weakness of people migration in-between the Iraqi cities. Thus, it has been clear that the relationship between each city with the others is based on and of mobile people. However, the COVID-19 effects on the people’s migration needed to be explored. Whereas the main function of the gravity model is to
... Show MoreThe paper establishes explicit representations of the errors and residuals of approximate
solutions of triangular linear systems by Jordan elimination and of general linear algebraic
systems by Gauss-Jordan elimination as functions of the data perturbations and the rounding
errors in arithmetic floating-point operations. From these representations strict optimal
componentwise error and residual bounds are derived. Further, stability estimates for the
solutions are discussed. The error bounds for the solutions of triangular linear systems are
compared to the optimal error bounds for the solutions by back substitution and by Gaussian
elimination with back substitution, respectively. The results confirm in a very
One of the important goals in the learning process is to be effective learning through the self-direction of the learner , because it has an impact on the effort of learners , it is better to be a learner responsible for learning and independent of the acquisition of knowledge ,
اذ اكدتكثيرAs many have confirmed منFrom الدراساتStudies والادبياتAnd literature انthat فشلالكثير The failure of many منFrom الطلبةStudents فيin a تنظيمgroup المعلوماتthe information ومعالجتهاAnd processed اثناءduring عمليةProcess تعلمهمLearn them لاNo يرجعReturns الىto me انخفاضdrop فيin a درجةDegree ذكائهمTheir intelligence اوor عدمNo
... Show MoreIn this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot
... Show MoreIndividual mobility is an outcome of the rapid changes in life; it is revealed in particular literary works within the end of the 19th century. Mobility is clearer in modern time as the individual has become physically freer in his movement. But the individual’s freedom is often conditioned by restrictions. Usually, change stimulates individuals to obtain new structure of feeling; the individual mocks or rages against institutions, or he would comply, suffering rapid personal deterioration as he faces effective stability or institutions. There is a continuous sense of “deadlock.” Sylvia Plath’s novel reflects the depression of an intellectual young woman who fails to find her right path muddled by an inconsistent, confusing
... Show MoreIn real world, almost all networks evolve over time. For example, in networks of friendships and acquaintances, people continually create and delete friendship relationship connections over time, thereby add and draw friends, and some people become part of new social networks or leave their networks, changing the nodes in the network. Recently, tracking communities encountering topological shifting drawn significant attentions and many successive algorithms have been proposed to model the problem. In general, evolutionary clustering can be defined as clustering data over time wherein two concepts: snapshot quality and temporal smoothness should be considered. Snapshot quality means that the clusters should be as precise as possible durin
... Show More