Quantum key distribution (QKD) provides unconditional security in theory. However, practical QKD systems face challenges in maximizing the secure key rate and extending transmission distances. In this paper, we introduce a comparative study of the BB84 protocol using coincidence detection with two different quantum channels: a free space and underwater quantum channels. A simulated seawater was used as an example for underwater quantum channel. Different single photon detection modules were used on Bob’s side to capture the coincidence counts. Results showed that increasing the mean photon number generally leads to a higher rate of coincidence detection and therefore higher possibility of increasing the secure key rate. The secure key rate can reach 0.0239 (bits/pulse) with a quantum bit error rate (QBER) of 3.2% for the free space channel and 1.5% for the simulated sea-water channel. The security parameters for each value of the mean photon number closely align with the corresponding theoretical predictions. However, some discrepancies were observed, primarily due to a mismatch in photon detection efficiency for SPDMs and system fluctuations. The theoretical calculations also predict that using coincidence detection, the key can be distributed over distances of up to 195 km.
Software-defined networking (SDN) is an innovative network paradigm, offering substantial control of network operation through a network’s architecture. SDN is an ideal platform for implementing projects involving distributed applications, security solutions, and decentralized network administration in a multitenant data center environment due to its programmability. As its usage rapidly expands, network security threats are becoming more frequent, leading SDN security to be of significant concern. Machine-learning (ML) techniques for intrusion detection of DDoS attacks in SDN networks utilize standard datasets and fail to cover all classification aspects, resulting in under-coverage of attack diversity. This paper proposes a hybr
... Show MoreCommunity detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem. In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a
... Show MoreIn this paper, we used maximum likelihood method and the Bayesian method to estimate the shape parameter (θ), and reliability function (R(t)) of the Kumaraswamy distribution with two parameters l , θ (under assuming the exponential distribution, Chi-squared distribution and Erlang-2 type distribution as prior distributions), in addition to that we used method of moments for estimating the parameters of the prior distributions. Bayes
In this paper, we present a comparison of double informative priors which are assumed for the parameter of inverted exponential distribution.To estimate the parameter of inverted exponential distribution by using Bayes estimation ,will be used two different kind of information in the Bayes estimation; two different priors have been selected for the parameter of inverted exponential distribution. Also assumed Chi-squared - Gamma distribution, Chi-squared - Erlang distribution, and- Gamma- Erlang distribution as double priors. The results are the derivations of these estimators under the squared error loss function with three different double priors.
Additionally Maximum likelihood estimation method
... Show MoreLet R be a commutative ring with 1 and M be a (left) unitary R – module. This essay gives generalizations for the notions prime module and some concepts related to it. We termed an R – module M as semi-essentially prime if annR (M) = annR (N) for every non-zero semi-essential submodules N of M. Given some of their advantages characterizations and examples, and we study the relation between these and some classes of modules.
Let
he concept of small monoform module was introduced by Hadi and Marhun, where a module U is called small monoform if for each non-zero submodule V of U and for every non-zero homomorphism f ∈ Hom R (V, U), implies that ker f is small submodule of V. In this paper the author dualizes this concept; she calls it co-small monoform module. Many fundamental properties of co-small monoform module are given. Partial characterization of co-small monoform module is established. Also, the author dualizes the concept of small quasi-Dedekind modules which given by Hadi and Ghawi. She show that co-small monoform is contained properly in the class of the dual of small quasi-Dedekind modules. Furthermore, some subclasses of co-small monoform are investiga
... Show More