J. Interconnect. Networks最新文献_第2页

The λ4-Connectivity of the Cartesian Product of Trees 树的笛卡尔积的λ4连通性

J. Interconnect. Networks Pub Date : 2023-01-09 DOI: 10.1142/s0219265922500074

Hengzhe Li, Jiajia Wang, Rongxia Hao

引用次数: 0

Distance-Edge-Monitoring Sets in Hierarchical and Corona Graphs 层次图和电晕图中的距离边监测集

J. Interconnect. Networks Pub Date : 2022-12-28 DOI: 10.1142/s0219265922500037

Gang Yang, Changxiang He

引用次数: 0

Directed Tree Connectivity of Symmetric Digraphs and Complete Bipartite Digraphs 对称有向图和完全二部有向图的有向树连通性

J. Interconnect. Networks Pub Date : 2022-12-24 DOI: 10.1142/s0219265922500086

Junran Yu

引用次数: 0

Wireless Sensor Network Security Analysis for Data and Aggregation 基于数据和聚合的无线传感器网络安全分析

J. Interconnect. Networks Pub Date : 2022-12-19 DOI: 10.1142/s0219265922500025

Maravarman Manoharan, S. Babu, R. Pitchai

{"title":"Wireless Sensor Network Security Analysis for Data and Aggregation","authors":"Maravarman Manoharan, S. Babu, R. Pitchai","doi":"10.1142/s0219265922500025","DOIUrl":"https://doi.org/10.1142/s0219265922500025","url":null,"abstract":"Data security is critical in wireless sensor networks (WSNs) because communication signals are highly available due to data transmission in free space. Attacks ranging from passive eavesdropping to active snooping are more common on these networks. This paper proposes secure data transfer using data encryption based on the improved Rivest–Shamir–Adleman (RSA) with Diffie–Hellman (DH) key exchange algorithm (IRSA-DH). For this purpose, the adaptive distance-based agglomerative hierarchical (ADAH)-based clustering method is used. Then the cluster head (CH) is selected using the improved weight-based rain optimization (IWRO) to improve the network’s lifespan. This study aims to design a secure group communication method for WSNs. In order to generate and distribute the key to the group, the RSA and DH and key exchange algorithm had been hybridized with the Key Management Center (KMC). For safe communication between users, the key exchange technique is investigated. The performance measures such as throughput, packet loss ratio (PLR), packet delivery ratio (PDR), latency, energy consumption, end-to-end delay (EED) and network lifetime are analyzed and compared with the existing approaches.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"429 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116012989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Towards Intelligent Control of Beaconing Power and Beaconing Rate in Vehicular Ad Hoc Networks 车载自组网中信标功率和信标速率的智能控制研究

J. Interconnect. Networks Pub Date : 2022-11-21 DOI: 10.1142/s0219265922500013

Driss Ait Omar, Hamid Garmani, Mohamed EL Amrani, Es-said Azougaghe, Mohamed Baslam, M. Jourhmane

引用次数: 0

Security and Energy Aware Clustering-Based Routing in Wireless Sensor Network: Hybrid Nature-Inspired Algorithm for Optimal Cluster Head Selection 无线传感器网络中基于安全和能量感知的聚类路由:最优簇头选择的混合自然启发算法

J. Interconnect. Networks Pub Date : 2022-10-29 DOI: 10.1142/s0219265921500390

Mallanagouda Biradar, Basavaraj Mathapathi

{"title":"Security and Energy Aware Clustering-Based Routing in Wireless Sensor Network: Hybrid Nature-Inspired Algorithm for Optimal Cluster Head Selection","authors":"Mallanagouda Biradar, Basavaraj Mathapathi","doi":"10.1142/s0219265921500390","DOIUrl":"https://doi.org/10.1142/s0219265921500390","url":null,"abstract":"One of the significant approaches in implementing the routing of WSNs is clustering that leads to scalability and extending of network lifetime. In the clustered WSN, cluster heads (CHs) utilize maximum energy to another node. Moreover, it balanced the load present in the sensor nodes (SNs) between the CHS for enhancing the network lifespan. Moreover, the CH plays an important part in efficient routing, as well as it must be selected in an optimal way. Thus, this work intends to introduce a cluster-based routing approach in WSN, where it selects the CHs by the optimization algorithm. A new hybrid seagull rock swarm with opposition-based learning (HSROBL) is introduced for this purpose, which is the hybridized concept of rock hyraxes swarm optimization (RHSO) and seagull optimization algorithm (SOA). Further, the optimal CH selection is based on various parameters including distance, security, delay, and energy. At the end, the outcomes of the presented approach are analyzed to extant algorithms based on delay, alive nodes, average throughput, and residual energy, respectively. Based on throughput, alive node, residual energy, as well as delay, the overall improvement in performance is about 28.50%.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125005655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reliability of Augmented 3-Ary n-Cubes with Extra Faults 带额外故障的增广3-Ary n-立方体的可靠性

J. Interconnect. Networks Pub Date : 2022-09-29 DOI: 10.1142/s0219265921500407

Xueli Sun, Jianxi Fan, B. Cheng, Yan Wang, Jingya Zhou

引用次数: 0

Distance Optimally Edge Connectedness of Arrangement Graph Based on Subgraph Fault Pattern 基于子图故障模式的排列图距离最优边连通性

J. Interconnect. Networks Pub Date : 2022-09-21 DOI: 10.1142/s0219265921500389

Zhengqi Yu, Shuming Zhou, Hong Zhang, Xiaoqing Liu

{"title":"Distance Optimally Edge Connectedness of Arrangement Graph Based on Subgraph Fault Pattern","authors":"Zhengqi Yu, Shuming Zhou, Hong Zhang, Xiaoqing Liu","doi":"10.1142/s0219265921500389","DOIUrl":"https://doi.org/10.1142/s0219265921500389","url":null,"abstract":"Large-scale multiprocessor systems or multicomputer systems based on networking have been extensively used in the big data era and social network. Fault tolerance is becoming an essential attribute in multiprocessor systems with the increase of the system scale. For any distinct vertices [Formula: see text], the local connectivity of [Formula: see text] and [Formula: see text], denoted by [Formula: see text], is the maximum number of independent [Formula: see text]-paths in system graph [Formula: see text]. The local edge connectivity of [Formula: see text], [Formula: see text], [Formula: see text], is defined similarly. For any [Formula: see text], [Formula: see text], if [Formula: see text] (or [Formula: see text], then [Formula: see text] is [Formula: see text]-distance optimally (edge) connected, where [Formula: see text] is the diameter of [Formula: see text] and [Formula: see text] is the degree of [Formula: see text]. For any integers [Formula: see text] subject to [Formula: see text], if [Formula: see text] is [Formula: see text]-distance optimally (edge) connected, then we call [Formula: see text] is [Formula: see text]-distance local optimally (edge) connected. In this work, we show that [Formula: see text] ([Formula: see text] is [Formula: see text]-arrangement graph) is [Formula: see text]-distance local optimally edge connected for [Formula: see text] and [Formula: see text].","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121292333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Precise Values for the Strong Subgraph 3-Arc-Connectivity of Cartesian Products of Some Digraph Classes 某些有向图类笛卡尔积的强子图3-弧连通性的精确值

J. Interconnect. Networks Pub Date : 2022-08-27 DOI: 10.1142/s0219265921500365

Yiling Dong

引用次数: 0

Optimal Broadcasting in Fully Connected Trees 全连接树的最佳广播

J. Interconnect. Networks Pub Date : 2022-08-05 DOI: 10.1142/s0219265921500377

M. Gholami, Hovhannes A. Harutyunyan, Edward Maraachlian

引用次数: 5