Research On Routing Algorithm Based On Opportunistic IoT And Node Cooperation

With the rapid development of Io T technology and industry,many emerging Io T application scenarios have been born.Such as underwater environmental monitoring,collection of wildlife information,and early warning of road hazards in mountainous areas.It is difficult for the existing wireless communication networks to operate effectively in the absence of infrastructure.However,opportunistic networks can be better applied to these emerging scenarios,using the contact opportunities between network nodes for data transmission without infrastructure.Considering that the temporary communication network between wireless nodes is highly dynamic and partially connected,the complete connection path may not exist in the network.The "storage-carry-forward" routing model is used by opportunistic networks to solve the problem of intermittent connections.However,traditional routing algorithms are no longer suitable for this routing model,and the design of opportunistic network routing algorithms faces huge challenges.How to use the attribute information of nodes to improve data transmission performance has been a hot topic in recent years,and it is also the focus of this thesis.Based on an exhaustive sorting and analysis of existing opportunistic network routing algorithms,this thesis summarizes the main issues that affect the performance of routing algorithms,such as inaccurate community division,unbalanced network load,insufficient utilization of node information,and excessive redundant messages.Then based on this,two innovative routing algorithms are proposed purposefully,and the specific research work is as follows:(1)This thesis proposes a routing algorithm based on the attributes of nodes and buffer management.To address the problem of underutilization of node information,the algorithm integrates information such as node type,power,cache and encounter probability to select the next hop for message forwarding,which prevents messages from being transmitted to nodes with insufficient resources and weak communication capabilities.For the problem of excessive redundant messages,a buffer management mechanism based on priority scheduling is adopted,which allows nodes to send messages or clear caches according to different priorities,and delete redundant copies of messages in the network promptly.(2)This thesis proposes a routing algorithm based on dynamic community partition and destination node concentration.To solve the problem of inaccurate community division,the algorithm combines the idea of community division in complex networks,using the information of node connections to construct a weighted opportunistic network,and then dividing the network communities dynamically according to the connection weights and the social attributes of nodes,which improves the accuracy of community division.To handle the problem of unbalanced network load,the algorithm implements a forwarding strategy based on the concentration of the destination node,which indicates the transmission direction for messages to reach the destination node,and reduces the load on central nodes to make the whole network more balanced.(3)This thesis uses The ONE,a simulation tool for opportunistic networks,to design a transmission model based on the urban traffic network environment,as well as an evaluation module for load balancing of the network.Simulations are performed to compare the classical algorithms with the algorithms proposed in this thesis.Results show that the proposed algorithms can effectively improve the message delivery rate and reduce the network load.