CN110191495A - A kind of routing discovering method and device based on fiducial probability forwarding - Google Patents
A kind of routing discovering method and device based on fiducial probability forwarding Download PDFInfo
- Publication number
- CN110191495A CN110191495A CN201910419842.3A CN201910419842A CN110191495A CN 110191495 A CN110191495 A CN 110191495A CN 201910419842 A CN201910419842 A CN 201910419842A CN 110191495 A CN110191495 A CN 110191495A
- Authority
- CN
- China
- Prior art keywords
- node
- confidence level
- routing
- probability
- forwarding
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present disclosure discloses a kind of routing discovering methods and device based on fiducial probability forwarding, this method comprises: the behavior of periodic evaluation node, predicts the confidence level of node；In route finding process, forwarding probability is calculated for it according to the confidence level of node associated neighboring nodes, node forwards the route discovery information received according to the probability；In the Route Selection stage, path confidence level is calculated according to node credibility, confidence level highest routing in path is selected in a plurality of optional routing.The disclosure effectively reduces malicious node and participates in the probability of route discovery, to reduce the additional control overhead caused by the invalid forwarding of these nodes, while can also be improved the reliability of routing.
Description
Technical field
The disclosure belongs to the technical field of self-organizing network, is related to a kind of routing discovering method based on fiducial probability forwarding
And device.
Background technique
Only there is provided background technical informations relevant to the disclosure for the statement of this part, it is not necessary to so constitute first skill
Art.
Self-organizing network, if mobile ad-hoc network is the network that one group of node with wireless communication ability forms, often
One node is mobile terminal while also having the function of routing.What node can be supported in no any communications infrastructure
Communication is realized in autonomous networking in environment.Directly pass through point-to-point eless channel communication between two neighboring nodes, and it is apart from each other
Node then need to establish the routing being made of multiple nodes, communication is realized by way of multi-hop transmission.Because without center
Node, all nodes often do not have complete network topological information.Therefore, it in establishing routing procedure, needs through big vast model
Mode route discovery information is forwarded to all nodes.In the process, a large amount of broadcast overhead can be generated.
Probability forwarding mechanism is one of self-organizing network information forwarding mechanism.The mechanism is according to Network status in advance
Node sets forward probability, and node forwards the information received according to the probability.Therefore, probability forwarding mechanism can reduce routing hair
Redundant forwarding in existing information communication process, reduces expense.It, can be according to section according to application difference in currently existing scheme
The forwarding probability of the parameters calculate nodes such as dot density, additional coverage rate, distance, however, inventor has found in R&D process, still
There is no scheme using the credibility of node or prestige as the calculation basis of forwarding probability.
Self-organizing network naturally needs all cooperations for participating in node.However, because of the reasons such as resource-constrained, self-organizing network
In it is possible that selfish node, even starts the malicious node of rogue attacks.These nodes will affect the normal fortune of network
Capable and data transmission security.Therefore in route discovery, foundation and maintenance process, malicious node should be identified, and be excluded
Outside.In current mainstream scheme, credible administrative model is used to the confidence level of evaluation node, identifies malicious node, and on road
After by discovery node, in the choice phase by investigating the optional credibility for routing interior joint, it includes minimum for selecting one
Malicious node or the highest routing of confidence level.However, inventor has found in R&D process, although this mode can reduce evil
Node of anticipating participates in the probability of data transmission, improves routing security, but in route finding process, malicious node is still engaged in
The forwarding of grouping.They participate in information forwarding operation for route discovery even whole network be clearly it is invalid,
It is extra, and will increase the expense of network, it is therefore necessary to design a kind of mechanism and exclude malicious node in route finding process
Except, eliminate expense brought by them.
Summary of the invention
It for the deficiencies in the prior art, solves in dangerous self-organizing network environment, node is established routing and opened
The problem of selling larger and interfering vulnerable to malicious node, one or more other embodiments of the present disclosure provide a kind of based on fiducial probability
The routing discovering method and device of forwarding periodically assess the credible journey of node by the credible administrative model of self-organizing network
Degree provides authentication parameters for probability forwarding；By the route discovery mechanisms forwarded based on fiducial probability, malicious node is effectively reduced
The probability of route discovery is participated in, to reduce the additional control overhead caused by the invalid forwarding of these nodes, while can also be with
Improve the reliability of routing.
According to the one aspect of one or more other embodiments of the present disclosure, a kind of routing based on fiducial probability forwarding is provided
It was found that method.
A kind of routing discovering method based on fiducial probability forwarding, this method comprises:
The confidence level of node is predicted in the behavior of periodic evaluation node；
In route finding process, forwarding probability is calculated for it according to the confidence level of node associated neighboring nodes, node is pressed
The route discovery information received is forwarded according to the probability；
In the Route Selection stage, path confidence level is calculated according to node credibility, selects path in a plurality of optional routing
The highest routing of confidence level.
Further, in the method, using the confidence level of credible administrative model prediction node；
The credible administrative model is distributed trust model, using direct confidence level and recommends confidence level extremely phase
Answer the behavior of changeable weight comprehensive assessment node.
Further, in the method, the direct confidence level describes believable probability distribution using Beta distribution；Using
Bayesian formula derives the credible distribution of node according to the intersection record in history intersection record and evaluation period.
Further, in the method, in node i when assessing the confidence level of node j, all common neighbor nodes of the two
Recommendation information recommendation trust average be the recommendation confidence level.
Further, in the method, changeable weight value is updated according to total intersection record quantity between node i and j.
Further, in the method, the specific steps of the route finding process include:
Source node finds request packet to its neighbor node broadcast；
Judge whether recipient is destination node, if being directly entered destination node Route Selection, otherwise enters in next step；
In the wheel route finding process, node never receives request of route discovery packet with path every time, by being arranged not
The theoretical transfer sequence of request of route discovery packet is rearranged with forward delay time；
Calculate node is based on believable forwarding probability, and node decides whether to forward request of route discovery packet according to the probability；
Return judges whether recipient is destination node.
Further, in the method, the node never receives the specific step of request of route discovery packet with path every time
Suddenly include:
In epicycle route finding process, when node receives request of route discovery packet, judge whether node had received
Request of route discovery packet abandons the request of route discovery packet newly received if receiving, and otherwise enters in next step；
Node calculates the forward delay time of the request of route discovery packet；
If the forward delay time for some request of route discovery packet that node saves is already expired, turn according to probability pass-through mode
The request of route discovery packet is sent out, and removes other request of route discovery packets to be forwarded.
Further, in the method, the node based on believable forwarding probability according to the confidence level of upstream node and
This confidence level for broadcasting new overlay node set determines.
Further, in the method, the specific steps of the destination node Route Selection are as follows: in the Route Selection stage,
Path confidence level is calculated according to node credibility, after destination node never receives multiple request of route discovery packets with path, more
Confidence level highest routing in path is selected in the optional routing of item, and reverse route is established according to the request of route discovery packet.
According to the one aspect of one or more other embodiments of the present disclosure, a kind of computer readable storage medium is provided.
A kind of computer readable storage medium, wherein being stored with a plurality of instruction, described instruction is suitable for by terminal device
Reason device loads and executes a kind of routing discovering method based on fiducial probability forwarding.
According to the one aspect of one or more other embodiments of the present disclosure, a kind of terminal device is provided.
A kind of terminal device comprising processor and computer readable storage medium, processor is for realizing each instruction；Meter
Calculation machine readable storage medium storing program for executing is suitable for being loaded by processor and being executed described one kind and is based on for storing a plurality of instruction, described instruction
The routing discovering method of fiducial probability forwarding.
According to the one aspect of one or more other embodiments of the present disclosure, a kind of routing based on fiducial probability forwarding is provided
It was found that device.
A kind of route discovery device based on fiducial probability forwarding, based on a kind of road based on fiducial probability forwarding
By discovery method, comprising:
Confidence level prediction module is configured as the behavior of periodic evaluation node, predicts the confidence level of node；
Route discovery module is configured as in route finding process, and the confidence level according to node associated neighboring nodes is
It calculates forwarding probability, and node forwards the route discovery information received according to the probability；
Routing selecting module, was configured as in the Route Selection stage, path confidence level was calculated according to node credibility, more
Confidence level highest routing in path is selected in the optional routing of item.
The disclosure the utility model has the advantages that
A kind of routing discovering method and device based on fiducial probability forwarding that the disclosure provides, solves dangerous from group
Knit in network environment, node establish routing cost it is larger and vulnerable to malicious node interference the problem of, first periodically assessment section
The behavior of point, predicts the credibility of node.It is it according to the confidence level of node associated neighboring nodes in route finding process
Forwarding probability is calculated, node forwards the route discovery information received according to the probability.In the Route Selection stage, a plurality of optional
Most reliable routing is selected according to routing credible indexes in routing.The disclosure effectively reduces malicious node and participates in the general of route discovery
Rate to reduce the additional control overhead caused by the invalid forwarding of these nodes, while can also be improved the reliability of routing.
Detailed description of the invention
The Figure of description for constituting a part of this disclosure is used to provide further understanding of the disclosure, and the disclosure is shown
Meaning property embodiment and its explanation do not constitute the improper restriction to the disclosure for explaining the disclosure.
Fig. 1 is a kind of routing discovering method flow chart based on fiducial probability forwarding according to one or more embodiments；
Fig. 2 is the credible evaluation value figure according to each node of one or more embodiments；
Fig. 3 is to forward exemplary diagram according to the request of route discovery packet delay of one or more embodiments；
Fig. 4 is to forward probability calculation exemplary diagram according to the request of route discovery packet of one or more embodiments.
Specific embodiment:
Below in conjunction with the attached drawing in one or more other embodiments of the present disclosure, to one or more other embodiments of the present disclosure
In technical solution be clearly and completely described, it is clear that described embodiment is only disclosure a part of the embodiment,
Instead of all the embodiments.Based on one or more other embodiments of the present disclosure, those of ordinary skill in the art are not being made
Every other embodiment obtained under the premise of creative work belongs to the range of disclosure protection.
It is noted that following detailed description is all illustrative, it is intended to provide further instruction to the disclosure.Unless another
It indicates, all technical and scientific terms that the present embodiment uses have and disclosure 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 embodiment, and be not intended to restricted root
According to the illustrative embodiments of the disclosure.As used herein, unless the context clearly indicates otherwise, otherwise singular
Also it is 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 their combination.
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 of one module, program segment or code, a part of 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, function marked in the box can also occur according to the sequence that is marked in attached drawing is different from.For example, two connect
The box even indicated can actually be basically executed in parallel or they can also be executed in a reverse order sometimes,
This depends on related function.It should also be noted that each box and flow chart in flowchart and or block diagram
And/or the combination of the box in block diagram, the dedicated hardware based system that functions or operations as defined in executing can be used are come
It realizes, or the combination of specialized hardware and computer instruction can be used to realize.
In the absence of conflict, the feature in the embodiment and embodiment in the disclosure can be combined with each other, and tie below
It closes attached drawing and embodiment is described further the disclosure.
Embodiment one
Be solve in dangerous self-organizing network environment, node establish routing cost it is larger and vulnerable to malicious node interfere
The problem of, according to the one aspect of one or more other embodiments of the present disclosure, provide a kind of routing based on fiducial probability forwarding
It was found that method.
A kind of routing discovering method based on fiducial probability forwarding, this method comprises:
The confidence level of node is predicted in the behavior of periodic evaluation node；
In route finding process, forwarding probability is calculated for it according to the confidence level of node associated neighboring nodes, node is pressed
The route discovery information received is forwarded according to the probability；
In the Route Selection stage, path confidence level is calculated according to node credibility, selects path in a plurality of optional routing
The highest routing of confidence level.
This method effectively reduces the probability that malicious node participates in route discovery, to reduce the invalid forwarding because of these nodes
The additional control overhead caused, while can also be improved the reliability of routing.
As shown in Figure 1, the key step of this method is as follows:
Step 1: the credibility of credible administrative model periodic evaluation node.
Step 2: every wheel route discovery finds request packet (Route Request from source node to its neighbours' broadcast
Packet, RREQ) start.
Step 3: node never receives RREQ with path every time, is forwarded by setting in a wheel route finding process
The theoretical transfer sequence of each RREQ is rearranged in delay.
Step 4: calculating and be based on believable forwarding probability, and node decides whether to forward RREQ according to the probability.
Step 5: after destination node never receives multiple RREQ with path, a confidence level is selected most from multiple routings
High, and reverse route is established according to the RREQ.
Step 6: a wheel route discovery terminates.
In this method step 1, credible administrative model is distributed trust model, using directly credible and recommendation
The credible confidence level to assess node.Wherein direct confidence level describes believable probability distribution, an assessment using Beta distribution
Observe that the normal intersection record between node i and node j is α in weekijAnd βij, it is distributed according to Beta, mathematic expectaion conduct
Direct credible evaluation of the node i to node j:
Node is derived according to the intersection record in history intersection record and evaluation period using Bayesian formula
Credible distribution.Because Beta is distributed as conjugation distribution, the prior distribution and Posterior distrbutionp of fiducial probability all meet Beta distribution.It is false
If normal amount of interaction and abnormal amount of interaction are respectively in history intersection recordWithIt is observed in current period
Normal amount of interaction and abnormal amount of interaction are respectivelyWithIn order to reduce history intersection record in credible evaluation
Specific gravity, using decline factor mu:
Formula (2) periodically are executed, node is assessed according to the interactive information in history mutual information and current period
Direct confidence level.
For recommending confidence level, node i can be pushed away when assessing the confidence level of node j from the common neighbor node collection of the two
Recommend information, it is assumed that be denoted as T from node k about the recommendation trust of node jkj, all recommended node set are denoted as Cn, then recommend
TrustCalculation method are as follows:
Wherein | | indicate set interior joint quantity.
Directly trust obtaining with after recommendation trust, comprehensive the two obtains the final trust value of node:
Wherein wdAnd wrFor changeable weight, calculation method are as follows:
In formula (5), wconFor fixed value, from value between 0 and 1, n indicates total intersection record between node i and j
Quantity.
In the credible administrative model of the present embodiment, number of nodes is set as 100, wherein 30 are malicious node, it can
The attack type started is that packet loss attacks (Packet-dropping attack), probability 0.2-0.4, modification attack
(Modification attack), probability 0.3-0.6, then when wherein simulation time is 120 seconds, the credible of each node is commented
It is as shown in Figure 2 to be estimated to take value.Essential characteristic is normal node credible evaluation value close or equal to 1, and the credible evaluation of malicious node
Value is 0.5 or so.
In three the present embodiment the step of, a node allows never to receive multiple RREQ with path, when node i is from section
When point j receives a RREQ, it is denoted as RREQij, node will do it following operation:
(1) in epicycle route finding process, whether node i had received RREQ, and RREQ is abandoned if receivingij, no
Then, (2) are gone to；
(2) node i is RREQijCalculate forward delay time FDij, i.e., in time FDijJust allow to forward later, calculate public
Formula are as follows:
FDij=MaxDelay × (1-Tij) (6)
(3) if the forward delay time for some RREQ that node i saves is already expired, it can forward, then be forwarded according to probability
Mode forwards the RREQ, and removes other RREQ to be forwarded.
In a route finding process, when the never same path (corresponding different upstream nodes) of node receives multiple RREQ,
It needs to be that each RREQ sets different forward delays according to the confidence level of upstream node, the forwarding time for resetting RREQ is realized with this
Sequence, and the RREQ for choosing first waiting time to terminate is forwarded.In delay forwarding example as shown in Figure 3 and Table 1, node
D receives RREQ, and the confidence level according to A, B and C in time t+0.5, t+0.7 and t+0.9 at node A, B and C respectively,
It is 1,0.6 and 0.2 according to the delay forwarding time that formula (6) is their calculating, then each RREQ is corresponding can forwarding time point
It Wei not t+1.1, t+0.8 and t+0.5.It is observed that obtaining forwarding qualification first from the RREQ that node C receives, and it is forwarded,
The RREQ received from other nodes is dropped, and is no longer forwarded.
Table 1
In four the present embodiment the step of, the forwarding probability of node is determined by two factors, and one is that upstream node can
Reliability, a confidence level for being this and broadcasting new overlay node set, wherein new overlay node set U (i) calculation is as follows:
U (i)=Nb(i)-[Nb(i)I Nb(j)]-{j} (7)
In formula (7), Nb(i) and Nb(j) node i and a hop neighbor node set of node j are respectively indicated.Because of node i
Be not to broadcast at once, but postpone a period of time after receiving a RREQ, during this may from other nodes, such as
Node k is received again by the RREQ that source node is sent, and needs to be updated U (i) at this time:
U (i)=U (i)-[U (i) I Nb(k)]-{k} (8)
After obtaining new overlay node set, the confidence level of the set is assessed, gathers confidence level TU(i)Equal in set
The confidence level of the highest node of confidence level:
TU(i)=max { Tik},k∈U(i) (9)
The forwarding probability calculation of node i is as follows:
pre(i)=min (TU(i),Tij) (10)
Node is the random number being randomly generated between one 0 to 1 according to the mode of forwarding probability forwarding RREQ, if changed
Random number is less than pre(i) RREQ is then forwarded, the RREQ of all preservations is otherwise abandoned, abandons forwarding operation.
The calculation of new overlay node set U (i) and forwarding probability is as shown in Fig. 4 and table 2.U (i) is the neighbour of node i
Occupy node set (A, B, C, D, E, F, J) subtract it is remaining after the common neighbor node (E, F) and node J of node i and node j
Node, as node A, B, C and D.Gather confidence level TU(i)Equal to the confidence level of the highest node of confidence level in set, i.e. TU(i)
The forwarding Probability p of=max { 0.5,0.9,0.95,0.8 }=0.95. and node Ire(i) equal to the confidence level of upstream node J and new
The maximum value of overlay node collection confidence level, i.e. pre(i)=max { 0.8,0.95 }=0.8.
Table 2
In five the present embodiment the step of, the confidence level T in pathrouteIt is calculated as
Troute=min (Tmn), wherein m, n are two nodes (11) adjacent on path
Destination node selects T in all optional pathsrouteIt is maximum to establish reverse route.
Embodiment two
According to the one aspect of one or more other embodiments of the present disclosure, a kind of computer readable storage medium is provided.
A kind of computer readable storage medium, wherein being stored with a plurality of instruction, described instruction is suitable for by terminal device
Reason device loads and executes a kind of routing discovering method based on fiducial probability forwarding.
Embodiment three
According to the one aspect of one or more other embodiments of the present disclosure, a kind of terminal device is provided.
A kind of terminal device comprising processor and computer readable storage medium, processor is for realizing each instruction；Meter
Calculation machine readable storage medium storing program for executing is suitable for being loaded by processor and being executed described one kind and is based on for storing a plurality of instruction, described instruction
The routing discovering method of fiducial probability forwarding.
These computer executable instructions execute the equipment according to each reality in the disclosure
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, which can be, can keep 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, electric magnetic storage apparatus, 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 random access memory (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, local area network, wide area network and/or wireless network
Portion stores equipment.Network may include copper transmission cable, optical fiber transmission, wireless transmission, router, firewall, 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
The source code or object code that any combination of language is 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 on the user computer, partly be executed on the user computer, as an independent software package
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 local area network 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, by being believed 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.
Example IV
According to the one aspect of one or more other embodiments of the present disclosure, a kind of routing based on fiducial probability forwarding is provided
It was found that device.
A kind of route discovery device based on fiducial probability forwarding, based on a kind of road based on fiducial probability forwarding
By discovery method, comprising:
Confidence level prediction module is configured as the behavior of periodic evaluation node, predicts the confidence level of node；
Route discovery module is configured as in route finding process, and the confidence level according to node associated neighboring nodes is
It calculates forwarding probability, and node forwards the route discovery information received according to the probability；
Routing selecting module, was configured as in the Route Selection stage, path confidence level was calculated according to node credibility, more
Confidence level highest routing in path is selected in the optional routing of item.
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 only 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
Further division is to be embodied by multiple modules.
The foregoing is merely preferred embodiment of the present disclosure, are not limited to the disclosure, for the skill of this field
For art personnel, the disclosure can have various modifications and variations.It is all within the spirit and principle of the disclosure, it is made any to repair
Change, equivalent replacement, improvement etc., should be included within the protection scope of the disclosure.Therefore, the disclosure is not intended to be limited to this
These embodiments shown in text, and it is to fit to the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. a kind of routing discovering method based on fiducial probability forwarding, which is characterized in that this method comprises:
The confidence level of node is predicted in the behavior of periodic evaluation node；
In route finding process, forwarding probability is calculated for it according to the confidence level of node associated neighboring nodes, node is according to this
Probability forwards the route discovery information received；
In the Route Selection stage, path confidence level is calculated according to node credibility, selects path credible in a plurality of optional routing
Spend highest routing.
2. a kind of routing discovering method based on fiducial probability forwarding as described in claim 1, which is characterized in that in this method
In, using the confidence level of credible administrative model prediction node；
The credible administrative model is distributed trust model, using direct confidence level and confidence level is recommended extremely accordingly to move
The behavior of state weight comprehensive assessment node.
3. a kind of routing discovering method based on fiducial probability forwarding as claimed in claim 2, which is characterized in that in this method
In, the direct confidence level describes believable probability distribution using Beta distribution；Remembered using Bayesian formula according to history interaction
Intersection record in record and evaluation period derives the credible distribution of node；
In node i when assessing the confidence level of node j, the recommendation trust of the recommendation information of all common neighbor nodes of the two
Average is the recommendation confidence level；
Changeable weight value is updated according to total intersection record quantity between node i and j.
4. a kind of routing discovering method based on fiducial probability forwarding as described in claim 1, which is characterized in that in this method
In, the specific steps of the route finding process include:
Source node finds request packet to its neighbor node broadcast；
Judge whether recipient is destination node, if being directly entered destination node Route Selection, otherwise enters in next step；
In the wheel route finding process, node never receives request of route discovery packet with path every time, turns by the way that setting is different
Hair delay time rearranges the theoretical transfer sequence of request of route discovery packet；
Calculate node is based on believable forwarding probability, and node decides whether to forward request of route discovery packet according to the probability；
Return judges whether recipient is destination node.
5. a kind of routing discovering method based on fiducial probability forwarding as described in claim 1, which is characterized in that in this method
In, the specific steps that the node never receives request of route discovery packet with path every time include:
In epicycle route finding process, when node receives request of route discovery packet, judge whether node had received routing
It was found that request packet, abandons the request of route discovery packet newly received if receiving, otherwise enter in next step；
Node calculates the forward delay time of the request of route discovery packet；
It, should according to the forwarding of probability pass-through mode if the forward delay time for some request of route discovery packet that node saves is already expired
Request of route discovery packet, and remove other request of route discovery packets to be forwarded.
6. a kind of routing discovering method based on fiducial probability forwarding as described in claim 1, which is characterized in that in this method
In, the node broadcasts the credible of new overlay node set with this according to the confidence level of upstream node based on believable forwarding probability
Degree determines.
7. a kind of routing discovering method based on fiducial probability forwarding as described in claim 1, which is characterized in that in this method
In, the specific steps of the destination node Route Selection are as follows: in the Route Selection stage, it is credible that path is calculated according to node credibility
Degree after destination node never receives multiple request of route discovery packets with path, selects path confidence level in a plurality of optional routing
Highest routing, and reverse route is established according to the request of route discovery packet.
8. 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 is loaded and is executed such as a kind of described in any item route discoveries forwarded based on fiducial probability of claim 1-7
Method.
9. a kind of terminal device comprising 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 suitable for being loaded by processor and being executed such as power
Benefit requires a kind of described in any item routing discovering methods based on fiducial probability forwarding of 1-7.
10. a kind of route discovery device based on fiducial probability forwarding, which is characterized in that based on such as any one of claim 1-7
A kind of routing discovering method based on fiducial probability forwarding, comprising:
Confidence level prediction module is configured as the behavior of periodic evaluation node, predicts the confidence level of node；
Route discovery module is configured as in route finding process, is counted according to the confidence level of node associated neighboring nodes for it
Forwarding probability is calculated, node forwards the route discovery information received according to the probability；
Routing selecting module, was configured as in the Route Selection stage, calculated path confidence level according to node credibility, it is a plurality of can
Routing is by the highest routing of middle selection path confidence level.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910419842.3A CN110191495A (en) | 2019-05-20 | 2019-05-20 | A kind of routing discovering method and device based on fiducial probability forwarding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910419842.3A CN110191495A (en) | 2019-05-20 | 2019-05-20 | A kind of routing discovering method and device based on fiducial probability forwarding |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110191495A true CN110191495A (en) | 2019-08-30 |
Family
ID=67716998
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910419842.3A Pending CN110191495A (en) | 2019-05-20 | 2019-05-20 | A kind of routing discovering method and device based on fiducial probability forwarding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110191495A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110868246A (en) * | 2019-09-02 | 2020-03-06 | 北京邮电大学 | Information transmission method and system |
| CN112822098A (en) * | 2020-12-25 | 2021-05-18 | 河南卓正电子科技有限公司 | Routing method and device of Internet of things and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105682096A (en) * | 2016-01-29 | 2016-06-15 | 福建师范大学 | Internet of things credible route selection method and system based on AGV and reputation system |
| US20180287810A1 (en) * | 2017-03-30 | 2018-10-04 | Fujitsu Limited | Information processing apparatus, information processing system, and information processing method |
-
2019
- 2019-05-20 CN CN201910419842.3A patent/CN110191495A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105682096A (en) * | 2016-01-29 | 2016-06-15 | 福建师范大学 | Internet of things credible route selection method and system based on AGV and reputation system |
| US20180287810A1 (en) * | 2017-03-30 | 2018-10-04 | Fujitsu Limited | Information processing apparatus, information processing system, and information processing method |
Non-Patent Citations (2)
| Title |
|---|
| ZHEXIONG WEI、H. TANG、F. R. YU、MAOYU WANG、P. MASON: "Security Enhancements for Mobile Ad Hoc Networks (MANETs) with Trust Management Using Uncertain Reasoning", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 * |
| 许化强: "移动Ad Hoc网络全局互联下开销控制与可信保障研究", 《中国博士学位论文全文数据库（电子期刊）》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110868246A (en) * | 2019-09-02 | 2020-03-06 | 北京邮电大学 | Information transmission method and system |
| CN112822098A (en) * | 2020-12-25 | 2021-05-18 | 河南卓正电子科技有限公司 | Routing method and device of Internet of things and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3625935B1 (en) | Techniques for secure blockchain routing | |
| US7826366B2 (en) | Joint channel assignment and routing in wireless networks | |
| US8472319B2 (en) | Relay station operated according to QOS level of service packet and method of operating relay station | |
| Hossain et al. | Multi-objective Harris hawks optimization algorithm based 2-Hop routing algorithm for CR-VANET | |
| Jahanshahi et al. | On channel assignment and multicast routing in multi–channel multi–radio wireless mesh networks | |
| Ding et al. | Intelligent data transportation in smart cities: A spectrum-aware approach | |
| Fernandez et al. | Metaheuristics in telecommunication systems: network design, routing, and allocation problems | |
| Lakas et al. | A Multiconstrained QoS‐Compliant Routing Scheme for Highway‐Based Vehicular Networks | |
| CN110191495A (en) | A kind of routing discovering method and device based on fiducial probability forwarding | |
| Kumar et al. | Collaborative-learning-automata-based channel assignment with topology preservation for wireless mesh networks under QoS constraints | |
| Azer et al. | An innovative approach for the wormhole attack detection and prevention in wireless ad hoc networks | |
| Ayub et al. | Contact quality based forwarding strategy for delay tolerant network | |
| Sadeghianpour et al. | Joint channel assignment and routing in multiradio multichannel wireless mesh networks with directional antennas | |
| Sarubbi et al. | Allocating roadside units in VANETs using a variable neighborhood search strategy | |
| Derdouri et al. | Performance analysis of self‐organised multicast group in multi‐radio multi‐channel wireless mesh networks | |
| Tran‐Dang et al. | Link‐delay and spectrum‐availability aware routing in cognitive sensor networks | |
| Hegde et al. | Performance and efficiency tradeoffs in blockchain overlay networks | |
| Padiya et al. | A System for MANET to detect selfish nodes using NS2 | |
| Papaj et al. | Trust based algorithm for candidate node selection in hybrid MANET-DTN | |
| Rahbari | Hybrid evolutionary game theory in qos routing of wireless mesh networks | |
| Moura et al. | Game theory for cooperation in multi-access edge computing | |
| Wu et al. | Joint interface placement and channel assignment in multi-channel wireless mesh networks | |
| Maragatharajan et al. | A secured MANET using position‐based opportunistic routing and SEMI MARKOV process | |
| Sausen et al. | Bounded-distance multi-coverage backbones in wireless sensor networks | |
| Pavani et al. | A reliable data delivery using trust management system based on node behaviour predication in MANET |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190830 |