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

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

The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. This work modernize the feedforward neural network, so the secret message will be encrypted by unsupervised neural network method to get the cipher text that can be decrypted using the same network to get the original text. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding lengths. In this work, the key is the final weights

Heading of this research, to interrogate the text Sufi Andalusia, one of the displayed cognitive embodied the spirit of the experiment with Walsh nudity Sufi, who ascended to the world of spirituality within their experience of poetry, taking pictures of the perceived symbol cognitively carry through to the worlds transparent based Almwaged related Bashan soul and heart, has tried to invest communicative potential offered by .      

Everybody is connected with social media like (Facebook, Twitter, LinkedIn, Instagram…etc.) that generate a large quantity of data and which traditional applications are inadequate to process. Social media are regarded as an important platform for sharing information, opinion, and knowledge of many subscribers. These basic media attribute Big data also to many issues, such as data collection, storage, moving, updating, reviewing, posting, scanning, visualization, Data protection, etc. To deal with all these problems, this is a need for an adequate system that not just prepares the details, but also provides meaningful analysis to take advantage of the difficult situations, relevant to business, proper decision, Health, social media, sc

In present work, new tetra-dentate ligand, titled 3,5-bis ((E)-5-Bromo-2-hydroxy benzylidene amino) benzoic acid (H₃L), was prepared via an acid-catalyzed condensation process. New four metallic ligand complexes with Co(II), Ni(II), Cu(II) and Zn(II) ions, were also prepared from the refluxing of equivalent moles. Ligand's structure and its complexes; were confirmed by numerous characterization methods, including Ultraviolet-Visible, Infrared, Mass Spectrometer, ¹H and ¹³C Nuclear Magnetic Resonance spectra, atomic absorption, magnetic moments, and molar conductivity measurements. The results of the spectroscopic analyzes proved that the prepared ligand acts as tetradentate bi-ionic ligand and it was bond

The biometric-based keys generation represents the utilization of the extracted features from the human anatomical (physiological) traits like a fingerprint, retina, etc. or behavioral traits like a signature. The retina biometric has inherent robustness, therefore, it is capable of generating random keys with a higher security level compared to the other biometric traits. In this paper, an effective system to generate secure, robust and unique random keys based on retina features has been proposed for cryptographic applications. The retina features are extracted by using the algorithm of glowworm swarm optimization (GSO) that provides promising results through the experiments using the standard retina databases. Additionally, in order t

Provides the style of benchmarking the best possible use whenevaluating the performance and evaluation, as well as improved performance,due to its consistency with the principles of good evaluation of theperformance, an extension of the completion of several functions of the timeand cost less, thereby increasing the efficiency of the management of theinstitutions, especially institutions, the media, as it became public the future ofthe message sender to the same time Zaorosaúl new media is challenging thetraditional media of what distinguishes this new interactive media and mass ledto this transition . However, the media Aljdidhoosaúl traditional mediacontinue to coexist and reinforce each Menhmaalakhr, for his wealth offreedom of opin

This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, tra