Journal of High Speed Networks最新文献_第4页

A survey of provenance in scientific workflow 科学工作流程中的来源调查

IF 0.9

Journal of High Speed Networks Pub Date : 2023-02-15 DOI: 10.3233/jhs-222017

Songhai Lin, Hong Xiao, Wenjun Jiang, Dafeng Li, Jiaben Liang, Zelin Li

引用次数: 0

A high presence traditional crafts experience system that combines multicultural architectural styles with Japanese culture 融合多元文化建筑风格与日本文化的高存在感传统工艺体验体系

IF 0.9

Journal of High Speed Networks Pub Date : 2023-01-18 DOI: 10.3233/jhs-222074

Tomoyuki Ishida, Yangzhicheng Lu

引用次数: 0

Knowledge enhancement BERT based on domain dictionary mask 基于域字典掩码的知识增强BERT

IF 0.9

Journal of High Speed Networks Pub Date : 2023-01-16 DOI: 10.3233/jhs-222013

Xianglin Cao, Hong Xiao, Wenjun Jiang

引用次数: 0

Fault diagnosis model of multi-axis industrial robot based on triplet network 基于三重网络的多轴工业机器人故障诊断模型

IF 0.9

Journal of High Speed Networks Pub Date : 2022-12-22 DOI: 10.3233/jhs-222014

Guangsi Xiong, Ping Li, Hanlin Zeng, Hong Xiao, Wenjun Jiang

引用次数: 0

An anti-consensus strategy based on continuous perturbation updates in opposite directions 一种基于相反方向的连续扰动更新的反共识策略

IF 0.9

Journal of High Speed Networks Pub Date : 2022-12-06 DOI: 10.3233/jhs-220001

Yujie Xie, Xintong Liang, Yifan Huang, Jian Hou, Yubo Jia

{"title":"An anti-consensus strategy based on continuous perturbation updates in opposite directions","authors":"Yujie Xie, Xintong Liang, Yifan Huang, Jian Hou, Yubo Jia","doi":"10.3233/jhs-220001","DOIUrl":"https://doi.org/10.3233/jhs-220001","url":null,"abstract":"In modern society, multi-agent consensus is applied in many applications such as distributed machine learning, wireless sensor networks and so on. However, some agents might behave abnormally subject to external attack or internal faults, and thus fault-tolerant consensus problem is studied recently, among which Q-consensus is one of the state-of-the-art and effective methods to identify all the faulty agents and achieve consensus for normal agents in general networks. To fight against Q-consensus algorithm, this paper proposes a novel strategy, called split attack, which is simple but capable of breaking consensus convergence. By aggregating all the states of neighboring nodes with an extra perturbation, the normal nodes are split into sub-groups and converge to two separate values, so that consensus is broken. Two scenarios, including the introduction of additional faulty nodes and compromise of the original nodes, are considered. More specifically, in the former case, two additional faulty nodes are adopted, each of which is responsible to mislead parts of the normal nodes. While in the latter one, two original normal nodes are compromised to mislead the whole system. Moreover, the compromised nodes selection is fundamentally a classification problem, and thus optimized through CNN. Finally, the numerical simulations are provided to verify the proposed schemes and indicate that the proposed method outperforms other attack methods.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"37 4 1","pages":"15-25"},"PeriodicalIF":0.9,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75372886","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

Energy-aware resource management in Internet of vehicles using machine learning algorithms 基于机器学习算法的车联网能源感知资源管理

IF 0.9

Journal of High Speed Networks Pub Date : 2022-11-15 DOI: 10.3233/jhs-222004

Sichao Chen, Yuanchao Hu, Liejiang Huang, Dilong Shen, Yuanjun Pan, Ligang Pan

{"title":"Energy-aware resource management in Internet of vehicles using machine learning algorithms","authors":"Sichao Chen, Yuanchao Hu, Liejiang Huang, Dilong Shen, Yuanjun Pan, Ligang Pan","doi":"10.3233/jhs-222004","DOIUrl":"https://doi.org/10.3233/jhs-222004","url":null,"abstract":"Internet of Vehicles (IoV) presents a new generation of vehicular communications with limited computation offloading, energy and memory resources with 5G/6G technologies that have grown enormously and are being used in wide variety of Intelligent Transportation Systems (ITS). Due to the limited battery power in smart vehicles, the concept of energy consumption is one of the main and critical challenges of the IoV environments. Optimizing resource management strategies for improving the energy consumption using AI-based methods is one of important solutions in the IoV environments. There are various machine learning algorithms for selecting optimal solutions for energy-efficient resource management strategies. This paper presents the existing energy-aware resource management strategies for the IoV case studies, and performs a comparative analysis among their applied AI-based methods and machine learning algorithms. This analysis presents a technical and deeper understanding of the technical aspects of existing machine learning and AI-based algorithms that will be helpful in design of new hybrid AI approaches for optimizing resource management strategies with reducing their energy consumption.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"44 1","pages":"27-39"},"PeriodicalIF":0.9,"publicationDate":"2022-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73681372","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}

引用次数: 1

A secure data fitting scheme based on CKKS homomorphic encryption for medical IoT 基于CKKS同态加密的医疗物联网安全数据拟合方案

IF 0.9

Journal of High Speed Networks Pub Date : 2022-11-08 DOI: 10.3233/jhs-222016

Yunxuan Su, Xu An Wang, Weidong Du, Yunlong Ge, Kaiyang Zhao, M. Lv

引用次数: 0

Data forwarding: A new VoteRank and Assortativity based approach to improve propagation time in social networks 数据转发:一种新的基于VoteRank和选型性的方法来改善社交网络中的传播时间

IF 0.9

Journal of High Speed Networks Pub Date : 2022-11-08 DOI: 10.3233/jhs-220695

Kasra Majbouri Yazdi, Jingyu Hou, Saeid Khodayi, Adel Majbouri Yazdi, Saeed Saedi, Wanlei Zhou

{"title":"Data forwarding: A new VoteRank and Assortativity based approach to improve propagation time in social networks","authors":"Kasra Majbouri Yazdi, Jingyu Hou, Saeid Khodayi, Adel Majbouri Yazdi, Saeed Saedi, Wanlei Zhou","doi":"10.3233/jhs-220695","DOIUrl":"https://doi.org/10.3233/jhs-220695","url":null,"abstract":"With the rapid development of social networks, studying and analyzing their structures and behaviors has become one of the most important requirements of businesses. Social network analysis can be used for many different purposes such as product ads, market orientation detection, influential members detection, predicting user behaviors, recommender systems improvements, etc. One of the newest research topics in social network analysis is the enhancement of the information propagation performance in different aspects based on application. In this paper, a new method is proposed to improve few metrics such as distribution time and precision on social networks. In this method, the local attributes of nodes and also the structural information of the network is used to forward data across the network and reduce the propagation time. First of all, the centrality and Assortativity are calculated for all nodes separately to select two sets of nodes with the highest values for both criteria. Then, the initial active nodes of the network are selected by calculating the intersection of the two sets. Next, the distribution paths are detected based on the initial active nodes to calculate the propagation time. The performance analysis results show that the proposed method has better outcomes in comparison to other state-of-the-art methods in terms of distribution time, precision, recall, and AUPR criteria.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"207 ","pages":"275-285"},"PeriodicalIF":0.9,"publicationDate":"2022-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72435481","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

Double Q-learning based routing protocol for opportunistic networks 基于双q学习的机会网络路由协议

IF 0.9

Journal of High Speed Networks Pub Date : 2022-11-03 DOI: 10.3233/jhs-222018

Jagdeep Singh, S. K. Dhurandher, I. Woungang, L. Barolli

{"title":"Double Q-learning based routing protocol for opportunistic networks","authors":"Jagdeep Singh, S. K. Dhurandher, I. Woungang, L. Barolli","doi":"10.3233/jhs-222018","DOIUrl":"https://doi.org/10.3233/jhs-222018","url":null,"abstract":"Opportunistic Delay Tolerant Networks also referred to as Opportunistic Networks (OppNets) are a subset of wireless networks having mobile nodes with discontinuous opportunistic connections. As such, developing a performant routing protocol in such an environment remains a challenge. Most research in the literature have shown that reinforcement learning-based routing algorithms can achieve a good routing performance, but these algorithms suffer from under-estimations and/or over-estimations. Toward addressing these shortcomings, in this paper, a Double Q-learning based routing protocol for Opportunistic Networks framework named Off-Policy Reinforcement-based Adaptive Learning (ORAL) is proposed, which selects the most suitable next-hop node to transmit the message toward its destination without any bias by using a weighted double Q-estimator. In the next-hop selection process, a probability-based reward mechanism is involved, which considers the node’s delivery probability and the frequency of encounters among the nodes to boost the protocol’s efficiency. Simulation results convey that the proposed ORAL protocol improves the message delivery ratio by maintaining a trade-off between underestimation and overestimation. Simulations are conducted using the HAGGLE INFOCOM 2006 real mobility data trace and synthetic model, showing that when time-to-live is varied, (1) the proposed ORAL scheme outperforms DQLR by 14.05%, 9.4%, 5.81% respectively in terms of delivery probability, overhead ratio and average delay; (2) it also outperforms RLPRoPHET by 16.17%, 9.2%, 6.85%, respectively in terms of delivery ratio, overhead ratio and average delay.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"15 1","pages":"1-14"},"PeriodicalIF":0.9,"publicationDate":"2022-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87399989","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}

引用次数: 2

Performance evaluation of contact-time based and adaptive-timer based message suppression methods for inter-vehicle communication in vehicular DTN 车载DTN中基于接触时间和自适应定时器的信息抑制方法性能评价

IF 0.9

Journal of High Speed Networks Pub Date : 2022-11-03 DOI: 10.3233/jhs-222071

Makoto Ikeda

{"title":"Performance evaluation of contact-time based and adaptive-timer based message suppression methods for inter-vehicle communication in vehicular DTN","authors":"Makoto Ikeda","doi":"10.3233/jhs-222071","DOIUrl":"https://doi.org/10.3233/jhs-222071","url":null,"abstract":"In the next generation wireless networks, the number of connected terminals to the network, communication protocols, and the channels available will be increased, thus network slicing will become more important. Also, vehicles, buses, trains and motorcycles are considered communication terminals. These communication terminals should have independent network management considering their movement such as joining and leaving the networks. Therefore, Delay-Disruption-Disconnection Tolerant Networking (DTN) has been attracting attention for their potential support of inter-vehicle communication. In this paper are presented the Contact-Time (CT) based and Adaptive-Timer (AT) based Message Suppression (MS) methods for Vehicular DTN. For the CT-based MS method are used three DTN protocols for Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication. For AT-based MS are used conventional Epidemic and two proposed Epidemic-based methods for V2V communication. We compare MS method, Message Suppression Controller (MSC) and MSC with Adaptive Threshold (MSC-ATh). The simulation results show that MSC-ATh performs better than other approaches. The storage consumption is improved when the number of vehicles increases and there is no reduction in PDR even if the message suppression is enabled. For Epidemic, when the number of Road-Side Units (RSUs) is 16, the results of PDR are the best compared with other DTN protocols. The MSC-ATh method is about 22% better than Epidemic for storage consumption. Also, the delay performance of MSC-ATh is improved by increasing the Suppression Coefficients (SCs) and number of vehicles.","PeriodicalId":54809,"journal":{"name":"Journal of High Speed Networks","volume":"1 1","pages":"57-73"},"PeriodicalIF":0.9,"publicationDate":"2022-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81083158","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