The Research and Simulation of the Satellite Network Routing Algorithm Based on Game Theory

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.

Download Full-text

Intelligent Multipath Backup Ant Colony Routing Algorithm of Satellite Network Based on Betweenness Centrality

2020 IEEE Computing, Communications and IoT Applications (ComComAp) ◽

10.1109/comcomap51192.2020.9398870 ◽

2020 ◽

Author(s):

Rong Zhou ◽

Qi Zhang ◽

Ying Tao ◽

Yufei Shen ◽

Wei Zhang ◽

...

Keyword(s):

Betweenness Centrality ◽

Routing Algorithm ◽

Ant Colony ◽

Satellite Network

Download Full-text

Network Routing Mechanism Simulation Research Based on VANETs

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.651-653.1868 ◽

2014 ◽

Vol 651-653 ◽

pp. 1868-1874

Author(s):

Li Zhu ◽

Lan Bai

Keyword(s):

Routing Protocol ◽

Vehicular Networks ◽

Routing Algorithm ◽

Dynamic Network ◽

Network Routing ◽

On Demand ◽

Routing Mechanism ◽

Demand Routing ◽

On The Road ◽

Low Efficiency

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.

Download Full-text