Routing method and device based on neighbor node density, storage medium and terminal

Abstract

The invention discloses a routing method and device based on neighbor node density, a storage medium and a terminal. The method comprises the following steps: receiving RREQ control information sent by a sending node; judging whether the current node is an isolated node of the sending node, if so, caching the RREQ control information and forwarding the RREQ control information; and otherwise, judging whether the current node is an over-dense node of the sending node, if so, discarding the RREQ control information, and if not, forwarding the RREQ control information based on the RREQ control information forwarding probability of the current node. According to the invention, different RREQ control information forwarding forms are implemented, and the purpose of reducing broadcast control information of nodes in the self-organizing network due to discovery of routing based on the neighbor node density and the neighbor node relative position is achieved. The reliability of the data in the routing discovery process from the source node to the destination node is improved, and unnecessary control information forwarding is reduced, so that the throughput and the data packet transmissibility of the self-organizing network are improved, and the network delay and overhead are reduced.

Description

Technical Field

[0001] The present invention relates to the technical field of wireless self-organizing network communication, and in particular to a routing method and device based on neighbor node density, a storage medium and a terminal. Background Art

[0002] With the rapid development of economy and society, people have put forward higher requirements for the speed and quality of wireless transmission. Existing wireless networks can be divided into two types: one is infrastructure-based, which is often controlled by a central network, such as GSM and Wifi; the other is infrastructure-free, which is composed of a number of network device nodes and is not controlled by a central node, such as an ad hoc network. Mobile ad hoc network is a type of ad hoc network, which is also a wireless network. It consists of a group of mobile nodes. They can self-organize into a network without any pre-configured infrastructure, and can also establish a temporary communication network without Internet connection. These nodes are connected to each other in a self-organizing and distributed manner to transmit information and data.

[0003] However, there are still some challenges and limitations in mobile ad hoc networks. For example, in a scenario where nodes move quickly, the rapid change in network topology may cause the routing path to fail and be recalculated, causing some nodes to send a large number of broadcast messages to other nodes in a short period of time. When superimposed with the messages normally sent by other nodes in the network, the resulting instantaneous traffic and congestion exceed the bandwidth and resource capacity of the network, resulting in a degradation of network performance or even complete interruption. This phenomenon is called the network storm problem. To solve this problem, researchers have developed several strategies and techniques to optimize the performance of mobile ad hoc networks and reduce the risk of network storms. The most commonly used method is to use congestion control and routing protocols, such as AODV. These technologies and protocols can help reduce useless broadcast messages and optimize routing paths, thereby avoiding the occurrence of network storms.

[0004] However, the above methods can only work well when the number of mobile devices is small in most cases, and the network performance will still decrease when the number of mobile devices is large. In the future, the number of network devices connected is bound to increase continuously, so it is of great practical significance to improve the networking performance of ad hoc network systems under large number of connections. Summary of the invention

[0005] The purpose of the present application is to provide a routing method and device, a storage medium and a terminal based on neighbor node density, which are used to solve the problem that the existing mobile self-organizing network can only perform well when the number of mobile devices is small, and the network performance will still decline when the number of mobile devices is large.

[0006] In a first aspect, the present application provides a routing method based on neighbor node density, comprising:

[0007] Receive RREQ control information sent by the sending node;

[0008] Determine whether the current node is an isolated node of the sending node, if so, cache the RREQ control information and forward the RREQ control information; otherwise

[0009] It is determined whether the current node is an overcrowded node of the sending node. If so, the RREQ control information is discarded; otherwise, the RREQ control information is forwarded based on the RREQ control information forwarding probability of the current node.

[0010] In one embodiment of the present application, the process of determining whether the current node is an isolated node of the sending node and determining whether the current node is an overcrowded node of the sending node is as follows:

[0011] Obtaining an average value of the number of common nodes between the sending node and all its neighboring nodes, and obtaining a standard deviation of the number of common nodes between the sending node and all its neighboring nodes;

[0012] Obtaining the number of common nodes between the sending node and the current node as the target node number, and obtaining the standard deviation of the current node based on the target node number, the average value of the number of common nodes, and the standard deviation of the number of common nodes;

[0013] It is determined whether the standard deviation is greater than the overcrowded confidence threshold. If so, it indicates that the current node is an overcrowded node of the sending node. Otherwise, it is determined whether the standard deviation is less than the overcrowded confidence threshold. If so, it indicates that the current node is an isolated node of the sending node.

[0014] In one embodiment of the present application, the standard deviation of the current node is obtained as follows:

[0015]

[0016] Among them, z is the standard deviation of the current node, N ij is the target number of nodes, is the average number of public nodes, Vc j is the standard deviation of the number of common nodes.

[0017] In one embodiment of the present application, the over-dense confidence threshold is 1.645, and the over-dense confidence threshold is -1.645.

[0018] In one embodiment of the present application, the step of receiving RREQ control information sent by the sending node includes:

[0019] Receiving RREQ control information sent by a sending node, and parsing the RREQ control information to obtain destination node information and source node information;

[0020] Based on the destination node information, determine whether the current node is the destination node or whether the destination node information exists in the current node routing information. If yes, send the RREQ control information to the source node based on the source node information; otherwise

[0021] It is determined whether the number of neighbor nodes of the current node is greater than a constant threshold, and if so, subsequent steps are executed; otherwise, the RREQ control information is cached and forwarded.

[0022] In one embodiment of the present application, forwarding the RREQ control information based on the RREQ control information forwarding probability of the current node includes:

[0023] Obtain the RREQ control information forwarding probability and probability random number of the current node, and determine whether the RREQ control information forwarding probability of the current node is greater than the probability random number. If so, cache the RREQ control information and forward the RREQ control information; otherwise, discard the RREQ control information.

[0024] In one embodiment of the present application, the forwarding probability of the RREQ control information of the current node is obtained in the following manner:

[0025] P i =k / Nb i

[0026] Among them, Pi is the RREQ control information forwarding probability of the current node, k is a constant threshold, and Nbi is the number of neighbor nodes of the current node.

[0027] In a second aspect, the present application provides a routing device based on neighbor node density, including an information receiving module, an isolated node determination module, and an overcrowded node determination module;

[0028] The information receiving module is used to receive the RREQ control information sent by the sending node;

[0029] The isolated node determination module is used to determine whether the current node is an isolated node of the sending node, and if so, cache the RREQ control information and forward the RREQ control information, otherwise, transfer to the overcrowded node determination module;

[0030] The overcrowded node determination module is used to determine whether the current node is an overcrowded node of the sending node, and if so, discard the RREQ control information; otherwise, forward the RREQ control information based on the RREQ control information forwarding probability of the current node.

[0031] In a third aspect, the present application provides a storage medium having a computer program stored thereon, which, when executed by a processor, implements the routing method based on neighbor node density.

[0032] In a fourth aspect, the present application provides a terminal, comprising: a processor and a memory, wherein the memory is communicatively connected to the processor;

[0033] The memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory, so that the terminal executes the routing method based on neighbor node density.

[0034] Compared with the prior art, one or more embodiments of the above scheme may have the following advantages or beneficial effects:

[0035] By applying the routing method based on neighbor node density provided by the embodiment of the present invention, by determining overcrowded nodes and isolated nodes, different RREQ control information forwarding forms are implemented to achieve the purpose of reducing the broadcast control information of nodes in the self-organizing network due to route discovery based on the neighbor node density and the relative position of the neighbor nodes. The reliability of the route discovery process from the source node to the destination node can be improved, and unnecessary control information forwarding can be reduced, thereby improving the throughput and data packet delivery rate of the self-organizing network, and reducing network delay and overhead.

[0036] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures particularly pointed out in the description, claims and drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] The accompanying drawings are used to provide a further understanding of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings:

[0038] Figure 1 A schematic diagram of a process flow of a routing method based on neighbor node density according to a first embodiment of the present invention is shown;

[0039] Figure 2 A schematic diagram of an isolated node in Embodiment 1 of the present invention is shown;

[0040] Figure 3 A schematic diagram of overcrowded nodes in the first embodiment of the present invention is shown;

[0041] Figure 4 A schematic diagram showing a specific process of a routing method based on neighbor node density according to a first embodiment of the present invention is shown;

[0042] Figure 5 A schematic diagram showing throughput under different confidence thresholds using a routing method based on neighbor node density in Embodiment 1 of the present invention is shown;

[0043] Figure 6 A schematic diagram showing the data packet delivery rate at different confidence thresholds using a routing method based on neighbor node density in Embodiment 1 of the present invention is shown;

[0044] Figure 7 A schematic diagram showing the delay of the routing method based on neighbor node density under different confidence thresholds in the first embodiment of the present invention is shown;

[0045] Figure 8 A schematic diagram showing the relationship between throughput and the number of nodes when AODV, ND-AODV and the routing method based on neighbor node density of the present invention are used in the first embodiment of the present invention;

[0046] Fig. 9 A schematic diagram showing the relationship between the data packet transmission rate and the number of nodes when using AODV, ND-AODV and the routing method based on neighbor node density of the present invention in the first embodiment of the present invention;

[0047] Fig.10 A schematic diagram showing the relationship between the average delay and the number of nodes when using AODV, ND-AODV and the routing method based on neighbor node density of the present invention in the first embodiment of the present invention;

[0048] Fig.11 A schematic diagram showing the relationship between throughput and node rate when AODV, ND-AODV and the routing method based on neighbor node density of the present invention are used in the first embodiment of the present invention;

[0049] Fig.12 A schematic diagram showing the relationship between the data packet transmission rate and the node rate when using AODV, ND-AODV and the routing method based on neighbor node density of the present invention in the first embodiment of the present invention is shown;

[0050] Fig.13 A schematic diagram showing the relationship between average delay and node rate when using AODV, ND-AODV and the routing method based on neighbor node density of the present invention in the first embodiment of the present invention is shown;

[0051] Fig.14 A schematic diagram of the structure of a routing device based on neighbor node density according to a second embodiment of the present invention is shown;

[0052] Fig.15 A schematic diagram of the structure of a fourth terminal pair according to an embodiment of the present invention is shown. DETAILED DESCRIPTION

[0053] The following will describe the implementation methods of the present invention in detail with reference to the accompanying drawings and embodiments, so that the implementation process of how the present invention applies technical means to solve technical problems and achieve technical effects can be fully understood and implemented accordingly. It should be noted that as long as there is no conflict, the various embodiments of the present invention and the various features in the embodiments can be combined with each other, and the technical solutions formed are all within the protection scope of the present invention.

[0054] The AODV routing protocol defines three data formats for messages: RREQ, RREP, and RRER. The RREQ message format is: when a node needs to transmit data to a destination node, but there is no legal route to the destination node, it can broadcast the RREQ message to the entire network, seek the route to the destination node from the network, and wait for the RREP message carrying the route information to the destination node to return within the agreed time. If no RREP reply is received within the specified time, the RREQ message will be resent until the maximum number of transmissions is reached.

[0055] The following embodiments of the present invention provide a routing method and device based on neighbor node density, a storage medium and a terminal, which are used to solve the problem that the existing mobile self-organizing network can only perform well when the number of mobile devices is small, and the network performance will still decline when the number of mobile devices is large. First, two nodes are defined, one is a sending node and the other is a receiving node. The routing method based on neighbor node density provided by the present invention acts on the receiving node.

[0056] like Figure 1 As shown, an embodiment of the present invention provides a routing method based on neighbor node density, including the following steps.

[0057] Step S101: receiving RREQ control information sent by a sending node.

[0058] Specifically, after receiving the RREQ control information from the sending node, the receiving node updates the reverse route, parses the RREQ control information, and obtains the destination node information and the source node information. The routing information of the receiving node includes the current node information.

[0059] refer to Figure 4As shown, after obtaining the destination node information, it is necessary to determine whether the current node is the destination node, or to determine whether the destination node information exists in the routing information of the current node. If the current node is the destination node or the destination node information exists in the routing information of the current node, the RREQ control information can be directly sent to the source node based on the source node information. Otherwise, it is necessary to determine whether the current node is in a relatively congested state, that is, the number of neighbor nodes of the current node needs to be compared with the set conventional threshold. If the number of neighbor nodes of the current node is greater than the constant threshold, it means that the current node is in a relatively congested state. At this time, the subsequent steps can be executed to forward the RREQ control information based on the actual situation of the current node. If the number of neighbor nodes of the current node is not greater than the constant threshold, it means that the current node is in a relatively loose node situation. At this time, the RREQ control information can be cached and directly forwarded to all neighbor nodes of the current node.

[0060] It should be noted that the constant threshold for determining whether the current node is in a congestion situation is obtained through an existing congestion threshold acquisition method, which is not the focus of the invention of the method of the present invention and will not be described in detail here.

[0061] Step S102, determining whether the current node is an isolated node of the sending node, if so, buffering the RREQ control information and forwarding the RREQ control information, otherwise, proceeding to step S103.

[0062] Specifically, when the current node is in a relatively congested situation, it is necessary to further determine whether the current node is an isolated node of the sending node. If so, the RREQ control information is cached and the RREQ control information is directly forwarded to all neighboring nodes of the current node. Otherwise, it is necessary to further determine whether the current node is an overcrowded node of the sending node, that is, go to step S103.

[0063] In this embodiment, nodes with fewer common neighbors with the sending node are regarded as isolated nodes of the sending node. The method for further determining isolated nodes is: first calculate the average number of common nodes between the sending node and all its neighbor nodes. The number of common nodes between the sending node and one of its neighbor nodes is the number of nodes shared by all neighbor nodes of the sending node and all neighbor nodes of one of its neighbor nodes. Obtain the number of common nodes between the sending node and all its neighbor nodes, and take the average value to obtain the average number of common nodes. The formula for calculating the average number of common nodes is as follows:

[0064]

[0065] in, Represents the average number of public nodes, N ijis the number of common nodes between the sending node j and its neighbor node i, n j is the number of all neighbor nodes of the sending node j.

[0066] Then calculate the standard deviation of the number of common nodes between the sending node and all its neighboring nodes. The formula for calculating the standard deviation of the number of common nodes is:

[0067]

[0068] Among them, Vc j is the standard deviation of the number of public nodes, N ij is the number of common nodes between the sending node j and its neighbor node i, Represents the average number of public nodes, n j is the number of all neighbor nodes of the sending node j.

[0069] The number of common nodes between the sending node and the current node is taken as the target number of nodes, and then the standard deviation of the current node is obtained based on the target number of nodes, the average number of common nodes, and the standard deviation of the number of common nodes. The formula for calculating the standard deviation of the current node is:

[0070]

[0071] Among them, z is the standard deviation of the current node, N ij is the target number of nodes, is the average number of public nodes, Vc j is the standard deviation of the number of common nodes.

[0072] Finally, determine whether the obtained standard deviation is less than the isolated confidence threshold. If so, it means that the current node is an isolated node of the sending node, such as Figure 2 Similarly, it is also possible to determine whether the current node is an overcrowded node of the sending node based on the standard deviation.

[0073] Step S103, determining whether the current node is an overcrowded node of the sending node, if so, discarding the RREQ control information, otherwise forwarding the RREQ control information based on the RREQ control information forwarding probability of the current node.

[0074] Specifically, after determining that the current node is not an isolated node of the sending node, it is also necessary to determine whether the current node is an overcrowded node of the sending node. The specific method of determining an overcrowded node is: based on the standard deviation number obtained in step S102, determine whether the obtained standard deviation number is greater than the overcrowded confidence threshold. If so, it means that the current node is an overcrowded node of the sending node. Figure 3As shown, the current node does not need to cache and forward the RREQ control information at this time, and can directly discard the RREQ control information. When it is determined that the current node is neither an isolated node of the sending node nor an overcrowded node of the sending node, it means that the current node should be a regular node of the sending node. At this time, the RREQ control information needs to be forwarded based on the RREQ control information forwarding probability of the current node.

[0075] Specifically, when the current node should be a regular node of the sending node, the forwarding form of the RREQ control information is: calculate the forwarding probability of the RREQ control information of the current node, and randomly generate a random number between (0,1) as the probability random number, and then determine whether the forwarding probability of the RREQ control information of the current node is greater than or equal to the probability random number. If so, cache the RREQ control information and directly forward the RREQ control information to all neighboring nodes of the current node. Otherwise, there is no need to cache and forward the RREQ control information, and the RREQ control information is directly discarded.

[0076] The calculation method of the RREQ control information forwarding probability of the current node is:

[0077] P i =k / Nb i

[0078] Among them, Pi is the forwarding probability of RREQ control information, k is a constant threshold, and Nbi is the number of neighbor nodes of the current node.

[0079] It should be noted that in this embodiment, the overcrowded confidence threshold is preferably set to 1.645, and the isolated confidence threshold is -1.645. The overcrowded confidence threshold and the isolated confidence threshold are set based on the z threshold. The preferred z threshold in the embodiment of the present invention is 1.645. The z threshold in the embodiment of the present invention is obtained based on data experiments. The determination of the preferred z threshold in the embodiment of the present invention can be briefly described through the following simulation experiment process.

[0080] The specific experiment uses a simulation time of 110s and a simulation area of ​​1000*1000m 2 The simulated loss model is a two-ray ground propagation loss model, the transmission packet size is 512b, the transmission rate is 2M / s, the transport layer protocol is UDP, the transmission model is CBR (Constant Bit Rate), and the node mobility model is a random way point mobility model. In the simulation, the routing method based on neighbor node density in this embodiment is represented as CND-AODV.

[0081] Z-scores are a statistic used to measure the relative position or deviation of a data point in a data set. Further, z-scores are used to determine the position of a data point in the entire data set and evaluate its deviation from the average value. This embodiment uses z-scores to define the z threshold, and then accurately defines isolated nodes and overcrowded nodes based on the z threshold. The confidence intervals for different z thresholds.

[0082] Z-value Confidence -1.282≤z≤1.282 80％ -1.440≤z≤1.440 85％ -1.645≤z≤1.645 90％ -1.960≤z≤1.960 95％ -2.576≤z≤2.576 99％

[0083] The simulation will show the pros and cons of the routing method based on neighbor node density in this embodiment from the perspective of network throughput, latency, and data packet delivery rate. The specific throughput is the total number of data packets received per unit time. Its expression is as follows:

[0084]

[0085] Delay can also be called average delay, which is the time it takes for a data packet to be sent from the source node to be received by the destination node. Its expression is as follows:

[0086]

[0087] Packet delivery rate: the ratio of the number of packets received by the destination node to the number of packets sent by the source node.

[0088]

[0089] Compare different z thresholds to obtain the optimal parameters. This simulation mainly consists of 25, 75, ..., 275 nodes, and the node movement rate is randomly 0-5m / s at different times. The z thresholds are set to 1.282, 1.440, 1.645, 1.960 and 2.576 respectively. The higher the z threshold is set, the fewer nodes exceed the deviation; then see the performance of CND-AODV in the self-organizing network under different thresholds.

[0090] Figure 5-Figure 7 They are the throughput performance, packet delivery rate performance and latency performance of CND-AODV under different confidence thresholds. Figure 5-Figure 7It can be seen that no matter what the threshold value of z is, the throughput and packet delivery rate show a downward trend, and the delay shows an upward trend. However, when the threshold value of Z is 1.645, that is, when the confidence interval is 90%, it has a small improvement in throughput and packet delivery rate compared to other values, and the delay is also less increased than other values, and there is also a small improvement. Further, according to a large number of experiments, it can be proved that when the z threshold is 1.645, CND-AODV has the best network performance. Therefore, in the routing method based on neighbor node density in the embodiment of the present invention, the z threshold is set to 1.645, and the over-dense confidence threshold is further set to 1.645, and the isolated confidence threshold is set to -1.645.

[0091] In order to describe the routing effect of the routing method based on neighbor node density in an embodiment of the present invention in more detail, the embodiments of the present invention respectively use AODV, ND-AODV (Neighborhood Density AODV) and CND-AODV (Common Neighborhood Density AODV) proposed in this embodiment to simulate the data under the same situation.

[0092] The specific experiment uses a simulation time of 110s and a simulation area of ​​1000*1000m 2 The simulated loss model is the bilinear model Two Ray Ground Propagation Loss Model, the transmission packet size is 512b, the transmission rate is 2M / s, the transport layer protocol is UDP, the transmission model is CBR (Constant Bit Rate), and the node mobility model is the random way point mobility model.

[0093] The scenario of changing the number of nodes is used as the first scenario of the simulation. In this scenario, the number of nodes is composed of 25, 75, ..., 275, and the node movement rate is randomly 0 to 5 m / s at different times, simulating the normal sending and receiving business scenarios of normal walking and riding.

[0094] Figure 8-Figure 10 The relationships between throughput, packet delivery rate and latency and the number of nodes under AODV, ND-AODV and the routing method based on neighbor node density of the present invention. Figure 8-Figure 9 It can be seen that as the number of nodes increases from 25 to 275, the throughput and packet delivery rate of the three routing methods, AODV, ND-AODV and CND-AODV proposed in this embodiment, all slowly decrease, but the decrease degree of the CND-AODV method is the smallest. Fig.10As shown in the figure, in terms of latency, as the number of nodes continues to increase, the network latency under the three methods shows a rising trend. However, it can be found that in the process of increasing latency, the network routing using the CND-AODV method has a significantly lower transmission latency than AODV and ND-AODV. In summary, in scenarios with a large number of nodes, the CND-AODV method proposed in this embodiment improves the network in terms of both throughput and network latency.

[0095] The node movement rate change scenario is used as the second simulation scenario. The node movement rate in this scenario consists of random rates of 3, 25, and 50, corresponding to the human movement, vehicle movement, and highway vehicle movement scenarios, respectively. The number of nodes is controlled to 200, and the nodes send and receive services.

[0096] Figure 11-13 The relationships between throughput, packet delivery rate and latency and mobility rate under AODV, ND-AODV and the routing method based on neighbor node density of the present invention. Figure 11-Figure 12 It can be seen that as the speed increases, the throughput and data packet delivery rate of the three routing methods, AODV, ND-AODV and CND-AODV proposed in this embodiment, all decrease, but the decrease degree of the CND-AODV method is the smallest. Fig.13 As shown in the figure, in terms of latency, as the node movement speed increases, the network latency under the three methods shows a rising trend. However, it can be found that in the process of increasing latency, the transmission latency of the network routed by the CND-AODV method is significantly lower than that of AODV and ND-AODV. Therefore, as the node movement speed increases, the network performance is improved to a certain extent.

[0097] The routing method based on neighbor node density provided by the embodiment of the present invention takes into account the neighbor node density and the relative position of the neighbor nodes, and can better identify isolated nodes and overcrowded nodes in a self-organizing network, thereby improving the reliability of routing discovery, thereby reducing the network resource overhead caused by excessive control information forwarding and improving network throughput.

[0098] like Fig.14 As shown, the embodiment of the present application provides a routing device based on neighbor node density. The routing device based on neighbor node density in this embodiment includes an information receiving module, an isolated node determination module and an overcrowded node determination module.

[0099] The information receiving module is used to receive the RREQ control information sent by the sending node.

[0100] The isolated node determination module is used to determine whether the current node is an isolated node of the sending node. If so, the RREQ control information is cached and forwarded. Otherwise, it is transferred to the overcrowded node determination module.

[0101] The overcrowded node determination module is used to determine whether the current node is an overcrowded node of the sending node. If so, the RREQ control information is discarded; otherwise, the RREQ control information is forwarded based on the RREQ control information forwarding probability of the current node.

[0102] The neighbor node density-based routing device provided by the embodiment of the present invention implements different RREQ control information forwarding forms by determining overcrowded nodes and isolated nodes, thereby achieving the purpose of reducing the broadcast control information of nodes in the self-organizing network due to route discovery based on the neighbor node density and the relative position of the neighbor nodes. The reliability of the route discovery process from the source node to the destination node can be improved, and unnecessary control information forwarding can be reduced, thereby improving the throughput and data packet delivery rate of the self-organizing network, and reducing network delay and overhead.

[0103] The present application embodiment also provides a computer-readable storage medium. A person of ordinary skill in the art can understand that all or part of the steps in the method for implementing the above embodiment can be completed by instructing the processor through a program, and the program can be stored in a computer-readable storage medium, and the storage medium is a non-transitory medium, such as a random access memory, a read-only memory, a flash memory, a hard disk, a solid-state hard disk, a magnetic tape, a floppy disk, an optical disc, and any combination thereof. The above storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server or a data center that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a digital video disc (DVD)), or a semiconductor medium (e.g., a solid-state disk (SSD)), etc.

[0104] like Fig.15 As shown, an embodiment of the present application provides a terminal.

[0105] The terminal of this embodiment includes a processor and a memory connected to each other; the memory is used to store computer programs, and the processor is used to execute the computer programs stored in the memory, so that all or part of the steps can be implemented when the terminal executes them.

[0106] The specific steps of all or part of the steps and the beneficial effects obtained by applying the terminal provided by the embodiment of the present invention are the same as those in the first embodiment, and will not be described in detail here.

[0107] It should be noted that the memory may include random access memory (RAM) and may also include non-volatile memory, such as at least one disk storage. Similarly, the processor may also be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components.

[0108] Although the embodiments disclosed in the present invention are as above, the contents described are only embodiments adopted for facilitating the understanding of the present invention and are not intended to limit the present invention. Any technician in the technical field to which the present invention belongs can make any modifications and changes in the form and details of the implementation without departing from the spirit and scope disclosed in the present invention, but the protection scope of the present invention shall still be subject to the scope defined in the attached claims.

Claims

1. A routing method based on neighbor node density, comprising: Receive RREQ control information sent by the sending node; Determine whether the current node is an isolated node of the sending node, if so, cache the RREQ control information and forward the RREQ control information; otherwise It is determined whether the current node is an overcrowded node of the sending node. If so, the RREQ control information is discarded; otherwise, the RREQ control information is forwarded based on the RREQ control information forwarding probability of the current node.

2. The method according to claim 1, characterized in that: The process of determining whether the current node is an isolated node of the sending node and determining whether the current node is an overcrowded node of the sending node is as follows: Obtaining an average value of the number of common nodes between the sending node and all its neighboring nodes, and obtaining a standard deviation of the number of common nodes between the sending node and all its neighboring nodes; Obtaining the number of common nodes between the sending node and the current node as the target node number, and obtaining the standard deviation of the current node based on the target node number, the average value of the number of common nodes, and the standard deviation of the number of common nodes; Determine whether the standard deviation is greater than an overcrowded confidence threshold. If so, it indicates that the current node is an overcrowded node of the sending node. Otherwise, determine whether the standard deviation is less than an isolated confidence threshold. If so, it indicates that the current node is an isolated node of the sending node.

3. The method according to claim 2, characterized in that: The standard deviation of the current node is obtained as follows: Among them, z is the standard deviation of the current node, N ij is the target number of nodes, is the average number of public nodes, Vc j is the standard deviation of the number of common nodes.

4. The method according to claim 2, characterized in that: The overcrowded confidence threshold is 1.645, and the isolated confidence threshold is -1.

645.

5. The method according to claim 1, characterized in that: The steps of receiving the RREQ control information sent by the sending node include: Receiving RREQ control information sent by a sending node, and parsing the RREQ control information to obtain destination node information and source node information; Based on the destination node information, determine whether the current node is the destination node or whether the destination node information exists in the current node routing information. If yes, send the RREQ control information to the source node based on the source node information; otherwise It is determined whether the number of neighbor nodes of the current node is greater than a constant threshold, and if so, subsequent steps are executed; otherwise, the RREQ control information is cached and forwarded.

6. The method according to claim 1, characterized in that: Forwarding the RREQ control information based on the RREQ control information forwarding probability of the current node includes: Obtain the RREQ control information forwarding probability and probability random number of the current node, and determine whether the RREQ control information forwarding probability of the current node is greater than the probability random number. If so, cache the RREQ control information and forward the RREQ control information; otherwise, discard the RREQ control information.

7. The method according to claim 6, characterized in that: The forwarding probability of the RREQ control information of the current node is obtained as follows: P i =k / Nb i Among them, Pi is the RREQ control information forwarding probability of the current node, k is a constant threshold, and Nbi is the number of neighbor nodes of the current node.

8. A routing device based on neighbor node density, characterized in that: It includes an information receiving module, an isolated node determination module and an overcrowded node determination module; The information receiving module is used to receive the RREQ control information sent by the sending node; The isolated node determination module is used to determine whether the current node is an isolated node of the sending node, and if so, cache the RREQ control information and forward the RREQ control information, otherwise, transfer to the overcrowded node determination module; The overcrowded node determination module is used to determine whether the current node is an overcrowded node of the sending node, and if so, discard the RREQ control information; otherwise, forward the RREQ control information based on the RREQ control information forwarding probability of the current node.

9. A storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the routing method based on neighbor node density described in any one of claims 1 to 7 is implemented.

10. A terminal, characterized in that: include: A processor and a memory, wherein the memory is communicatively connected to the processor; The memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory, so that the terminal executes the routing method based on neighbor node density as described in any one of claims 1 to 7.

Images