International Journal of Computer Network and Information Security @ijcnis
Journal articles - International Journal of Computer Network and Information Security
All articles: 1240
Scientific article
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.
Free
Genetic Algorithm Based Node Fault Detection and Recovery in Distributed Sensor Networks
Scientific article
Sensor nodes are prone to failure due to energy depletion and some other reasons in Distributed Sensor Networks (DSNs). In this regard fault tolerance of network is essential in distributed sensor environment. Energy efficiency, network or topology control and fault-tolerance are the most important issues in the development of next-generation DSNs. This paper proposes a node fault detection and recovery by using Genetic Algorithm (GA), when some of the sensor nodes faulty in DSN. The main objective of this work is to provide fault tolerance mechanism, which is energy efficient and responsive to network by using GA which is used to detect the faulty of nodes in the network based on the energy depletion of node and link failure between nodes. The proposed fault detection model is used to detect faults at node level and network level faults (link failure and packet error). We have evaluated the performance parameters for the proposed scheme.
Free
Scientific article
Intrusion detection system is the most important part of the network security system because the volume of unauthorized access to the network resources and services increase day by day. In this paper a genetic algorithm based intrusion detection system is proposed to solve the problem of the small disjunct in the decision tree. In this paper genetic algorithm is used to improve the coverage of those rules which are cope with the problem of the small disjunct. The proposed system consists of two modules rule generation phase, and the second module is rule optimization module. We tested the effectiveness of the system with the help of the KDD CUP dataset and the result is compared with the REP Tree, Random Tree, Random Forest, Na?ve Bayes, and the DTLW IDS (decision tree based light weight intrusion detection system). The result shows that the proposed system provide the best result in comparison to the above mentioned classifiers.
Free
Genetic Centralized Dynamic Clustering in Wireless Sensor Networks
Scientific article
In order to minimize the energy consumption involved by communications in wireless sensor networks, the use of clustering has proven to be effective. The problem remains to determine the number of cluster-heads, and their distribution in the network to ensure minimal energy consumption and better coverage networks. Unlike Low-Energy Adaptive Clustering Hierarchy algorithm which fixes in advance the number of cluster-heads, and do not guarantee the coverage of the entire network, in this paper, we proposed a genetic centralized dynamic algorithm (GA)-based clustering approach to optimize the clustering configuration (the number of cluster-heads, their distribution and the cluster-members) to limit node energy consumption and the best coverage. The obtained simulation results show that the proposed technique overcomes the Low-Energy Adaptive Clustering Hierarchy algorithm.
Free
Genetic spectrum assignment model with constraints in cognitive radio networks
Scientific article
The interference constraints of genetic spectrum assignment model in cognitive radio networks are analyzed in this paper. An improved genetic spectrum assignment model is proposed. The population of genetic algorithm is divided into two sets, the feasible spectrum assignment strategies and the randomly updated spectrum assignment strategies. The penalty function is added to the utility function to achieve the spectrum assignment strategy that satisfies the interference constraints and has better fitness. The proposed method is applicable in both the genetic spectrum assignment model and the quantum genetic spectrum assignment mode. It can ensure the randomness of partial chromosomes in the population to some extent, and reduce the computational complexity caused by the constraints-free procedure after the update of population. Simulation results show that the proposed method can achieve better performance than the conventional genetic spectrum assignment model and quantum genetic spectrum assignment model
Free
Geographic Load Balanced Routing in Wireless Sensor Networks
Scientific article
Recently the application domains of wireless sensor networks have grown exponentially. Traditional routing algorithm generates traffic related to route discovery to destination. Geographic routing algorithms exploit location information well but the problem of congestion and collision throttle its full employment for resource constrained wireless sensor networks. In this paper we present a Geographic Load Balanced Routing (GLBR), explores a technique Load balancing for WSNs which can be a viable solution to the challenges of geographic routing. Load balancing can be realized through two approaches. GLBR defines parameters based on communication overhead at sensor nodes and wireless link status through which load can be balanced across whole network. GLBR approach exploits the existing Geographic Routing approach i.e. Greedy forwarding by considering not only the distance between next hop and destination as single parameter for packet forwarding but also consider overhead at node. When load at a node is high GLBR looks for an alternate option for packet forwarding. Thus GLBR divert traffic to obviate congestion and hence avoid disconnections in the network.
Free
Getting Obstacle Avoidance Trajectory of Mobile Beacon for Localization
Scientific article
Localization is one of the most important technologies in wireless sensor network, and mobile beacon assisted localization is a promising localization method. The mobile beacon trajectory planning is a basic and important problem in these methods. There are many obstacles in the real world, which obstruct the moving of mobile beacon. This paper focuses on the obstacle avoidance trajectory planning scheme. After partitioning the deployment area with fixed cell decomposition, the beacon trajectory are divided into global and local trajectory. The approximate shortest global trajectory is obtained by depth-first search, greedy strategy method and ant colony algorithm, while local trajectory is any existing trajectories. Simulation results show that this method can avoid obstacles in the network deployment area, and the smaller cell size leads to longer beacon trajectory and more localizable sensor nodes.
Free
Global Trust: A Trust Model for Cloud Service Selection
Scientific article
Cloud Computing refers to network-based service provided by a large number of computers, sharing computing and storage resources. Combined with on-demand provisioning mechanisms and relied on a pay-per-use business model. The Cloud Computing offers the possibilities to scale rapidly, to store data remotely and to share services in a dynamic environment. However, these benefits can be seen as weaknesses for assuring trust, and providing confidence to the users of service. In this case, some traditional mechanisms to guarantee reliable services are no longer suitable or dynamic enough, and new models need to be developed to fit this paradigm. This study describes the assessment of the trust in the context of Cloud Computing, proposes a new trust model adapted to Cloud environments, and shows some experiments in regards of the proposed solution.
Free
Graph Neural Networks for Predictive Maintenance in IoT Sensor Systems Using Device Telemetry Data
Scientific article
Industrial IoT systems generate massive telemetry streams, requiring intelligent predictive maintenance models to detect failures early, reduce downtime, and improve operational reliability and safety. Traditional approaches employ statistical analysis, sequence segmentation techniques, CNN-LSTM hybrids, and graph-based classification models to capture spatial-temporal dependencies and identify abnormal device behaviour patterns. These methods typically achieve high classification accuracy but often exhibit moderate RUL estimation performance, demonstrating strong fault detection capability across industrial, energy, and smart infrastructure applications. However, static graph structures, limited temporal attention, imbalanced fault distributions, and poor generalization under noisy conditions restrict robustness and real-world deployment scalability. This paper proposes a dynamic graph-based GAT-BiLSTM with cross-attention and gated fusion, achieving 99.50% accuracy and superior RUL prediction stability under noisy conditions. The framework incorporates adaptive adjacency learning and multi-task optimization to enhance predictive maintenance accuracy and robustness in IoT sensor networks.
Free
Graph Structured Data Security using Trusted Third Party Query Process in Cloud Computing
Scientific article
Cloud computing enables the users to outsource and access data economically from the distributed cloud server. Once the data leaves from data owner premises, there is no privacy guarantee from the untrusted parties in cloud storage system. Providing data privacy for the outsourced sensitive data is a challenging task in cloud computing. In this paper we have proposed a Trusted Third party Query Process(TTQP) method to provide data privacy for graph structured outsourced data. This method utilize the encrypted graph frequent features search index list to search the matched query graph features in graph data base. The proposed system has analyzed in terms of different size of data graphs, index storage, query feature size and query execution time. The performance analysis of our proposed system shows, this method is more secure than the existing privacy preserving encrypted Query Graph (PPQG).
Free
Scientific article
Binary code similarity detection (BCSD) is a method for identifying similarities between two or more slices of binary code (machine code or assembly code) without access to their original source code. BCSD is often used in many areas, such as vulnerability detection, plagiarism detection, malware analysis, copyright infringement and software patching. Numerous approaches have been developed in these areas via graph matching and deep learning algorithms. Existing solutions have low detection accuracy and lack cross-architecture analysis. This work introduces a cross-platform graph deep learning-based approach, i.e., GraphConvDeep, which uses graph convolution networks to compute the embedding. The proposed GraphConvDeep approach relies on the control flow graph (CFG) of individual binary functions. By evaluating the distance between two embeddings of functions, the similarity is detected. The experimental results show that GraphConvDeep is better than other cutting-edge methods at accurately detecting similarities, achieving an average accuracy of 95% across different platforms. The analysis shows that the proposed approach achieves better performance with an area under the curve (AUC) value of 96%, particularly in identifying real-world vulnerabilities.
Free
Scientific article
The exponential growth of Internet of Things (IoT) devices necessitates fog computing architectures that balance network performance with energy efficiency and environmental sustainability. Traditional fog node placement algorithms decouple energy considerations from optimization processes, leading to excessive grid dependency and substantial carbon emissions. This research introduces Green D-OXA, a novel energy-efficient algorithm for dynamic fog node placement with integrated renewable energy harvesting in sustainable IoT networks. Green D-OXA extends the bio-inspired OX optimizer through four adaptive mechanisms: energy-aware warm-start initialization, adaptive iteration control, intelligent triggering with renewable energy prediction, and explicit solar-wind harvesting models with battery management. The algorithm formulates continuous multi-objective optimization integrating connectivity, coverage, movement costs, energy consumption, renewable utilization, and carbon reduction. Comprehensive experimental evaluation across five dynamic scenarios mobile fog nodes, equipment failures, time-varying traffic, network expansion, and combined dynamics demonstrates superior performance compared to three established baseline algorithms (SPP-TLBO, CSA-FSPP, SPP-DEA). Green D-OXA achieves 97.8% connectivity, 98.4% coverage, 68.5% renewable energy utilization, and 43.4%-56% CO₂ emission reduction. Scalability analysis from 50 to 1000 nodes confirms practical deploy ability with minimal performance degradation and 3.8%-4.9% energy overhead. Results establish Green D-OXA as an effective solution for sustainable large-scale IoT-fog computing infrastructures, advancing green computing initiatives through intelligent renewable energy integration.
Free
Scientific article
Wireless sensor networks (WSNs), which provide sensing capabilities to Internet of Things (IoT) equipment with limited energy resources, are made up of specialized transducers. Since substitution or re-energizing of batteries in sensor hubs is extremely difficult, power utilization becomes one of the pivotalmattersin WSN. Clustering calculation assumes a significant part in power management for the energy-compelled network. Optimal cluster head selection suitably adjusts the load in the sensor network, thereby reduces the energy consumption and elongates the lifetime of assisted sensors. This article centers around to an appropriate load balancing and routing technique by the utilization recently developed of Elephant Herding Optimization (EHO) algorithm that alternates the cluster location amongst nodes with the highest energy. The Scheme considered various parameter residual energy, initial energy and an optimum number of cluster head for the next cluster heads selection. The proposed model increases the lifetime of the network by keeping more nodes active even after the 2700th round. The experiment results of the trials show that the proposed EHO-based CH selection strategy outperforms the cutting-edge CH selection models.
Free
HTTP Packet Inspection Policy for Improvising Internal Network Security
Scientific article
Past few years the use of Internet and its applications has increased to a great extent. There is also an enormous growth in the establishment of computer networks by large, medium and small organizations, for data transfer and information exchange. Due to this huge growth, incidents of cyber-attacks and security breaches have also increased. Data on a network is transferred using protocols such as Hyper Text Transfer Protocol, which is very vulnerable. Many types of malicious contents are hidden in packets that are transferred over a network or system, which may can to get it slow, crash or buffer overflow etc. Thus it is very important to secure networks from such types of attacks. There are lots of mechanisms available but still they are not good enough because of dynamic environment. Such kind of attacks can be countered by applying appropriate policies on network edge devices like Adaptive Security Appliance, firewalls, web servers, router etc. Also the packets which are transferred between networks, they should deeply inspect for malicious or any insecure contents. In this paper firstly we would study Network security issues and available mechanism to counter them our focus would be on inspecting the HTTP packets deeply by applying policies on ASA. Finally we would use Graphical Network Simulator (GNS3) to test such a policy.
Free
Handover Analysis for Yaw-Shifted High-Altitude Platforms
Scientific article
High-Altitude Platforms (HAP) is an emerging technology for mobile broadband communications and is capable of providing many advantages compared to conventional terrestrial and satellite systems. On the other hand, positional instabilities of HAP affect the system performance greatly. In this paper, a main problem concerning the rotation motion or yaw-shiftof HAP is described, analyzed, and its impact on the handover of cellular systems is also investigated. The total handover due to both user mobility and platform rotational positional instability is discussed and determined. An expression for the number of calls subjected to handover is deduced where it will be a function of users' density and their distribution in the cell, platform angular shift due to rotation, cell geometry, and number of active calling users. The analysis of this number shows the serious effects of the yaw-shift instability on the system performance.
Free
Handover Comparisons of WiMAX and WiMAX Release 2
Scientific article
Internet has become major need of every person. It provides information in a single click, cost effective way of communication with the outside world, gigantic library, social networking, feeds and blogs, satellite TV and business. World has become a global village because of internet. WiMAX is one of the most promising and innovating technology which supports high speed data and multimedia applications like VoIP, Satellite TV and video conferencing. The demand for enlarged coverage and high speed internet made WiMAX services still inadequate to the users. WiMAX Release 2 or WiMAX 2 is 4G technology built on IEEE 802.16m specification that will provide high bandwidth for VoIP and peak download rate up to 300Mbps which is more than double the current WiMAX . This work enlightens features and comparison of WiMAX and WiMAX 2 with respect to different handover schemes, network architecture, bandwidth, spectral efficiency and sector size throughput. Result shows that the WiMAX 2 is similar to WiMAX but with increased bandwidth, 4.5% better spectral efficiency and 28/54 Mbps Sector/site throughput.
Free
Hardware Implementation of Elliptic Curve Cryptography over Binary Field
Scientific article
This paper presents high-performance Elliptic Curve Cryptography (ECC) architecture over binary field, based on the Montgomery scalar multiplication algorithm. The word-serial finite field arithmetic unit (AU) is proposed with the optimized operation scheduling and bit-parallel modular reduction. With a dedicated squarer, the 163-bit point scalar multiplication with coordinate conversion can be done in 20.9μs by the design of one AU, and can be further improved to 11.1μs by the one of three AUs, both using 0.13μm CMOS technology. The comparison with other ECC designs justifies the effectiveness of the proposed architecture in terms of performance and area-time efficiency.
Free
Hardware Implementation of Fidelity based On Demand Routing Protocol in MANETs
Scientific article
With the advent of real applications in fields like defense and domestic fields, MANET is becoming more popular. MANET does not require any infrastructure, moreover it can behave as mobile networks. These features have boosted up the popularity of MANET in the community. As more and more fields get dependent on MANET, the system needs to be more robust and less expensive. For example, in defense field security is the major issue, while in the domestic field maintaining the QoS is the major issue. To commercialize MANET the routing protocols need to be lightweight, secure and the hardware on which it is to be implemented should be low cost at the same time. We propose a lightweight, secure and efficient routing model for MANETs; which uses fidelity to allocate trust to a neighbor, thereby taking the decision whether to send data via that secure neighbor or not. It also uses new packets like report and recommendation that help the protocol to detect and eliminate the malicious nodes from the network. To observe the results we implement this protocol in hardware, on the Arduino platform in ZigBee network. We observe that our protocol exhibits high packet delivery fraction, low normalize routing load and low end to end delay, compared to existing secure routing protocols. Thereby, maintaining a constant tradeoff between the QoS and the security of the network.
Free
Scientific article
We present a new hardware realization of fast elliptic curve Multi-Scalar Point Multiplication (MSPM) using the sum of products expansion of the scalars. In Elliptic curve point Multiplication latency depends on the number of one’s (Hamming Weight) in the binary representation of the scalar multiplier. By reducing the effective number of one’s in the multiplier, the multiplication speed is automatically increased. Therefore we describe a new method of effectively reducing the Hamming weight of the scalar multipliers thereby reduces the number of Point Adders when multi scalar multiplication is needed. The increase in speed achieved outweighs the hardware cost and complexity.
Free
Hashing Key Based Analysis of Polynomial Encryption Standard
Scientific article
In present scenario, where data is transmitted from transmitter end to receiver end, security and authenticity of the data are the major issues. Hence, the need of an efficient technique which can assure secure transmission of data comes into the picture. There are several techniques which have been developed for this purpose over the time. Cryptography is one such technique. In this paper a new model is presented that is based on the implementation of Hash techniques with the Polynomial Message Authenticating scheme to increase the security level of transmission. The comparative analysis of Secure Hash Algorithms i.e. SHA-1 and SHA-256, implemented using Polynomial Message Authenticating scheme, is presented on the basis of different parameters like processing gain, delivery ratio, energy consumed, duty cycle, Hashing length and degree of polynomial.
Free