CN108494682B - Gossip routing method and device based on average node degree improvement in Ad hoc network - Google Patents
Gossip routing method and device based on average node degree improvement in Ad hoc network Download PDFInfo
- Publication number
- CN108494682B CN108494682B CN201810231159.2A CN201810231159A CN108494682B CN 108494682 B CN108494682 B CN 108494682B CN 201810231159 A CN201810231159 A CN 201810231159A CN 108494682 B CN108494682 B CN 108494682B
- Authority
- CN
- China
- Prior art keywords
- gossip
- node degree
- forwarding probability
- average
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/32—Flooding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a Gossip routing method and a Gossip routing device based on average node degree improvement in an Ad hoc network, wherein the method comprises the following steps: receiving a node routing table message to calculate an average node degree, wherein the average node degree is the average value of the number of adjacent nodes in a one-hop range of all nodes in a certain area; determining pseudo-gossip forwarding probability according to the size relationship between the node degree of the current node and the average node degree; and determining the gossip forwarding probability according to a predefined relation between the pseudo gossip forwarding probability and the gossip forwarding probability. By combining the introduction of the gossip forwarding probability p and the combination of the average node degree, the problem of overlarge routing overhead caused by a flooding algorithm is solved, and the reliability of network message transmission is ensured.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and relates to a Gossip routing method and device based on average node degree improvement in an Ad hoc network.
Background
In recent years, due to the unique characteristics of the mobile Ad hoc network, the mobile Ad hoc network is more generally applied in various scenes. Many routing protocols are applied on the basis of a flooding algorithm, and the flooding algorithm is applied in an Ad hoc network, so that many unnecessary messages are forwarded, and a large routing overhead is brought. Although some researchers provide more flooding optimization schemes, the optimization effect is not satisfactory, and a lot of unnecessary messages are propagated, so that the overhead is increased, and the overall performance of the Ad hoc network is affected.
In summary, in the prior art, how to reduce the problem of a large amount of routing protocol overhead caused by the flooding problem of the Ad hoc network is still lack of an effective solution.
Disclosure of Invention
Aiming at the defects in the prior art and solving the problem of how to reduce a large amount of routing protocol overhead caused by the flooding problem of the Ad hoc network in the prior art, the invention provides a Gossip routing method and a Gossip routing device based on average node degree improvement in the Ad hoc network, which improve the Gossip routing algorithm used by the mobile Ad hoc network, wherein the key of the Gossip routing algorithm is to determine the message forwarding probability of each node.
The first purpose of the invention is to provide a Gossip routing method based on average node degree improvement in an Ad hoc network.
In order to achieve the purpose, the invention adopts the following technical scheme:
a Gossip routing method based on average node degree improvement in Ad hoc network comprises the following steps:
receiving a node routing table message to calculate an average node degree, wherein the average node degree is the average value of the number of adjacent nodes in a one-hop range of all nodes in a certain area;
determining pseudo-gossip forwarding probability according to the size relationship between the node degree of the current node and the average node degree;
and determining the gossip forwarding probability according to a predefined relation between the pseudo gossip forwarding probability and the gossip forwarding probability.
As a further preferable scheme, the relationship between the node degrees of the current node and the average node degree includes that the node degree of the current node is less than one third of the average node degree, the node degree of the current node is equal to or greater than one third of the average node degree and equal to or less than two thirds of the average node degree, and the node degree of the current node is greater than two thirds of the average node degree.
As a further preferred scheme, in the method, when the node degree of the current node is less than one third of the average node degree, the pseudo-gossip forwarding probability is determined to be selected from 0.75-0.8.
As a further preferable scheme, when the node degree of the current node is less than one third of the average node degree, the optimal pseudo-gossip forwarding probability is 0.75.
As a further preferred scheme, in the method, when the node degree of the current node is greater than or equal to one third of the average node degree and less than or equal to two thirds of the average node degree, the false gossip forwarding probability is selected and determined between 0.65 and 0.75.
As a further preferable scheme, when the node degree of the current node is equal to or greater than one third of the average node degree and equal to or less than two thirds of the average node degree, the optimal pseudo-gossip forwarding probability is 0.675.
As a further preferred scheme, in the method, when the node degree of the current node is greater than two thirds of the average node degree, the pseudo gossip forwarding probability is determined to be selected from 0.6-0.65.
As a further preferable scheme, when the node degree of the current node is greater than two thirds of the average node degree, the optimal pseudo-gossip forwarding probability is 0.6.
As a further preferred scheme, the predefined pseudo-gossip forwarding probability and gossip forwarding probability relation is: the gossip forwarding probability is the sum of the pseudo gossip forwarding probability and 0.02.
It is a second object of the present invention to provide a computer-readable storage medium.
In order to achieve the purpose, the invention adopts the following technical scheme:
a computer readable storage medium having stored therein a plurality of instructions adapted to be loaded by a processor of a terminal device and to perform the process of:
receiving a node routing table message to calculate an average node degree, wherein the average node degree is the average value of the number of adjacent nodes in a one-hop range of all nodes in a certain area;
determining pseudo-gossip forwarding probability according to the size relationship between the node degree of the current node and the average node degree;
and determining the gossip forwarding probability according to a predefined relation between the pseudo gossip forwarding probability and the gossip forwarding probability.
A third object of the present invention is to provide a terminal device.
In order to achieve the purpose, the invention adopts the following technical scheme:
a terminal device comprising a processor and a computer readable storage medium, the processor being configured to implement instructions; a computer readable storage medium for storing a plurality of instructions adapted to be loaded by a processor and to perform the process of:
receiving a node routing table message to calculate an average node degree, wherein the average node degree is the average value of the number of adjacent nodes in a one-hop range of all nodes in a certain area;
determining pseudo-gossip forwarding probability according to the size relationship between the node degree of the current node and the average node degree;
and determining the gossip forwarding probability according to a predefined relation between the pseudo gossip forwarding probability and the gossip forwarding probability.
The invention has the beneficial effects that:
1. compared with a flooding algorithm, the Gossip routing method and device based on average node degree improvement in the Ad hoc network greatly reduce the forwarding number of routing messages, and reduce the total routing overhead by forwarding the Gossip messages with certain probability;
2. compared with the unmodified Gossip routing method, the Gossip routing method and the Gossip routing device based on the improvement of the average node degree in the Ad hoc network further reduce the routing overhead by combining the size relationship between the average node degree and the current node degree, can prevent the premature disappearance of the Gossip message and greatly improve the network performance;
3. the Gossip routing method and device based on average node degree improvement in the Ad hoc network not only solves the problem of overlarge routing overhead caused by a flooding algorithm, but also ensures the reliability of network message transmission by combining the introduction of the Gossip forwarding probability p and the average node degree.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the application and, together with the description, serve to explain the application and are not intended to limit the application.
FIG. 1 is a flow chart of a method of the present invention;
FIG. 2 is a flowchart of a method specific to example 1 of the present invention;
FIG. 3 is a NAM animation screenshot at a certain time in the NS-2.35 simulation software according to embodiment 4 of the present invention;
FIG. 4 is a schematic diagram of the variation of the network throughput with the number of nodes in three different algorithms according to embodiment 4 of the present invention;
FIG. 5 is a schematic diagram of the variation of the control overhead of three different algorithms with the number of nodes in embodiment 4 of the present invention;
fig. 6 is a schematic diagram of changes in average end-to-end delay with the number of nodes in three different algorithms according to embodiment 4 of the present invention.
The specific implementation mode is as follows:
the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be noted that the following detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
It is noted that the flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of methods and systems according to various embodiments of the present disclosure. It should be noted that each block in the flowchart or block diagrams may represent a module, a segment, or a portion of code, which may comprise one or more executable instructions for implementing the logical function specified in the respective embodiment. It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Without conflict, the embodiments and features of the embodiments of the present application may be combined with each other to further explain the present invention in conjunction with the figures and embodiments.
Interpretation of terms:
I-Gossip: the new Improved Gossip routing algorithm presented herein.
Gossip1(p) is a routing algorithm that forwards messages with a certain probability p.
Gossip1(p, k) is a routing algorithm that forwards messages with a probability of 1 for the first k hops and then with some probability p for the messages.
Gossip2(p1, k, p2, n) is a routing algorithm that forwards messages with a probability of 1 for the first k hops and then with a certain probability of p, but forwards messages with a probability of p2(p2> p1) when the number of neighboring nodes is less than n.
Example 1:
the purpose of this embodiment 1 is to provide an improved Gossip routing method based on average node degree in Ad hoc network.
In order to achieve the purpose, the invention adopts the following technical scheme:
as shown in figure 1 of the drawings, in which,
a Gossip routing method based on average node degree improvement in Ad hoc network comprises the following steps:
step (1): receiving a node routing table message to calculate an average node degree, wherein the average node degree is the average value of the number of adjacent nodes in a one-hop range of all nodes in a certain area;
step (2): determining pseudo-gossip forwarding probability according to the size relationship between the node degree of the current node and the average node degree;
and (3): and determining the gossip forwarding probability according to a predefined relation between the pseudo gossip forwarding probability and the gossip forwarding probability.
For the flooding problem, this embodiment 1 proposes an I-Gossip routing algorithm, which is an Gossip routing algorithm improved based on an average node degree, so as to reduce a large amount of routing protocol overhead caused by the flooding problem. In an Ad hoc network, the impact of the flooding problem can be conveniently solved by having each node forward messages with a certain probability p.
In Ad hoc networks, by analysis of simulation experiments on the Gossip algorithm, using a Gossip forwarding probability between 0.6-0.8 ensures that almost every node can get a message. For a larger-scale Ad hoc network, the routing overhead can be reduced by about 35% by using the Gossip algorithm compared with the flooding algorithm. And the Gossip routing algorithm can be combined with the classic AODV routing protocol to optimize the network performance, and experiments show that the larger the network scale is, the more obvious the optimization effect brought by the Gossip routing algorithm is.
In the Gossip routing algorithm, the selection of the Gossip forwarding probability p is difficult, the value of the forwarding probability p is small, the routing overhead is relatively reduced, but the reliability of the Ad hoc network propagation is reduced due to the small value of p; the forwarding probability P is larger, which makes the reduction of the routing overhead less obvious. Many researchers have proposed many optimization schemes for the problem of large routing overhead caused by the flooding algorithm, but have not further performed deep optimization improvement based on the problem caused by the Gossip algorithm. In a mobile Ad hoc network, a mobile node may have relatively few neighboring nodes, and in this case, appropriately increasing the forwarding probability p will improve the network performance on the basis of ensuring reliable message transmission. The mobile Ad hoc network uses the Gossip routing algorithm to reduce a lot of unnecessary routing overhead, and greatly improves the network throughput, reduces the forwarding of unnecessary routing messages, reduces the total end-to-end time delay of the network, and improves the effectiveness of message transmission of the Ad hoc network.
At present, in the referred data, no routing algorithm which is improved by combining the average node degree on the basis of the Gossip algorithm in the Ad hoc network still exists. In view of the shortcomings of the existing routing algorithm, the embodiment provides an improved Gossip routing algorithm based on the average node degree. Fig. 2 is a flowchart illustrating a specific method of the method 1 in this embodiment.
In step (1) of this embodiment, an average value of the number of neighboring nodes within a hop range of all nodes in a certain area is defined as an average node degree, and the average node degree can be calculated through a message in a node routing table.
In step (2) of the present embodiment, an appropriate pseudo-gossip forwarding probability p0 is selected according to the average node degree calculated in step (1). The method for selecting the pseudo-dialect forwarding probability p0 in detail comprises the following steps:
step (2-1): according to the past Gossip experiment, the forwarding probability p between 0.6 and 0.8 can ensure that almost every node can obtain the message;
step (2-2): and comparing the node degree n0 of the current node with the calculated average node degree n, thereby determining the pseudo-gossip forwarding probability p 0.
In step (2-2) of this embodiment, the relationship between the node degrees of the current node and the average node degree includes that the node degree of the current node is less than one third of the average node degree, the node degree of the current node is greater than or equal to one third of the average node degree and less than or equal to two thirds of the average node degree, and the node degree of the current node is greater than two thirds of the average node degree.
When n0 is less than
When the node degree of the current node is less than one third of the average node degree, the forwarding probability of the pseudo-stream caption is selected and determined between 0.75 and 0.8, and the optimal pseudo-stream captionThe forwarding probability is 0.75;
when n0 is between
To
When the node degree of the current node is more than or equal to one third of the average node degree and less than or equal to two thirds of the average node degree, selecting and determining the pseudo-flow declaration forwarding probability between 0.65 and 0.75, wherein the optimal pseudo-flow declaration forwarding probability is 0.675;
when n0 is greater than
And selecting and determining the pseudo-manifold transmission probability between 0.6 and 0.65 when the node degree of the current node is more than two thirds of the average node degree, wherein the optimal pseudo-manifold transmission probability is 0.6.
In step (3) of this embodiment, the predefined pseudo-gossip forwarding probability and gossip forwarding probability relation is: the gossip forwarding probability is the sum of the pseudo gossip forwarding probability and 0.02, and p is p0+ 0.02.
And calculating the gossip forwarding probability p through a defined formula.
Example 2:
the object of this embodiment 2 is to provide a computer-readable storage medium.
In order to achieve the purpose, the invention adopts the following technical scheme:
a computer readable storage medium having stored therein a plurality of instructions adapted to be loaded by a processor of a terminal device and to perform the process of:
step (1): receiving a node routing table message to calculate an average node degree, wherein the average node degree is the average value of the number of adjacent nodes in a one-hop range of all nodes in a certain area;
step (2): determining pseudo-gossip forwarding probability according to the size relationship between the node degree of the current node and the average node degree;
and (3): and determining the gossip forwarding probability according to a predefined relation between the pseudo gossip forwarding probability and the gossip forwarding probability.
Example 3:
the purpose of this embodiment 3 is to provide a terminal device.
In order to achieve the purpose, the invention adopts the following technical scheme:
a terminal device comprising a processor and a computer readable storage medium, the processor being configured to implement instructions; a computer readable storage medium for storing a plurality of instructions adapted to be loaded by a processor and to perform the process of:
step (1): receiving a node routing table message to calculate an average node degree, wherein the average node degree is the average value of the number of adjacent nodes in a one-hop range of all nodes in a certain area;
step (2): determining pseudo-gossip forwarding probability according to the size relationship between the node degree of the current node and the average node degree;
and (3): and determining the gossip forwarding probability according to a predefined relation between the pseudo gossip forwarding probability and the gossip forwarding probability.
These computer-executable instructions, when executed in a device, cause the device to perform methods or processes described in accordance with various embodiments of the present disclosure.
In the present embodiments, a computer program product may include a computer-readable storage medium having computer-readable program instructions embodied thereon for performing various aspects of the present disclosure. The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.
The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device over a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.
The computer program instructions for carrying out operations of the present disclosure may be assembly instructions, Instruction Set Architecture (ISA) instructions, machine related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, the electronic circuitry can execute computer-readable program instructions to implement aspects of the present disclosure by utilizing state information of the computer-readable program instructions to personalize the electronic circuitry, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA).
It should be noted that although several modules or sub-modules of the device are mentioned in the above detailed description, such division is merely exemplary and not mandatory. Indeed, the features and functionality of two or more of the modules described above may be embodied in one module in accordance with embodiments of the present disclosure. Conversely, the features and functions of one module described above may be further divided into embodiments by a plurality of modules.
Example 4:
the purpose of this example 4 is to verify the process in example 1 by comparison.
Gossip1(p) algorithm:
in order to reduce the problem of excessive routing overhead caused by the flooding algorithm, stepwise optimization is performed by using Gossip1(p) algorithm, which is to consider forwarding of a large amount of unnecessary routing messages during flooding, so that the problem is solved by introducing a forwarding probability p. After comprehensive experimental analysis is carried out on the Gossip1(P) algorithm, the problem that the routing overhead is reduced obviously due to the fact that the forwarding probability P is large is found; and the smaller the value of the forwarding probability p, the more the routing overhead is relatively reduced. However, a smaller value of p may also reduce the reliability of Ad hoc network propagation, i.e., when there are fewer neighbors to a node, reusing a lower probability of forwarding the gossip p may result in premature disappearance of gossip.
Gossip1(p, k) algorithm:
and performing further optimization and refinement by using a Gossip1(p, k) algorithm, wherein the Gossip1(p, k) algorithm has a strategy that the first k hops of the Ad hoc network route are propagated by a forwarding probability 1, and the Gossip forwarding probability p is improved to make up for the defect that the Gossip disappears too early. Multiple experimental results of the Gossip1(p, k) algorithm show that, because of a large difference between the numbers of neighboring nodes of each node, when the number of neighboring nodes is small, the preset Gossip forwarding probability p is too small, which may cause premature 'death' of Gossip, and it is difficult to ensure the reliability of network transmission.
Gossip2(p1, k, p2, n) improves the algorithm:
the Gossip2(p1, k, p2, n) is used for improving an algorithm to prevent premature 'death' of the Gossip, the strategy of the Gossip2(p1, k, p2, n) algorithm is to introduce two threshold value ideas, namely p2, n, on the basis of the Gossip1(p, k) algorithm, when the number of adjacent nodes of the nodes is smaller than a preset value n, the Gossip message is forwarded by using p2, wherein p2> p1, and the problems are solved by improving the Gossip forwarding probability.
In the Gossip2(p1, k, p2, n) routing algorithm, the routing overhead cannot be reduced as much as possible and the network performance cannot be optimized simply by forwarding the message with the probability p2(p2> p1) when the number of the neighboring nodes is smaller than a preset value. For example, in a sparse area of the network, there may be a small average node degree, and in this case, too much message transmission is inevitably caused by using the large probability p2 only when the average node degree is smaller than the preset value, so that the routing overhead is increased. However, the relation between the average node degree and the current node degree of the node is combined to further lock the appropriate forwarding probability, so that the network performance can be better improved. Therefore, embodiment 1 determines the pseudo-gossip forwarding probability p0 by comparing the node degree of the current node with the average node degree, and determines the gossip forwarding probability p by the pseudo-gossip forwarding probability p 0.
In Gossip2(p1, k, p2, n) algorithm, the number of neighbor nodes of each node is compared with a value preset by us, and then whether to use the Gossip forwarding probability p2 for message forwarding is judged. In the I-Gossip algorithm, the pseudo-Gossip forwarding probability p0 is determined by comparing the node degree n0 of the current node with the calculated average node degree n, and then the Gossip forwarding probability p is calculated.
As shown in fig. 3, in the wireless network simulation software NS-2.35, 20, 50, and 100 nodes are randomly placed in sequence in a 1000m × 1000m simulation area with 250m as a transmission range.
In the method in embodiment 1, the average node degree is calculated by the calculation method of the average node degree defined by us, and then the gossip forwarding probability p is solved by combining the pseudo gossip forwarding probability. As shown in fig. 4-6, it can be known from network simulation that using the I-Gossip algorithm increases network throughput, reduces routing overhead, and reduces end-to-end delay of the network compared to AODV and general Gossip algorithms. According to different configuration conditions of the number of the nodes, the network performance can be further improved when the network scale is large.
The invention has the beneficial effects that:
1. compared with a flooding algorithm, the Gossip routing method and device based on average node degree improvement in the Ad hoc network greatly reduce the forwarding number of routing messages, and reduce the total routing overhead by forwarding the Gossip messages with certain probability;
2. compared with the unmodified Gossip routing method, the Gossip routing method and the Gossip routing device based on the improvement of the average node degree in the Ad hoc network further reduce the routing overhead by combining the size relationship between the average node degree and the current node degree, can prevent the premature disappearance of the Gossip message and greatly improve the network performance;
3. the Gossip routing method and device based on average node degree improvement in the Ad hoc network not only solves the problem of overlarge routing overhead caused by a flooding algorithm, but also ensures the reliability of network message transmission by combining the introduction of the Gossip forwarding probability p and the average node degree.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A Gossip routing method based on average node degree improvement in Ad hoc network is characterized in that the method comprises the following steps:
receiving a node routing table message to calculate an average node degree, wherein the average node degree is the average value of the number of adjacent nodes in a one-hop range of all nodes in a certain area;
determining pseudo-gossip forwarding probability according to the size relationship between the node degree of the current node and the average node degree;
determining the gossip forwarding probability according to a predefined relation between the pseudo gossip forwarding probability and the gossip forwarding probability;
by combining the introduction of the gossip forwarding probability and the combination of the average node degree, the problem of overlarge routing overhead caused by a flooding algorithm is solved, and the reliability of network message transmission is ensured;
the predefined pseudo-gossip forwarding probability and gossip forwarding probability relation is as follows: the gossip forwarding probability is the sum of the pseudo gossip forwarding probability and 0.02, and p is p0+ 0.02.
2. The method of claim 1, wherein the relationship between the node degrees of the current node and the average node degree comprises the node degree of the current node being less than one third of the average node degree, the node degree of the current node being equal to or greater than one third of the average node degree and equal to or less than two thirds of the average node degree, and the node degree of the current node being greater than two thirds of the average node degree; the predefined pseudo-gossip forwarding probability and gossip forwarding probability relation is as follows: the gossip forwarding probability is the sum of the pseudo gossip forwarding probability and 0.02.
3. A method as claimed in claim 2, characterized in that in the method the determination of the pseudo-gossip forwarding probability is chosen between 0.75 and 0.8 when the node degree of the current node is less than one third of the average node degree.
4. The method of claim 3, wherein the optimal pseudo-talks forwarding probability is 0.75 when the node degree of the current node is less than one-third of the average node degree.
5. The method as claimed in claim 2, wherein in the method, the determination of the pseudo-gossip forwarding probability is selected between 0.65 and 0.75 when the node degree of the current node is equal to or greater than one third and equal to or less than two thirds of the average node degree.
6. The method of claim 5, wherein the optimal pseudo-manifold forwarding probability is 0.675 when a node degree of a current node is equal to or greater than one-third and equal to or less than two-thirds of an average node degree.
7. A method according to claim 2, characterized in that in the method the determination of the pseudo-gossip forwarding probability is chosen between 0.6 and 0.65 when the node degree of the current node is greater than two thirds of the average node degree.
8. The method of claim 7, wherein the optimal pseudo-gossip forwarding probability is 0.6 when the node degree of the current node is greater than two-thirds of the average node degree.
9. A computer-readable storage medium having stored thereon a plurality of instructions, characterized in that said instructions are adapted to be loaded by a processor of a terminal device and to perform the method according to any one of claims 1-8.
10. A terminal device comprising a processor and a computer readable storage medium, the processor being configured to implement instructions; a computer-readable storage medium for storing a plurality of instructions for performing the method of any of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810231159.2A CN108494682B (en) | 2018-03-20 | 2018-03-20 | Gossip routing method and device based on average node degree improvement in Ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810231159.2A CN108494682B (en) | 2018-03-20 | 2018-03-20 | Gossip routing method and device based on average node degree improvement in Ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108494682A CN108494682A (en) | 2018-09-04 |
| CN108494682B true CN108494682B (en) | 2020-11-06 |
Family
ID=63318852
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810231159.2A Expired - Fee Related CN108494682B (en) | 2018-03-20 | 2018-03-20 | Gossip routing method and device based on average node degree improvement in Ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108494682B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7738404B2 (en) * | 2007-01-23 | 2010-06-15 | Alcatel-Lucent Usa Inc. | Method of aggregate statistic computation |
| CN106789676A (en) * | 2017-01-19 | 2017-05-31 | 西安电子科技大学 | The reliable multicast method for routing of low overhead in wireless self-organization network |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103957571B (en) * | 2014-05-12 | 2017-03-29 | 中国石油大学(华东) | A kind of Ad hoc network routing discovering methods based on Brownian movement |
| CN104952459B (en) * | 2015-04-29 | 2018-05-15 | 大连理工大学 | A kind of distributed sound Enhancement Method based on distributed consensus and MVDR Wave beam formings |
| US20160328530A1 (en) * | 2015-05-08 | 2016-11-10 | Umm-Al-Qura University | Method and apparatus for automated patient severity ranking in mass casualty incidents |
-
2018
- 2018-03-20 CN CN201810231159.2A patent/CN108494682B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7738404B2 (en) * | 2007-01-23 | 2010-06-15 | Alcatel-Lucent Usa Inc. | Method of aggregate statistic computation |
| CN106789676A (en) * | 2017-01-19 | 2017-05-31 | 西安电子科技大学 | The reliable multicast method for routing of low overhead in wireless self-organization network |
Non-Patent Citations (2)
| Title |
|---|
| 《Gossip-based ad hoc routing》;Z.J. Haas等;《IEEE/ACM Transactions on Networking》;20060619;参见第三节至第七节 * |
| 《基于节点平均连接度的Ad Hoc网络分簇算法》;杨卫东;《计算机工程与应用》;20090901;参见第2节至第3节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108494682A (en) | 2018-09-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11678247B2 (en) | Method and apparatus to enhance routing protocols in wireless mesh networks | |
| Anazawa et al. | Trajectory and data planning for mobile relay to enable efficient Internet access after disasters | |
| EP2425608B1 (en) | Method and system to enable a hybrid routing protocol | |
| US10491515B2 (en) | Fast and loss-free local recovery by a RPL parent device | |
| US20120113896A1 (en) | Skip Ahead Routing in Wireless Ad Hoc Networks | |
| CN109784928B (en) | Information processing method and information processing device based on block chain | |
| KR101680726B1 (en) | METHOD FOR PROVIDING PRoPHET PROTOCOL USING MESSAGE DELIVERY COUNT TO DESTINATION NODES, RECORDING MEDIUM, SYSTEM AND DEVICE FOR PERFORMING THE METHOD | |
| CN107820697B (en) | Enhanced peer discovery method and system in a mesh network | |
| Chaurasia et al. | MAODV: Modified wormhole detection AODV protocol | |
| Liu et al. | PATCH: a novel local recovery mechanism for mobile ad-hoc networks | |
| CN111262788A (en) | Optimized and improved Merkle tree storage method and system | |
| CN108494682B (en) | Gossip routing method and device based on average node degree improvement in Ad hoc network | |
| WO2022002093A1 (en) | Distributing information in communication networks | |
| CN110662258A (en) | Message forwarding method, device and medium | |
| Anannya et al. | Extended neighborhood knowledge based dominant pruning (exdp) | |
| WO2018094873A1 (en) | Method and device for establishing multicast cluster | |
| CN111065146A (en) | Ad hoc network route determining method based on link quality | |
| CN106792980B (en) | Joint routing metric and partially overlapping channel allocation method | |
| Vhora et al. | Rank Base Data Routing (RBDR) scheme using AOMDV: A proposed scheme for packet drop attack detection and prevention in MANET | |
| CN101778443B (en) | Method, device and system for route selection | |
| CN108684064B (en) | Networking method and device fusing multiple communication modes | |
| CN116545608B (en) | Block spreading method and system based on acquaintance immune strategy | |
| CN112054921B (en) | Network verification method and device, computer storage medium and electronic equipment | |
| CN113472701B (en) | Processing method, device, equipment and storage medium of route information | |
| CN112866031B (en) | Route configuration method, device, equipment and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20201106 Termination date: 20210320 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |