International Journal of Computer Network and Information Security (IJCNIS)

ISSN: 2074-9090 (Print)

ISSN: 2074-9104 (Online)



Published By: MECS Press

Frequency: 6 issues per year

Number(s) Available: 127

ICV: 2014 8.19

SJR: 2021 0.438

(IJCNIS) in Google Scholar Citations / h5-index

IJCNIS is committed to bridge the theory and practice of computer network and information security. From innovative ideas to specific algorithms and full system implementations, IJCNIS publishes original, peer-reviewed, and high quality articles in the areas of computer network and information security. IJCNIS is well-indexed scholarly journal and is indispensable reading and references for people working at the cutting edge of computer network, information security, and their applications.


IJCNIS has been abstracted or indexed by several world class databases: ScopusSCImago, Google Scholar, Microsoft Academic Search, CrossRef, Baidu Wenku, IndexCopernicus, IET Inspec, EBSCO, VINITI, JournalSeek, ULRICH's Periodicals Directory, WorldCat, Scirus, Academic Journals Database, Stanford University Libraries, Cornell University Library, UniSA Library, CNKI Scholar, ProQuest, J-Gate, ZDB, BASE, OhioLINK, iThenticate, Open Access Articles, Open Science Directory, National Science Library of Chinese Academy of Sciences, The HKU Scholars Hub, etc..

Current Issue - IJCNIS Vol. 15, No. 5, Oct. 2023


D2D Communication Using Distributive Deep Learning with Coot Bird Optimization Algorithm

By Nethravathi H. M. Akhila S. Vinayakumar Ravi

DOI:, Pub. Date: 8 Oct. 2023

D2D (Device-to-device) communication has a major role in communication technology with resource and power allocation being a major attribute of the network. The existing method for D2D communication has several problems like slow convergence, low accuracy, etc. To overcome these, a D2D communication using distributed deep learning with a coot bird optimization algorithm has been proposed. In this work, D2D communication is combined with the Coot Bird Optimization algorithm to enhance the performance of distributed deep learning. Reducing the interference of eNB with the use of deep learning can achieve near-optimal throughput. Distributed deep learning trains the devices as a group and it works independently to reduce the training time of the devices. This model confirms the independent resource allocation with optimized power value and the least Bit Error Rate for D2D communication while sustaining the quality of services. The model is finally trained and tested successfully and is found to work for power allocation with an accuracy of 99.34%, giving the best fitness of 80%, the worst fitness value of 46%, mean value of 6.76 and 0.55 STD value showing better performance compared to the existing works.

[...] Read more.
Integer Programming Models for Task Scheduling and Resource Allocation in Mobile Cloud Computing

By Rasim M. Alguliyev Rashid G. Alakbarov

DOI:, Pub. Date: 8 Oct. 2023

In traditional mobile cloud computing, user tasks are uploaded and processed on a cloud server over the Internet. Due to the recent rapid increase in the number of mobile users connected to the network, due to overload of the Internet communication channels, there are significant delays in the delivery of data processed on cloud servers to the user. Furthermore, it complicates the optimal scheduling of the tasks of many users on cloud servers and the delivery of results. Scheduling is an approach used to reduce the tasks execution time by ensuring a balanced distribution of user tasks on cloud servers. The goal of scheduling is to ensure selection of appropriate resources to handle tasks quickly, taking into account user requirements. Whereas the goal of cloud service providers is to provide users with the required resources through performing effective scheduling so that both the user and the service provider can benefit. The article proposes a scheduling model to reduce processing time, network latency, and power consumption of mobile devices through optimal task placement in the cloudlet network in a mobile cloud computing environment.

[...] Read more.
Method of Calculating Information Protection from Mutual Influence of Users in Social Networks

By Rimvidas Khrashchevskyi Vitaliy Klobukov Valerii Kozlovskyi Volodymyr Akhramovych Serhii Lazarenko

DOI:, Pub. Date: 8 Oct. 2023

Dynamic models of the information security system (DMoISS) in social networks (SN) are studied and the mutual influence between users (MIBU) was taken into account. Also, the stability of the security system (SoSS) was analyzed.
There is a practical interest in studying the behavior of the of SN information security systems (ISS) using parameters of the MIBU. DMoISS in SN in the mathematical sense of this term is considered. A dynamic system is understood as an object or process for which the concept of state is unambiguously defined as a set of certain quantities at a given moment of time and a given law describes the change (evolution) of the initial state over time.
SN is a set of users and connections between them. Individuals, social groups, organizations, cities, countries can be considered as users. Connections are understood not only as MIBU, but also as the exchange of various resources and activities.
Theoretical study of the dynamic behavior of a real object requires the creation of its mathematical model. The procedure of developing the model is to compile mathematical equations based on physical laws. These laws were formulated in the language of differential equations.
As a result of the research it is established the influence of parameters of MIBU on parameters of SN ISS. Phase portraits (PP) of the data protection system in the MatLab/Multisim program are determined, what indicates of the SoSS in the operating range of the parameters even at the maximum value of influences.
This study is useful and important from the point of view of information security in the network, since the parameters of MIBU significantly affect the protection rate (with different values - up to 100%).
The scientific value of the article lies in the fact that for the first time, on the basis of the study of the developed systems of nonlinear differential equations (NDE), it is shown the quantitative relationship between the parameters of the MIBU and the parameters of the SN ISS, as well as the SoSS is shown based on the study of the nonlinear equation of the second degree.

[...] Read more.
Hybrid Energy Regulated Constant Gain Kalman-Filter for Optimized Target Detection and Tracking in Wireless Sensor Networks

By Urvashi Saraswat Anita Yadav Abhishek Bhatia

DOI:, Pub. Date: 8 Oct. 2023

Wireless Sensor Networks (WSNs) are one of the most researched areas worldwide as the wide-scale networks possess low cost, are small in size, consume low power, and can be deployed in various environments. Among various applications of WSNs, target tracking is a highly demanding and broadly investigated application of wireless sensor networks. The parameter of accurate tracking is restricted because of the limited resources present in the wireless sensor networks, noise of the network, environmental factors, and faulty sensor nodes. Our work aims to enhance the accuracy of the tracking process as well as energy utilization by combing the mechanism of clustering with the prediction. Here, we present a hybrid energy-regulated constant gain Kalman filter-based target detection and tracking method, which is an algorithm to make the best use of energy and enhance precision in tracking. Our proposed algorithm is compared with the existing approaches where it is observed that the proposed technique possesses efficient energy utilization by decreasing the transference of unimportant data within the sensor network, achieving accurate results.

[...] Read more.
Flow-aware Segment Routing in SDN-enabled Data Center Networks

By Bommareddy Lokesh Narendran Rajagopalan

DOI:, Pub. Date: 8 Oct. 2023

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.

[...] Read more.
Detection of DDOS Attacks on Cloud Computing Environment Using Altered Convolutional Deep Belief Networks

By S. Sureshkumar G. K. D. Prasanna Venkatesan R. Santhosh

DOI:, Pub. Date: 8 Oct. 2023

The primary benefits of Clouds are that they can elastically scale to meet variable demands and provide corresponding environments for computing. Cloud infrastructures require highest levels of protections from DDoS (Distributed Denial-of-Services). Attacks from DDoSs need to be handled as they jeopardize availability of networks. These attacks are becoming very complex and are evolving at rapid rates making it complex to counter them. Hence, this paper proposes GKDPCAs (Gaussian kernel density peak clustering techniques) and ACDBNs (Altered Convolution Deep Belief Networks) to handle these attacks. DPCAs (density peak clustering algorithms) are used to partition training sets into numerous subgroups with comparable characteristics, which help in minimizing the size of training sets and imbalances in samples. Subset of ACDBNs get trained in each subgroup where FSs (feature selections) of this work are executed using SFOs (Sun-flower Optimizations) which evaluate the integrity of reduced feature subsets. The proposed framework has superior results in its experimental findings while working with NSL-KDD and CICIDS2017 datasets. The resulting overall accuracies, recalls, precisions, and F1-scoresare better than other known classification algorithms. The framework also outperforms other IDTs (intrusion detection techniques) in terms of accuracies, detection rates, and false positive rates.

[...] Read more.
Energy Efficient Resource Allocation in 5G RAN Slicing with Grey Wolf Optimization

By Dhanashree Kulkarni Mithra Venkatesan Anju V. Kulkarni

DOI:, Pub. Date: 8 Oct. 2023

The massive connections and the real time control applications have different requirement on delay, energy, rate and reliability of the system. In order to meet the diversified 5G requirements, network slicing technique guarantees on the wide scale applications. In this paper, we have proposed a dynamic resource allocation system with two time scale. The one time scale is used for the resource allocation in the system and the other is used for optimized use of latency and power. Lyapunov drift function is used for the balance between the power consumption and the user satisfaction. Further, Grey Wolf Optimization (GWO) is used for the resource allocation strategy so as to gain the reliability of the system with heterogeneous requirements. The proposed methodology shows the improvement of 27% in user satisfaction and 17.5% in power consumption. The proposed framework can be utilized for the rate as well as latency sensitive applications in 5G.

[...] Read more.
Ford Fulkerson and Newey West Regression Based Dynamic Load Balancing in Cloud Computing for Data Communication

By Prabhakara B. K. Chandrakant Naikodi Suresh L.

DOI:, Pub. Date: 8 Oct. 2023

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.

[...] Read more.
Dual-discriminator Conditional Generative Adversarial Network Optimized with Hybrid Momentum Search Algorithm and Giza Pyramids Construction Algorithm for Cluster-based Routing in WSN Assisted IoT

By Darshan B. D. Prashanth C. R.

DOI:, Pub. Date: 8 Oct. 2023

Wireless sensor network (WSN) efficiently sends and receives the data on the internet of things (IoT) environment. As a large-scale WSN's nodes are powered by batteries, it is essential to create an energy-efficient system to decrease energy consumption and increase the network's lifespan. The existing methods not present effectual cluster head (CH) selection and trust node computation. Therefore, dual-discriminator conditional generative adversarial network optimized with a hybrid Momentum search algorithm and Giza Pyramids Construction algorithm for Cluster Based Routing in WSN Assisted IoT is proposed in this manuscript, for securing data transmission by identifying the optimum CH in the network (DDcGAN-MSA-GPCA-CBR-WSN-IoT). Initially, the proposed method is acting routing process via cluster head. Therefore, Dual-Discriminator conditional Generative Adversarial Network (DDcGAN) is considered to select the CH depending on multi-objective fitness function. The multi-objective fitness function, such as energy, delay, throughput, distance among the nodes, cluster density, capacity, collision, traffic rate, and cluster density. Based on fitness function, CH is selected. After cluster head selection, a malicious node depends on three parameters: trust, delay, and distance. These three parameters are optimized by hyb MSA-GPCA for ideal trust path selection. The proposed DDcGAN-MSA-GPCA-WSN-IoT technique is activated in PYTHON and network simulator (NS2) tool. Its effectiveness is analyzed under performance metrics, such as number of alive nodes, dead nodes, delay, energy consumption, packet delivery ratio, a lifetime of sensor nodes, and total residual energy. The simulation outcomes display that the proposed method attains lower delay, higher packet delivery ratio and high network lifetime when comparing to the existing models.

[...] Read more.