检索结果-南通市图书馆

Research on optimal intelligent routing algorithm for IoV with machine learning and smart contract

在线全文

学校读者我要写书评

暂无评论

Digital Communications and Networks 2023年第1期9卷 47-55页

作者： Baofeng Ji Mingkun Zhang Ling Xing Xiaoli Li Chunguo Li Congzheng Han Hong Wen Henan University of Science and Technology College of Information EngineeringLuoyang471000China The Institute of Atmospheric Physics Chinese Academy of Sciences(LAGEO)Beijing100029China Longmen Laboratory Luoyang471000China Chinese Academy of Agricultural Mechanization Sciences Beijing100000China University of Bristol BristolBS00UK University of Electronic Science and Technology of China Chengdu610000China

The huge increase in the communication network rate has made the application fields and scenarios for vehicular ad hoc networks more abundant and diversified and proposed more requirements for the efficiency and quality of data *** improve the limited communication distance and poor communication quality of the Internet of Vehicles(IoV),an optimal intelligent routing algorithm is proposed in this *** multiweight decision algorithm with the greedy perimeter stateless routing protocol,designed and evaluated standardized function for link *** additive weighting is used to optimize link stability and distance to improve the packet delivery rate of the *** blockchain system is used as the storage structure for relay data,and the smart contract incentive algorithm based on machine learning is used to encourage relay vehicles to provide more communication bandwidth for data packet *** proposed scheme is simulated and analyzed under different scenarios and different *** experimental results demonstrate that the proposed scheme can effectively reduce the packet loss rate and improve system performance.

关键词： IoV Machine learning Smart contract routing algorithm GPSR Relay transmission

Geographic Information and Node Selfish-Based routing algorithm for Delay Tolerant Networks

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2017年第3期22卷 243-253页

作者： Fang Lu Jianbo Li Shan Jiang Youmei Song Fushu Wang College of Computer Science andTechnology Qingdao UniversityQingdao 266071China

In Delay Tolerant Networks （DTNs）, some routing algorithms ignore that most nodes are selfish, i.e., nodes are willing to use their own resources to forward messages to nodes with whom they have a relationship. In view of this phenomenon, we propose a routing algorithm based on Geographic Information and Node Selfishness （GINS）. To choose a forwarding node, GINS combines nodes＇ willingness to forward and their geographic information to maximize the possibility of contacting the destination. GINS formulates the message forwarding process as a 0-1 Knapsack Problem with Assignment Restrictions to satisfy node demands for selfishness. Extensive simulations were conducted, and results show that GINS can achieve a high delivery ratio and a lower hop count compared with GRONE and LPHU. Furthermore, its overhead ratio is 25% and 30% less than that of GRONE and LPHU, respectively.

关键词： delay tolerant networks node willingness routing algorithm geographic information forwarding process

A survey of routing algorithm for mesh Network-on-Chip

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2016年第4期10卷 591-601页

作者： Yue WU Chao LU Yunji CHEN State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 101408 China Loongson Technology Corporation Limited Beijing 100095 China

With the rapid development of semiconductor in- dustry, the number of cores integrated on chip increases quickly, which brings tough challenges such as bandwidth, scalability and power into on-chip interconnection. Under such background, Network-on-Chip （NoC） is proposed and gradually replacing the traditional on-chip interconnections such as sharing bus and crossbar. For the convenience of physical layout, mesh is the most used topology in NoC design. routing algorithm, which decides the paths of pack- ets, has significant impact on the latency and throughput of network. Thus routing algorithm plays a vital role in a wellperformed network. This study mainly ：focuses on the routing algorithms of mesh NoC. By whether taking network information into consideration in routing decision, routing algorithms of NoC can be roughly classified into oblivious routing and adaptive routing. Oblivious routing costs less without adaptiveness while adaptive routing is on the contrary. To combine the advantages of oblivious and adaptive routing algorithm, half-adaptive algorithms were proposed. In this paper, the concepts, taxonomy and features of routing algorithms of NoC are introduced. Then the importance of routing algorithms in mesh NoC is highlighted, and representative routing algorithms with respective features are reviewed and summarized. Finally, we try to shed light upon the future work of NoC routing algorithms.

关键词： Network-on-Chip mesh topology routing algorithm adaptive routing oblivious routing

Virtual channel load-balanced routing algorithm for Torus networks

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2011年第1期18卷 70-76页

作者： WANG Ya-gang DU Hui-min SHEN Xu-bang School of Computer Xidian University Xi'an 710071 China School of Computer Xi'an University of Posts and Telecommunications Xi'an 710121 China School of Electronic Engineering Xi'an University of Posts and Telecommunications Xi'an 710121 China

In order to improve the network performance furthermore, a routing algorithm for 2D-Torus is investigated from the standpoint of load balance for virtual channels. The 2D-Torus network is divided into two virtual networks and each physical channel is split into three virtual channels. A novel virtual channel allocation policy and a routing algorithm are proposed, in which traffic load is distributed to those three virtual channels in a more load-balanced manner by introducing a random parameter. Simulations of the proposed algorithm are developed with a SystemC-based test bench. The results show that compared with the negative first for Torus networks （NF-T） algorithm, the proposed algorithm can achieve better performance in terms of network latency and throughput under different traffic patterns. It also shows that a routing algorithm with load balance for virtual channels can significantly improve the network performance furthermore.

关键词： interconnection network Torus networks routing algorithm virtual channel load balance

Load Balancing routing algorithm Based on Extended Link States in LEO Constellation Network

在线全文

学校读者我要写书评

暂无评论

China Communications 2022年第2期19卷 247-260页

作者： Chaoying Dong Xin Xu Aijun Liu Xiaohu Liang College of Communications Engineering Army Engineering University of PLANanjing 210007China

As an important part of satellite communication network,LEO satellite constellation network is one of the hot research *** the nonuniform distribution of terrestrial services may cause inter-satellite link congestion,improving network load balancing performance has become one of the key issues that need to be solved for routing algorithms in LEO ***,by expanding the range of available paths and combining the congestion avoidance mechanism,a load balancing routing algorithm based on extended link states in LEO constellation network is *** results show that the algorithm achieves a balanced distribution of traffic load,reduces link congestion and packet loss rate,and improves throughput of LEO satellite network.

关键词： LEO satellite routing algorithm congestion avoidance load balancing

Congestion aware routing algorithm for delay-disruption tolerance networks

在线全文

学校读者我要写书评

暂无评论

Journal of Central South University 2011年第1期18卷 133-139页

作者：陶勇龚正虎林亚平周四望 School of Computer National University of Defense Technology School of Software Hunan University

There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering *** simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.

关键词： delay-disruption tolerant network congestion control routing algorithm custody transfer

A DTN Oriented Adaptive routing algorithm Based on Node Load

在线全文

学校读者我要写书评

暂无评论

China Communications 2022年第12期19卷 54-63页

作者： Hongyan Cui Diyue Chen Roy E.Welsch State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China Beijing Laboratory of Advanced Information Networks Beijing University of Posts and TelecommunicationsBeijing 100876China Massachusetts Institute of Technology CambridgeMA 02139USA

In recent years,Delay Tolerant Networks(DTN)have received more and more *** the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceive changes in the network *** paper proposes an AdaptiveSpray routing *** algorithm can dynamically control the initial maximum message copy number according to the cache occupancy rate of the node itself,and the cache occupancy rate is added as an impact factor to the calculation of the probability of each node meeting the destination *** the forwarding phase,the node will first compare the meeting probability of itself and the meeting node to the destination node,and then choose different forwarding *** simulation shows that the AdaptiveSpray algorithm proposed in this paper has obvious advantages compared with the existing routing algorithms in terms of message delivery rate and average delay.

关键词： DTN routing algorithm adaptive cache management

Topological properties and routing algorithm for semi-diagonal torus networks

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2011年第5期18卷 64-70页

作者： WANG Ya-gang DU Hui-min SHEN Xu-bang School of Computer Xidian University Xi＇an 710071 China School of Electronic Engineering Xi＇an University of Posts and Telecommunications Xi＇an 710121 China

To improve the scalability and reduce the implementation complexity of Mesh and Mesh-like networks, the semi-diagonal Torus （SD-Torus） network, a regular and symmetrical intercormection network is proposed. The SD-Torus network is a combination of a typical 2D-Torus network with two extra diagonal links from northwest to southeast direction for each node. The topological properties of SD-Torus networks are discussed, and a load balanced routing algorithm for SD-Torus is presented. System-C based simulation result shows that, compared with diagonal Mesh （DMesh）, diagonal Torus （DTorus） and XMesh networks, the SD-Torus network can achieve high performance with a lower network cost. It makes the SD-Torus network a powerful candidate for the high performance interconnection networks.

关键词： interconnection networks routing algorithm load balance SD-Toms networks direct networks

Directional routing algorithm for Deep Space Optical Network

在线全文

学校读者我要写书评

暂无评论

China Communications 2017年第1期14卷 158-168页

作者： Lei Guo Xiaorui Wang Yejun Liu Pengchao Han Yamin Xie Yuchen Tan Key Laboratory of Medical Image Computing of Northeastern University Ministry of Education School of Computer Science and Engineering Northeastern University Shenyang 110819 China School of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou 450002 China State Key Laboratory of Information Photonics and Optical Communications (BUPT) 100876 China

With the development of science, economy and society, the needs for research and exploration of deep space have entered a rapid and stable development stage. Deep Space Optical Network(DSON) is expected to become an important foundation and inevitable development trend of future deepspace communication. In this paper, we design a deep space node model which is capable of combining the space division multiplexing with frequency division multiplexing. Furthermore, we propose the directional flooding routing algorithm(DFRA) for DSON based on our node model. This scheme selectively forwards the data packets in the routing, so that the energy consumption can be reduced effectively because only a portion of nodes will participate the flooding routing. Simulation results show that, compared with traditional flooding routing algorithm(TFRA), the DFRA can avoid the non-directional and blind transmission. Therefore, the energy consumption in message routing will be reduced and the lifespan of DSON can also be prolonged effectively. Although the complexity of routing implementation is slightly increased compared with TFRA, the energy of nodes can be saved and the transmission rate is obviously improved in DFRA. Thus the overall performance of DSON can be significantly improved.

关键词： deep space optical network routing algorithm directional flooding routing algorithm traditional flooding routing algorithm