An optimization method for wireless mobile network routing

Abstract

The invention discloses an optimization method for wireless mobile network route selection, and belongs to the field of wireless mobile networks. The specific technical scheme includes: according to the number of neighbors of network nodes, dynamically defining local areas in a network in real time, partitioning the nodes with the number of the neighbors larger than a defined value into the local areas with large intensity, routing the nodes in the local areas according to network topology of the local areas of current sending nodes and based on a unisource shortest route, and routing the nodes outside the local areas by adoption of a routing protocol based on geographic locations; and if routing fails, the sending nodes store messages to be sent, and after T time, performing the routing selection again. The optimization method for the wireless mobile network routing selection can be applied to high dynamic wireless mobile networks including vehicle-mounted self-organization networks and the like. According to the optimization method for the wireless mobile network routing selection, the routing based on the geographic locations is fully combined with the routing based on the network topology, the routing based on the geographic locations and the routing based on the network topology are called according to occasions, a message delivery success rate is increased, time delay is reduced, and overall performance of the network is enhanced.

Description

technical field [0001] The invention relates to a wireless mobile network, in particular to an optimization method for route selection in a highly dynamic wireless mobile network. Background technique [0002] With the development of wireless mobile networks, various wireless mobile networks are widely used in people's lives, such as vehicular ad hoc networks. As a highly dynamic wireless mobile network, vehicular ad hoc networks have the following salient features: [0003] (1) The distribution of node density is uneven. In different locations and areas, the density distribution of nodes is different in different time periods. For example, the density of nodes is very high in the bustling urban areas and during rush hours, while the density of nodes in areas such as highways and suburbs is very small. ; [0004] (2) The network topology changes frequently, and the position change rate of each node depends on the node density in the area where it is located. If the node mov...

AI Technical Summary

Problems solved by technology

[0006] (4) Due to the existence of communication obstacles (such as high-rise buildings, etc.), although the nodes are within the communication range between each other, they cannot communicate;

[0011] (1) Although the processing process converges quickly, the path found is also a relatively short path from the source point to the destination point, but when it is applied to a highly dynamic wireless mobile network, the network topology changes very frequently, especially the node density is not In very large cases, the node moves very fast. Often, before the message is forwarded from the source point to the destination point, the link node has already moved, the link is frequently broken, and the node cannot be found when the message is forwarded, resulting in loss. Bag;

[0012] (2) When the network topology is large or the node density is high, it is unrealistic to know the topology of the entire network in real time, and it will also cause a considerable network load, resulting in network congestion that seriously affects network performance

[0017] (1) When the network nodes are relatively dense, such as the rush hour of commuting vehicles or the bustling area of ​​the city center, the node moves slowly at this time, and the topology changes slowly, but each time the forwarded message is still looking for the next hop node through greedy routing , resulting in a lot of unnecessary delivery, increasing network load and delay;

[0018] (2) The right-hand rule in the repair strategy, the selected next-hop node is likely to forward in the direction away from the destination node, increasing the delay, and it is very likely to run out of forwarding time and cause packet loss

Images