Статьи журнала - International Journal of Computer Network and Information Security
Все статьи: 1110
Omni Directional Antenna Assisted Scheme to Minimize Redundancy in Wireless Sensor Networks
Статья научная
Wireless Sensor Networks (WSNs) incorporate smart antennas for information propagation to offer connected coverage with reduced interference. This paper presents an omni directional antenna assisted scheme for WSNs to reduce network redundancy besides offering connected coverage. The directivity of an omni directional antenna outfitted on a sink node is exploited to reduce network redundancy and at the same time the connectivity of sensor nodes with the sink node is retained. The relationship between lobe count, beam width, rotation angle and directivity of an omni directional antenna in context of sensor networks is also discussed. Simulation results show a significant reduction in overall network redundancy if the rotation angle of the omni directional antenna fitted on the sink node is minimized from 360° to 30°
Бесплатно
On Classical Cryptographic Protocols in Post-Quantum World
Статья научная
In post-quantum approach, we consider classical (non-quantum) protocols and primitives which are run by honest parties on classical computers and our aim is to keep their security in an environment where the adversary can rely on quantum computers [3]. In particular, even a harder goal is set by requiring provable security guaranties in a concurrent running environment as we aim computational UC-security. Unruh [16] conjectured that classical arguments of computational UC-security remain usable in a post-quantum world as long as the underlying computational UC-secure primitives are also computationally quantum UC-secure. Our proposed technique (full factorization) aims at reducing the original protocol into a statistically-secure protocol by turning the protocol into a hybrid one where all cryptographic primitives are substituted by appropriate ideal functionalities. The considered set of primitives consists of secret key and public key encryption as well as digital signature. This way and by applying the Unruh's Quantum Lifting Theorem as well as the Quantum Universal Composition Theorem we gain a computationally quantum UC-secure protocol from a classical UC-secure protocol. We consider quantum standard-security, where the adversary can send only classical inputs to honest algorithms, i.e. honest machines cannot receive quantum superposition of inputs If we add also the practical need of efficiency our example is the class of protocols built from symmetric key primitives. A practical (fast) implementation could be based on AES encryption algorithm with appropriate key size as long as we live with the wide belief that this algorithm is secure against a quantum adversary.
Бесплатно
On Maxima Distribution of Full Differentials and Linear Hulls of Block Symmetric Ciphers
Статья научная
The problem of determination of maxima dis-tribution laws of full differentials and linear bias of block symmetric ciphers as substitution transformations is con-sidered. Well-known theoretical results, published in lit-erature, are given, as well as experiment results on mak-ing the laws of maxima distribution of full differential transitions and maximum biasess of linear hulls for re-duced cipher model from Belorussian standard and cipher Kalina, which practically confirm theoretical calculations, are presented. The results testify that maximum values of differential and linear probabilities are concentrated close to their average values and for evaluation of indexes of cipher provable security it's enough to make a test of proximity of differential and linear cipher indexes, re-ceived for one arbitrarily taken cipher key corresponding to indexes of random substitutions.
Бесплатно
On Statistical Behavioral Investigations of Body Movements of Human Body Area Channel
Статья научная
A statistical characterization of body surface to external communication of Body Area Network is investigated for movement of human body in different directions i.e. 00, 900, 1800 and 2700, with respect to the transmitting antenna. The NICT's statistical model is used to carry out measurement in ultra-wideband (UWB) range. The important parameters that capture the variability of the delay profile over the channel e.g. mean delay spread and RMS delay spread of power delay profile (PDP) is presented. The probability density (PDF) and cumulative distribution (CDF) function of the output signal to noise ratio (SNR) have been computed. The performance of Selective Rake (S-Rake) and Partial rake (P-Rake) receiver structure that employs maximal-ratio combining (MRC) is investigated for varying number of fingers taps.
Бесплатно
On a Novel Grid Computing-Based Distributed Brute-force Attack Scheme (GCDBF) By Exploiting Botnets
Статья научная
Brute-force attacks are known to be the promising way to break into even most complicated systems by trying every possible permutation of the keys. But since cryptosystems began to use longer and more complex keys, brute-force attacks has lost their usability, because of relatively high complexity of trying every possible permutation with respect to computational power and computation time that was available to crypto breakers. Although computational power is increasing continuously, its increasing rate is less than that of key length and complexity. Having these assumptions in mind, it is infeasible for centralized traditional computing architectures with limited computation power to break into modern cryptosystem by compromising the key with implementing schemes like conventional brute-force. In this paper authors aim for devising a novel brute-force scheme which integrates a modern computing architecture (grid computing) with botnets in order to perform brute-force attacks with lower computation time and lower equipment cost for individual cryptobreakers who have no access to supercomputers. In summary, GCDBF uses a portion of computation power of each of the infected nodes belonging to a botnet in a grid-based environment in order to process a portion of total workload of a brute-force attack which is needed for breaking a specific key. This approach neutralizes the need of acquiring supercomputers for individual hackers while reducing the required time for breaking the key because of using grid computing architecture. For the purpose of evaluation, GCDBF is implemented in different scenarios to prove its performance in comparison to centralized brute-force scheme.
Бесплатно
Статья научная
We Study the performance of priority–based virtual channels scheduling algorithm in packet telemetry system. Probability of occupying physical channel by the virtual channel with the highest priority is considered, on condition that the packet arrival rate contribution is Poisson distribution. Packets losing rate of the virtual channel with the highest priority is also investigated, of which calculating formulas are given. An interesting conclusion is made by theoretical analysis and simulation experiments that when the running time of the scheduling module is long enough, both the probability of being scheduled and packets losing rate of the virtual channel with the highest priority converge on fixed values, which can offer reference to engineering design.
Бесплатно
On the impact of perceived vulnerability in the adoption of information systems security innovations
Статья научная
A number of determinants predict the adoption of Information Systems (IS) security innovations. Amongst, perceived vulnerability of IS security threats has been examined in a number of past explorations. In this research, we examined the processes pursued in analysing the relationship between perceived vulnerability of IS security threats and the adoption of IS security innovations. The study uses Systematic Literature Review (SLR) method to evaluate the practice involved in examining perceived vulnerability on IS security innovation adoption. The SLR findings revealed the appropriateness of the existing empirical investigations of the relationship between perceived vulnerability of IS security threats on IS security innovation adoption. Furthermore, the SLR results confirmed that individuals who perceives vulnerable to an IS security threat are more likely to engage in the adoption an IS security innovation. In addition, the study validates the past studies on the relationship between perceived vulnerability and IS security innovation adoption.
Бесплатно
Статья научная
The application of technology in various fields makes mobility even higher, one of them is by making a website for exchange and manage information. However, with information disclosure causing security and protection issues to be considered. One of the website security techniques can be done by using the penetration testing method to know the vulnerability of the system. This study will implement tools with the Open Source Intelligence concept, namely Maltego as a medium for conducting security testing and using the OWASP version 4 framework as a standardization of steps taken when security test goes on. This study will focus on information gathering security testing of important factor of the X Company's website. The results of testing and analysis with the OWASP version 4 framework with the Testing for Information Gathering module show that the web application system used by X Company has information vulnerability of the used web server version, GET and POST requests, URL systematics, website framework, website builder component, and the outline of the website architecture. The researcher gave several recommendations related to the vulnerability of the website which later can be used by X Company website administrators to improve website security and protection.
Бесплатно
OpenFlow Technology: A Journey of Simulation Tools
Статья научная
This paper presents a complete guideline for developing OpenFlow infrastructure. OpenFlow is standard network protocol to manage traffic between routers and Ethernet Switches. This approach will help to create the next generation virtual network, which provides the solution for network management, flow control of packets, delay optimization etc without interfering the backbone network. Here a brief idea about all the supporting tools involved in the journey of OpenFlow has been introduced. This paper provides a solution with top to bottom approach to install OpenFlow network tools. On the basis of one by one approach user is able to solve the problem appeared during the installation with proper justifications.
Бесплатно
Optimal Route Based Advanced Algorithm using Hot Link Split Multi-Path Routing Algorithm
Статья научная
Present research work describes advancement in standard routing protocol AODV for mobile ad-hoc networks. Our mechanism sets up multiple optimal paths with the criteria of bandwidth and delay to store multiple optimal paths in the network. At time of link failure, it will switch to next available path. We have used the information that we get in the RREQ packet and also send RREP packet to more than one path, to set up multiple paths, It reduces overhead of local route discovery at the time of link failure and because of this End to End Delay and Drop Ratio decreases. The main feature of our mechanism is its simplicity and improved efficiency. This evaluates through simulations the performance of the AODV routing protocol including our scheme and we compare it with HLSMPRA (Hot Link Split Multi-Path Routing Algorithm) Algorithm. Indeed, our scheme reduces routing load of network, end to end delay, packet drop ratio, and route error sent. The simulations have been performed using network simulator OPNET. The network simulator OPNET is discrete event simulation software for network simulations which means it simulates events not only sending and receiving packets but also forwarding and dropping packets. This modified algorithm has improved efficiency, with more reliability than Previous Algorithm.
Бесплатно
Optimization Modeling for GM(1,1) Model Based on BP Neural Network
Статья научная
In grey theory, GM(1,1) model is widely discussed and studied. The purpose of GM(1,1) model is to work on system forecasting with poor, incomplete or uncertain messages. The parameters estimation is an important factor for the GM(1,1) model, thus improving estimation method to enhance the model forecasting accuracy becomes a hot topic of researchers. This study proposes an optimization method for GM(1,1) model based on BP neural network. The GM(1,1) model is mapped to a BP neural network, the corresponding relation between GM(1,1) model parameters and BP network weights is established, the GM(1,1) model parameters estimation problem is transformed into an optimization problem for the weights of neural network. The BP neural network is trained by use of BP algorithm, when the BP network convergence, optimization model parameters can be extracted, and the optimization modeling for GM(1,1) Model based on BP algorithm can be also realized. The experiment results show that the method is feasible and effective, the precision is higher than the traditional method and other optimization modeling methods.
Бесплатно
Optimization of Maintenance Task Interval of Aircraft Systems
Статья научная
Maintenance accounts for approximately 20% of the operational cost of aircraft; a margin higher than cost associated with fuel, crew, navigation, and landing fees. A significant percentage of maintenance cost is attributed to failures of aircraft components and systems. These failures are random and provide a database which can further be analyzed to aid decision-making for maintenance optimization. In this paper, stochastic mathematical models which can potentially be used to optimize maintenance task intervals of aircraft systems are developed. The initial data for this research are diagnostic variables and reliability parameters which formed the basis for selecting the probability density function for time between failures according to the exponential and Erlang models. Based on the probability density functions, the efficiency of the maintenance processes was calculated using average operational cost per unit time. The results of the analysis were further tested using the Monte Carlo simulation method and the findings are highlighted in this paper. The simulation results compared favorably with analytical results obtained using already existing Monte Carlo techniques to about 82% accuracy. The proposed mathematical optimization models determine the optimal aircraft maintenance task interval which is cost effective while considering safety and reliability requirements; our results can also be applied during the development, design, and operation phases of aircraft systems.
Бесплатно
Optimization of Routing in Distributed Sensor Networks Using Heuristic Technique Approach
Статья научная
Distributed Sensor Network consists set of distributed nodes having the capability of sensing, computation and wireless communications. Power management, various routing and data dissemination protocols have been specifically designed for DSN, where energy consumption is an essential design issues for routing. Optimization of routing method is an essential for routing of DSN because of long communication distances between distributed sensor nodes and sink node in a network can greatly drain the energy of sensors and decrease the lifetime of the network. In this paper, simulation is carried out for optimization of routing in DSNs using MATLAB software. The objective is to maximize the network life time and improve the energy efficiency using heuristic technique. A proposed Genetic Algorithm based routing protocol is used for solving an optimization through the evolution of genes parameters, which are coded by strings of characters or numbers and genetic operations (selection, crossover and mutation) are iterated. Finally, the performance parameters for the proposed scheme are evaluated and are shown in terms of energy and routing efficiency, time computation and network lifetime.
Бесплатно
Статья научная
Vehicular Ad-hoc Networks is one of the emerging research areas of Mobile ad- hoc network. One of the key problems of VANET is changing topology of vehicles which leads to frequent disconnections. Therefore, for communication among the running vehicles, routing of the message becomes a challenging problem. Although, many routing protocols have been proposed in the literatures, but the performance of these protocols, in different scenarios, depends on the value of parameters used in. The objective of our work is to find best fitness function value for Ad-hoc on demand multipath distance vector routing protocol, in real scenario map by obtaining an optimal value of parameters using Magnetic Optimization Algorithm. Therefore, in this paper, we have proposed an algorithm based on Magnetic Optimization Algorithm which finds the optimal value of parameters for Ad-hoc on demand multipath distance vector routing protocol in a given scenario. The fitness function guides Magnetic Optimization Algorithm to achieve the best fitness value. The experimental results, using the optimal value of parameters obtained by Magnetic Optimization Algorithm, show 81.41% drop in average end-to-end delay, 39.24 % drop in Normalized Routing Loads, and slight rise (0.77%) in the packet delivery ratio as compared to using default value of parameters in Ad-hoc on demand multipath distance vector routing protocol.
Бесплатно
Optimization of different queries using optimization algorithm (DE)
Статья научная
The biggest challenge in modern web is to tackle tremendous growth of data, scattered and continuously updating in nature. Processing of such unscattered data by human or machine remains a tedious task. Semantic Web; as a solution has already been invented. But, still there are some other challenges, like as optimization of the query. We introduce a new approach for real–time SPARQL query optimization with different forms and different triple patterns. The strategy introduces rearrangement of order of triple pattern using Differential Evolution(DE). The experimental study focus on main-memory model of RDF data and ARQ query engine of Jena. We compare the result of proposed approach with the Ant Colony Optimization(ACO) different versions and some other approaches. Results shows that proposed approach provides better execution time as compare to the other approaches.
Бесплатно
Optimized Communication of Group Mobility in WPAN
Статья научная
ZigBee is a low cost, low-power consumption and long battery life network that is based on the IEEE 802.15.4 standard; which is most usually used to transfer low data rates information in the Wireless Personal Area Network (WPAN). In the Wireless Personal Area Network (WPAN) network, capability of sensor network and mobile network are combined that have energy limit and sensing range limits. Here a network is composed of a number of Sub-Network or groups with the selection of group leader. Group formation is defined under sensing range limit, density limit and type of nodes. The selection of group leader is defined under velocity analysis, energy and average distance after that inter group and intra group communication is performed and then Handoff mechanism is performed when nodes switch the group or group switch the base station.
Бесплатно
Статья научная
Transmission control protocol (TCP) is the most common protocol found in recent networks to maintain reliable communication. The most popular transport protocol in use today is TCP that cannot fully utilize the ability of the network because of the constraints of its conservative congestion control algorithm and favors reliability over timeliness. Despite congestion is the most frequent cause of lost packets, transmission defects can also result in packet loss. In response to packet loss, end-to-end congestion control mechanism in TCP limits the amount of remarkable, unacknowledged data segments that are permitted in the network. To overcome the drawback, Optimized Extreme Gradient Boosting Algorithm is proposed to predict the congestion. Initially, the data is collected and given to data preprocessing to improve the data quality. Min-Max normalization is used to normalize the data in the particular range and KNN-based missing value imputation is used to replace the missing values in the original data in the preprocessing section. Then the preprocessed data is fed into the Optimized Extreme Gradient Boosting Algorithm to predict the congestion. Remora optimization is used in the designed model for optimally selecting the learning rate to minimize the error for enhancing the prediction accuracy in machine learning. For validating the proposed model, the performance metrics attained by the proposed and existing model are compared. Accuracy, precision, recall and error values for the proposed methods are 96%, 97%, 96% and 3% values are obtained. Thus, the proposed optimized extreme gradient boosting with the remora algorithm for congestion prediction in the transport layer method is the best method than the existing algorithm.
Бесплатно
Статья научная
In fog computing, computing resources are deployed at the network edge, which can include routers, switches, gateways, and even end-user devices. Fog computing focuses on running computations and storing data directly on or near the fog devices themselves. The data processing occurs locally on the device, reducing the reliance on network connectivity and allowing for faster response times. However, the conventional intrusion detection system (IDS) failed to provide security during the data transfer between fog nodes to cloud, fog data centres. So, this work implemented the optimized IDS in fog computing environment (OIDS-FCE) using advanced naturally inspired optimization algorithms with extreme learning. Initially, the data preprocessing operation maintains the uniform characteristics in the dataset by normalizing the columns. Then, comprehensive learning particle swarm based effective seeker optimization (CLPS-ESO) algorithm extracts the intrusion specific features by analyzing the internal patterns of all rows, columns. In addition, automatic termination-based whale optimization algorithm (ATWOA) selects the best intrusion features from CLPS-ESO resultant features using correlation analysis. Finally, the hybrid extreme learning machine (HELM) classifies the varies instruction types from ATWOA optimal features. The simulation results show that the proposed OIDS-FCE achieved 98.52% accuracy, 96.38% precision, 95.50% of recall, and 95.90% of F1-score using UNSW-NB dataset, which are higher than other artificial intelligence IDS models.
Бесплатно
Статья научная
The optoelectronic Biswapped-Hyper Hexa-Cell is a recently reported recursive and a symmetrical architecture of Biswapped Family. This symmetrical network has claimed and proved to be advantageous in terms of network diameter, bisection width, minimum node-degree and network cost compared to its counterpart architecture of OTIS family named ‘OTIS Hyper Hexa-Cell’ and traditional grid-based architecture of Biswapped family named ‘Biswapped-Mesh’. In this paper, we present a novel and efficient parallel algorithm for counting sort for sorting distinct numeric values on dh-dimensional Biswapped-Hyper Hexa-Cell optoelectronic network. The parallel algorithm demands 10d_h+12+ log_2〖S_A 〗 electronic and 10 optical moves, where SA is the size of count array: Acip[SA], and SA equals to maximal minus minimal numeric value plus one. On the basis of analysis, it is concluded that proposed algorithm delivers better performance since speedup and efficiency improved for worst case scenario (difference between maximal and minimal data values becomes larger) with the increase of only few communication moves required for sorting.
Бесплатно
Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network
Статья научная
Wireless sensor networks (WSNs) are novel large-scale wireless networks that consist of distributed, self organizing, low-power, low-cost, tiny sensor devices to cooperatively collect information through infrastructure less wireless networks. These networks are envisioned to play a crucial role in variety of applications like critical military surveillance applications, forest fire monitoring, commercial applications such as building security monitoring, traffic surveillance, habitat monitoring and smart homes and many more scenarios. Node capture attack is one of the most dreadful security attack exist in wireless sensor networks. An adversary steals cryptographic key or other confidential information like node’s id etc from a captured node to compromise entire network. So, Security of wireless sensor network is an important issue for maintaining confidentiality and integrity of wireless links. Now-a-days, researchers are paying attention towards developing security schemes against Node capture attack. Our survey provides deep insights of existing techniques that enhance the attacking efficiency of the node capture attack in wireless sensor network. It also analyzes various detection and key pre-distribution schemes for inventing a new scheme to improve resilience against node capture attack.
Бесплатно
