The Wireless Sensor Networks (WSNs), which are deployed in harsh environments, are extremely susceptible to localized battery exhaustion as well as intelligent inside routing threats, especially sinkhole and data falsification attacks. In this paper, we present ECHVM (Enhanced Cluster Head selection by Voting and an ECC-based Blockchain Mechanism), a novel, secure, and energy-efficient routing framework to achieve an optimal trade-off between network security and hardware resource efficiency. We present the ECHVM protocol that combines Elliptic Curve Cryptography (ECC) with a lightweight, local distributed ledger to mitigate risks of centralized authority by tr
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 MoreThroughout this paper we introduce the concept of quasi closed submodules which is weaker than the concept of closed submodules. By using this concept we define the class of fully extending modules, where an R-module M is called fully extending if every quasi closed submodule of M is a direct summand.This class of modules is stronger than the class of extending modules. Many results about this concept are given, also many relationships with other related concepts are introduced.
Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith
... Show MoreDirectional Compact Geographic Forwarding (DCGF) routing protocol promises a minimal overhead generation by utilizing a smart antenna and Quality of Service (QoS) aware aggregation. However, DCGF was tested only in the attack-free scenario without involving the security elements. Therefore, an investigation was conducted to examine the routing protocol algorithm whether it is secure against attack-based networks in the presence of Denial-of-Service (DoS) attack. This analysis on DoS attack was carried out using a single optimal attacker, A1, to investigate the impact of DoS attack on DCGF in a communication link. The study showed that DCGF does not perform efficiently in terms of packet delivery ratio and energy consumption even on a sin
... Show MoreIn the present study, advanced oxidation process / heterogeneous photocatalytic process (UV/TiO2/Fenton) system was investigated to the treatment of oily wastewater. The present study was conducted to evaluate the effect of hydrogen peroxide concentration H2O2, initial amount of the iron catalyst Fe+2, pH, temperature, amount of TiO2 and the concentration of oil in the wastewater. The removal efficiency for the system UV/TiO2/Fenton at optimal conditions and dosage (H2O2 = 400mg/L, Fe+2 = 40mg/L, pH=5, temperature =30oC, TiO2=75mg/L) for 1000mg/L load was found to be 77%.
Aluminum foil cover around the re
... Show MoreThe concept of fully pseudo stable Banach Algebra-module (Banach A-module) which is the generalization of fully stable Banach A-module has been introduced. In this paper we study some properties of fully stable Banach A-module and another characterization of fully pseudo stable Banach A-module has been given.