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.
Community detection is useful for better understanding the structure of complex networks. It aids in the extraction of the required information from such networks and has a vital role in different fields that range from healthcare to regional geography, economics, human interactions, and mobility. The method for detecting the structure of communities involves the partitioning of complex networks into groups of nodes, with extensive connections within community and sparse connections with other communities. In the literature, two main measures, namely the Modularity (Q) and Normalized Mutual Information (NMI) have been used for evaluating the validation and quality of the detected community structures. Although many optimization algo
... Show MoreThe researchers have a special interest in studying Markov chains as one of the probability samples which has many applications in different fields. This study comes to deal with the changes issue that happen on budget expenditures by using statistical methods, and Markov chains is the best expression about that as they are regarded reliable samples in the prediction process. A transitional matrix is built for three expenditure cases (increase ,decrease ,stability) for one of budget expenditure items (base salary) for three directorates (Baghdad ,Nineveh , Diyala) of one of the ministries. Results are analyzed by applying Maximum likelihood estimation and Ordinary least squares methods resulting
... Show Morenatural and non-natural disasters, is an environmental challenges the society and the economy as well as a direct and indirect economic affect, and the units are part of the system overlapping among themselves and thus affected by external indicators, directly or indirectly, these direct effects appear in the destruction or damage inflicted by disasters in property , infrastructure , superstructure , accounting information systems and indirectly in the outcome of future business, comes research problem through access to accounting treatments issued by the Federal Office of financial supervision to address the damage caused by the disasters and prepare the missing financial accounts it turns out us that there is negligence of a nu
... Show MoreThe 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 Morehe public federal budget of the state includes estimated figures for state revenues and expenditures for the next fiscal year. The estimation process is one of the main parts of the preparation of the general budget of the state and the accuracy in the estimation of revenues and expenditures of the most important principles that should be based on the process of making estimates and should not overestimate the assessment process to ensure the availability of funds in the future in all cases, which lead to unfair distribution of allocations, so the research aims to study The case of preparing the budget in the Directorate and how to estimate the expenditure in, by the analysis of operating budgets and identify deviations in the implementa
... Show More