Flying Ad hoc Networks (FANETs) has developed as an innovative technology for access places without permanent infrastructure. This emerging form of networking is construct of flying nodes known as unmanned aerial vehicles (UAVs) that fly at a fast rate of speed, causing frequent changes in the network topology and connection failures. As a result, there is no dedicated FANET routing protocol that enables effective communication between these devices. The purpose of this paper is to evaluate the performance of the category of topology-based routing protocols in the FANET. In a surveillance system involving video traffic, four routing protocols with varying routing mechanisms were examined. Additionally, simulation experiments conducted to determine the influence of flying altitude. The results indicate that hybrid routing protocols outperform other types of protocols in terms of average throughput. Proactive protocols, on the other hand, have the least jitter.
The main focus of this article is to introduce the notion of rough pentapartitioned neutrosophic set and rough pentapartitioned neutrosophic topology by using rough pentapartitioned neutrosophic lower approximation, rough pentapartitioned neutrosophic upper approximation, and rough pentapartitioned neutrosophic boundary region. Then, we provide some basic properties, namely operations on rough pentapartitioned neutrosophic set and rough pentapartitioned neutrosophic topology. By defining rough pentapartitioned neutrosophic set and topology, we formulate some results in the form of theorems, propositions, etc. Further, we give some examples to justify the definitions introduced in this article.
Recently, the increasing demand to transfer data through the Internet has pushed the Internet infrastructure to the nal edge of the ability of these networks. This high demand causes a deciency of rapid response to emergencies and disasters to control or reduce the devastating effects of these disasters. As one of the main cornerstones to address the data trafc forwarding issue, the Internet networks need to impose the highest priority on the special networks: Security, Health, and Emergency (SHE) data trafc. These networks work in closed and private domains to serve a group of users for specic tasks. Our novel proposed network ow priority management based on ML and SDN fullls high control to give the required ow priority to SHE dat
... Show MoreBaghdad city has been faced numerous issues related to freshwater environment deteriorations due to many reasons, mainly was the discharge of wastewater without adequate treatment. Al- Rustamiya Wastewater Treatment Plant (WWTP) have been constructed among many plants in Baghdad city to reduce the amount of wastewater discharged into natural environment and its subsequent adverse effects. This study was conducted to evaluate the performance of the plant which consist of a conventional activated sludge (CAS) and sequencing batch reactors (SBR) systems as secondary treatment units and its ability to meet Iraqi specifications. A reliability level determination and analysis also were conducted to find the plant's stability and its capabi
... Show MoreBaghdad city has been faced numerous issues related to freshwater environment deteriorations due to many reasons, mainly was the discharge of wastewater without adequate treatment. Al-Rustamiya Wastewater Treatment Plant (WWTP) have been constructed among many plants in Baghdad city to reduce the amount of wastewater discharged into natural environment and its subsequent adverse effects. This study was conducted to evaluate the performance of the plant which consist of a conventional activated sludge (CAS) and sequencing batch reactors (SBR) systems as secondary treatment units and its ability to meet Iraqi specifications. A reliability level determination and analysis also were conducted to find the plant's stability an
... Show MoreIn this study, flow-based routing model is investigated. The aim of this study is to increase scalability of flow control, routing and network resources solutions, as well as to improve Quality of Service and performance of the whole system. A method of hierarchical routing is proposed. The goal coordination method alsoused in this paper. Two routing models (model with quadratic objective function and model with traffic engineering) were fully analyzed. The basic functions of the hierarchical routing model levels based on goal coordination method were addressed Both models’ convergence is also explained. The dependence of the coordination iterations number on the packet flow rates for both models is graphically shown. The results shows
... Show More
The implementation of technology in the provision of public services and communication to citizens, which is commonly referred to as e-government, has brought multitude of benefits, including enhanced efficiency, accessibility, and transparency. Nevertheless, this approach also presents particular security concerns, such as cyber threats, data breaches, and access control. One technology that can aid in mitigating the effects of security vulnerabilities within e-government is permissioned blockchain. This work examines the performance of the hyperledger fabric private blockchain under high transaction loads by analyzing two scenarios that involve six organizations as case studies. Several parameters, such as transaction send ra
... Show MoreThe industrial factory is one of the challenging environments for future wireless communication systems, where the goal is to produce products with low cost in short time. This high level of network performance is achieved by distributing massive MIMO that provides indoor networks with joint beamforming that enhances 5G network capacity and user experience as well. Judging from the importance of this topic, this study introduces a new optimization problem concerning the investigation of multi-beam antenna (MBA) coverage possibilities in 5G network for indoor environments, named Base-station Beams Distribution Problem (BBDP). This problem has an extensive number of parameters and constrains including user’s location, required d
... Show MoreLet G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric