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.
This paper work new and unprecedented definitions of sets, which we have named supra fan, supra. delta fan, supra. semi delta fan sets, which are generated by three sets of specific type of supra open sets, it was utilized supra open, supra delta open, supra. semi delta open sets with special conditions. It is highlighted many details of these new types of fan sets, their axis, blades and their annular sets using tables. Attention is given to the interior and the closure of these three types in supra topological spaces. The research was further enriched numerous and diverse examples. Subsequently, the focus shifted to supra. semi delta fan sets to prove lemma and theorem.
Software Defined Network (SDN) is a new technology that separate the control plane from the data plane. SDN provides a choice in automation and programmability faster than traditional network. It supports the Quality of Service (QoS) for video surveillance application. One of most significant issues in video surveillance is how to find the best path for routing the packets between the source (IP cameras) and destination (monitoring center). The video surveillance system requires fast transmission and reliable delivery and high QoS. To improve the QoS and to achieve the optimal path, the SDN architecture is used in this paper. In addition, different routing algorithms are used with different steps. First, we eva
... Show MoreMoisture-induced damage is one of the primary causes of premature distress in asphalt pavements, leading to reduced service life and increased maintenance costs. Although nanomaterials have shown potential in enhancing asphalt performance, the underlying composite interaction mechanisms among nanomaterials, asphalt binder, and aggregate phases under moisture exposure are still not fully understood. In addition, comparative evaluations under consistent experimental conditions remain limited. This study investigates the influence of five nanomaterials: nano-silica (NS), nano-alumina (NA), nano-titanium dioxide (NT), nano-zinc oxide (NZ), and carbon nanotubes (CNT) on the physical and mechanical properties of asphalt binders and mixtur
... Show MoreEnergy savings are very common in IoT sensor networks because IoT sensor nodes operate with their own limited battery. The data transmission in the IoT sensor nodes is very costly and consume much of the energy while the energy usage for data processing is considerably lower. There are several energy-saving strategies and principles, mainly dedicated to reducing the transmission of data. Therefore, with minimizing data transfers in IoT sensor networks, can conserve a considerable amount of energy. In this research, a Compression-Based Data Reduction (CBDR) technique was suggested which works in the level of IoT sensor nodes. The CBDR includes two stages of compression, a lossy SAX Quantization stage which reduces the dynamic range of the
... 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