Journal of Interconnection Networks
Journal Prestige (SJR): 0.113 Number of Followers: 1 Hybrid journal (It can contain Open Access articles) ISSN (Print) 02192659  ISSN (Online) 17936713 Published by World Scientific [121 journals] 
 Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex
Connection of Some Special Graphs
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang
Abstract: Journal of Interconnection Networks, Ahead of Print.
The proper rainbow vertex connection number of [math], denoted by [math], is the smallest number of colors needed to properly color the vertices of [math] so that [math] is rainbow vertex connected. The proper strong rainbow vertex connection number of [math], denoted by [math], is the smallest number of colors needed to properly color the vertices of [math] so that [math] is strong rainbow vertex connected. These two concepts are inspired by the concept of proper (strong) rainbow connection number of graphs. In this paper, we first determine the values of [math] and [math] for some special graphs, such as all cubic graphs of order [math], pencil graphs, circular ladders or Möbius ladders. Secondly, we obtain the values of [math] and [math] for some special graphs, such as all cubic graphs of order [math], paths, cycles, wheels, complete multipartite graphs, pencil graphs, circular ladders and Möbius ladders. Finally, we characterize all the connected graphs [math] with [math] and [math].
Citation: Journal of Interconnection Networks
PubDate: 20230120T08:00:00Z
DOI: 10.1142/S0219265922500062

 The [math]Connectivity of the Cartesian Product of Trees

Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Hengzhe Li, Jiajia Wang, RongXia Hao
Abstract: Journal of Interconnection Networks, Ahead of Print.
Given a connected graph [math] and [math] with [math], an [math]tree is a such subgraph [math] of [math] that is a tree with [math]. Two [math]trees [math] and [math] are edgedisjoint if [math]. Let [math] be the maximum size of a set of edgedisjoint [math]trees in [math]. The [math]connectivity of [math] is defined as [math]. In this paper, we first show some structural properties of edgedisjoint [math]trees by Fan Lemma and Königore Formula. Then, the [math]connectivity of the Cartesian product of trees is determined. That is, let [math] be trees, then [math] if [math] for each [math], otherwise [math]. As corollaries, [math]connectivity for some graph classes such as hypercubes and meshes can be obtained directly.
Citation: Journal of Interconnection Networks
PubDate: 20230109T08:00:00Z
DOI: 10.1142/S0219265922500074

 Mobile Big Data Analytics for Human Behavior Recognition in Wireless
Sensor Network Based on Transfer Learning
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Zhexiong Cui, Jie Ren
Abstract: Journal of Interconnection Networks, Ahead of Print.
Big data analysis of human behavior can provide the basis and support for the application of various scenarios. Using sensors for human behavior analysis is an effective means of identification method, which is very valuable for research. To address the problems of low recognition accuracy, low recognition efficiency of traditional human behavior recognition (HBR) algorithms in complex scenes, in this paper, we propose an HBR algorithm for Mobile Big data analytics in wireless sensor network using improved transfer learning. First, different wireless sensors are fused to obtain human behavior mobile big data, and then by analyzing the importance of human behavior features (HBF), the dynamic change parameters of HBF extraction threshold are calculated. Second, combined with the dynamic change parameters of threshold, the HBF of complex scenes are extracted. Finally, the best classification function of human behavior in complex scenes is obtained by using the classification function of HBF in complex scenes. Human behavior in complex scenes is classified according to the HBF in the feature set. The HBR algorithm is designed by using the improved transfer learning network to realize the recognition of human behavior in complex scenes. The results show that the proposed algorithm can accurately recognize up to 22 HBF points, and can control the HBR time within 2 s. The human behavior false recognition rate of miscellaneous scenes is less than 10%. The recognition speed is above 10/s, and the recall rate can reach more than 98%, which improves the HBR ability of complex scenes.
Citation: Journal of Interconnection Networks
PubDate: 20230105T08:00:00Z
DOI: 10.1142/S0219265922420038

 MultiScale Segmentation Method of Remote Sensing Big Data Image Using
Deep Learning
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Huiping Li
Abstract: Journal of Interconnection Networks, Ahead of Print.
Remote sensing image (RSI) segmentation is an effective method to interpret remote sensing information and an important means of remote sensing data information processing. Traditional RSI segmentation methods have some problems such as poor segmentation accuracy and low similarity difference measurement. Therefore, we propose a multiscale segmentation (MSS) method for remote sensing big data image. First, the segmentation scale of RSI is divided, and the quantitative value of histogram band is used to calculate the similarity index between different objects; Second, the parameters in the same spot are improved based on the maximum area method to determine the shape factor of RSI; Finally, the object closure model is established to clarify the region conversion cost, and the RSI is dynamically segmented based on Multiscale convolutional neural networks; The MSS algorithm of RSI is designed, and the MSS method of RSI is obtained. The results show that the maximum similarity difference measure of the proposed method is 0.648, and the similarity difference measure always remains the largest. The maximum recall of RSI is 0.954, and the highest recall is 0.988, indicating that the RSI segmentation accuracy of the proposed method is good.
Citation: Journal of Interconnection Networks
PubDate: 20221231T08:00:00Z
DOI: 10.1142/S021926592242004X

 DistanceEdgeMonitoring Sets in Hierarchical and Corona Graphs

Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Gang Yang, Changxiang He
Abstract: Journal of Interconnection Networks, Ahead of Print.
Let [math] and [math] be the vertex set and edge set of graph [math]. Let [math] be the distance between vertices [math] and [math] in the graph [math] and [math] be the graph obtained by deleting edge [math] from [math]. For a vertex set [math] and an edge [math], let [math] be the set of pairs [math] with a vertex [math] and a vertex [math] such that [math]. A vertex set [math] is distanceedgemonitoring set, introduced by Foucaud, Kao, Klasing, Miller, and Ryan, if every edge [math] is monitored by some vertex of [math], that is, the set [math] is nonempty. In this paper, we determine the smallest size of distanceedgemonitoring sets of hierarchical and corona graphs.
Citation: Journal of Interconnection Networks
PubDate: 20221228T08:00:00Z
DOI: 10.1142/S0219265922500037

 Directed Tree Connectivity of Symmetric Digraphs and Complete Bipartite
Digraphs
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Junran Yu
Abstract: Journal of Interconnection Networks, Ahead of Print.
Sun and Yeo introduced the concept of directed tree connectivity, including the generalized [math]vertexstrong connectivity, [math] and generalized [math]arcstrong connectivity, [math] [math], which could be seen as a generalization of classical connectivity of digraphs and a natural extension of the wellestablished undirected tree connectivity. In this paper, we study the directed tree connectivity of symmetric digraphs and complete bipartite digraphs. We give lower bounds for the two parameters [math] and [math] on symmetric digraphs. We also determine the precise values of [math] for every [math] and [math] for [math], where [math] is a complete bipartite digraph of order [math].
Citation: Journal of Interconnection Networks
PubDate: 20221224T08:00:00Z
DOI: 10.1142/S0219265922500086

 EnergyEfficient Model for Intruder Detection Using Wireless Sensor
Network
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Ashok Kumar Rai, A. K. Daniel
Abstract: Journal of Interconnection Networks, Ahead of Print.
A wireless sensor network (WSN) can be used for various purposes, including area monitoring, health care, smart cities, and defence. Numerous complex issues arise in these applications, including energy efficiency, coverage, and intruder detection. Intruder detection is a significant obstacle in various wireless sensor network applications. It causes data fusion that jeopardizes the network’s confidentiality, lifespan, and coverage. Various algorithm has been proposed for intruder detection where each node act as an agent, or some monitoring nodes are deployed for intruder detection. The proposed protocol detects intruders by transmitting a known bit from the Cluster Head (CH) to all nodes. The legal nodes must acknowledge their identification to the CH in order to be valid; otherwise, if the CH receives an incorrect acknowledgement from a node or receives no acknowledgement at all, it is an intruder. The proposed protocol assists in protecting sensor data from unauthorized access and detecting the intruder with its location through the identity of other legal nodes. The simulation results show that the proposed protocol delivers better results for identifying intruders for various parameters.
Citation: Journal of Interconnection Networks
PubDate: 20221219T08:00:00Z
DOI: 10.1142/S0219265921490025

 Wireless Sensor Network Security Analysis for Data and Aggregation

Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Maravarman Manoharan, S. Babu, R. Pitchai
Abstract: Journal of Interconnection Networks, Ahead of Print.
Data security is critical in wireless sensor networks (WSNs) because communication signals are highly available due to data transmission in free space. Attacks ranging from passive eavesdropping to active snooping are more common on these networks. This paper proposes secure data transfer using data encryption based on the improved Rivest–Shamir–Adleman (RSA) with Diffie–Hellman (DH) key exchange algorithm (IRSADH). For this purpose, the adaptive distancebased agglomerative hierarchical (ADAH)based clustering method is used. Then the cluster head (CH) is selected using the improved weightbased rain optimization (IWRO) to improve the network’s lifespan. This study aims to design a secure group communication method for WSNs. In order to generate and distribute the key to the group, the RSA and DH and key exchange algorithm had been hybridized with the Key Management Center (KMC). For safe communication between users, the key exchange technique is investigated. The performance measures such as throughput, packet loss ratio (PLR), packet delivery ratio (PDR), latency, energy consumption, endtoend delay (EED) and network lifetime are analyzed and compared with the existing approaches.
Citation: Journal of Interconnection Networks
PubDate: 20221219T08:00:00Z
DOI: 10.1142/S0219265922500025

 DataDriven Information Management Method of Power Supply Chains Using
Mobile Cloud Computing
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Ma Jingze, Zhan Guoye, Yang Fan, Chen Xingpei
Abstract: Journal of Interconnection Networks, Ahead of Print.
Based on the spring, spring MVC and MyBatis structures of the cloud platform SSM framework, an information management platform for power grid material supply chain is built. The data layer uses a variety of sensors to collect power grid material supply chain information, and the information is fed back to the data storage layer after being integrated by the logical reorganization function of the persistence layer. The data storage layer uses the multisensor supply chain information fusion method based on paste progress to fuse the information and store it in the database. The business logic layer calls the information in the database and uses the improved kmeans clustering algorithm to detect the abnormal supply chain data information. After calculation and data control by the control layer, the data management results are displayed through the presentation layer. The experimental results show that the absolute error of data fusion is very low. It can effectively cluster data information and distinguish outlier anomaly information at the same time, and the effect of information management is good.
Citation: Journal of Interconnection Networks
PubDate: 20221121T08:00:00Z
DOI: 10.1142/S0219265922420026

 Towards Intelligent Control of Beaconing Power and Beaconing Rate in
Vehicular Ad Hoc Networks
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Driss Ait Omar, Hamid Garmani, Mohamed El Amrani, Essaid Azougaghe, Mohamed Baslam, Mostafa Jourhmane
Abstract: Journal of Interconnection Networks, Ahead of Print.
In this paper, to avoid congestion in the wireless channel of vehicular ad hoc networks (VANETs), a joint beaconing rate and beaconing power based on game theory are proposed in this paper. The game is formulated as a noncooperative game, a Bayesian game, and a cooperative game. Three distributed and iterative algorithms (Best Response Algorithm, Fictitious Play Algorithm, and Cooperative Bargaining Algorithm) are proposed for computing the beaconing power and beaconing rate of each vehicle. Extensive simulations show the convergence of a proposed algorithm to the equilibrium beaconing power and beaconing rate and give some insights on how the game parameters may vary the game outcome.
Citation: Journal of Interconnection Networks
PubDate: 20221121T08:00:00Z
DOI: 10.1142/S0219265922500013

 Security and Energy Aware ClusteringBased Routing in Wireless Sensor
Network: Hybrid NatureInspired Algorithm for Optimal Cluster Head
Selection
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Mallanagouda Biradar, Basavaraj Mathapathi
Abstract: Journal of Interconnection Networks, Ahead of Print.
One of the significant approaches in implementing the routing of WSNs is clustering that leads to scalability and extending of network lifetime. In the clustered WSN, cluster heads (CHs) utilize maximum energy to another node. Moreover, it balanced the load present in the sensor nodes (SNs) between the CHS for enhancing the network lifespan. Moreover, the CH plays an important part in efficient routing, as well as it must be selected in an optimal way. Thus, this work intends to introduce a clusterbased routing approach in WSN, where it selects the CHs by the optimization algorithm. A new hybrid seagull rock swarm with oppositionbased learning (HSROBL) is introduced for this purpose, which is the hybridized concept of rock hyraxes swarm optimization (RHSO) and seagull optimization algorithm (SOA). Further, the optimal CH selection is based on various parameters including distance, security, delay, and energy. At the end, the outcomes of the presented approach are analyzed to extant algorithms based on delay, alive nodes, average throughput, and residual energy, respectively. Based on throughput, alive node, residual energy, as well as delay, the overall improvement in performance is about 28.50%.
Citation: Journal of Interconnection Networks
PubDate: 20221029T07:00:00Z
DOI: 10.1142/S0219265921500390

 TrustBased Permissioned Blockchain Network for Identification and
Authentication of Internet of Smart Devices: An ECommerce Prospective
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Erukala Suresh Babu, Ilaiah Kavati, Ramalingaswamy Cheruku, Soumya Ranjan Nayak, Uttam Ghosh
Abstract: Journal of Interconnection Networks, Ahead of Print.
The Internet of Things refers to billions of devices around us connected to the wireless internet. These IoT devices are memoryconstrained devices that can collect and transfer data over the network without human assistance. Recently, IoT is materialized in retail commerce, transforming from recognition service to postpurchase engagement service. IoT examples in retail commerce are smart refrigerators, smart speakers, smart washing machines, smart automobiles, and automatic repurchase of groceries using RFID tags. Despite the rise, one of the significant inconveniences slowing rapid adaption is the “security” of these devices, which are vulnerable to various attacks. One such attack is Distributed DenialofService (DDoS) attacks targeting offline or online sensitive data. Hence, a lightweight cryptographic mechanism needs to establish secure communication among IoT devices. This paper presents the solution to secure communication among IoT devices using a permissioned blockchain network. Specifically, in this work, we proposed a mechanism for identifying and authenticating the smart devices using the Ellipticcurve cryptography (ECC) protocol. This proposed work uses permissioned blockchain infrastructure, which acts as a source of trust that aids the authentication process using ECC cryptosystem. In addition, lightweight Physical Unclonable Function (PUF) technology is also used to securely store the device’s keys. Using this technology, the private keys need not be stored anywhere, but it is generated on the fly from the trusted zone whenever the private key is required.
Citation: Journal of Interconnection Networks
PubDate: 20221013T07:00:00Z
DOI: 10.1142/S0219265922430010

 Reliability of Augmented [math]Ary [math]Cubes with Extra Faults

Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Xueli Sun, Jianxi Fan, Baolei Cheng, Yan Wang, Jingya Zhou
Abstract: Journal of Interconnection Networks, Ahead of Print.
Fault tolerance is critical to reliability analysis of interconnection networks since the vulnerability of component failure increases with the growth of network scale. Extra connectivity and extra diagnosability are two decisive indicators of the ability of parallel and distributed systems to tolerate and diagnose faulty nodes. This paper mainly establishes the [math]extra connectivity and [math]extra diagnosability of augmented [math]ary [math]cubes [math], which is a generalization of [math]ary [math]cubes and augmented cubes. In addition, we explore the [math]extra diagnosis algorithm of [math] under the MM* model.
Citation: Journal of Interconnection Networks
PubDate: 20220929T07:00:00Z
DOI: 10.1142/S0219265921500407

 Distance Optimally Edge Connectedness of Arrangement Graph Based on
Subgraph Fault Pattern
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Zhengqin Yu, Shuming Zhou, Hong Zhang, Xiaoqing Liu
Abstract: Journal of Interconnection Networks, Ahead of Print.
Largescale multiprocessor systems or multicomputer systems based on networking have been extensively used in the big data era and social network. Fault tolerance is becoming an essential attribute in multiprocessor systems with the increase of the system scale. For any distinct vertices [math], the local connectivity of [math] and [math], denoted by [math], is the maximum number of independent [math]paths in system graph [math]. The local edge connectivity of [math], [math], [math], is defined similarly. For any [math], [math], if [math] (or [math], then [math] is [math]distance optimally (edge) connected, where [math] is the diameter of [math] and [math] is the degree of [math]. For any integers [math] subject to [math], if [math] is [math]distance optimally (edge) connected, then we call [math] is [math]distance local optimally (edge) connected. In this work, we show that [math] ([math] is [math]arrangement graph) is [math]distance local optimally edge connected for [math] and [math].
Citation: Journal of Interconnection Networks
PubDate: 20220921T07:00:00Z
DOI: 10.1142/S0219265921500389

 Remote Sensing Image Registration Via Cyclic Parameter Synthesis and
Spatial Transformation Network
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Chen Ying, Li Xianjing, Wang Wei, Wang Jiahao, Zhang Wencheng, Shi Yanjiao, Zhang Qi
Abstract: Journal of Interconnection Networks, Ahead of Print.
Aiming at the problems of insufficient feature extraction ability, many mismatching points and low registration accuracy of some remote sensing image registration algorithms, this study proposes a remote sensing image registration algorithm via cyclic parameter synthesis spatial transformation network. (1) We propose a feature extraction network framework combined with the improved spatial transformation network and improved Densely Connected Networks (DenseNet), which can focus on important areas of images for feature extraction.This framework can effectively improve the feature extraction ability of the model, so as to improve the model accuracy. (2) In the matching stage, we design the coarse filter and fine filter double filter architecture. Thus, the false matching points are effectively filtered out, which not only improves the robustness of the model but also improves the registration accuracy. Compared with the two traditional methods and two deep learning methods, the experimental results of this model are better in many indexes.
Citation: Journal of Interconnection Networks
PubDate: 20220830T07:00:00Z
DOI: 10.1142/S0219265922420014

 Precise Values for the Strong Subgraph 3ArcConnectivity of Cartesian
Products of Some Digraph Classes
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Yiling Dong
Abstract: Journal of Interconnection Networks, Ahead of Print.
Let [math] be a digraph of order [math], [math] a subset of [math] of size [math] and [math]. A strong subgraph [math] of [math] is called an [math]strong subgraph if [math]. A pair of [math]strong subgraphs [math] and [math] is said to be arcdisjoint if [math]. Let [math] be the maximum number of arcdisjoint [math]strong subgraphs in [math]. Sun and Gutin defined the strong subgraph [math]arcconnectivity as λk(D) =min{λS(D) S ⊆ V (D), S = k}. The new parameter [math] could be seen as a generalization of classical edgeconnectivity of undirected graphs. In this paper, we get precise values for the strong subgraph 3arcconnectivity of Cartesian products of some digraph classes. Also, we prove that there is no upper bound on [math] depending on [math] and [math].
Citation: Journal of Interconnection Networks
PubDate: 20220827T07:00:00Z
DOI: 10.1142/S0219265921500365

 Optimal Broadcasting in Fully Connected Trees

Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Saber Gholami, Hovhannes A. Harutyunyan, Edward Maraachlian
Abstract: Journal of Interconnection Networks, Ahead of Print.
Broadcasting is disseminating information in a network where a specific message must spread to all network vertices as quickly as possible. Finding the minimum broadcast time of a vertex in an arbitrary network is proven to be NPcomplete. However, this problem is solvable for a few families of networks. In this paper, we present an optimal algorithm for finding the broadcast time of any vertex in a fully connected tree ([math]) in [math] time. An [math] is formed by attaching arbitrary trees to vertices of a complete graph of size [math] where [math] is the total number of vertices in the graph.
Citation: Journal of Interconnection Networks
PubDate: 20220805T07:00:00Z
DOI: 10.1142/S0219265921500377

 A Study on Ornated Graphs

Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Johan Kok, Sudev Naduvath, Vivian Mukungunugwa
Abstract: Journal of Interconnection Networks, Ahead of Print.
In this paper, we introduce the notion of a finite nonsimple directed graph called, an ornated graph. An ornated graph is a directed graph on [math] vertices, denoted by [math], whose vertices are consecutively labeled clockwise on the circumference of a circle and constructed from an ordered string [math]. Joining vertices is such that for an odd indexed entry [math] of the string, a tail vertex [math] has clockwise heads [math] if and only if [math]. For an even indexed entry [math] of the string, a tail vertex [math] has anticlockwise heads [math] if and only if [math]. Some interesting results for certain types of ornated graphs are presented.
Citation: Journal of Interconnection Networks
PubDate: 20220730T07:00:00Z
DOI: 10.1142/S0219265921500353

 DTAR: A Dynamic Threshold Adaptive RankingBased EnergyEfficient Routing
Algorithm for WSNs
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: R. Amutha, G. G. Sivasankari, K. R. Venugopal, Thompson Stephan
Abstract: Journal of Interconnection Networks, Ahead of Print.
Owing to uncertainties associated with energy and maintenance of large Wireless Sensor Networks (WSN) during transmission, energyefficient routing strategies are gaining popularity. A Dynamic Threshold Adaptive Routing Algorithm (DTAR) is proposed for determining the most appropriate node to become a Cluster Head (CH) using adaptive participation criteria. For determining the next Forwarder Node (FN), an adaptive ranking scheme depends on distance ([math]) and Residual Energy ([math]). However, additional parameters such as Delivery Ratio (DR), EndtoEnd delay ([math] delay), and Message Success Rate (MSR) should be considered to achieve the most optimal approach to achieve energy efficiency. The proposed DTAR algorithm is validated on variable clustered networks in order to investigate the effect of opportunistic routing with increasing network size and energy resources. The proposed algorithm shows a substantial decrease in energy consumption during transmission. Energy Consumption (EC), Packet Delivery Ratio (PDR), EndtoEnd delay ([math] delay), and Message Success Rate (MSR) are used to illustrate the effectiveness of the proposed algorithm for energy efficiency.
Citation: Journal of Interconnection Networks
PubDate: 20220531T07:00:00Z
DOI: 10.1142/S0219265921490013

 The [math]VertexRainbow Index of [math](Edge) Connected Graphs

Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Yingbin Ma, Wenhan Zhu
Abstract: Journal of Interconnection Networks, Ahead of Print.
Let [math] be a vertexcolored graph. For a vertex set [math] of at least two vertices, a tree [math] that connects [math] in [math] is vertexrainbow if no two vertices of [math] have the same color, such a tree is called a vertexrainbow [math]tree or a vertexrainbow tree connecting [math]. Let [math] be a fixed integer with [math], [math] is said to be vertexrainbow [math]tree connected if every [math]subset [math] of [math] has a vertexrainbow [math]tree. The [math]vertexrainbow index [math] of a graph [math] is the minimum number of colors are needed in order to make [math] vertexrainbow [math]tree connected. In this paper, we focus on [math]. When [math] is [math]connected or [math]edgeconnected, we provide a sharp upper bound for [math], respectively, and determine the graphs [math], where [math] reaches the upper bound.
Citation: Journal of Interconnection Networks
PubDate: 20220530T07:00:00Z
DOI: 10.1142/S0219265921500341

 Health Ratio Optimization of Group DetectionBased Data Network Using
Genetic Algorithm
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: A. R. Suhas, M Manoj Priyatham
Abstract: Journal of Interconnection Networks, Ahead of Print.
A physical region can have multiple parts, each part is monitored with the help of a Special DDN (SDDN). In the existing methods, namely, LEACH, the Fuzzy method has a larger path between the initiator DDN to destination DDN. Nonhealthy DDNs can occur in the Groupbased Detection Data Network (GDDN) when the battery level of the DDN reaches below the threshold. The possibility of more Nonhealthy DDNs can be of multiple reasons (i) when the link path is of larger length (ii) Same DDN is used multiple times as an SDDN and (iii) repeated communication between base station to DDNs causes the DDN to lose more battery. If a mechanism is created to recover the DDNs or recharge them, then the number of Nonhealthy DDNs can be reduced and DDN performance can be improved a lot. The Proposed Genetic (PGENETIC) method will find the SDDN in a batteryaware manner and also at path will be of minimum length along with regular interval trigger to identify DDNs which are nonhealthy and replace or recharge them. PGENETIC is compared with LEACH, Fuzzy method, and Proposed CHEF (PCHEF) and proved that PGENETIC exhibits better performance.
Citation: Journal of Interconnection Networks
PubDate: 20220512T07:00:00Z
DOI: 10.1142/S0219265922410018

 Reliability of DQcube Networks Under the Condition of [math]Component

Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: Wenjun Liu
Abstract: Journal of Interconnection Networks, Ahead of Print.
Connectivity is an important measure parameter to evaluate the fault tolerance of networks. With the continuous expansion of networks scale, it is inevitable that the processor fails. Once the processor fails, the information processed by the failed processor will be unreliable, which may cause fatal consequences. Therefore, it is of great significance to study the connectivity and diagnosability of networks. In this paper, we establish that the [math]component connectivity of DQcube is [math], where [math] and [math]. Furthermore, we determine that the [math]component diagnosability of DQcube is [math] under the PMC model and the MM* model, where [math] and [math].
Citation: Journal of Interconnection Networks
PubDate: 20220418T07:00:00Z
DOI: 10.1142/S021926592150033X

 A New MultiLevel SemiSupervised Learning Approach for Network Intrusion
Detection System Based on the ‘GOA’
Free preprint version: Loading...Rate this result: What is this?Please help us test our new preprint finding feature by giving the preprint link a rating.
A 5 star rating indicates the linked preprint has the exact same content as the published article.
Authors: A. Madhuri, Veerapaneni Esther Jyothi, S. Phani Praveen, S. Sindhura, V. Sai Srinivas, D. Lokesh Sai Kumar
Abstract: Journal of Interconnection Networks, Ahead of Print.
One of the important technologies in present days is Intrusion detection technology. By using the machine learning techniques, researchers were developed different intrusion systems. But, the designed models toughness is affected by the two parameters, in that first one is, high network traffic imbalance in several categories, and another is, nonidentical distribution is present in between the test set and training set in feature space. An artificial neural network (ANN) multilevel intrusion detection model with semisupervised hierarchical [math]means method (HSKmeans) is presented in this paper. Error rate of intrusion detection is reduced by the ANN’s accurate learning so it uses the Grasshopper Optimization Algorithm (GOA) which is analysed in this paper. Based on selection of important and useful parameters as bias and weight, error rate of intrusion detection system is reduced in the GOA algorithm and this is the main objective of the proposed system. Cluster based method is used in the pattern discovery module in order to find the unknown patterns. Here the test sample is treated as unlabelled unknown pattern or the known pattern. Proposed approach performance is evaluated by using the dataset as KDDCUP99. It is evident from the experimental findings that the projected model of GOA based semi supervised learning approach is better in terms of sensitivity, specificity and overall accuracy than the intrusion systems which are existed previously.
Citation: Journal of Interconnection Networks
PubDate: 20220131T08:00:00Z
DOI: 10.1142/S0219265921430477
