Subjects -> COMMUNICATIONS (Total: 518 journals)
    - COMMUNICATIONS (446 journals)
    - DIGITAL AND WIRELESS COMMUNICATION (31 journals)
    - HUMAN COMMUNICATION (19 journals)
    - MEETINGS AND CONGRESSES (7 journals)
    - RADIO, TELEVISION AND CABLE (15 journals)

DIGITAL AND WIRELESS COMMUNICATION (31 journals)

Showing 1 - 31 of 31 Journals sorted alphabetically
Ada : A Journal of Gender, New Media, and Technology     Open Access   (Followers: 22)
Advances in Image and Video Processing     Open Access   (Followers: 24)
Communications and Network     Open Access   (Followers: 13)
E-Health Telecommunication Systems and Networks     Open Access   (Followers: 3)
EURASIP Journal on Wireless Communications and Networking     Open Access   (Followers: 14)
Future Internet     Open Access   (Followers: 87)
Granular Computing     Hybrid Journal  
IEEE Transactions on Wireless Communications     Hybrid Journal   (Followers: 26)
IEEE Wireless Communications Letters     Hybrid Journal   (Followers: 42)
IET Wireless Sensor Systems     Open Access   (Followers: 18)
International Journal of Communications, Network and System Sciences     Open Access   (Followers: 9)
International Journal of Digital Earth     Hybrid Journal   (Followers: 15)
International Journal of Embedded and Real-Time Communication Systems     Full-text available via subscription   (Followers: 6)
International Journal of Interactive Communication Systems and Technologies     Full-text available via subscription   (Followers: 2)
International Journal of Machine Intelligence and Sensory Signal Processing     Hybrid Journal   (Followers: 3)
International Journal of Mobile Computing and Multimedia Communications     Full-text available via subscription   (Followers: 2)
International Journal of Satellite Communications and Networking     Hybrid Journal   (Followers: 39)
International Journal of Wireless and Mobile Computing     Hybrid Journal   (Followers: 8)
International Journal of Wireless Networks and Broadband Technologies     Full-text available via subscription   (Followers: 2)
International Journals Digital Communication and Analog Signals     Full-text available via subscription   (Followers: 2)
Journal of Digital Information     Open Access   (Followers: 181)
Journal of Interconnection Networks     Hybrid Journal   (Followers: 1)
Journal of the Southern Association for Information Systems     Open Access   (Followers: 2)
Mobile Media & Communication     Hybrid Journal   (Followers: 10)
Nano Communication Networks     Hybrid Journal   (Followers: 5)
Psychology of Popular Media Culture     Full-text available via subscription   (Followers: 1)
Signal, Image and Video Processing     Hybrid Journal   (Followers: 11)
Ukrainian Information Space     Open Access  
Vehicular Communications     Full-text available via subscription   (Followers: 4)
Vista     Open Access   (Followers: 4)
Wireless Personal Communications     Hybrid Journal   (Followers: 6)
Similar Journals
Journal Cover
Journal of Interconnection Networks
Journal Prestige (SJR): 0.113
Number of Followers: 1  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 0219-2659 - ISSN (Online) 1793-6713
Published by World Scientific Homepage  [121 journals]
  • Monitoring Edge-Geodetic Numbers of Some Networks

    • Free pre-print version: Loading...

      Authors: Yingying Zhang, Fanfan Wang, Chenxu Yang
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Motivated by the problem of network monitoring, Foucaud, Krishna and Ramasubramony Sulochana introduced the concept of monitoring edge-geodetic set and a related graph invariant. A monitoring edge-geodetic set (MEG-set for short) is a set such that the removal of any edge changes the distance between some pair of vertices in the set. The minimum size of the monitoring edge-geodetic set is called the monitoring edge-geodetic number. In this paper, we study the monitoring edge-geodetic numbers of some well-known networks, including folded hypercube, folded [math]-cube, prism graph, anti-prism graph, Jahangir graph and windmill graphs.
      Citation: Journal of Interconnection Networks
      PubDate: 2024-02-28T08:00:00Z
      DOI: 10.1142/S0219265924500014
       
  • On the Vertex Identification Spectra of Grids

    • Free pre-print version: Loading...

      Authors: Reginaldo M. Marcelo, Mark Anthony C. Tolentino, Agnes D. Garciano, Mari-Jo P. Ruiz, Jude C. Buot
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Let [math] be a red–white coloring of the vertices of a nontrivial connected graph [math] with diameter [math], where at least one vertex is colored red. Then [math] is called an identification coloring or simply, an ID-coloring, if and only if for any two vertices [math] and [math], [math], where for any vertex [math], [math] and [math] is the number of red vertices at a distance [math] from [math]. A graph is said to be an ID-graph if it possesses an ID-coloring. If [math] is an ID-graph, then the spectrum of [math] is the set of all positive integers [math] for which [math] has an ID-coloring with [math] red vertices. The identification number or ID-number of a graph is the smallest element in its spectrum. In this paper, we extend a result of Kono and Zhang on the identification number of grids [math]. In particular, we give a formulation of strong ID-coloring and use it to give a sufficient condition for an ID-coloring of a graph to be extendable to an ID-coloring of the Cartesian product of a path [math] with [math]. Consequently, some elements of the spectrum of grids [math] for positive integers [math] and [math], with [math], are obtained. The complete spectrum of ladders [math] is then determined using systematic constructions of ID-colorings of the ladders.
      Citation: Journal of Interconnection Networks
      PubDate: 2024-02-28T08:00:00Z
      DOI: 10.1142/S0219265924500026
       
  • A Systematic Analysis, Outstanding Challenges, and Future Prospects for
           Routing Protocols and Machine Learning Algorithms in Underwater Wireless
           Acoustic Sensor Networks

    • Free pre-print version: Loading...

      Authors: M. Shwetha, Sannathammegowda Krishnaveni
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Water has covered a wide part of the earth’s surface. Oceans and other water bodies contain significant natural and environmental resources as well as aquatic life. Due to humans’ hazardous and unsuitable underwater (UW) settings, these are generally undiscovered and unknown. As a result of its widespread utility in fields as diverse as oceanography, ecology, seismology, and oceanography, underwater wireless sensor networks (UWSNs) have emerged as a cutting-edge area of study. Despite their usefulness, the performance of the network is hampered by factors including excessive propagation delay, a changing network architecture, a lack of bandwidth, and a battery life that is too short on sensor nodes. Developing effective routing protocols is the best way to overcome these challenges. An effective routing protocol can relay data from the network’s root node to its final destination. Therefore, the state of the art in underwater wireless acoustic sensor network (UWASN) routing protocols is assessed with an eye toward their potential for development. In real-world applications, sensor node positions are frequently used to locate relevant information. As a result, it is crucial to conduct research on routing protocols. Reinforcement learning (RL) algorithms have the ability to enhance routing under a variety of conditions because they are experience-based learning algorithms. Underwater routing methods for UWSN are reviewed in detail, including those that rely on machine learning (ML), energy, clustering and evolutionary approaches. Tables are incorporated for the suggested protocols by including the benefits, drawbacks, and performance assessments, which make the information easier to digest. Also, several applications of UWSN are discussed with security considerations. In addition to this, the analysis of node deployment and residual energy is discussed in this review. Furthermore, the domain review emphasizes UW routing protocol research difficulties and future directions, which can help researchers create more efficient routing protocols based on ML in the future.
      Citation: Journal of Interconnection Networks
      PubDate: 2024-02-01T08:00:00Z
      DOI: 10.1142/S0219265923300015
       
  • On the Maximum Cliques in Powers of Hypercubes

    • Free pre-print version: Loading...

      Authors: Yanting Hu, Weihua Yang
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Finding the values of [math] and [math] is a fundamental problem in classical coding theory. The [math] is the size of the maximum independent set of [math] which is the induced subgraph of vectors of weight [math] of the [math]-power of [math]-dimensional hypercubes. Obviously, [math]. In order to further understand and study the independent set of [math], we explore its clique number and the structure of the maximum clique. In this paper, we obtain the clique number and the structure of the maximum clique of [math] for [math] As an application, by [math] we obtain the upper bounds of [math] for [math]
      Citation: Journal of Interconnection Networks
      PubDate: 2024-01-27T08:00:00Z
      DOI: 10.1142/S0219265923500366
       
  • Source Network Load Storage Access to Power Wireless Private Network
           Technology Based on 5G Ultra Dense Networking

    • Free pre-print version: Loading...

      Authors: Zehui Liu, Dongjuan Ma, Min Guo, Weizhe Jing, Wei Gao, Weikang Kong
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      We make the source network load storage access power wireless private network, this paper proposes a source network load storage access power wireless private network technology based on 5G ultra dense network. The multiple rotation scheduling and self-organizing learning methods are used to establish the deployment model of the source network load storage access node of the power wireless private network under the 5G communication mode. According to the routing control algorithm design of the 5G ultra dense networking node, combined with the integration analysis of the access load parameters, the source network load storage access model of the 5G ultra dense networking under the dynamic load distributed control mode is established. Through the method of optimal control of reactive power and voltage of distribution network, the transmission link equilibrium structure model of 5G source network load storage access to power wireless private network is constructed. Combined with the coverage analysis of link topology structure and the benefit maximization constraint analysis of production and consumption users, the active and reactive capacity analysis of transaction between production and consumption user groups and multiple production and consumption users is adopted. Combined with the energy storage characteristics analysis and power flow parameter calculation of the source network load storage access power, the 5G ultra dense networking and private network access to the source network load storage access power are realized. The test shows that this method has better power balance dispatching ability and larger output power gain when it is applied to the design of source network load storage access power wireless private network.
      Citation: Journal of Interconnection Networks
      PubDate: 2024-01-24T08:00:00Z
      DOI: 10.1142/S0219265923500354
       
  • [math]-Path Decompositions of the Line Graph of the Complete Bipartite
           Graph

    • Free pre-print version: Loading...

      Authors: Limin Gao, Weihua Yang
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      The line graph is a very popular research object in graph theory, in complex networks and also in social networks recently. Let [math] be the line graph of the complete bipartite graph [math] and [math] be a path of length [math]. In this paper, we give necessary and sufficient conditions for the existence of [math]-decompositions of [math].
      Citation: Journal of Interconnection Networks
      PubDate: 2024-01-24T08:00:00Z
      DOI: 10.1142/S0219265923500378
       
  • Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex
           Connection of Graphs with Large Clique Number

    • Free pre-print version: Loading...

      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] to make [math] 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] to make [math] strong rainbow vertex connected. These two concepts are inspired by the concepts of proper (strong) rainbow connection number of graphs. In this paper, we determine the values of [math] and [math] of [math] with large clique numbers [math] and [math]. Moreover, we determine the values of [math] and [math] of [math] with large clique numbers [math], [math] and [math].
      Citation: Journal of Interconnection Networks
      PubDate: 2024-01-19T08:00:00Z
      DOI: 10.1142/S0219265923500342
       
  • Bounds of Two Toughnesses and Binding Numbers for Star Factors

    • Free pre-print version: Loading...

      Authors: Yujia Gao, Zhen Ji, Xiaojie Sun, Qinghe Tong
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      For a set [math] of connected graphs, a spanning subgraph [math] of a graph [math] is an [math]-factor if every component of [math] is isomorphic to some member of [math]. In this paper, we give a criterion for the existence of tight toughness, isolated toughness and binding number bounds in a graph of a strong [math]-star factor, [math]-factor and [math]-star factor. Moreover, we show that the bounds of the sufficient conditions are sharp.
      Citation: Journal of Interconnection Networks
      PubDate: 2024-01-10T08:00:00Z
      DOI: 10.1142/S0219265923500329
       
  • On the Local Metric Dimension of Graphs

    • Free pre-print version: Loading...

      Authors: Chenxu Yang, Xingchao Deng, Jinxia Liang, Yuhu Liu
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Let [math] be a graph. A set [math] is a local resolving set of [math] if there exists [math] such that [math] for any [math]. The local metric dimension [math] of [math] is the minimum cardinality of all the local resolving sets of [math]. In this paper, we characterize the graphs with [math]. Next, we obtain the Nordhaus–Gaddum-type results for local metric dimension. Finally, the local metric dimension of several graph classes is given.
      Citation: Journal of Interconnection Networks
      PubDate: 2024-01-10T08:00:00Z
      DOI: 10.1142/S0219265923500330
       
  • Author Index Volume 23 (2023)

    • Free pre-print version: Loading...

      Abstract: Journal of Interconnection Networks, Volume 23, Issue 04, December 2023.

      Citation: Journal of Interconnection Networks
      PubDate: 2023-05-29T07:00:00Z
      DOI: 10.1142/S0219265923990013
      Issue No: Vol. 23, No. 04 (2023)
       
  • Some Existence Theorems on Star Factors

    • Free pre-print version: Loading...

      Authors: Xiumin Wang, Fengyun Ren, Dong He, Ao Tan
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      The [math]-factor and [math]-factor of a graph are a spanning subgraph whose each component is an element of [math] and [math], respectively, where [math] is a special family of trees. In this paper, we obtain a sufficient condition in terms of tight toughness, isolated toughness and binding number bounds to guarantee the existence of a [math]-factor and [math]-factor for any graph.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-11-29T08:00:00Z
      DOI: 10.1142/S0219265923500275
       
  • Krill Herd and Feed Forward Optimization System-Based Routing Protocol for
           IoT-MANET Environment

    • Free pre-print version: Loading...

      Authors: S. Sugumaran, V. Sivasankaran, M. G. Chitra
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      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.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-11-27T08:00:00Z
      DOI: 10.1142/S0219265923500305
       
  • Embedding Kn√∂del Graph into Cube-like Architectures: Dilation
           Optimization and Wirelength Analysis

    • Free pre-print version: Loading...

      Authors: Remi Mariam Reji, R. Sundara Rajan, T. M. Rajalaxmi
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      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 [math] is a minimum linear gossip network and has minimum broadcasting. It has [math] vertices, [math] edges, where [math] is even, and [math]log[math]. 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 [math] into the hypercube [math] is at most [math]. 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 [math]. Also, we calculate the wirelength of embedding the Knödel graph into the above-said cube-like architectures using dilation.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-11-24T08:00:00Z
      DOI: 10.1142/S0219265923500317
       
  • A Novel Incentive Routing Protocol with Virtual Projection for Mobile
           Packet Forwarding Nodes in Wireless Sensor Networks

    • Free pre-print version: Loading...

      Authors: L. Niranjan, M. Manoj Priyatham
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      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.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-11-18T08:00:00Z
      DOI: 10.1142/S0219265923500287
       
  • Component Edge Connectivity and Extra Edge Connectivity of Bubble-Sort
           Star Graphs

    • Free pre-print version: Loading...

      Authors: Xiaohui Hua, Yonghao Lai
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Connectivity is an important parameter for evaluating the reliability and stability of an interconnection network. Based on the edge connectivity, more refined connectivities have been proposed. The [math]-component edge connectivity [math] and the [math]-extra edge connectivity [math] are two important parameters to assess the robustness of an interconnection network, which received attention extensively. In this paper, we determine the [math]-component edge connectivity and the [math]-extra edge connectivity of bubble-sort star graphs [math]. For [math]-component edge connectivity, we prove that [math], [math], and [math] for [math]. For [math]-extra edge connectivity, we prove that [math], [math], and [math] for [math].
      Citation: Journal of Interconnection Networks
      PubDate: 2023-11-10T08:00:00Z
      DOI: 10.1142/S0219265923500299
       
  • Hybrid Model-Based Intrusion Detection in Wireless Sensor Network on the
           Basis of Risk and Link Quality

    • Free pre-print version: Loading...

      Authors: Ranjeet B. Kagade, N. Vijayaraj
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      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.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-11-08T08:00:00Z
      DOI: 10.1142/S0219265923500214
       
  • Self-Configuration and Self-Healing Framework Using Extreme Gradient
           Boosting (XGBoost) Classifier for IoT-WSN

    • Free pre-print version: Loading...

      Authors: M. Ganesh Raja, S. Jeyalaksshmi
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      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.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-11-03T07:00:00Z
      DOI: 10.1142/S0219265923500226
       
  • On the Local Metric Dimension of Line Graphs

    • Free pre-print version: Loading...

      Authors: Chenxu Yang, Xingchao Deng, Wen Li
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Let [math] be a graph. For any [math], if there exists [math] such that [math], we say that [math] resolving [math]. A set [math] of vertices in [math] is a local resolving set of [math] if there exists [math] such that [math] for any [math]. The local metric dimension [math] of [math] is the minimum cardinality of all the local resolving sets of [math]. In this paper, we study the relation between [math] and [math]. Furthermore, we construct a graph [math] such that [math] and [math]. Finally, we investigate the local metric dimension of several special line graphs.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-10-31T07:00:00Z
      DOI: 10.1142/S0219265923500263
       
  • Tight Toughness, Isolated Toughness and Binding Number Bounds for the
           Star-Path Factor

    • Free pre-print version: Loading...

      Authors: Yifan Yao, Jinxia Liang, Yue Li, Rongrong Ma
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      For a set [math] of connected graphs, a spanning subgraph [math] of [math] is called a [math] if each component of [math] is isomorphic to a member of [math]. In this paper, some sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [math]-factor and [math]-factor for any graph are obtained.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-10-20T07:00:00Z
      DOI: 10.1142/S0219265923500202
       
  • Sharp Bounds and Precise Values for the [math]-Chromatic Number of Graphs

    • Free pre-print version: Loading...

      Authors: Yangfan Yu, Yuefang Sun
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Let [math] be a connected undirected graph. A vertex coloring [math] of [math] is an [math]-vertex coloring if for each vertex [math] in [math], the number of different colors assigned to [math] is at most [math]. The [math]-chromatic number of [math], denoted by [math], is the maximum number of colors which are used in an [math]-vertex coloring of [math]. In this paper, we provide sharp bounds for [math] of a graph [math] in terms of its vertex cover number, maximum degree and diameter, respectively. We also determine precise values for [math] in some cases.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-10-20T07:00:00Z
      DOI: 10.1142/S021926592350024X
       
  • On the Monitoring-Edge-Geodetic Numbers of Line Graphs

    • Free pre-print version: Loading...

      Authors: Gemaji Bao, Chenxu Yang, Zhiqiang Ma, Zhen Ji, Xin Xu, Peiyao Qin
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      For a vertex set [math], we say that [math] is a monitoring-edge-geodetic set (MEG-set for short) of graph [math], that is, some vertices of [math] can monitor an edge of the graph, if and only if we can remove that edge would change the distance between some pair of vertices in the set. The monitoring-edge-geodetic number [math] of a graph [math] is defined as the minimum cardinality of a monitoring-edge-geodetic set of [math]. The line graph [math] of [math] is the graph whose vertices are in one-to-one correspondence with the edges of [math], that is, if two vertices are adjacent in [math] if and only if the corresponding edges have a common vertex in [math]. In this paper, we study the relation between [math] and [math], and prove that [math]. Next, we have determined the exact values for a MEG-set of some special graphs and their line graphs. For a graph [math] and its line graph [math], we prove that [math] can be arbitrarily large.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-10-20T07:00:00Z
      DOI: 10.1142/S0219265923500251
       
  • Efficient Strategy to Exchange Road Messages Between Smart Vehicles and
           Wireless Sensor Networks in Hybrid Sensor and Vehicular Networks

    • Free pre-print version: Loading...

      Authors: Taha Bensiradj
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      The aim of the intelligent transport system (ITS) is the improvement of road safety. This system is based on intelligent vehicles composing a network called Vehicular Ad hoc NETwork (VANET). This network suffers from a disconnection problem due to its dynamic topology. Therefore, a framework of collaboration between the Wireless Sensor Network (WSN) and VANET called Hybr1id Sensor and Vehicular Networks (HSVN) has been proposed. In HSVN, the WSN can play the role of a relay between disconnected vehicles. This paper aims to propose a strategy allowing the exchange of messages between the two networks. That reduces the number of accidents and improves the management of road traffic. We can summarize our proposition in three essential points. First, an algorithm is proposed to decompose the vehicular network into clusters. This algorithm takes into account the mobile aspect of vehicles and the road model. Second, a data encoding model and a message model have been proposed to improve the quality of messages. That reduces the response time of drivers to a critical situation. Finally, an exchange algorithm is proposed to ensure the transmission of road messages between vehicles and sensors. Its principle of work is based on several scenarios defined relative to the network condition. Obtained results show an improvement in the delivery delays of road messages and the number of exchanged road messages between the vehicles.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-10-10T07:00:00Z
      DOI: 10.1142/S0219265923500238
       
  • Secure and Energy-Based STEERA Routing Protocol for Wireless Sensor
           Networks

    • Free pre-print version: Loading...

      Authors: G. Mohan Ram, E. Ilavarasan
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      In wireless sensor networks (WSN), the multifunctional low-power sensor nodes are linked to base stations and are highly responsible for sensing various information. However, maintaining the network’s lifespan is a major issue because of limited battery capacity and node failures. Thus, the proposed study introduced a new Scalable Trust-based Energy Efficient Routing Algorithm (STEERA) with Adaptive Grasshopper Algorithm (AGA) to enhance the network lifespan. At first, the trust values (Tv) are generated for each node to eliminate the malicious node with the help of penalty factor and volatilization. To make efficient routing process, the nodes are formed into cluster groups. A suitable cluster head is selected for each cluster to mitigate the energy consumption problem through the AGA approach by optimizing the parameters like Tv, distance and residual energy. Finally, the data packets are effectively transmitted through a multi-hop routing process by selecting an appropriate path and satisfying certain parameters through Fire Hawks Optimization (FHO). To simulate the proposed techniques, NS2 software is employed, and the performance is measured over various metrics like energy consumption, residual energy, the lifespan of a network, packet loss ratio and average end-to-end delay. The performance analysis shows that the proposed protocol design has obtained higher results than conventional routing protocols.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-09-29T07:00:00Z
      DOI: 10.1142/S0219265923500184
       
  • Low Delay Transmission Scheme of Power Communication Information Based on
           5G Network

    • Free pre-print version: Loading...

      Authors: Dongjuan Ma, Feng Jing, Zehui Liu, Min Guo, Weizhe Jing, Jie Liang
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Power information data transmission is prone to packet loss rate, and communication protocol is required to improve the transmission capacity of power information data. Therefore, a low delay transmission scheme of power communication information based on 5G networking is proposed and constructed, the power communication information data through 5G networking technology is processed and is sent to the corresponding data application module for data classification and mining, and then the information data is converted in different formats to the same data transmission format. TCP communication protocol as the communication protocol is selected for data online transmission to describe the low delay transmission of power communication information. The chaotic sequence is set based on 5G networking, and the connection weight matrix is calculated. Then the power communication information sequence is encrypted in real time according to the row column substitution rule. On this basis, the data encryption module, dynamic key generation module and shared key update module are combined to realize the low delay transmission of power communication information. The experimental results show that with the increase of the network area and the number of nodes, the data transmission volume can be gradually increased. The change range of this method is relatively small, which can effectively improve the feasibility of the low delay transmission scheme of power communication information.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-09-26T07:00:00Z
      DOI: 10.1142/S0219265923500172
       
  • On the Extremal Values of the Weighted Integrity of a Graph

    • Free pre-print version: Loading...

      Authors: Wayne Goddard, Julia VanLandingham
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      The integrity of a graph [math] is defined as the minimum value of [math] taken over all [math], where [math] denotes the maximum cardinality of a component of graph [math]. In this paper, we investigate bounds on the maximum and minimum values of the weighted version of this parameter. We also consider the same question for the related parameter vertex-neighbor-integrity.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-09-26T07:00:00Z
      DOI: 10.1142/S0219265923500196
       
  • The Bounds of Generalized 4-Connectivity of Folded Divide-and-Swap Cubes

    • Free pre-print version: Loading...

      Authors: Caixi Xue, Shuming Zhou, Hong Zhang
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Connectivity along with its extensions are important metrices to estimate the fault-tolerance of interconnection networks. The classic connectivity [math] of a graph [math] is the minimum cardinality of a vertex set [math] such that [math] is connected or a single vertex. For any subset [math] with [math], a tree [math] in [math] is called an [math]-tree if [math]. Furthermore, any two [math]-tree [math] and [math] are internally disjoint if [math] and [math]. We denote by [math] the maximum number of pairwise internally disjoint [math]-trees in [math]. For an integer [math], the generalized [math]-connectivity of a graph [math] is defined as [math] and [math]. For the [math]-dimensional folded divide-and-swap cubes, [math], we show the upper bound and the lower bound of [math], that is [math], where [math] and [math] in this paper.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-08-10T07:00:00Z
      DOI: 10.1142/S0219265923500160
       
  • On [math]-Coloring of Some Cycle-Related Graphs

    • Free pre-print version: Loading...

      Authors: Merlin Thomas Ellumkalayil, Sudev Naduvath
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      A graph coloring is proper when the colors assigned to a pair of adjacent vertices in it are different and it is improper when at least one of the adjacent pair of vertices receives the same color. When the minimum number of colors required in a proper coloring of a graph is not available, coloring the graph with the available colors, say [math] colors, will lead at least an edge to have its end vertices colored with a same color. Such an edge is called a bad edge. In a proper coloring of a graph [math], every color class is an independent set. However, in an improper coloring there can be few color classes that are non-independent. In this paper, we use the concept of [math]-coloring, which permits only one color class to be non-independent and determine the minimum number of bad edges, which is denoted by [math], obtained from the same for some cycle-related graphs.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-08-08T07:00:00Z
      DOI: 10.1142/S0219265923500147
       
  • Holes Problem Solving in Khalimsky Topology Protocol for Wireless Sensor
           Networks (WSNs)

    • Free pre-print version: Loading...

      Authors: Mahmoud Mezghani, Omnia Mezghani
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      In this paper, we propose an approach solving the holes problem in Wireless Sensor Networks (WSNs) based on Khalimsky k-Clustering and data routing protocol (MDKC). The aim of this solution is to establish optimized data routing paths between isolated nodes/clusters and the Sink in noisy environment with the presence of obstacles. This approach is an improvement of a previous work deploying stationary WSN not dealing with the problem of “holes”. At first, the MDKC algorithm divides the WSN into k-hop [math] compact dynamic clusters. For each cluster, a node is elected cluster-head in its k-neighborhood according to some criteria such as the remaining energy, the k-degree and the communication probability average. Then, some nodes are selected as Khalimsky anchors to optimize the intra-cluster data routing process. The Khalimsky anchors at the border layers ensure the inter-cluster data routing between adjacent clusters. In the next phase of MDKC, Mobile Collectors (MCs) are used for data collecting and relaying from isolated nodes/clusters to the connected Khalimsky’s nodes. The simulation results prove that MDKC minimizes the energy consumption and improves the connectivity rate between sensors and the delivery rate compared to some existing approaches.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-08-08T07:00:00Z
      DOI: 10.1142/S0219265923500159
       
  • Sufficient Conditions of (Isolated) Toughness and Binding Number for the
           Existence of Component Factors

    • Free pre-print version: Loading...

      Authors: Zhiqiang Ma, Fengyun Ren, Meiqin Wei, Gemaji Bao
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      For a family of connected graphs [math], a spanning subgraph [math] of [math] is called an [math]-factor if each component of [math] is isomorphic to a member of [math]. In this paper, sufficient conditions with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the [math]-factor, [math]-factor or [math]-factor for [math] are obtained.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-07-27T07:00:00Z
      DOI: 10.1142/S0219265923500135
       
  • The Ordinal Consistency of a Hesitant Fuzzy Preference Relation

    • Free pre-print version: Loading...

      Authors: Xue Feng, Shengling Geng, Banghe Han
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      An efficient solution to the misleading solutions of decision-making problems is the study of consistency when the decision makers express their opinions by means of fuzzy preference relations. To elucidate the consistency of HFPRs, the S-ordinal consistency of HFPRs was proposed, and S-OCI was also proposed to evaluate the degree of consistency of a hesitant fuzzy preference relation by calculating the unreasonable 3-cycles in the directed graph. Two novel methods were also proposed for calculation of the S-OCI. Moreover, the inconsistent judgment in hesitation fuzzy preference relation was developed. In order to repair the inconsistency of a hesitant fuzzy preference relation, an algorithm for finding and removing 3-cycles in digraph was developed. Finally, some illustrative examples were given to prove the effectiveness of the method.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-07-19T07:00:00Z
      DOI: 10.1142/S0219265923500093
       
  • The Strong Menger Connectivity of the Directed [math]-Ary [math]-Cube

    • Free pre-print version: Loading...

      Authors: Guoqiang Xie, Jixiang Meng
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      A strong digraph [math] is strongly Menger (arc) connected if, for [math], [math] can reach [math] by min[math] internally (arc) disjoint-directed paths. A digraph [math] is [math](-arc)-fault-tolerant strongly Menger([math]-(A)FTSM, for short) (arc) connected if [math] is strongly Menger (arc) connected for every [math](respectively, [math]) with [math]. A digraph [math] is [math]-conditional (arc)-fault-tolerant strongly Menger ([math]-C(A)FTSM, for short) (arc) connected if [math] is strongly Menger (arc) connected for every [math](respectively, [math]) with [math] and [math]. The directed [math]-ary [math]-cube [math] [math] and [math] is a digraph with vertex set [math]. For two vertices [math] and [math], [math] dominates [math] if there exists an integer [math], [math], satisfying [math]mod [math] and [math], when [math]. In this paper, we show that [math] [math] is [math]-AFTSM arc connected when [math], [math]-FTSM connected when [math], [math]-CAFTSM arc connected when [math], and [math]-CFTSM connected when [math].
      Citation: Journal of Interconnection Networks
      PubDate: 2023-07-19T07:00:00Z
      DOI: 10.1142/S0219265923500123
       
  • The [math]-Total-Proper Index of Graphs

    • Free pre-print version: Loading...

      Authors: Yingbin Ma, Hui Zhang
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Given a set [math] with [math], a tree [math] is considered as a total proper [math]-tree or a total proper tree connecting [math] if any two adjacent or incident elements of edges and [math] of [math] differ in color. Let [math] be a connected graph of order [math], and [math] be an integer with [math]. A total-colored graph is total proper[math]-tree connected if for every set [math] of [math] vertices, there exists a total proper [math]-tree in [math]. The [math]-total-proper index of [math], denoted by [math], is the minimum number of colors required to make [math] total proper [math]-tree connected. In this paper, we first investigate the [math]-total-proper index of some special graphs. Moreover, we characterize the graphs with [math]-total-proper index [math] and [math], respectively.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-07-17T07:00:00Z
      DOI: 10.1142/S0219265923500111
       
  • To Secure the Cloud Application Using a Novel Efficient Deep
           Learning-Based Forensic Framework

    • Free pre-print version: Loading...

      Authors: Sheena Mohammed, Sridevi Rangu
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Privacy and security are the most concerning topics while using cloud-based applications. Malware detection in cloud applications is important in identifying application malware activity. So, a novel Goat-based Recurrent Forensic Mechanism (GbRFM) is used to detect the attack and provide the attack type in cloud-based applications. At first, the dataset is pre-processed in the hidden phase, and the errorless features are extracted. The proposed model also trains the output of the hidden layer to identify and classify the malware. The wild goat algorithm enhances the identification rate by accurately detecting the attack. Using the NSL-KDD data, the preset research was verified, and the outcomes were evaluated. The performance assessment indicates that the developed model gained a 99.26% accuracy rate for the NSL-KDD dataset. Moreover, to validate the efficiency of the proposed model, the outcomes are compared with other techniques. The comparison analysis proved that the proposed model attained better results.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-06-21T07:00:00Z
      DOI: 10.1142/S0219265923500081
       
  • Tight Toughness, Isolated Toughness and Binding Number Bounds for the
           [math]-Factors and the [math]-Factors

    • Free pre-print version: Loading...

      Authors: Xiao Xu, Zhuoma Gao, Lei Meng, Qinghe Tong
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Let [math] be an integer. The [math]-factor of a graph [math] is a spanning subgraph [math] if [math] for all [math], and the [math]-factor is a subgraph whose each component is either [math] or [math]. In this paper, we give the lower bounds with regard to tight toughness, isolated toughness and binding number to guarantee the existence of the [math]-factors and [math]-factors for a graph.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-06-21T07:00:00Z
      DOI: 10.1142/S021926592350010X
       
  • Nordhaus–Gaddum-Type Results for the [math]-Independent Number of
           Graphs

    • Free pre-print version: Loading...

      Authors: Zhao Wang, Hongfang Liu, Yuhu Liu
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      The concept of [math]-independent set, introduced by Fink and Jacobson in 1986, is a natural generalization of classical independence set. A k-independent set is a set of vertices whose induced subgraph has maximum degree at most [math]. The k-independence number of [math], denoted by [math], is defined as the maximum cardinality of a [math]-independent set of [math]. As a natural counterpart of the [math]-independence number, we introduced the concept of [math]-edge-independence number. An edge set [math] in [math] is called k-edge-independent if the maximum degree of the subgraph induced by the edges in [math] is less or equal to [math]. The k-edge-independence number, denoted [math], is defined as the maximum cardinality of a [math]-edge-independent set. In this paper, we study the Nordhaus–Gaddum-type results for the parameter [math] and [math]. We obtain sharp upper and lower bounds of [math], [math], [math] and [math] for a graph [math] of order [math]. Some graph classes attaining these bounds are also given.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-06-10T07:00:00Z
      DOI: 10.1142/S021926592350007X
       
  • Nordhaus–Gaddum-Type Results for the Strong Equitable Vertex
           [math]-Arboricity of Graphs

    • Free pre-print version: Loading...

      Authors: Zhiwei Guo
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      For a graph [math] and positive integers [math], [math], a [math]-tree-vertex coloring of [math] refers to a [math]-vertex coloring of [math] satisfying every component of each induced subgraph generated by every set of vertices with the same color forms a tree with maximum degree not larger than [math], and it is called equitable if the difference between the cardinalities of every pair of sets of vertices with the same color is at most [math]. The strong equitable vertex [math]-arboricity of [math], denoted by [math], is defined as the least positive integer [math] satisfying [math], which admits an equitable [math]-tree-vertex coloring for each integer [math] with [math]. The strong equitable vertex [math]-arboricity of a graph is very useful in graph theory applications such as load balance in parallel memory systems, constructing timetables and scheduling. In this paper, we present the tight upper and lower bounds on [math] for an arbitrary graph [math] with [math] vertices and a given integer [math] with [math], and we characterize the extremal graphs [math] with [math], [math], [math], respectively. Based on the above extremal results, we further obtain the Nordhaus–Gaddum-type results for [math] of graphs [math] with [math] vertices for a given integer [math] with [math].
      Citation: Journal of Interconnection Networks
      PubDate: 2023-05-31T07:00:00Z
      DOI: 10.1142/S0219265923500068
       
  • An Efficient and Multi-Tier Node Deployment Strategy Using Variable
           Tangent Search in an IOT-Fog Environment

    • Free pre-print version: Loading...

      Authors: Gunaganti Sravanthi, Nageswara Rao Moparthi
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      The Internet of Things (IoT) creates a large number of datasets, and these are handled in cloud data centers. IoT services are more delayed when data is sent over longer distances to the cloud. Node deployment is used to improve the performance of the multi-tier IoT-Fog environment by finding minimum distance with low Latency. Several methods have been discussed previously to improve the node deployment strategies but they do not provide good results. To overcome these issues, an Efficient and Multi-Tier Node Deployment Strategy using Variable Tangent Search Optimization Algorithm (VTSOA) is proposed in an IoT-Fog Environment. This Multi-Tier Node Deployment Strategy consists of several layers: IoT device layer, Fog layer, and cloud layer. The IoT device layer collects the data from external devices and is transmitted to the Fog layer. The fog layer contains several nodes. Hence, it increases the Latency of sending the data to the cloud. Therefore, VTSOA-based node deployment is done in the fog layer which finds the minimum distance nodes for effective communication. In this, the proposed approach is implemented in MATLAB. After that, the performance of this method is linked to various optimization algorithms.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-05-09T07:00:00Z
      DOI: 10.1142/S0219265923500044
       
  • An Enhanced Probabilistic-Shaped SCMA NOMA for Wireless Networks

    • Free pre-print version: Loading...

      Authors: Ramya Thirunavukkarasu, Ramachandran Balasubramanian
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      The future digital evolution poses challenges that need to be spectral and energy-efficient, as well as highly reliable and resilient. The non-orthogonal multiple access (NOMA) accomplishes massive connectivity, spectral efficiency, effective bandwidth utilization, and low latency. The proposed work involves the code domain NOMA scheme called Sparse Code Multiple Access (SCMA) which provides shaping gain through multi-dimensional constellation and the best performance in terms of bit error rate (BER). It achieves overloading of users through the non-orthogonal allocation of resources which enhances the spectral efficiency and serves more users. The shaping gain can be further improved by reducing the BER and enhancing the capacity of the channel through constellation shaping. This work employs a probabilistic-shaped (PS) constellation where each symbol is transmitted with different probabilities which achieves a reduction of average symbol power and forward error correction (FEC) through channel coding using polar codes which aid in energy efficiency. The output is two-dimensionally spread over Orthogonal Frequency Code Division Multiplexing (OFCDM) subcarriers to achieve a flexible transmission rate through a variable spreading factor. Computer simulations showed better BER performance under AWGN and Rayleigh channels with remarkable gain in SNR which paves the way for future applications in Fifth Generation (5G) beyond networks.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-05-04T07:00:00Z
      DOI: 10.1142/S0219265923500032
       
  • Energy-Efficient Data Aggregation and Cluster-Based Routing in Wireless
           Sensor Networks Using Tasmanian Fully Recurrent Deep Learning Network with
           Pelican Variable Marine Predators Algorithm

    • Free pre-print version: Loading...

      Authors: Shreedhar Yadawad, S. M. Joshi
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      One of the major significant problems in the existing techniques in Wireless Sensor Networks (WSNs) is Energy Efficiency (EE) because sensor nodes are battery-powered devices. The energy-efficient data transmission and routing to the sink are critical challenges because WSNs have inherent resource limitations. On the other hand, the clustering process is a crucial strategy that can rapidly increase network lifetime. As a result, WSNs require an energy-efficient routing strategy with optimum route election. These issues are overcome by using Tasmanian Fully Recurrent Deep Learning Network with Pelican Variable Marine Predators Algorithm for Data Aggregation and Cluster-Based Routing in WSN (TFR-DLN-PMPOA-WSN) which is proposed to expand the network lifetime. Initially, Tasmanian Fully Recurrent Deep Learning Network (TFR-DLN) is proposed to elect the Optimal Cluster Head (OCH). After OCH selection, the three parameters, trust, connectivity, and QoS, are optimized for secure routing with the help of the Pelican Variable Marine Predators Optimization Algorithm (PMPOA). Finally, the proposed method finds the minimum distance among the nodes and selects the best routing to increase energy efficiency. The proposed approach will be activated in MATLAB. The efficacy of the TFR-DLN- PMPOA-WSN approach is assessed in terms of several performances. It achieves higher throughput, higher packet delivery ratio, higher detection rate, lower delay, lower energy utilization, and higher network lifespan than the existing methods.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-04-21T07:00:00Z
      DOI: 10.1142/S0219265923500056
       
  • A Note on Connectivity of Regular Graphs

    • Free pre-print version: Loading...

      Authors: Huixian Xu, Jinqiu Zhou
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      In this note, we prove the equivalence of edge connectivity, essential edge connectivity and cyclic edge connectivity in an [math]-regular graph, where [math].
      Citation: Journal of Interconnection Networks
      PubDate: 2023-04-17T07:00:00Z
      DOI: 10.1142/S0219265923500020
       
  • Hyper Star Fault Tolerance of Hierarchical Star Networks

    • Free pre-print version: Loading...

      Authors: Lulu Yang, Xiaohui Hua
      Abstract: Journal of Interconnection Networks, Ahead of Print.
      Let [math] and [math] be two connected subgraphs of an interconnection network [math]. If the removal of any minimum [math]-structure-cut (respectively, minimum [math]-substructure-cut) splits [math] into exactly two components, one of which is isomorphic to [math], then [math] is said to be hyper[math]-connected (respectively, hyper sub-[math]-connected). The hierarchical star network [math] is one of alternative interconnection networks for multiprocessor systems. Let [math], [math] and [math]. In this paper, we prove that (i) both the [math]-structure connectivity and the sub-[math]-structure connectivity of [math] are [math]; and (ii) both the [math]-structure connectivity and the sub-[math]-structure connectivity of [math] are [math]; and (iii) [math] is hyper [math]-connected and hyper sub-[math]-connected, where [math] is the complete graph with one vertex and [math] is a star with [math] vertices.
      Citation: Journal of Interconnection Networks
      PubDate: 2023-02-08T08:00:00Z
      DOI: 10.1142/S0219265923500019
       
  • Mobile Big Data Analytics for Human Behavior Recognition in Wireless
           Sensor Network Based on Transfer Learning

    • Free pre-print version: Loading...

      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: 2023-01-05T08:00:00Z
      DOI: 10.1142/S0219265922420038
       
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
 


Your IP address: 44.220.62.183
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-
JournalTOCs
 
 
  Subjects -> COMMUNICATIONS (Total: 518 journals)
    - COMMUNICATIONS (446 journals)
    - DIGITAL AND WIRELESS COMMUNICATION (31 journals)
    - HUMAN COMMUNICATION (19 journals)
    - MEETINGS AND CONGRESSES (7 journals)
    - RADIO, TELEVISION AND CABLE (15 journals)

DIGITAL AND WIRELESS COMMUNICATION (31 journals)

Showing 1 - 31 of 31 Journals sorted alphabetically
Ada : A Journal of Gender, New Media, and Technology     Open Access   (Followers: 22)
Advances in Image and Video Processing     Open Access   (Followers: 24)
Communications and Network     Open Access   (Followers: 13)
E-Health Telecommunication Systems and Networks     Open Access   (Followers: 3)
EURASIP Journal on Wireless Communications and Networking     Open Access   (Followers: 14)
Future Internet     Open Access   (Followers: 87)
Granular Computing     Hybrid Journal  
IEEE Transactions on Wireless Communications     Hybrid Journal   (Followers: 26)
IEEE Wireless Communications Letters     Hybrid Journal   (Followers: 42)
IET Wireless Sensor Systems     Open Access   (Followers: 18)
International Journal of Communications, Network and System Sciences     Open Access   (Followers: 9)
International Journal of Digital Earth     Hybrid Journal   (Followers: 15)
International Journal of Embedded and Real-Time Communication Systems     Full-text available via subscription   (Followers: 6)
International Journal of Interactive Communication Systems and Technologies     Full-text available via subscription   (Followers: 2)
International Journal of Machine Intelligence and Sensory Signal Processing     Hybrid Journal   (Followers: 3)
International Journal of Mobile Computing and Multimedia Communications     Full-text available via subscription   (Followers: 2)
International Journal of Satellite Communications and Networking     Hybrid Journal   (Followers: 39)
International Journal of Wireless and Mobile Computing     Hybrid Journal   (Followers: 8)
International Journal of Wireless Networks and Broadband Technologies     Full-text available via subscription   (Followers: 2)
International Journals Digital Communication and Analog Signals     Full-text available via subscription   (Followers: 2)
Journal of Digital Information     Open Access   (Followers: 181)
Journal of Interconnection Networks     Hybrid Journal   (Followers: 1)
Journal of the Southern Association for Information Systems     Open Access   (Followers: 2)
Mobile Media & Communication     Hybrid Journal   (Followers: 10)
Nano Communication Networks     Hybrid Journal   (Followers: 5)
Psychology of Popular Media Culture     Full-text available via subscription   (Followers: 1)
Signal, Image and Video Processing     Hybrid Journal   (Followers: 11)
Ukrainian Information Space     Open Access  
Vehicular Communications     Full-text available via subscription   (Followers: 4)
Vista     Open Access   (Followers: 4)
Wireless Personal Communications     Hybrid Journal   (Followers: 6)
Similar Journals
Similar Journals
HOME > Browse the 73 Subjects covered by JournalTOCs  
SubjectTotal Journals
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
 


Your IP address: 44.220.62.183
 
Home (Search)
API
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-