In this work, a simple and new method is proposed to simultaneously improve the physical layer security and the transmission performance of the optical orthogonal frequency division multiplexing system, by combining orthogonal frequency division multiplexing technique with chaotic theory principles. In the system, a 2-D chaotic map is employed. The introduced system replaces complex operations such as matrix multiplication with simple operations such as multiplexing and inverting. The system performance in terms of bit error rate (BER) and peak to average ratio (PAPR) is enhanced. The system is simulated using Optisystem15 with a MATLAB2016 and for different constellations. The simulation results showed that the  BE

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.

Optimized Link State Routing Protocol (OLSR) is an efficient routing protocol used for various Ad hoc networks. OLSR employs the Multipoint Relay (MPR) technique to reduce network overhead traffic. A mobility model's main goal is to realistically simulate the movement behaviors of actual users. However, the high mobility and mobility model is the major design issues for an efficient and effective routing protocol for real Mobile Ad hoc Networks (MANETs). Therefore, this paper aims to analyze the performance of the OLSR protocol concerning various random and group mobility models. Two simulation scenarios were conducted over four mobility models, specifically the  Random Waypoint model (RWP), Random Direction model (RD), Nomadic Co

Precision is one of the main elements that control the quality of a geodetic network, which defines as the measure of the network efficiency in propagation of random errors. This research aims to solve ZOD and FOD problems for a geodetic network using Rosenbrock Method to optimize the geodetic networks by using MATLAB programming language, to find the optimal design of geodetic network with high precision. ZOD problem was applied to a case study network consists of 19 points and 58 designed distances with a priori deviation equal to 5mm, to determine the best points in the network to consider as control points. The results showed that P55 and P73 having the minimum ellipse of error and considered as control points. FOD problem was applie

Mobile Ad hoc Networks (MANETs) is a wireless technology that plays an important role in several modern applications which include military, civil, health and real-time applications. Providing Quality of Service (QoS) for this application with network characterized by node mobility, infrastructure-less, limitation resource is a critical issue and takes greater attention. However, transport protocols effected influential on the performance of MANET application. This study provides an analysis and evaluation of the performance for TFRC, UDP and TCP transport protocols in MANET environment. In order to achieve high accuracy results, the three transport protocols are implemented and simulated with four different network topology which are 5, 10

Internet paths sharing the same congested link can be identified using several shared congestion detection techniques. The new detection technique which is proposed in this paper depends on the previous novel technique (delay correlation with wavelet denoising (DCW) with new denoising method called Discrete Multiwavelet Transform (DMWT) as signal denoising to separate between queuing delay caused by network congestion and delay caused by various other delay variations. The new detection technique provides faster convergence (3 to 5 seconds less than previous novel technique) while using fewer probe packets approximately half numbers than the previous novel technique, so it will reduce the overload on the network caused by probe packets.

The employment of cognitive radio (CR) is critical to the successful development of wireless communications. In this field, especially when using the multiple input multiple output (MIMO) antenna technology, energy consumption is critical. If the principal user (PU) is present, developers can utilize the energy detecting approach to tell. The researchers employed two distinct phases to conduct their research: the intense and accurate sensing stages. After the furious sensing step was completed, the PU user was identified as having a maximum or minimal energy channel. There are two situations in which the proposed algorithm's performance is tested: channels for fading AWGN and Rayleigh. When the proposed methods' simulation results a

<span>As a result of numerous applications and low installation costs, wireless sensor networks (WSNs) have expanded excessively. The main concern in the WSN environment is to lower energy consumption amidst nodes while preserving an acceptable level of service quality. Using multi-mobile sinks to reduce the nodes' energy consumption have been considered as an efficient strategy. In such networks, the dynamic network topology created by the sinks mobility makes it a challenging task to deliver the data to the sinks. Thus, in order to provide efficient data dissemination, the sensor nodes will have to readjust the routes to the current position of the mobile sinks. The route re-adjustment process could result in a significant m

Localization is an essential demand in wireless sensor networks (WSNs). It relies on several types of measurements. This paper focuses on positioning in 3-D space using time-of-arrival- (TOA-) based distance measurements between the target node and a number of anchor nodes. Central localization is assumed and either RF, acoustic or UWB signals are used for distance measurements. This problem is treated by using iterative gradient descent (GD), and an iterative GD-based algorithm for localization of moving sensors in a WSN has been proposed. To localize a node in 3-D space, at least four anchors are needed. In this work, however, five anchors are used to get better accuracy. In GD localization of a moving sensor, the algo