Pub Date : 2024-02-01DOI: 10.1142/s0219265923300015
M. Shwetha, Sannathammegowda Krishnaveni
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.
水覆盖了地球表面的大部分区域。海洋和其他水体蕴藏着重要的自然和环境资源以及水生生物。由于人类在水下（UW）环境中的危险性和不适宜性，这些资源通常未被发现和未知。由于水下无线传感器网络（UWSN）在海洋学、生态学、地震学和海洋学等不同领域的广泛应用，水下无线传感器网络已成为一个前沿研究领域。尽管水下无线传感器网络非常有用，但其性能却受到各种因素的影响，包括过长的传播延迟、不断变化的网络架构、带宽不足以及传感器节点电池寿命过短。开发有效的路由协议是克服这些挑战的最佳途径。有效的路由协议可以将数据从网络根节点中转到最终目的地。因此，我们对水下无线声学传感器网络（UWASN）路由协议的技术现状进行了评估，并着眼于其发展潜力。在实际应用中，传感器节点的位置经常被用来定位相关信息。因此，对路由协议进行研究至关重要。强化学习（RL）算法是一种基于经验的学习算法，因此能够在各种条件下增强路由能力。本文详细评述了用于 UWSN 的水下路由方法，包括那些依赖于机器学习 (ML)、能量、聚类和进化方法的方法。建议的协议都有表格，包括优点、缺点和性能评估，使信息更容易消化。此外，还讨论了 UWSN 的几种应用以及安全方面的考虑。此外，本综述还讨论了节点部署和剩余能量的分析。此外，该领域综述还强调了 UW 路由协议研究的难点和未来方向，这有助于研究人员在未来创建基于 ML 的更高效路由协议。
{"title":"A Systematic Analysis, Outstanding Challenges, and Future Prospects for Routing Protocols and Machine Learning Algorithms in Underwater Wireless Acoustic Sensor Networks","authors":"M. Shwetha, Sannathammegowda Krishnaveni","doi":"10.1142/s0219265923300015","DOIUrl":"https://doi.org/10.1142/s0219265923300015","url":null,"abstract":"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.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139884853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-02-01DOI: 10.1142/s0219265923300015
M. Shwetha, Sannathammegowda Krishnaveni
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.
水覆盖了地球表面的大部分区域。海洋和其他水体蕴藏着重要的自然和环境资源以及水生生物。由于人类在水下（UW）环境中的危险性和不适宜性，这些资源通常未被发现和未知。由于水下无线传感器网络（UWSN）在海洋学、生态学、地震学和海洋学等不同领域的广泛应用，水下无线传感器网络已成为一个前沿研究领域。尽管水下无线传感器网络非常有用，但其性能却受到各种因素的影响，包括过长的传播延迟、不断变化的网络架构、带宽不足以及传感器节点电池寿命过短。开发有效的路由协议是克服这些挑战的最佳途径。有效的路由协议可以将数据从网络根节点中转到最终目的地。因此，我们对水下无线声学传感器网络（UWASN）路由协议的技术现状进行了评估，并着眼于其发展潜力。在实际应用中，传感器节点的位置经常被用来定位相关信息。因此，对路由协议进行研究至关重要。强化学习（RL）算法是一种基于经验的学习算法，因此能够在各种条件下增强路由能力。本文详细评述了用于 UWSN 的水下路由方法，包括那些依赖于机器学习 (ML)、能量、聚类和进化方法的方法。建议的协议都有表格，包括优点、缺点和性能评估，使信息更容易消化。此外，还讨论了 UWSN 的几种应用以及安全方面的考虑。此外，本综述还讨论了节点部署和剩余能量的分析。此外，该领域综述还强调了 UW 路由协议研究的难点和未来方向，这有助于研究人员在未来创建基于 ML 的更高效路由协议。
{"title":"A Systematic Analysis, Outstanding Challenges, and Future Prospects for Routing Protocols and Machine Learning Algorithms in Underwater Wireless Acoustic Sensor Networks","authors":"M. Shwetha, Sannathammegowda Krishnaveni","doi":"10.1142/s0219265923300015","DOIUrl":"https://doi.org/10.1142/s0219265923300015","url":null,"abstract":"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.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139824987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-27DOI: 10.1142/s0219265923500366
Yanting Hu, Weihua Yang
Finding the values of [Formula: see text] and [Formula: see text] is a fundamental problem in classical coding theory. The [Formula: see text] is the size of the maximum independent set of [Formula: see text] which is the induced subgraph of vectors of weight [Formula: see text] of the [Formula: see text]-power of [Formula: see text]-dimensional hypercubes. Obviously, [Formula: see text]. In order to further understand and study the independent set of [Formula: see text], 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 [Formula: see text] for [Formula: see text] As an application, by [Formula: see text] we obtain the upper bounds of [Formula: see text] for [Formula: see text]
{"title":"On the Maximum Cliques in Powers of Hypercubes","authors":"Yanting Hu, Weihua Yang","doi":"10.1142/s0219265923500366","DOIUrl":"https://doi.org/10.1142/s0219265923500366","url":null,"abstract":"Finding the values of [Formula: see text] and [Formula: see text] is a fundamental problem in classical coding theory. The [Formula: see text] is the size of the maximum independent set of [Formula: see text] which is the induced subgraph of vectors of weight [Formula: see text] of the [Formula: see text]-power of [Formula: see text]-dimensional hypercubes. Obviously, [Formula: see text]. In order to further understand and study the independent set of [Formula: see text], 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 [Formula: see text] for [Formula: see text] As an application, by [Formula: see text] we obtain the upper bounds of [Formula: see text] for [Formula: see text]","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140492767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-24DOI: 10.1142/s0219265923500378
Limin Gao, Weihua Yang
The line graph is a very popular research object in graph theory, in complex networks and also in social networks recently. Let [Formula: see text] be the line graph of the complete bipartite graph [Formula: see text] and [Formula: see text] be a path of length [Formula: see text]. In this paper, we give necessary and sufficient conditions for the existence of [Formula: see text]-decompositions of [Formula: see text].
{"title":"3-Path Decompositions of the Line Graph of the Complete Bipartite Graph","authors":"Limin Gao, Weihua Yang","doi":"10.1142/s0219265923500378","DOIUrl":"https://doi.org/10.1142/s0219265923500378","url":null,"abstract":"The line graph is a very popular research object in graph theory, in complex networks and also in social networks recently. Let [Formula: see text] be the line graph of the complete bipartite graph [Formula: see text] and [Formula: see text] be a path of length [Formula: see text]. In this paper, we give necessary and sufficient conditions for the existence of [Formula: see text]-decompositions of [Formula: see text].","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139601389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-24DOI: 10.1142/s0219265923500354
Zehui Liu, Dongjuan Ma, Min Guo, Weizhe Jing, Wei Gao, Weikang Kong
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.
{"title":"Source Network Load Storage Access to Power Wireless Private Network Technology Based on 5G Ultra Dense Networking","authors":"Zehui Liu, Dongjuan Ma, Min Guo, Weizhe Jing, Wei Gao, Weikang Kong","doi":"10.1142/s0219265923500354","DOIUrl":"https://doi.org/10.1142/s0219265923500354","url":null,"abstract":"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.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139600137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-19DOI: 10.1142/s0219265923500342
Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang
The proper rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] to make [Formula: see text] rainbow vertex connected. The proper strong rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] to make [Formula: see text] 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 [Formula: see text] and [Formula: see text] of [Formula: see text] with large clique numbers [Formula: see text] and [Formula: see text]. Moreover, we determine the values of [Formula: see text] and [Formula: see text] of [Formula: see text] with large clique numbers [Formula: see text], [Formula: see text] and [Formula: see text].
{"title":"Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Graphs with Large Clique Number","authors":"Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang","doi":"10.1142/s0219265923500342","DOIUrl":"https://doi.org/10.1142/s0219265923500342","url":null,"abstract":"The proper rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] to make [Formula: see text] rainbow vertex connected. The proper strong rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] to make [Formula: see text] 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 [Formula: see text] and [Formula: see text] of [Formula: see text] with large clique numbers [Formula: see text] and [Formula: see text]. Moreover, we determine the values of [Formula: see text] and [Formula: see text] of [Formula: see text] with large clique numbers [Formula: see text], [Formula: see text] and [Formula: see text].","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139525710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-10DOI: 10.1142/s0219265923500329
Yujia Gao, Zhen Ji, Xiaojie Sun, Qinghe Tong
For a set [Formula: see text] of connected graphs, a spanning subgraph [Formula: see text] of a graph [Formula: see text] is an [Formula: see text]-factor if every component of [Formula: see text] is isomorphic to some member of [Formula: see text]. 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 [Formula: see text]-star factor, [Formula: see text]-factor and [Formula: see text]-star factor. Moreover, we show that the bounds of the sufficient conditions are sharp.
{"title":"Bounds of Two Toughnesses and Binding Numbers for Star Factors","authors":"Yujia Gao, Zhen Ji, Xiaojie Sun, Qinghe Tong","doi":"10.1142/s0219265923500329","DOIUrl":"https://doi.org/10.1142/s0219265923500329","url":null,"abstract":"For a set [Formula: see text] of connected graphs, a spanning subgraph [Formula: see text] of a graph [Formula: see text] is an [Formula: see text]-factor if every component of [Formula: see text] is isomorphic to some member of [Formula: see text]. 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 [Formula: see text]-star factor, [Formula: see text]-factor and [Formula: see text]-star factor. Moreover, we show that the bounds of the sufficient conditions are sharp.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139441178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-10DOI: 10.1142/s0219265923500330
Chenxu Yang, Xingchao Deng, Jinxia Liang, Yuhu Liu
Let [Formula: see text] be a graph. A set [Formula: see text] is a local resolving set of [Formula: see text] if there exists [Formula: see text] such that [Formula: see text] for any [Formula: see text]. The local metric dimension [Formula: see text] of [Formula: see text] is the minimum cardinality of all the local resolving sets of [Formula: see text]. In this paper, we characterize the graphs with [Formula: see text]. Next, we obtain the Nordhaus–Gaddum-type results for local metric dimension. Finally, the local metric dimension of several graph classes is given.
{"title":"On the Local Metric Dimension of Graphs","authors":"Chenxu Yang, Xingchao Deng, Jinxia Liang, Yuhu Liu","doi":"10.1142/s0219265923500330","DOIUrl":"https://doi.org/10.1142/s0219265923500330","url":null,"abstract":"Let [Formula: see text] be a graph. A set [Formula: see text] is a local resolving set of [Formula: see text] if there exists [Formula: see text] such that [Formula: see text] for any [Formula: see text]. The local metric dimension [Formula: see text] of [Formula: see text] is the minimum cardinality of all the local resolving sets of [Formula: see text]. In this paper, we characterize the graphs with [Formula: see text]. Next, we obtain the Nordhaus–Gaddum-type results for local metric dimension. Finally, the local metric dimension of several graph classes is given.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139440348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-29DOI: 10.1142/s0219265923500275
Xiumin Wang, Fengyun Ren, Dong He, Ao Tan
The [Formula: see text]-factor and [Formula: see text]-factor of a graph are a spanning subgraph whose each component is an element of [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] 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 [Formula: see text]-factor and [Formula: see text]-factor for any graph.
{"title":"Some Existence Theorems on Star Factors","authors":"Xiumin Wang, Fengyun Ren, Dong He, Ao Tan","doi":"10.1142/s0219265923500275","DOIUrl":"https://doi.org/10.1142/s0219265923500275","url":null,"abstract":"The [Formula: see text]-factor and [Formula: see text]-factor of a graph are a spanning subgraph whose each component is an element of [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] 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 [Formula: see text]-factor and [Formula: see text]-factor for any graph.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139214630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-27DOI: 10.1142/s0219265923500305
S. Sugumaran, V. Sivasankaran, M. G. Chitra
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.
{"title":"Krill Herd and Feed Forward Optimization System-Based Routing Protocol for IoT-MANET Environment","authors":"S. Sugumaran, V. Sivasankaran, M. G. Chitra","doi":"10.1142/s0219265923500305","DOIUrl":"https://doi.org/10.1142/s0219265923500305","url":null,"abstract":"The Internet of Things (IoT) is a developing technology in the world of communication and embedded systems. The IoT consists of a wireless sensor network with Internet service. The data size of the sensor node is small, but the routing of the data and energy consumption are important issues that need to be advocated. The Mobile Adhoc Network (MANET) plays a very important role in IoT services. In MANET, nodes are moving within the network. So, routes are created dynamically on demand and do not have any centralized units. The route optimization method addresses issues like selecting the best routes in terms of overhead, loop free, traffic control, balancing, throughput, route maintenance, and so on. In this paper, IoT routes are created between sensors to sink through MANET nodes with WSN routing ideology. The Krill Herd and Feed Forward Optimization (KH-FFO)-based method discovers the routes. The Krill herd algorithm clusters the network. This method increases network speed and reduces energy waste. Feed-forward optimization involves learning all the nodes in the network and identifying the shortest and most energy-efficient route from source to sink. The overall performance of the KH-FFO protocol has improved the network’s capacity, reduced packet loss, and increased the energy utilization of the nodes in the network. The ns-3 simulation for KH-FFO is tested in different node densities and observed energy utilization is increased by 28%, network life is increased by 7%, Packet delivery ratio improved by 7.5%, the End-to-End delay improved by 31% and the Throughput is 3%. These metrices are better than the existing works in the network.","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.7,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139230136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：