Статьи журнала - International Journal of Computer Network and Information Security

Все статьи: 1130

Flat-Top Ring-Shaped Cell Design for High-Altitude Platform Communications

Flat-Top Ring-Shaped Cell Design for High-Altitude Platform Communications

Yasser Albagory

Статья научная

In this paper, a new design for ring-shaped cells is introduced where to improve the power distribution and carrier-to-interference ratio (CIR) over the cell area. The designed cell has flat-top radiation pattern with minimal ripples in the service area while the out-of-cell area has lower radiation levels. The new design utilizes two weighting functions applied to a vertical linear array; the first is responsible for the flat-top design and the second smoothes the pattern and reduces the sidelobe levels. The resulted power pattern has a uniform distribution over the cell stripe with as small as 0.25 dB ripples and a uniform CIR values greater than 43 dB within the cells which reduces the burden of power control and increases the immunity to propagation problems.

Бесплатно

Flow-aware Segment Routing in SDN-enabled Data Center Networks

Flow-aware Segment Routing in SDN-enabled Data Center Networks

Bommareddy Lokesh, Narendran Rajagopalan

Статья научная

The underlying objective of segment routing is to avoid maintenance of the per-flow state at forwarding devices. Segment routing (SR) enables the network devices to minimize their forwarding table size by generalizing the forwarding rules and making them applicable to multiple flows. In existing works, optimizing the trade-off between segment length and the number of co-flows sharing the segment is considered the key to determining optimal segment endpoints. However, the flow characteristics like the lifetime of flows, and dynamically altering routing paths are critical and impact the performance of SR. Ideally, network flows considered for SR are expected to persist for a longer duration and adhere to static routing paths. But our analysis of flow characteristics at a typical data center reveals that the majority of flows are short-lived. Also, network flows are subject to alter their routing paths frequently for several reasons. Considering short-lived flows and flows that dynamically alter their routing paths may lead to choosing unstable segment endpoints. Hence, it is necessary to study the flow characteristics for determining more stable segment endpoints. In this paper, the authors implemented the SR technique considering the flow characteristics at an SDN-enabled data center and the results show a significant improvement with respect to the stability of segment endpoints.

Бесплатно

Ford Fulkerson and Newey West Regression Based Dynamic Load Balancing in Cloud Computing for Data Communication

Ford Fulkerson and Newey West Regression Based Dynamic Load Balancing in Cloud Computing for Data Communication

Prabhakara B.K., Chandrakant Naikodi, Suresh L.

Статья научная

In Cloud Computing (CC) environment, load balancing refers to the process of optimizing resources of virtual machines. Load balancing in the CC environment is one of the analytical approaches utilized to ensure indistinguishable workload distribution and effective utilization of resources. This is because only by ensuring effective balance of dynamic workload results in higher user satisfaction and optimal allocation of resource, therefore improve cloud application performance. Moreover, a paramount objective of load balancing is task scheduling because surges in the number of clients utilizing cloud lead to inappropriate job scheduling. Hence, issues encircling task scheduling has to be addressed. In this work a method called, Ford Fulkerson and Newey West Regression-based Dynamic Load Balancing (FF-NWRDLB) in CC environment is proposed. The FF-NWRDLB method is split into two sections, namely, task scheduling and dynamic load balancing. First, Ford Fulkerson-based Task Scheduling is applied to the cloud user requested tasks obtained from Personal Cloud Dataset. Here, employing Ford Fulkerson function based on the flow of tasks, energy-efficient task scheduling is ensured. The execution of asymmetrical scientific applications can be smoothly influenced by an unbalanced workload distribution between computing resources. In this context load balancing signifies as one of the most significant solution to enhance utilization of resources. However, selecting the best accomplishing load balancing technique is not an insignificant piece of work. For example, selecting a load balancing model does not work in circumstances with dynamic behavior. In this context, a machine learning technique called, Newey West Regression-based dynamic load balancer is designed to balance the load in a dynamic manner at run time, therefore ensuring accurate data communication. The FF-NWRDLB method has been compared to recent algorithms that use the markov optimization and the prediction scheme to achieve load balancing. Our experimental results show that our proposed FF-NWRDLB method outperforms other state of the art schemes in terms of energy consumption, throughput, delay, bandwidth and task scheduling efficiency in CC environment.

Бесплатно

Forensics Investigation of Web Application Security Attacks

Forensics Investigation of Web Application Security Attacks

Amor Lazzez, Thabet Slimani

Статья научная

Nowadays, web applications are popular targets for security attackers. Using specific security mechanisms, we can prevent or detect a security attack on a web application, but we cannot find out the criminal who has carried out the security attack. Being unable to trace back an attack, encourages hackers to launch new attacks on the same system. Web application forensics aims to trace back and attribute a web application security attack to its originator. This may significantly reduce the security attacks targeting a web application every day, and hence improve its security. The aim of this paper is to carry out a detailed overview about the web application forensics. First, we define the web applications forensics, and we present a taxonomic structure of the digital forensics. Then, we present the methodology of a web application forensics investigation. After that, we illustrate the forensics supportive tools for a web application forensics investigation. After that, we present a detailed presentation of a set of the main considered web application forensics tools. Finally, we provide a comparison of the main considered web application forensics tools.

Бесплатно

Forensics image acquisition process of digital evidence

Forensics image acquisition process of digital evidence

Erhan Akbal, Sengul Dogan

Статья научная

For solving the crimes committed on digital materials, they have to be copied. An evidence must be copied properly in valid methods that provide legal availability. Otherwise, the material cannot be used as an evidence. Image acquisition of the materials from the crime scene by using the proper hardware and software tools makes the obtained data legal evidence. Choosing the proper format and verification function when image acquisition affects the steps in the research process. For this purpose, investigators use hardware and software tools. Hardware tools assure the integrity and trueness of the image through write-protected method. As for software tools, they provide usage of certain write-protect hardware tools or acquisition of the disks that are directly linked to a computer. Image acquisition through write-protect hardware tools assures them the feature of forensic copy. Image acquisition only through software tools do not ensure the forensic copy feature. During the image acquisition process, different formats like E01, AFF, DD can be chosen. In order to provide the integrity and trueness of the copy, hash values have to be calculated using verification functions like SHA and MD series. In this study, image acquisition process through hardware-software are shown. Hardware acquisition of a 200 GB capacity hard disk is made through Tableau TD3 and CRU Ditto. The images of the same storage are taken through Tableau, CRU and RTX USB bridge and through FTK imager and Forensic Imager; then comparative performance assessment results are presented.

Бесплатно

Formal Verification of Congestion Control Algorithm in VANETs

Formal Verification of Congestion Control Algorithm in VANETs

Mohamad Yusof Darus, Kamalrulnizam Abu Bakar

Статья научная

A Vehicular Ad-Hoc Networks (VANETs) is the technology that uses moving cars as nodes in a network to create a mobile network. VANETs turn every participating car into a wireless router, allowing cars of each other to connect and create a network with a wide range. VANETs are developed for enhancing the driving safety and comfort of automotive users. The VANETs can provide wide variety of service such as Intelligent Transportation System (ITS) e.g. safety applications. Many of safety applications built in VANETs are required real-time communication with high reliability. One of the main challenges is to avoid degradation of communication channels in dense traffic network. Many of studies suggested that appropriate congestion control algorithms are essential to provide efficient operation of the network. However, most of congestion control algorithms are not really applicable to event-driven safety messages. In this paper we propose congestion control algorithm as solution to prevent congestion in VANETs environment. We propose a complete validation method and analyse the performance of our congestion control algorithms for event-driven safety messages in difference congested scenarios. The effectiveness of the proposed congestion control algorithm is evaluated through the simulation using Veins simulator.

Бесплатно

Formal Verification of NTRUEncrypt Scheme

Formal Verification of NTRUEncrypt Scheme

Gholam Reza Moghissi, Ali Payandeh

Статья научная

In this paper we explore a mechanized verification of the NTRUEncrypt scheme, with the formal proof system Isabelle/HOL. More precisely, the functional correctness of this algorithm, in its reduced form, is formally verified with computer support. We show that this scheme is correct what is a necessary condition for the usefulness of any cryptographic encryption scheme. Besides, we present a convenient and application specific formalization of the NTRUEncrypt scheme in the Isabelle/HOL system that can be used in further study around the functional and security analysis of NTRUEncrypt family.

Бесплатно

Forward Error Correction Convolutional Codes for RTAs' Networks: An Overview

Forward Error Correction Convolutional Codes for RTAs' Networks: An Overview

Salehe I. Mrutu, Anael Sam, Nerey H. Mvungi

Статья научная

For more than half a century, Forward Error Correction Convolutional Codes (FEC-CC) have been in use to provide reliable data communication over various communication networks. The recent high increase of mobile communication services that require both bandwidth intensive and interactive Real Time Applications (RTAs) impose an increased demand for fast and reliable wireless communication networks. Transmission burst errors; data decoding complexity and jitter are identified as key factors influencing the quality of service of RTAs implementation over wireless transmission media. This paper reviews FEC-CC as one of the most commonly used algorithm in Forward Error Correction for the purpose of improving its operational performance. Under this category, we have analyzed various previous works for their strengths and weaknesses in decoding FEC-CC. A comparison of various decoding algorithms is made based on their decoding computational complexity.

Бесплатно

Frame Relay versus Asynchronous Transfer Mode: A Comparative Study and Simulation

Frame Relay versus Asynchronous Transfer Mode: A Comparative Study and Simulation

Ibrahim Ali Ibrahim Diyeb, Sharaf A. Alhomdy

Статья научная

Frame Relay and Asynchronous Transfer Mode (ATM) are two famous technologies in wide-area networks that use the virtual circuits for connecting and multiplexing many branches and networks. Those technologies can be used to carry different types of information such as real-time information which needs high data rate, low delay and an efficient throughput of the network's data communication devices. This paper is a study based on simulation for comparative performance evaluation between the Frame Relay and ATM to understand the overview and the nature of these technologies focusing on real-time applications using the OPNET simulation tool for analyzing the performance of voice application. The evaluation parameters are traffic sent, traffic received, delay, Jitter and the end-to-end delay which have been used to compare the performance of the ATM and Frame Relay in high-speed networks. The simulation results demonstrate that the ATM has high traffic sent, high traffic received, and less delay compared to the Frame Relay. In addition, this paper may be considered as an insight for the new researchers to guide them to an overview, essentials, and understanding of the virtual connections for Frame Relay and ATM.

Бесплатно

Free Space Optical Channel Characterization and Modeling with Focus on Algeria Weather Conditions

Free Space Optical Channel Characterization and Modeling with Focus on Algeria Weather Conditions

Mehdi ROUISSAT, A. Riad BORSALI, Mohammad E. CHIKH-BLED

Статья научная

Free-Space Optics (FSO) is a wireless optical technology that enables optical transmission of data, voice and video communications through the air, up to 10 Gbps of data, based on the use of the free space (the atmosphere) as transmission medium and low power lasers as light sources. Quality and performance of FSO links are generally affected by link distance and weather conditions like environmental temperature and light, sun, fog, snow, smoke, haze and rain. In this paper we study the effects of weather conditions on the performance of FSO links, taking the climate of Algeria as an example, and since there is no known analysis on the effects of weather conditions in this country, this paper offers an attempt to analyze and identify the challenges related to the deployment of FSO links under Algeria's weather. We also present a Graphic User Interface "GUI" to provide an approximate availability estimate of an atmospheric optical link in term of probability of connection.

Бесплатно

Frog-Based Routing Algorithm to Enhance the Network Lifetime of Wireless Sensor Networks

Frog-Based Routing Algorithm to Enhance the Network Lifetime of Wireless Sensor Networks

Vidya Honguntikar, G. S. Biradar

Статья научная

Wireless Sensor Networks (WSN) finds wide applications in both Target tracking and Environment monitoring in almost every field, with the demand growing day by day. Routing is considered as the most important challenge in designing a WSN. To enhance the Network Lifetime, there is a need to have a balanced load sharing with equal consumption of Energy by all the nodes in the Network. Several Routing Protocols have been developed that are inspired by the collective behaviour and principles of social insects and animal societies. Inspired by the Frog behaviour, we in this paper propose an Energy efficient distributed Frog-Based Routing (FBR) algorithm for WSN. Routing path is established considering the nodes that have high residual Energy which makes all the nodes die around the same time, prolonging the Network Lifetime. Simulation was carried out using NS2 and the results of FBR algorithm are compared with two other Energy Efficient Routing Protocols LEACH and SPIN for the evaluation of different performance metrics.

Бесплатно

Fuzzy Based Energy Efficient Multiple Cluster Head Selection Routing Protocol for Wireless Sensor Networks

Fuzzy Based Energy Efficient Multiple Cluster Head Selection Routing Protocol for Wireless Sensor Networks

Sohel Rana, Ali Newaz Bahar, Nazrul Islam, Johirul Islam

Статья научная

The Wireless Sensor Network (WSN) is made up with small batteries powered sensor devices with lim-ited energy resources within it. These sensor nodes are used to monitor physical or environmental conditions and to pass their data through the wireless network to the main location. One of the crucial issues in wireless sensor network is to create a more energy efficient system. Clustering is one kind of mechanism in Wireless Sensor Networks to prolong the network lifetime and to reduce network energy consumption. In this paper, we propose a new routing protocol called Fuzzy Based Energy Effi-cient Multiple Cluster Head Selection Routing Protocol (FEMCHRP) for Wireless Sensor Network. The routing process involves the Clustering of nodes and the selection of Cluster Head (CH) nodes of these clusters which sends all the information to the Cluster Head Leader (CHL). After that, the cluster head leaders send aggregated data to the Base Station (BS). The selection of cluster heads and cluster head leaders is performed by using fuzzy logic and the data transmission process is performed by shortest energy path which is selected applying Dijkstra Algorithm. The simulation results of this research are compared with other protocols BCDCP, CELRP and ECHERP to evaluate the performance of the proposed routing protocol. The evaluation concludes that the proposed routing protocol is better in prolonging network lifetime and balancing energy consumption.

Бесплатно

Fuzzy Membership Function in a Trust Based AODV for MANET

Fuzzy Membership Function in a Trust Based AODV for MANET

Partha Sarathi Banerjee, J. Paulchoudhury, S. R. Bhadra Chaudhuri

Статья научная

Security issues have been emphasized in MANET due to its vulnerability to unauthorised access and unshielded broadcasting nature of communication. In this paper we present a trust based AODV for MANET. The trust takes into account the eligible neighbours based on reliability, residual energy, and speed. Thus our algorithm provides a reliable, energy efficient routing technique. The multi-criteria trust values are calculated using fuzzy-logic. This algorithm is capable of putting aside the selfish nodes. As only trusted neighbours are selected for packet delivery, energy consumption also diminishes because the transmitting node does not need to deliver packets to the untrusted neighbours. Less number of transmissions renders low energy consumption. Absence of selfish nodes in the selected neighbours at every hop provides better packet delivery and hence better throughput.

Бесплатно

Fuzzy rule based inference system for implementation of naval military mission

Fuzzy rule based inference system for implementation of naval military mission

Rashmi Singh, Vipin Saxena

Статья научная

Naval military units are convoluted frameworks required to work in specific time periods in seaward assignments where support operations are radically restricted. A decline at the time of mission is an analytical fact that can radically impact the mission achievement. The choice of changing a unit to a mission subsequently requires complex judgments including data about the well being status of hardware and the natural conditions. The present system expects to help the choice about changing a unit to a mission considering that ambiguity and unpredictability of information by methods of fuzzy concepts and imitates the selection procedure of a human trained by means of a rule-based inference system. A numerical application is introduced to demonstrate the viability of the approach.

Бесплатно

GAFBone: A New Backbone Construction for Increasing Lifetime in Wireless Sensor Networks

GAFBone: A New Backbone Construction for Increasing Lifetime in Wireless Sensor Networks

Leily A.Bakhtiar, Somayyeh Jafarali Jassbi

Статья научная

Wireless sensor networks, which have been used in many applications in recent years, consist of tiny sensor nodes with restriction in processing ability and the battery unit. Because of that, one of the crucial problems in this field is power consumption and network lifetime. Geographic Adaptive Fidelity is a routing protocol which tries to reduce energy consumption by powering off unnecessary nodes. In this paper, we proposed a new backbone algorithm for this protocol to saving more energy which causes to improving the lifetime and performance of the networks. The results of simulation show that active grids will be halved approximately.

Бесплатно

GDAR: A Secure Authentication for Dapp Interoperability in Blockchain

GDAR: A Secure Authentication for Dapp Interoperability in Blockchain

Surekha Thota, Shantala Devi Patil, Gopal Krishna Shyam, Bhanu Prasad

Статья научная

Enterprises are adopting blockchain technology to build a server-less and trust-less system by assuring immutability and are contributing to blockchain research, innovation, and implementation. This led to the genesis of various decentralized blockchain platforms and applications that are unconnected with each other. Interoperability between these siloed blockchains is a must to reach its full potential. To facilitate mass adoption, technology should have the ability to transact between various decentralized applications (dapps) on the same chain, integrate with existing systems, and initiate transactions on other networks. In our research, we propose a secured authentication mechanism that enables various decentralized applications on the same chain to interact with each other using a global dapp authentication registry (GDAR). We carried out an in-depth performance evaluation and conclude that our proposed mechanism is an operative authentication solution for dapp interoperability.

Бесплатно

GSM Base Stations Location Monitoring using Geographic Information System

GSM Base Stations Location Monitoring using Geographic Information System

Kuboye B. M., Dada O. A., Akinwonmi F. C.

Статья научная

Global System for Mobile Communication (GSM) is a digital system developed to meet the desires of the entire public. As the population of a particular area, city or country increases, the number of mobile subscribers increases too. GSM network operators have to reduce congestion on their networks in order to satisfy their subscribers, therefore, a means of monitoring the base stations' locations and the geographical area of where they are located are important factor to achieve this purpose. This work provides a simple step-by-step approach on how to monitor the location of the base stations. A review of GSM and Global Positioning System (GPS) technology and their applications to the Geographic Information System (GIS) are presented. The means of taken the coordinates of base stations using a GPS device is also presented. ESRI's ArcView application software was used to design the map that shows the location of the base station and thereafter was integrated into the web. It concluded with the recommendation to GSM operators in Nigeria. If the recommendations are given necessary attention, the planning and optimization of cell sites will be enhanced and thereby reduce congestion on network. As a result, the performance of Network will improve, and it will give rise to subscribers' satisfaction and increasing profit returns to the operators.

Бесплатно

Galua Field Multipliers Core Generator

Galua Field Multipliers Core Generator

I.M. Zholubak, V.S. Hlukhov

Статья научная

An important part of based on elliptical curves cryptographic data protection is multipliers of Galois fields. For based on elliptical curves digital signatures, not only prime but also extended Galois fields GF(pm) are used. The article provides a theoretical justification for the use of extended Galois fields GF(dm) with characteristics d > 2, and a criterion for determining the best field is presented. With the use of the proposed criterion, the best fields, which are advisable to use in data protection, are determined. Cores (VHDL descriptions of digital units) are considered as structural part of based on FPGA devices. In the article methods for cryptoprocessors cores creating were analyzed. The article describes the generator of VHDL descriptions of extended Galois field multipliers with big characteristic (up to 2998). The use of mathematical packages for calculations to improve the quality of information security is also considered. The Galois field multipliers generator creates the VHDL description of multipliers schemes, describes connections of their parts and generates VHDL descriptions of these parts as result of Quine-McCluskey Boolean functions minimization method. However, the execution time of the algorithm increases with increasing amount of input data. Accordingly, generating field multipliers with large characteristic can take frерom a few seconds to several tens of seconds. It's important to simplify the design and minimize logic gates number in a field programmable gate array (FPGA) because it will speed up the operation of multipliers. The generator creates multipliers according to the three variants. The efficiency of using multipliers for fields with different characteristics was compared in article. The expediency of using extended Galois fields GF(dm) with characteristics d > 2 in data protection tools is analyzed, a criterion for comparing data protection tools based on such Galois fields is determined, and the best fields according to the selected criterion when implemented according to a certain algorithm are determined.

Бесплатно

Generalized Galois-Fibonacci Matrix Generators Pseudo-Random Sequences

Generalized Galois-Fibonacci Matrix Generators Pseudo-Random Sequences

Anatoly Beletsky

Статья научная

The article discusses various options for constructing binary generators of pseudo-random numbers (PRN) based on the so-called generalized Galois and Fibonacci matrices. The terms "Galois matrix" and "Fibonacci matrix" are borrowed from the theory of cryptography, in which the linear feedback shift registers (LFSR) generators of the PRN according to the Galois and Fibonacci schemes are widely used. The matrix generators generate identical PRN sequences as the LFSR generators. The transition from classical to generalized matrix PRN generators (PRNG) is accompanied by expanding the variety of generators, leading to a significant increase in their cryptographic resistance. This effect is achieved both due to the rise in the number of elements forming matrices and because generalized matrices are synthesized based on primitive generating polynomials and polynomials that are not necessarily primitive. Classical LFSR generators of PRN (and their matrix equivalents) have a significant drawback: they are susceptible to Berlekamp-Messi (BM) attacks. Generalized matrix PRNG is free from BM attack. The last property is a consequence of such a feature of the BM algorithm. This algorithm for cracking classical LFSR generators of PRN solves the problem of calculating the only unknown – a primitive polynomial generating the generator. For variants of generalized matrix PRNG, it becomes necessary to determine two unknown parameters: both an irreducible polynomial and a forming element that produces a generalized matrix. This problem turns out to be unsolvable for the BM algorithm since it is designed to calculate only one unknown parameter. The research results are generalized for solving PRNG problems over a Galois field of odd characteristics.

Бесплатно

Generation of An Efficient Digital Watermark Key Based on Honey Comb Polynomial Interpolation Approach

Generation of An Efficient Digital Watermark Key Based on Honey Comb Polynomial Interpolation Approach

G.RoslineNesakumari, V.Vijayakumar, B.V.Ramana Reddy

Статья научная

The present paper provides a new mechanism with two stages for efficient authentication based on Honey Comb Polynomial Interpolation (HCPI) and Morphological Border Sorted Pixel Value Difference (MBSPVD) scheme. A simple polynomial interpolation technique on new hexagonal structure called Honey Comb structure (HCS) is used for generating the key of the digital watermark. The polynomial interpolation gives a high secured key, which is difficult to break. HCS is used in the present paper to select pixel positions for generating the Digital Watermark key (DWK). The significant factor of the present method is, the digital watermark is generated by using DWK. The importance of HCS representation is that it possesses special computational features that are pertinent to the vision process. The HCS has features of higher degree of circular symmetry, uniform connectivity, greater angular resolution, and which leads to reduce storage and computation in image processing operations. The DWK is placed in the image by using MBSPVD method. Its guarantees high authentication, robustness, security and copyright protection. The Lagrange Polynomial interpolation (LPI) is used for retrieving the digital watermark from the DWK. The LPI accomplish the aim of image authentication and protection without reducing the image quality. The proposed HCPI-MBSPVD is tested with various attacks and compared with various existing image authentication and copyright protection methods. The comparisons and results indicate the efficacy of the proposed method.

Бесплатно

Журнал