CN108494682A - The improved Gossip method for routing of average node degree and device are based in Ad hoc networks - Google Patents
The improved Gossip method for routing of average node degree and device are based in Ad hoc networks Download PDFInfo
- Publication number
- CN108494682A CN108494682A CN201810231159.2A CN201810231159A CN108494682A CN 108494682 A CN108494682 A CN 108494682A CN 201810231159 A CN201810231159 A CN 201810231159A CN 108494682 A CN108494682 A CN 108494682A
- Authority
- CN
- China
- Prior art keywords
- node degree
- rumor
- node
- average
- probability
- 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.)
- Granted
Links
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 include based on the improved Gossip method for routing of average node degree and device, this method in a kind of Ad hoc networks：Receiving node routing table message calculates average node degree, and the average node degree is the neighbors number average value in a jump range of all nodes in certain area；Determine that pseudo- rumor forwards probability according to the magnitude relationship of the node degree of present node and the average node degree；Determine that rumor forwards probability with rumor forwarding probabilistic relation formula according to predefined pseudo- rumor forwarding probability.By combining the combination of the introducing and average node degree of rumor forwarding Probability p, both solved the problems, such as the excessive routing cost that flooding is brought, and in turn ensured the reliability of network message transmission.
Description
Technical field
The invention belongs to the technical field of wireless communication, it is related to improved based on average node degree in a kind of Ad hoc networks
Gossip method for routing and device.
Background technology
In recent years, it due to the exclusive feature of movable self-organization Ad hoc networks, has been obtained under several scenes more general
Time application.Wherein, many Routing Protocols are applied on the basis of flooding, and flooding is in Ad hoc nets
Application in network so that many unnecessary message are forwarded, and prodigious routing cost is brought.It is carried in spite of researcher
Go out more flooding prioritization scheme, but effect of optimization and not fully up to expectations, still there are many unnecessary transmission of news,
And then expense is increased, affect the overall performance of Ad hoc networks.
In conclusion how to reduce Ad hoc networks a large amount of Routing Protocols caused by due to flooding problem in the prior art
The problem of expense, still lacks effective solution.
Invention content
For the deficiencies in the prior art, solve the problems, such as how to reduce Ad hoc networks in the prior art due to flooding
Caused by a large amount of routing protocol overheads the problem of, the present invention proposes improved based on average node degree in a kind of Ad hoc networks
Gossip method for routing and device, the Gossip routing algorithms used movable self-organization Ad hoc networks are improved,
The key of Gossip routing algorithms is to determine that each node carries out the probability of message forwarding, and the present invention is general by combining rumor forwarding
The introducing of rate p and the combination of average node degree had both solved the problems, such as the excessive routing cost that flooding is brought, and had in turn ensured net
The reliability of network message transmission.
The first object of the present invention is to provide in a kind of Ad hoc networks based on the improved Gossip routings of average node degree
Method.
To achieve the goals above, the present invention is using a kind of following technical solution：
The improved Gossip method for routing of average node degree is based in a kind of Ad hoc networks, this method includes：
Receiving node routing table message calculates average node degree, and the average node degree is all nodes in certain area
One jumps the neighbors number average value in range；
Determine that pseudo- rumor forwards probability according to the magnitude relationship of the node degree of present node and the average node degree；
Determine that rumor forwards probability with rumor forwarding probabilistic relation formula according to predefined pseudo- rumor forwarding probability.
Scheme as a further preference, the magnitude relationship packet of the node degree of the present node and the average node degree
The node degree for including present node is less than the one third of average node degree, the node degree of present node is more than or equal to average node degree
One third and less than or equal to average node degree 2/3rds, the node degree of present node be more than three points of average node degree
Two.
Scheme as a further preference, in the method, when the node degree of present node is less than the three of average node degree
When/mono-, is chosen between 0.75-0.8 and determine that pseudo- rumor forwards probability.
Scheme as a further preference, when the node degree of present node is less than the one third of average node degree, most
Good puppet rumor forwarding probability is 0.75.
Scheme as a further preference, in the method, when the node degree of present node is more than or equal to average node degree
One third and less than or equal to average node degree 2/3rds when, chosen between 0.65-0.75 and determine pseudo- rumor forwarding
Probability.
Scheme as a further preference, when present node node degree be more than or equal to average node degree one third and
Less than or equal to average node degree 2/3rds when, best puppet rumor forwarding probability is 0.675.
Scheme as a further preference, in the method, when the node degree of present node is more than the three of average node degree
When/bis-, is chosen between 0.6-0.65 and determine that pseudo- rumor forwards probability.
Scheme as a further preference, when the node degree of present node is more than 2/3rds of average node degree, most
Good puppet rumor forwarding probability is 0.6.
Scheme as a further preference, the predefined pseudo- rumor forwarding probability forward probabilistic relation formula with rumor
For：It is that pseudo- rumor forwards the sum of probability and 0.02 that rumor, which forwards probability,.
The second object of the present invention is to provide a kind of computer readable storage medium.
To achieve the goals above, the present invention is using a kind of following technical solution：
A kind of computer readable storage medium, wherein being stored with a plurality of instruction, described instruction is suitable for by terminal device equipment
Processor load and execute following processing：
Receiving node routing table message calculates average node degree, and the average node degree is all nodes in certain area
One jumps the neighbors number average value in range；
Determine that pseudo- rumor forwards probability according to the magnitude relationship of the node degree of present node and the average node degree；
Determine that rumor forwards probability with rumor forwarding probabilistic relation formula according to predefined pseudo- rumor forwarding probability.
The third object of the present invention is to provide a kind of terminal device.
To achieve the goals above, the present invention is using a kind of following technical solution：
A kind of terminal device, including processor and computer readable storage medium, processor is for realizing each instruction；It calculates
Machine readable storage medium storing program for executing is suitable for being loaded by processor and executing following processing for storing a plurality of instruction, described instruction：
Receiving node routing table message calculates average node degree, and the average node degree is all nodes in certain area
One jumps the neighbors number average value in range；
Determine that pseudo- rumor forwards probability according to the magnitude relationship of the node degree of present node and the average node degree；
Determine that rumor forwards probability with rumor forwarding probabilistic relation formula according to predefined pseudo- rumor forwarding probability.
Beneficial effects of the present invention：
1, the improved Gossip method for routing of average node degree and dress are based in a kind of Ad hoc networks of the present invention
It sets, compared to flooding, significantly reduces the forwarding quantity of route messages, by forwarding rumor message with certain probability,
Reduce total routing cost；
2, the improved Gossip method for routing of average node degree and dress are based in a kind of Ad hoc networks of the present invention
It sets, by combining the magnitude relationship of average node degree and present node degree, compared to unmodified Gossip method for routing, into one
Step reduces routing cost, and can prevent rumor message and disappear too early, greatly improves the performance of network；
3, the improved Gossip method for routing of average node degree and dress are based in a kind of Ad hoc networks of the present invention
It sets, the combination of introducing and average node degree by forwarding Probability p in conjunction with rumor, had both solved the main road excessively that flooding is brought
By overhead issues, the reliability of network message transmission is in turn ensured.
Description of the drawings
The accompanying drawings which form a part of this application are used for providing further understanding of the present application, and the application's shows
Meaning property embodiment and its explanation do not constitute the improper restriction to the application for explaining the application.
Fig. 1 is flow chart of the method for the present invention；
Fig. 2 is the specific method flow chart of the embodiment of the present invention 1；
The NAM animation sectional drawings at Fig. 3 is the embodiment of the present invention 4 in NS-2.35 simulation softwares a certain moment；
Fig. 4 is that the network throughput of three kinds of algorithms of different of the embodiment of the present invention 4 is illustrated with the situation of change of node number
Figure；
Fig. 5 is the control overhead of three kinds of algorithms of different of the embodiment of the present invention 4 with the situation of change schematic diagram of node number；
Fig. 6 is the average end-to-end time delay of three kinds of algorithms of different of the embodiment of the present invention 4 with the situation of change of node number
Schematic diagram.
Specific implementation mode：
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
It is noted that following detailed description is all illustrative, it is intended to provide further instruction to the application.Unless another
It indicates, all technical and scientific terms that the present embodiment uses have and the application person of an ordinary skill in the technical field
Normally understood identical meanings.
It should be noted that term used herein above is merely to describe specific implementation mode, and be not intended to restricted root
According to the illustrative embodiments of the application.As used herein, unless the context clearly indicates otherwise, otherwise singulative
It is also intended to include plural form, additionally, it should be understood that, when in the present specification using term "comprising" and/or " packet
Include " when, indicate existing characteristics, step, operation, device, component and/or combination thereof.
It should be noted that flowcharts and block diagrams in the drawings show according to various embodiments of the present disclosure method and
The architecture, function and operation in the cards of system.It should be noted that each box in flowchart or block diagram can represent
A part for a part for one module, program segment, or code, the module, program segment, or code may include one or more
A executable instruction for realizing the logic function of defined in each embodiment.It should also be noted that some alternately
Realization in, the function that is marked in box can also occur according to the sequence different from being marked in attached drawing.For example, two connect
The box even indicated can essentially be basically executed in parallel or they can also be executed in a reverse order sometimes,
This depends on involved function.It should also be noted that each box in flowchart and or block diagram and flow chart
And/or the combination of the box in block diagram, it can be come using the dedicated hardware based system for executing defined functions or operations
It realizes, or can make to combine using a combination of dedicated hardware and computer instructions to realize.
In the absence of conflict, the features in the embodiments and the embodiments of the present application can be combined with each other with reference to
The invention will be further described with embodiment for attached drawing.
Term is explained：
I-Gossip：New Improved Gossip routing algorithms proposed in this paper.
Gossip1(p):The routing algorithm of message forwarding is carried out with some Probability p.
Gossip1 (p, k):Preceding k-hop is forwarded message with probability 1, and the road of message forwarding is then carried out with some Probability p
By algorithm.
Gossip2(p1,k,p2,n):Preceding k-hop is forwarded message with probability 1, and then carrying out message with some Probability p turns
Hair, but when neighbors number is less than n, with 2 (p2 of Probability p>P1 the routing algorithm of message forwarding) is carried out.
Embodiment 1：
The purpose of the present embodiment 1, which is to provide in a kind of Ad hoc networks, is based on the improved routing sides Gossip of average node degree
Method.
To achieve the goals above, the present invention is using a kind of following technical solution：
As shown in Figure 1,
The improved Gossip method for routing of average node degree is based in a kind of Ad hoc networks, this method includes：
Step (1)：Receiving node routing table message calculates average node degree, and the average node degree is institute in certain area
Have node one jumps the neighbors number average value in range；
Step (2)：Determine that pseudo- rumor forwards according to the magnitude relationship of the node degree of present node and the average node degree
Probability；
Step (3)：Determine that rumor forwarding is general with rumor forwarding probabilistic relation formula according to predefined pseudo- rumor forwarding probability
Rate.
For flooding problem, the present embodiment 1 proposes one kind, and based on average node degree, improved Gossip routings are calculated
Method --- I-Gossip routing algorithms, to come a large amount of routing protocol overheads caused by reducing due to flooding problem.In Ad hoc
In network, by making each node that can easily be solved the problems, such as caused by flooding with the forwarding of some Probability p progress message
It influences.
In Ad hoc networks, by the analysis of simulation experiment to Gossip algorithm, using between 0.6-0.8
Rumor forwarding probability may insure that almost each node can obtain message.For fairly large Ad hoc networks, make
It can reduce by 35% or so routing cost than flooding with Gossip algorithm.And Gossip routing algorithms can and it is classical
AODV Routing Protocols be combined and then optimize network performance, experiment shows that network size is relatively bigger, Gossip routing algorithms
Caused effect of optimization is more apparent.
In Gossip routing algorithms, the selection of rumor forwarding Probability p is relatively difficult, and forwarding Probability p value is smaller, road
Can also be reduced relatively by expense it is more, but smaller p value can also make Ad hoc networks propagate reliability reduce；And turn
It is larger to send out probability P value, then can make the unobvious of routing cost reduction.Many researchers are for routing caused by flooding
The big problem of expense proposes many prioritization schemes, is not based further on problem caused by Gossip algorithm but and carries out depth
Optimal improvements.In movable self-organization Ad hoc networks, a mobile node may have relatively small number of neighbors, in this feelings
Under condition, network performance will be promoted on the basis of ensureing that message transmission is reliable by properly increasing forwarding Probability p.Movable self-organization Ad
Hoc network reduces many unnecessary routing costs using Gossip routing algorithms, and is also obtained in terms of network throughput
Larger promotion has been arrived, by reducing the forwarding of unnecessary route messages, the total time delay end to end of network has been also reduced, improves
The validity of Ad hoc network message transmission.
Currently, in the data found, still do not combined on the basis of Gossip algorithm in for Ad hoc networks
The routing algorithm that average node degree is improved.For the deficiency of existing route algorithm, the present embodiment provides one kind based on average
Node degree and improved Gossip routing algorithms.It is illustrated in figure 2 the specific method flow chart of method 1 in the present embodiment.
It the present embodiment the step of in (1), is defined in certain area, the one of all nodes jump the neighbors in range
Several average value can calculate its average node degree as average node degree by the message in node route list.
The present embodiment the step of in (2), according to the suitable pseudo- rumor of calculated average node degree selection in step (1)
Forward Probability p 0.The method and step of the pseudo- rumor forwarding Probability p 0 of selection is in detail：
Step (2-1)：According to previous Gossip experiment can learn forwarding Probability p be between 0.6-0.8 can be true
Message can be obtained by protecting almost each node；
Step (2-2)：It is compared with calculated average node degree n according to the node degree n0 of present node, to really
Fixed puppet rumor forwards Probability p 0.
The present embodiment the step of in (2-2), the node degree of the present node and the size of the average node degree are closed
System includes that the node degree of present node is less than the one third of average node degree, the node degree of present node is more than or equal to average section
The one third of point degree and less than or equal to average node degree 2/3rds, the node degree of present node be more than average node degree
2/3rds.
When n0 is less thanWhen, i.e., the node degree of present node be less than average node degree one third when, 0.75-0.8 it
Between choose and determine that pseudo- rumor forwards probability, best puppet rumor forwarding probability is 0.75；
When n0 betweenIt arrivesBetween when, i.e., the node degree of present node be more than or equal to average node degree one third and
Less than or equal to average node degree 2/3rds when, chosen between 0.65-0.75 and determine that pseudo- rumor forwards probability, best pseudo- stream
Speech forwarding probability is 0.675；
When n0 is more thanWhen, i.e., when the node degree of present node is more than 2/3rds of average node degree, in 0.6-0.65
Between choose and determine that pseudo- rumor forwards probability, best puppet rumor forwarding probability is 0.6.
The present embodiment the step of in (3), the predefined pseudo- rumor forwarding probability forwards probabilistic relation formula with rumor
For：It is that pseudo- rumor forwards the sum of probability and 0.02, p=p0+0.02 that rumor, which forwards probability,.
Rumor, which is calculated, by the formula of definition forwards Probability p.
Embodiment 2：
The purpose of the present embodiment 2 is to provide a kind of computer readable storage medium.
To achieve the goals above, the present invention is using a kind of following technical solution：
A kind of computer readable storage medium, wherein being stored with a plurality of instruction, described instruction is suitable for by terminal device equipment
Processor load and execute following processing：
Step (1)：Receiving node routing table message calculates average node degree, and the average node degree is institute in certain area
Have node one jumps the neighbors number average value in range；
Step (2)：Determine that pseudo- rumor forwards according to the magnitude relationship of the node degree of present node and the average node degree
Probability；
Step (3)：Determine that rumor forwarding is general with rumor forwarding probabilistic relation formula according to predefined pseudo- rumor forwarding probability
Rate.
Embodiment 3：
The purpose of the present embodiment 3 is to provide a kind of terminal device.
To achieve the goals above, the present invention is using a kind of following technical solution：
A kind of terminal device, including processor and computer readable storage medium, processor is for realizing each instruction；It calculates
Machine readable storage medium storing program for executing is suitable for being loaded by processor and executing following processing for storing a plurality of instruction, described instruction：
Step (1)：Receiving node routing table message calculates average node degree, and the average node degree is institute in certain area
Have node one jumps the neighbors number average value in range；
Step (2)：Determine that pseudo- rumor forwards according to the magnitude relationship of the node degree of present node and the average node degree
Probability；
Step (3)：Determine that rumor forwarding is general with rumor forwarding probabilistic relation formula according to predefined pseudo- rumor forwarding probability
Rate.
These computer executable instructions make the equipment execute according to each reality in the disclosure when running in a device
Apply method or process described in example.
In the present embodiment, computer program product may include computer readable storage medium, containing for holding
The computer-readable program instructions of row various aspects of the disclosure.Computer readable storage medium can be kept and store
By the tangible device for the instruction that instruction execution equipment uses.Computer readable storage medium for example can be-- but it is unlimited
In-- storage device electric, magnetic storage apparatus, light storage device, electromagnetism storage device, semiconductor memory apparatus or above-mentioned
Any appropriate combination.The more specific example (non exhaustive list) of computer readable storage medium includes：Portable computing
Machine disk, hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read only memory (EPROM or
Flash memory), static RAM (SRAM), Portable compressed disk read-only memory (CD-ROM), digital versatile disc
(DVD), memory stick, floppy disk, mechanical coding equipment, the punch card for being for example stored thereon with instruction or groove internal projection structure, with
And above-mentioned any appropriate combination.Computer readable storage medium used herein above is not interpreted instantaneous signal itself,
The electromagnetic wave of such as radio wave or other Free propagations, the electromagnetic wave propagated by waveguide or other transmission mediums (for example,
Pass through the light pulse of fiber optic cables) or pass through electric wire transmit electric signal.
Computer-readable program instructions described herein can be downloaded to from computer readable storage medium it is each calculate/
Processing equipment, or outer computer or outer is downloaded to by network, such as internet, LAN, wide area network and/or wireless network
Portion's storage device.Network may include copper transmission cable, optical fiber transmission, wireless transmission, router, fire wall, interchanger, gateway
Computer and/or Edge Server.Adapter or network interface in each calculating/processing equipment are received from network to be counted
Calculation machine readable program instructions, and the computer-readable program instructions are forwarded, for the meter being stored in each calculating/processing equipment
In calculation machine readable storage medium storing program for executing.
Computer program instructions for executing present disclosure operation can be assembly instruction, instruction set architecture (ISA)
Instruction, machine instruction, machine-dependent instructions, microcode, firmware instructions, condition setup data or with one or more programmings
Language arbitrarily combines the source code or object code write, the programming language include the programming language-of object-oriented such as
C++ etc., and conventional procedural programming languages-such as " C " language or similar programming language.Computer-readable program refers to
Order can be executed fully, partly be executed on the user computer, as an independent software package on the user computer
Execute, part on the user computer part on the remote computer execute or completely on a remote computer or server
It executes.In situations involving remote computers, remote computer can include LAN by the network-of any kind
(LAN) or wide area network (WAN)-is connected to subscriber computer, or, it may be connected to outer computer (such as utilize internet
Service provider is connected by internet).In some embodiments, believe by using the state of computer-readable program instructions
Breath comes personalized customization electronic circuit, such as programmable logic circuit, field programmable gate array (FPGA) or programmable logic
Array (PLA), the electronic circuit can execute computer-readable program instructions, to realize the various aspects of present disclosure.
It should be noted that although being referred to several modules or submodule of equipment in the detailed description above, it is this
Division is merely exemplary rather than enforceable.In fact, in accordance with an embodiment of the present disclosure, two or more above-described moulds
The feature and function of block can embody in a module.Conversely, the feature and function of an above-described module can be with
It is further divided into and is embodied by multiple modules.
Embodiment 4：
The purpose of the present embodiment 4 is the method verified by comparative example in embodiment 1.
Gossip1 (p) algorithms：
In order to reduce the excessive problem of routing cost caused by flooding, carried out by using Gossip1 (p) algorithms
The largely forwarding of unnecessary route messages when successive optimization, Gossip1 (p) algorithms allow for flooding, therefore pass through to introduce and turn
Probability p is sent out to solve the above problems.And it is directed to after the progress Comprehensive Experiment analysis of Gossip1 (p) algorithms, it has been found that wherein deposit
In this problem, forwarding probability P value is larger, then can make the unobvious of routing cost reduction；And forward Probability p value smaller,
Routing cost can also be reduced more relatively.But smaller p value can also make the reliability that Ad hoc networks are propagated reduce, i.e.,
When the neighbors of node is less, reuses lower rumor forwarding Probability p and may result in the premature disappearance of rumor.
Gossip1 (p, k) algorithm：
Advanced optimized using Gossip1 (p, k) algorithm perfect, the strategy of Gossip1 (p, k) algorithm is then, leads to
It crosses and propagates the preceding k-hop that Ad hoc networks are route to forward probability 1, Probability p is forwarded by improving rumor, to make up stream
Say the defect to disappear too early.The many experiments of Gossip1 (p, k) algorithm the result shows that, due to the neighbors number of each node
Between there are larger differences, when neighbors number is less, the rumor that may be previously set forwarding Probability p is excessively small, makes
Too early " death " at rumor, it is difficult to the reliability of Logistics networks transmission.
Gossip2 (p1, k, p2, n) innovatory algorithm：
Rumor is prevented using Gossip2 (p1, k, p2, n) innovatory algorithms too early " death ", Gossip2 (p1, k, p2, n)
The strategy of algorithm is, on the basis of Gossip1 (p, k) algorithm, introduces two threshold value thinkings, that is, p2, n is introduced, as the neighbour of node
When node number is less than preset value n, the forwarding of rumor message, wherein p2 are carried out using p2>P1, by improving rumor forwarding
Probability is to solve the above problems.
It is simple preset less than us according to neighbors number is worked as in Gossip2 (p1, k, p2, n) routing algorithm
When value, with 2 (p2 of Probability p>P1 routing cost can not be reduced as far as possible by) carrying out message forwarding, optimize network performance.Such as
In some sparse region of network, there may be smaller average node degree, at this moment, only according to just less than preset value
Excessive message will necessarily be caused to transmit using greater probability p2, increase routing cost.But in conjunction with average node degree and node
The relationship of present node degree, then probability is suitably forwarded further to lock, it can preferably promote network performance.So real
It applies example 1 and pseudo- rumor forwarding Probability p 0 is determined by comparing the node degree of present node and the size of average node degree, pass through puppet
Rumor forwarding Probability p 0 determines that rumor forwards Probability p again.
In Gossip2 (p1, k, p2, n) algorithm, pass through neighbors number and our the preset values of each node
It is compared, then judges whether to carry out message forwarding using rumor forwarding Probability p 2.And in I-Gossip algorithms, according to working as
The node degree n0 of front nodal point is compared with calculated average node degree n, so that it is determined that pseudo- rumor forwards Probability p 0, is then counted
It calculates rumor and forwards Probability p.
As shown in figure 3, in Wireless Network Simulation software NS-2.35, in the 1000m* using 250m as range of transmission
In the simulating area of 1000m, 20,50,100 nodes are randomly placed successively.
The computational methods for the average node degree that method in embodiment 1 is defined by us, calculate average node degree, so
It combines pseudo- rumor that probability is forwarded to solve rumor afterwards and forwards Probability p.As shown in Figure 4-Figure 6, by network simulation it can be seen that,
Using I-Gossip algorithms compared to AODV and common Gossip algorithm, network throughput is increased, reduces routing cost, and
And reduce the end-to-end time delay of network.It can be seen that according to the configuring condition difference of node number when network size is larger,
Above-mentioned network performance can further get a promotion.
Beneficial effects of the present invention：
1, the improved Gossip method for routing of average node degree and dress are based in a kind of Ad hoc networks of the present invention
It sets, compared to flooding, significantly reduces the forwarding quantity of route messages, by forwarding rumor message with certain probability,
Reduce total routing cost；
2, the improved Gossip method for routing of average node degree and dress are based in a kind of Ad hoc networks of the present invention
It sets, by combining the magnitude relationship of average node degree and present node degree, compared to unmodified Gossip method for routing, into one
Step reduces routing cost, and can prevent rumor message and disappear too early, greatly improves the performance of network；
3, the improved Gossip method for routing of average node degree and dress are based in a kind of Ad hoc networks of the present invention
It sets, the combination of introducing and average node degree by forwarding Probability p in conjunction with rumor, had both solved the main road excessively that flooding is brought
By overhead issues, the reliability of network message transmission is in turn ensured.
The foregoing is merely the preferred embodiments of the application, are not intended to limit this application, for the skill of this field
For art personnel, the application can have various modifications and variations.Within the spirit and principles of this application, any made by repair
Change, equivalent replacement, improvement etc., should be included within the protection domain of the application.Therefore, the present invention is not intended to be limited to this
These embodiments shown in text, and it is to fit to widest range consistent with the principles and novel features disclosed in this article.
Claims (10)
1. being based on the improved Gossip method for routing of average node degree in a kind of Ad hoc networks, which is characterized in that this method packet
It includes：
Receiving node routing table message calculates average node degree, and the average node degree is a jump of all nodes in certain area
Neighbors number average value in range；
Determine that pseudo- rumor forwards probability according to the magnitude relationship of the node degree of present node and the average node degree；
Determine that rumor forwards probability with rumor forwarding probabilistic relation formula according to predefined pseudo- rumor forwarding probability.
2. the method as described in claim 1, which is characterized in that the node degree of the present node and the average node degree
Magnitude relationship includes that the node degree of present node is less than the one third of average node degree, the node degree of present node is more than or equal to
The one third of average node degree and the node degree for being less than or equal to 2/3rds of average node degree, present node are more than average section
2/3rds of point degree；The predefined pseudo- rumor forwarding probability and rumor forward the probabilistic relation formula to be：Rumor forwards probability
The sum of probability and 0.02 is forwarded for pseudo- rumor.
3. method as claimed in claim 2, which is characterized in that in the method, when the node degree of present node is less than averagely
When the one third of node degree, is chosen between 0.75-0.8 and determine that pseudo- rumor forwards probability.
4. method as claimed in claim 3, which is characterized in that when the node degree of present node is less than three points of average node degree
For the moment, best puppet rumor forwarding probability is 0.75.
5. method as claimed in claim 2, which is characterized in that in the method, when the node degree of present node is more than or equal to
The one third of average node degree and less than or equal to average node degree 2/3rds when, between 0.65-0.75 choose determine
Pseudo- rumor forwards probability.
6. method as claimed in claim 5, which is characterized in that when the node degree of present node is more than or equal to average node degree
One third and less than or equal to average node degree 2/3rds when, best puppet rumor forwarding probability is 0.675.
7. method as claimed in claim 2, which is characterized in that in the method, when the node degree of present node is more than averagely
Node degree 2/3rds when, chosen between 0.6-0.65 and determine that pseudo- rumor forwards probability.
8. the method for claim 7, which is characterized in that when the node degree of present node is more than three points of average node degree
Two when, best puppet rumor forwarding probability is 0.6.
9. a kind of computer readable storage medium, wherein being stored with a plurality of instruction, which is characterized in that described instruction is suitable for by terminal
The processor of equipment equipment loads and executes the method according to any one of claim 1-8.
10. a kind of terminal device, including processor and computer readable storage medium, processor is for realizing each instruction；It calculates
Machine readable storage medium storing program for executing is for storing a plurality of instruction, which is characterized in that described instruction is appointed for executing according in claim 1-8
Method described in one.
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 true CN108494682A (en) | 2018-09-04 |
| CN108494682B 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 (5)
| 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 |
| CN103957571A (en) * | 2014-05-12 | 2014-07-30 | 中国石油大学(华东) | Ad hoc network route discovery method based on Brownian motion |
| CN104952459A (en) * | 2015-04-29 | 2015-09-30 | 大连理工大学 | Distributed speech enhancement method based on distributed uniformity and MVDR (minimum variance distortionless response) beam forming |
| US20160328530A1 (en) * | 2015-05-08 | 2016-11-10 | Umm-Al-Qura University | Method and apparatus for automated patient severity ranking in mass casualty incidents |
| CN106789676A (en) * | 2017-01-19 | 2017-05-31 | 西安电子科技大学 | The reliable multicast method for routing of low overhead in wireless self-organization network |
-
2018
- 2018-03-20 CN CN201810231159.2A patent/CN108494682B/en not_active Expired - Fee Related
Patent Citations (5)
| 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 |
| CN103957571A (en) * | 2014-05-12 | 2014-07-30 | 中国石油大学(华东) | Ad hoc network route discovery method based on Brownian motion |
| CN104952459A (en) * | 2015-04-29 | 2015-09-30 | 大连理工大学 | Distributed speech enhancement method based on distributed uniformity and MVDR (minimum variance distortionless response) beam forming |
| US20160328530A1 (en) * | 2015-05-08 | 2016-11-10 | Umm-Al-Qura University | Method and apparatus for automated patient severity ranking in mass casualty incidents |
| 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 |
|---|
| Z.J. HAAS等: "《Gossip-based ad hoc routing》", 《IEEE/ACM TRANSACTIONS ON NETWORKING》 * |
| 杨卫东: "《基于节点平均连接度的Ad Hoc网络分簇算法》", 《计算机工程与应用》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108494682B (en) | 2020-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106656598B (en) | Power communication gateway key service alternative route configuration method and system | |
| Li et al. | Multi-objective topology planning for microwave-based wireless backhaul networks | |
| CN109617810A (en) | Data transmission method and device | |
| CN104396198A (en) | Tie-breaking in shortest path determination | |
| Sarasvathi et al. | QoS guaranteed intelligent routing using hybrid PSO-GA in wireless mesh networks | |
| CN104199884B (en) | A kind of social networks point of observation choosing method preferential based on R coverage rates | |
| CN105872093A (en) | CDN acceleration method and system | |
| CN104469874A (en) | Message forwarding method of opportunistic network based on probability centrality | |
| CN104936250A (en) | Routing method based on P2P file sharing in wireless D2D network | |
| Huang et al. | Blockchain network propagation mechanism based on P4P architecture | |
| CN106982162A (en) | Methods, devices and systems for forwarding service stream | |
| CN105453494B (en) | Virtual shortest path tree is established and the method and path-calculating element of processing | |
| CN108494682A (en) | The improved Gossip method for routing of average node degree and device are based in Ad hoc networks | |
| Maniscalco et al. | Binary and m-ary encoding in applications of tree-based genetic algorithms for QoS routing | |
| CN110191495A (en) | A kind of routing discovering method and device based on fiducial probability forwarding | |
| CN110198268A (en) | The high-dimensional Torus network architecture and adaptive routing method | |
| CN106792980B (en) | Joint routing metric and partially overlapping channel allocation method | |
| Khandelwal et al. | Secure IoT architecture in mobile ad-hoc network against malicious attacks using blockchain-based BATMAN | |
| CN105450528B (en) | The method of routing forwarding and corresponding equipment are carried out to data packet | |
| CN107749819A (en) | Route selection method and device under the conditions of a kind of grid network | |
| CN114697002A (en) | Distributed quantum cipher network group key distribution method and system | |
| CN110351189A (en) | Route control method towards real-time edge calculations | |
| Bueno et al. | Analyzing the effects of neighborhood crossover in multiobjective multicast flow routing problem | |
| Belgaum et al. | Ideal node enquiry search algorithm (INESH) in MANETS | |
| Stai et al. | A coalitional game based approach for multi-metric optimal routing in wireless networks |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20201106 Termination date: 20210320 |