JOURNAL OF INTERCONNECTION NETWORKS最新文献

Bounds of Two Toughnesses and Binding Numbers for Star Factors 两种韧性的界限和星形因子的结合数

IF 0.7

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2024-01-10 DOI: 10.1142/s0219265923500329

Yujia Gao, Zhen Ji, Xiaojie Sun, Qinghe Tong

引用次数: 0

On the Local Metric Dimension of Graphs 论图形的局部度量维度

IF 0.7

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2024-01-10 DOI: 10.1142/s0219265923500330

Chenxu Yang, Xingchao Deng, Jinxia Liang, Yuhu Liu

引用次数: 0

Some Existence Theorems on Star Factors 关于星形因子的一些存在定理

IF 0.7

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-11-29 DOI: 10.1142/s0219265923500275

Xiumin Wang, Fengyun Ren, Dong He, Ao Tan

引用次数: 0

Krill Herd and Feed Forward Optimization System-Based Routing Protocol for IoT-MANET Environment 面向物联网-MANET 环境的基于克里尔群和前馈优化系统的路由协议

IF 0.7

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-11-27 DOI: 10.1142/s0219265923500305

S. Sugumaran, V. Sivasankaran, M. G. Chitra

{"title":"Krill Herd and Feed Forward Optimization System-Based Routing Protocol for IoT-MANET Environment","authors":"S. Sugumaran, V. Sivasankaran, M. G. Chitra","doi":"10.1142/s0219265923500305","DOIUrl":"https://doi.org/10.1142/s0219265923500305","url":null,"abstract":"The Internet of Things (IoT) is a developing technology in the world of communication and embedded systems. The IoT consists of a wireless sensor network with Internet service. The data size of the sensor node is small, but the routing of the data and energy consumption are important issues that need to be advocated. The Mobile Adhoc Network (MANET) plays a very important role in IoT services. In MANET, nodes are moving within the network. So, routes are created dynamically on demand and do not have any centralized units. The route optimization method addresses issues like selecting the best routes in terms of overhead, loop free, traffic control, balancing, throughput, route maintenance, and so on. In this paper, IoT routes are created between sensors to sink through MANET nodes with WSN routing ideology. The Krill Herd and Feed Forward Optimization (KH-FFO)-based method discovers the routes. The Krill herd algorithm clusters the network. This method increases network speed and reduces energy waste. Feed-forward optimization involves learning all the nodes in the network and identifying the shortest and most energy-efficient route from source to sink. The overall performance of the KH-FFO protocol has improved the network’s capacity, reduced packet loss, and increased the energy utilization of the nodes in the network. The ns-3 simulation for KH-FFO is tested in different node densities and observed energy utilization is increased by 28%, network life is increased by 7%, Packet delivery ratio improved by 7.5%, the End-to-End delay improved by 31% and the Throughput is 3%. These metrices are better than the existing works in the network.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"52 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139230136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Embedding Knödel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis 将克诺德尔图嵌入立方体结构：扩张优化和线长分析

IF 0.7

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-11-24 DOI: 10.1142/s0219265923500317

Remi Mariam Reji, R. Sundara Rajan, T. M. Rajalaxmi

{"title":"Embedding Knödel Graph into Cube-like Architectures: Dilation Optimization and Wirelength Analysis","authors":"Remi Mariam Reji, R. Sundara Rajan, T. M. Rajalaxmi","doi":"10.1142/s0219265923500317","DOIUrl":"https://doi.org/10.1142/s0219265923500317","url":null,"abstract":"An important tool for the execution of parallel algorithms and the simulation of interconnection networks is graph embedding. The quality of an embedding can be assessed using some cost metrics. The dilation and wirelength are the commonly used parameters. The Knödel graph [Formula: see text] is a minimum linear gossip network and has minimum broadcasting. It has [Formula: see text] vertices, [Formula: see text] edges, where [Formula: see text] is even, and [Formula: see text]log[Formula: see text]. In this study, we solve the dilation problem of embedding the Knödel graph into certain cube-like architectures such as hypercube, folded hypercube, and augmented cube. In [G. Fertin, A. Raspaud, A survey on Knödel graphs, Discrete Applied Mathematics 137 (2004) 173–195], it is proved that the dilation of embedding the Knödel graph [Formula: see text] into the hypercube [Formula: see text] is at most [Formula: see text]. In this study, we obtain an improved upper bound for dilation of embedding the Knödel graph into the hypercube and it is equal to [Formula: see text]. Also, we calculate the wirelength of embedding the Knödel graph into the above-said cube-like architectures using dilation.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"27 10","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139240577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Novel Incentive Routing Protocol with Virtual Projection for Mobile Packet Forwarding Nodes in Wireless Sensor Networks 为无线传感器网络中的移动数据包转发节点设计的带虚拟投影的新型激励路由协议

IF 0.7

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-11-18 DOI: 10.1142/s0219265923500287

L. Niranjan, M. Manoj Priyatham

{"title":"A Novel Incentive Routing Protocol with Virtual Projection for Mobile Packet Forwarding Nodes in Wireless Sensor Networks","authors":"L. Niranjan, M. Manoj Priyatham","doi":"10.1142/s0219265923500287","DOIUrl":"https://doi.org/10.1142/s0219265923500287","url":null,"abstract":"The size of the Packet Forwarding Nodes (PFNs) is becoming very small as the technology advances in Wireless Sensor Networks (WSNs). The node has an additional parameter with low energy levels. The PFNs are distributed in a square cross-sectional area with each node acting as a Sensing Point (SP) that can be used for various kinds of applications like temperature, atmospheric humidity, acoustic, and pressure measurements. The packet is divided into several fragments where each fragment is considered as fixed or variable length. Each of these packets is sent over multiple PFNs toward the data center using PFNs. The selection of PFNs in the path is picked based on the trust level. In the network even special PFNs are placed which are responsible to deliver the packets toward the data center without losing the data during the transmission. The selection of special PFNs is done by computing the meeting probability, remaining energy computation, computation of data weight, and security value computation. The proposed Incentive Routing Protocol with Virtual Projection (IRPVP) method is compared with the conventional approaches concerning the parameters like delay, link count, resource energy, healthy PFNs, non-healthy PFNs, health ratio computation, remaining energy, control to data ratio, and balancing factor. The simulation outcomes show that the performance of the proposed IRPVP algorithm is better than the other conventional algorithms.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"15 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139261722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Component Edge Connectivity and Extra Edge Connectivity of Bubble-Sort Star Graphs 冒泡排序星图的分量边连通性和额外边连通性

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-11-10 DOI: 10.1142/s0219265923500299

Xiaohui Hua, Yonghao Lai

引用次数: 0

Hybrid Model-Based Intrusion Detection in Wireless Sensor Network on the Basis of Risk and Link Quality 基于风险和链路质量的无线传感器网络混合模型入侵检测

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-11-08 DOI: 10.1142/s0219265923500214

Ranjeet B. Kagade, N. Vijayaraj

{"title":"Hybrid Model-Based Intrusion Detection in Wireless Sensor Network on the Basis of Risk and Link Quality","authors":"Ranjeet B. Kagade, N. Vijayaraj","doi":"10.1142/s0219265923500214","DOIUrl":"https://doi.org/10.1142/s0219265923500214","url":null,"abstract":"Nowadays, Wireless Sensor Networks (WSN) face more security threats due to the increased service of data transmission at high speed in almost all applications. The security of the network must be ensured by identifying abnormal traffic and current emerging threats. The most promising model for safeguarding the core network from outside attacks is Intrusion Detection Systems (IDS). This work focuses on the introduction of clustering-based intrusion detection in WSN. Initially, clustering takes place, where the nodes are grouped under certain constraints via selecting the optimal Cluster Head (CH). The considered constraints are energy, delay, distance, risk, and link quality. This optimal selection takes place by a new hybrid optimization algorithm termed as Truncate Combined Bald Eagle Optimization (TCBEO) algorithm. The subsequent process is intrusion detection, where a hybrid detection model combining a Convolutional Neural Network (CNN) & Bi-directional Gated Recurrent unit (Bi-GRU) is employed, which is trained with features like improved entropy and correlation taking into consideration of constraints like energy and distance, respectively. Eventually, the suggested work’s effectiveness is affirmed against existing techniques using various performance metrics.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"8 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135392001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Self-Configuration and Self-Healing Framework Using Extreme Gradient Boosting (XGBoost) Classifier for IoT-WSN 基于极限梯度增强(XGBoost)分类器的IoT-WSN自配置自修复框架

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-11-03 DOI: 10.1142/s0219265923500226

M. Ganesh Raja, S. Jeyalaksshmi

{"title":"Self-Configuration and Self-Healing Framework Using Extreme Gradient Boosting (XGBoost) Classifier for IoT-WSN","authors":"M. Ganesh Raja, S. Jeyalaksshmi","doi":"10.1142/s0219265923500226","DOIUrl":"https://doi.org/10.1142/s0219265923500226","url":null,"abstract":"In most Internet of Things (IoT) systems, Quality of service (QoS) must be confirmed with respect to the requirement of implementation domain. The dynamic nature of the IoT surroundings shapes it to complicate the fulfilment of these commitments. A wide range of unpredictable events endanger the quality of service. While execution the self-adaptive schemes handle with system’s unpredictable. In IoT-based Wireless Sensor Networks (WSNs), the significant self-management objectives are self-configuration (SC) and self-healing (SH). In this paper, Self-Configuration and Self-healing Framework using an extreme gradient boosting (XGBoost) Classifier are proposed. In this framework, the IoT traffic classes are categorized as several types under XGBoost classifier. In SC phase, the IoT devices are self-configured by allocating various transmission slots, contention access period (CAPs) on the basis of its categories with priorities. In SH phase, the source node cardinally establishes a confined route retrieval method if the residual power in-between node is truncated or the node has displaced far away. The proposed framework is executed in NS-2 and the results exhibit that the proposed framework has higher packet delivery ratio with reduced packet drops and computational cost. Therefore, the proposed approach has attained 24.7%, 28.9%, 12.75% higher PDR, and 16.8%, 19.87%, and 13.7% higher residual energy than the existing methods like Self-Healing and Seamless Connectivity using Kalman Filter among IoT Networks (SH-SC-KF-IoT), Provenance aware run-time verification mechanism for self-healing IoT (PA-RVM-SH-IoT), and Fully Anonymous Routing Protocol and Self-healing Capacity in Unbalanced Sensor Networks (FARP-SC-USN) methods, respectively.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":"27 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135873445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On the Local Metric Dimension of Line Graphs 关于线形图的局部度量维数

JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2023-10-31 DOI: 10.1142/s0219265923500263

Chenxu Yang, Xingchao Deng, Wen Li

引用次数: 0