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

Все статьи: 1066

Optimization of Routing in Distributed Sensor Networks Using Heuristic Technique Approach

Optimization of Routing in Distributed Sensor Networks Using Heuristic Technique Approach

Lokesh. B. Bhajantri, Nalini. N

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

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.

Бесплатно

Optimization of Value of Parameters in Ad-hoc on Demand Multipath Distance Vector Routing Using Magnetic Optimization Algorithm

Optimization of Value of Parameters in Ad-hoc on Demand Multipath Distance Vector Routing Using Magnetic Optimization Algorithm

A K Giri, D K Lobiyal, C P Katti

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

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)

Optimization of different queries using optimization algorithm (DE)

Sahil Saharan, J.S. Lather, R. Radhakrishnan

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

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

Optimized Communication of Group Mobility in WPAN

Suman Lata, Naveen Goel

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

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.

Бесплатно

Optimized Parallel Counting Sort Algorithm for Distinct Numeric Values on Biswapped Hyper Hexa-Cell Optoelectronic Network

Optimized Parallel Counting Sort Algorithm for Distinct Numeric Values on Biswapped Hyper Hexa-Cell Optoelectronic Network

Ashish Gupta

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

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

Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network

Bhavana Butani, Piyush Kumar Shukla, Sanjay Silakari

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

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.

Бесплатно

Optimizing Concentric Circular Antenna Arrays for High-Altitude Platforms Wireless Sensor Networks

Optimizing Concentric Circular Antenna Arrays for High-Altitude Platforms Wireless Sensor Networks

Yasser Albagory, Omar Said

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

Wireless Sensor Networks (WSN) has gained interest in many applications and it becomes important to improve its performance. Antennas and communication performance are most important issues of WSN. In this paper, an adaptive concentric circular array (CCA) is proposed to improve the link between the sink and sensor nodes. This technique is applied to the new High – Altitude Platform (HAP) Wireless Sensor Network (WSN). The proposed array technique is applied for two coverage scenarios; a wider coverage cell of 30 km radius and a smaller cell of 8 km radius. The feasibility of the link is discussed where it shows the possibility of communications between the HAP sink station and sensor nodes located on the ground. The proposed CCA array is optimized using a modified Dolph-Chebyshev feeding function. A comparison with conventional antenna models in literature shows that the link performance in terms of bit energy to noise power spectral density ratio can be improved by up to 11.37 dB for cells of 8 km radius and 16.8 dB in the case of 30 km radius cells that make the link at 2.4 GHz feasible and realizable compared to using conventional antenna techniques.

Бесплатно

Optimizing the CMTS to Improve Quality of Service in Next Generation Networks based on ACO Algorithm

Optimizing the CMTS to Improve Quality of Service in Next Generation Networks based on ACO Algorithm

Dac-Nhuong Le

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

In this paper, we focus on the network topological design for providing Quality of Service (QoS) in Next Generation Network (NGN) and propose an effective Ant Colony Optimization (ACO) algorithm to solve the capacitated minimum spanning tree (cMTS) problem in dynamic environment. To improve QoS of communication network with considering the network provisioning capability and dynamic environment, we formulate this problem with minimizing the communication cost (as a kind of performance measures for network's QoS). Our objective functions are determined by pheromone matrix of ants satisfies capacity constraints to find good approximate solutions of cMST problems. Numerical experiments show that our algorithm have achieved much better than recent researches.

Бесплатно

Outlier Detection Technique for Wireless Sensor Network Using GAN with Autoencoder to Increase the Network Lifetime

Outlier Detection Technique for Wireless Sensor Network Using GAN with Autoencoder to Increase the Network Lifetime

Biswaranjan Sarangi, Biswajit Tripathy

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

In wireless sensor networks (WSN), sensor nodes are expected to operate autonomously in a human inaccessible and the hostile environment for which the sensor nodes and communication links are therefore, prone to faults and potential malicious attacks. Sensor readings that differ significantly from the usual pattern of sensed data due to faults in sensor nodes, unreliable communication links, and physical and logical malicious attacks are considered as outliers. This paper presents an outlier detection technique based on deep learning namely, generative adversarial networks (GANs) with autoencoder neural network. The two-level architecture proposed for WSN makes the proposed technique robust. The simulation result indicates improvement in detection accuracy compared to existing state-of-the-art techniques applied for WSNs and increase of the network lifetime. Robustness of outlier detection algorithm with respect to channel fault and robustness concerning different types of distribution of faulty communication channel is analyzed.

Бесплатно

Overview and Comparison of Candidate 5G Waveforms: FBMC, UFMC and F-OFDM

Overview and Comparison of Candidate 5G Waveforms: FBMC, UFMC and F-OFDM

Ali J. Ramadhan

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

The fifth generation (5G) technology standard, utilizing the Internet of Things, promises enhanced communication systems. However, the efficiency expected from such systems entails significant requirements, such as higher data rates and flexibility of the lowest 5G layer. Meeting these requirements in subsequent wireless communication systems is highly dependent on the use of waveforms capable of efficiently enabling multiple access. In other words, proper waveforms determine the effective handling of diverse traffic within a given band. In this study, four candidate multicarrier waveforms, namely filtered orthogonal frequency division multiplexing, filter bank multicarrier, universal filtered multicarrier, and orthogonal frequency division multiplexing, which is currently used in 4G systems, are compared based on multiple parameters. MATLAB simulation results indicate that the waveforms significantly improved spectrum localization and provided appropriate spectrum fragmentation. As these waveforms can mix diverse traffic specifications, they handle the problem of time-frequency synchronization effectively. Therefore, these new waveforms exhibit significant potential in terms of orthogonality and synchronicity and can support numerous users without dropping signals. In addition, they support all applications and scenarios related to multiple-input and multiple-output. The obtained simulation results confirm the suitability of such waveforms for 5G applications and systems.

Бесплатно

PAPR reduction in OFDM system using clipping and filtering methods based on CCDF

PAPR reduction in OFDM system using clipping and filtering methods based on CCDF

Tanvir Ul Haque, Sharif Hossen

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

Wireless communication systems are becoming so promising day-by-day due to the mobility and the dynamicity of communication pattern. But, to fulfill the wide range of user’s demand it has become much important to use some techniques which would be most efficient in terms of bandwidth and speed. The multicarrier strategy, called as orthogonal frequency division multiplexing (OFDM) has outstanding features to fulfill these demands. Multipath fading, delay spread, frequency selective fading and inter channel interference all of these limitations of wireless communication compound it with the scarcity of bandwidth gave rise to OFDM. However, the high peak-to-average power ratio is a great problem or a barrier in OFDM which causes the signal being distorted with the insufficient power at the receiver. There are some specified techniques to minimize it. In this paper, we have used clipping and filtering methods to minimize the effect of peak-to-average power ratio.

Бесплатно

PEECA: PSO-Based Energy Efficient Clustering Algorithm for Wireless Sensor Networks

PEECA: PSO-Based Energy Efficient Clustering Algorithm for Wireless Sensor Networks

Santar Pal Singh, Subhash Chander Sharma

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

In previous years, wireless sensor networks (WSNs) have fascinated lot of consideration from the scientific and technical society. The distributed characteristics and dynamic topology of sensor networks initiates very peculiar necessities in routing schemes that supposed to be met. The key feature of efficient routing protocol is energy expenditure and extension in lifetime of network. In past few years, various routing algorithms have been presented for WSNs. In this work, we focus on cluster based routing algorithms and propose a new algorithm for routing in WSNs. We perform the analysis of our new cluster based algorithms with existing algorithm on the basis of performance metrics. Simulation results shows that proposed algorithm outperform the other existing algorithms of his category.

Бесплатно

PNFEA: A Proposal Approach for Proactive Network Forensics Evidence Analysis to Resolve Cyber Crimes

PNFEA: A Proposal Approach for Proactive Network Forensics Evidence Analysis to Resolve Cyber Crimes

Mohammad Rasmi, Ahmad Al-Qerem

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

Nowadays, cyber crimes are increasing and have affected large organizations with highly sensitive information. Consequently, the affected organizations spent more resources analyzing the cyber crimes rather than detecting and preventing these crimes. Network forensics plays an important role in investigating cyber crimes; it helps organizations resolve cyber crimes as soon as possible without incurring a significant loss. This paper proposes a new approach to analyze cyber crime evidence. The proposed approach aims to use cyber crime evidence to reconstruct useful attack evidence. Moreover, it helps investigators to resolve cyber crime efficiently. The results of the comparison of the proposed approach prove that it is more efficient in terms of time and cost compared with the generic and the modern process approach for network forensics.

Бесплатно

PSO and TLBO based reliable placement of controllers in SDN

PSO and TLBO based reliable placement of controllers in SDN

Ashutosh Kumar Singh, Naveen Kumar, Shashank Srivastava

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

SDN (software defined networks) is a programmable network architecture that divides the forwarding plane and control plane. It can centrally manage the network through a software program, i.e., controller. Multiple controllers are required to manage the current software defined WAN. Placing multiple controllers in a network is known as controller placement problem (CPP). Only one controller is not capable to handle the scalability and reliability issues. To tackle these issues, multiple controllers are required. Efficient deployment of controllers in SDN is used to improve the performance and reliability of the network. To the best of our knowledge, this is the first attempt to minimize the total average latency of reliable SDN along with the implementation of TLBO and PSO algorithms to solve CPP. Our experimental results show that TLBO outperforms PSO for publicly available topologies.

Бесплатно

Parallel prefix sum algorithm on optoelectronic biswapped network hyper hexa-cell

Parallel prefix sum algorithm on optoelectronic biswapped network hyper hexa-cell

Ashish Gupta, Bikash Kanti Sarkar

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

The biswapped network hyper hexa-cell is recently reported optoelectronic network architecture for delivering excellent performance especially for mapping numerical problems which demands frequent routing and broadcasting. This network contains some important benefits such as smaller diameter, higher bisection width, and lower network’s total and optical cost as compared to counter-part OTIS hyper hexa-cell network. It is also advantageous as compared to the traditional biswapped network mesh containing smaller diameter and higher minimum node degree. In this paper, we present a parallel algorithm for mapping prefix sum of 2×(6×2^(d_h-1) )^2 data elements on a dh-dimensional biswapped network hyper hexa-cell of2〖×(6×2^(d_h-1) )〗^2 processors (assuming each processor contain single data element). It demands total ((d_h- 1)×(d_h+ 1))- ((d_h- 1)×(d_h- 2))/2+ 5d_h + 10 intra-cluster (electronic) and 3 inter-cluster (optical) moves.

Бесплатно

Parameter training in MANET using artificial neural network

Parameter training in MANET using artificial neural network

Baisakhi Chatterjee, Himadri Nath Saha

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

The study of convenient methods of information dissemination has been a vital research area for years. Mobile ad hoc networks (MANET) have revolutionized our society due to their self-configuring, infrastructure-less decentralized modes of communication and thus researchers have focused on finding better and better ways to fully utilize the potential of MANETs. The recent advent of modern machine learning techniques has made it possible to apply artificial intelligence to develop better protocols for this purpose. In this paper, we expand our previous work which developed a clustering algorithm that used weight-based parameters to select cluster heads and use Artificial Neural Network to train a model to accurately predict the scale of the weights required for different network topologies.

Бесплатно

Particle Swarm Optimization for Multi-constrained Routing in Telecommunication Networks

Particle Swarm Optimization for Multi-constrained Routing in Telecommunication Networks

Hongyan Cui, Jian Li, Xiang Liu, Yunlong Cai

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

By our analysis, the QoS routing is the optimization problem under the satisfaction of multiple QoS constraints. The Particles Swarm Optimization (PSO) is an optimization algorithm which has been applied to finding shortest path in the network. However, it might fall into local optimal solution, and is not able to solve the routing based on multiple constraints. To tackle this problem, we propose a new method of solving the multiple constraints routing. This paper firstly sets up a multi constrained QoS routing model and constructs the fitness value function by transforming the QoS constraints with a penalty function. Secondly, the iterative formulas of the original PSO are improved to tailor to non-continuous search space of the routing problem. Finally, the natural selection and mutation ideas of the Genetic Algorithm (GA) are applied to the PSO to improve the convergent performance. The simulation results show that the proposed GA-PSO algorithm can not only successfully solve the multi-constrained QoS routing problem, but also achieves a better effect in the success rate of the searching optimal path.

Бесплатно

Password Hardened Biometric: A Complete Solution of Online Security

Password Hardened Biometric: A Complete Solution of Online Security

Ajay Sharma, Deo Brat Ojha

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

In present epoch, secure online access to enterprises resources is very important for any organization. To protect valuable data become one of the big challenge for today's business as enterprise customers or clients involved in business-to-customer (B2C) and business-to-business (B2B) e-commerce need to feel that their transactions are secured from system hackers. Biometric technology provides a solution to this problem in enterprise network security. In this article we enhance the security of online transaction using secure and unique biometric template. The uniqueness of our process is that we store biometric template and password together in encrypted form both without the fusion of score level and decision level, which leads a successful way to combine multiple technologies, different from earlier methods. Password hardened biometric system helps to generate many different secure biometric templates for the same biometric system. It also generates unique biometric templates for multiple biometric systems from the same biometric trait.

Бесплатно

Password Security: An Analysis of Password Strengths and Vulnerabilities

Password Security: An Analysis of Password Strengths and Vulnerabilities

Katha Chanda

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

Passwords can be used to gain access to specific data, an account, a computer system or a protected space. A single user may have multiple accounts that are protected by passwords. Research shows that users tend to keep same or similar passwords for different accounts with little differences. Once a single password becomes known, a number of accounts can be compromised. This paper deals with password security, a close look at what goes into making a password strong and the difficulty involved in breaking a password. The following sections discuss related work and prove graphically and mathematically the different aspects of password securities, overlooked vulnerabilities and the importance of passwords that are widely ignored. This work describes tests that were carried out to evaluate the resistance of passwords of varying strength against brute force attacks. It also discusses overlooked parameters such as entropy and how it ties in to password strength. This work also discusses the password composition enforcement of different popular websites and then presents a system designed to provide an adaptive and effective measure of password strength. This paper contributes toward minimizing the risk posed by those seeking to expose sensitive digital data. It provides solutions for making password breaking more difficult as well as convinces users to choose and set hard-to-break passwords.

Бесплатно

Patch Based Sclera and Periocular Biometrics Using Deep Learning

Patch Based Sclera and Periocular Biometrics Using Deep Learning

V. Sandhya, Nagaratna P. Hegde

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

Biometric authentication has become an essential security aspect in today's digitized world. As limitations of the Unimodal biometric system increased, the need for multimodal biometric has become more popular. More research has been done on multimodal biometric systems for the past decade. sclera and periocular biometrics have gained more attention. The segmentation of sclera is a complex task as there is a chance of losing some of the features of sclera vessel patterns. In this paper we proposed a patch-based sclera and periocular segmentation. Experiments was conducted on sclera patches, periocular patches and sclera-periocular patches. These sclera and periocular patches are trained using deep learning neural networks. The deep learning network CNN is applied individually for sclera and periocular patches, on a combination of three Data set. The data set has images with occlusions and spectacles. The accuracy of the proposed sclera-periocular patches is 97.3%. The performance of the proposed patch-based system is better than the traditional segmentation methods.

Бесплатно

Журнал