Heterogeneous Satellite Network Routing Algorithm Based on Reinforcement Learning and Mobile Agent

Author(s):  
Xiaojing Shi ◽  
Pinyi Ren ◽  
Qinghe Du
2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Shitong Ye ◽  
Lijuan Xu ◽  
Xiaomin Li

Through the research on the vehicle-mounted self-organizing network, in view of the current routing technical problems of the vehicle-mounted self-organizing network under the condition of no roadside auxiliary communication unit cooperation, this paper proposes a vehicle network routing algorithm based on deep reinforcement learning. For the problems of massive vehicle nodes and multiple performance evaluation indexes in vehicular ad hoc network, this paper proposes a time prediction model of vehicle communication to reduce the probability of communication interruption and proposes the routing technology of vehicle network by studying the deep reinforcement learning method. This technology can quickly select routing nodes and plan the optimal route according to the required performance evaluation indicators.


2002 ◽  
Vol 122 (6) ◽  
pp. 922-927
Author(s):  
Hiroyuki Une ◽  
Takashi Yokoyama ◽  
Shigeya Ikebo ◽  
Akinobu Tanaka ◽  
Fei Qian

Electronics ◽  
2021 ◽  
Vol 10 (10) ◽  
pp. 1138
Author(s):  
Yu Lu ◽  
Liu Chang ◽  
Jingwen Luo ◽  
Jia Wu

With the rapid popularization of 5G communication and internet of things technologies, the amount of information has increased significantly in opportunistic social networks, and the types of messages have become more and more complex. More and more mobile devices join the network as nodes, making the network scale increase sharply, and the tremendous amount of datatransmission brings a more significant burden to the network. Traditional opportunistic social network routing algorithms lack effective message copy management and relay node selection methods, which will cause problems such as high network delay and insufficient cache space. Thus, we propose an opportunistic social network routing algorithm based on user-adaptive data transmission. The algorithm will combine the similarity factor, communication factor, and transmission factor of the nodes in the opportunistic social network and use information entropy theory to adaptively assign the weights of decision feature attributes in response to network changes. Also, edge nodes are effectively used, and the nodes are divided into multiple communities to reconstruct the community structure. The simulation results show that the algorithm demonstrates good performance in improving the information transmission’s success rate, reducing network delay, and caching overhead.


2014 ◽  
Vol 651-653 ◽  
pp. 1868-1874
Author(s):  
Li Zhu ◽  
Lan Bai

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.


Sign in / Sign up

Export Citation Format

Share Document