CN106209627B - Vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method - Google Patents
Vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method Download PDFInfo
- Publication number
- CN106209627B CN106209627B CN201610641348.8A CN201610641348A CN106209627B CN 106209627 B CN106209627 B CN 106209627B CN 201610641348 A CN201610641348 A CN 201610641348A CN 106209627 B CN106209627 B CN 106209627B
- Authority
- CN
- China
- Prior art keywords
- node
- message
- transmission ability
- vehicle
- caching
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 48
- 238000000034 method Methods 0.000 title claims abstract description 19
- 230000008859 change Effects 0.000 claims abstract description 16
- 230000007246 mechanism Effects 0.000 claims abstract description 12
- 108090000623 proteins and genes Proteins 0.000 claims description 13
- 238000007726 management method Methods 0.000 claims description 8
- 238000012545 processing Methods 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 7
- 230000033001 locomotion Effects 0.000 claims description 6
- 238000012423 maintenance Methods 0.000 claims description 6
- 238000012790 confirmation Methods 0.000 claims description 4
- 238000001514 detection method Methods 0.000 claims description 3
- 230000003993 interaction Effects 0.000 claims description 3
- 229910006119 NiIn Inorganic materials 0.000 claims description 2
- 238000012217 deletion Methods 0.000 claims 1
- 230000037430 deletion Effects 0.000 claims 1
- 238000000151 deposition Methods 0.000 claims 1
- 238000013461 design Methods 0.000 abstract description 2
- 239000007921 spray Substances 0.000 description 16
- 201000004569 Blindness Diseases 0.000 description 3
- 230000008901 benefit Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000006855 networking Effects 0.000 description 3
- 206010021703 Indifference Diseases 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 239000006185 dispersion Substances 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000006424 Flood reaction Methods 0.000 description 1
- 241000700605 Viruses Species 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 201000010099 disease Diseases 0.000 description 1
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
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/302—Route determination based on requested QoS
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention proposes that a kind of distributing based on node-node transmission ability focuses Routing Protocol method, including more copies distribute stage and single copy focussing stage.More copies distribute the stage and refer to when node possesses multiple copies of some message, possible path is found into network by distributing message copy, this method is by change rate to car speed, the node that meets and remaining cache size etc. because usually measuring node to the transmittability of message, and according to transmittability size, proportionally assignment messages distribute task；Single copy focussing stage refers to when node possesses a copy of some message, allows node that unique message copy is transmitted to transmittability than itself higher middle collection node, using node-node transmission ability as the forwarding of comparison condition control message.This method designs cache management strategy, is to remove redundancy message in time using message acknowledgement mechanism is delivered, and determines the transmission sequence of message in conjunction with message residue life span and reproducible number of copies are message distribution priority.
Description
Technical field
The present invention relates to vehicular ad hoc Routing Protocol vehicular ad hoc networks and opportunistic network technical field, more particularly to
A kind of vehicle-mounted based on node-node transmission ability, which distributes, focuses Routing Protocol method.
Background technique
Vehicular ad hoc network (Vehicular Ad-hoc Network, VANET) is used as current mobile ad-hoc network
One of most promising field, technology development have great importance to building intelligent transportation system.And Routing Protocol is made
For the key technology of network interconnection and data exchange, the performance of entire vehicular ad hoc network is determined to a certain extent.By
Have the characteristics that node motion is fast, change in topology is frequent, end-to-end path not can guarantee in vehicular ad hoc network, causes biography
System self-organizing network Routing Protocol is difficult to play a role in vehicle-mounted scene.And opportunistic network be one kind do not need information source node and
There are complete communication links between destination node, but the opportunity chance createed by node motion, with " storage-carrying-
Forwarding " mechanism realizes the self-organizing network of communication, and " appearance the is held disconnected late " feature having can meet vehicular ad hoc net well
The application demand of network.The In-vehicle networking of intermittence connection can be considered the extension of opportunistic network, traditional opportunistic network message forwarding
Algorithm has important reference value to In-vehicle networking Design of Routing Protocol.
Routing Protocol be opportunistic network research hot issue and the matter of utmost importance that should solve of various networking technologys it
One.Urban environment vehicle of lower night is sparse, and node will find that more suitable next-hop node is very difficult, and VANET at this time can
To regard a kind of special opportunistic network as, the simple Routing Protocol based on topology or based on geographical location is difficult to play work
With.In order to improve the delivery success rate of message, it can yet be regarded as a kind of feasible selection using opportunistic network routing policy, this is needed certainly
Certain interruption and delay can be tolerated by wanting the application on upper layer.
The Typical Representative of the Routing Protocol based on duplication is that Vahdat et al. is proposed in traditional opportunistic network routing
Epidemic agreement.Agreement provides each one message summary vector of node maintenance (Summary Vector, SV), and SV is contained
The information of node storage.When two nodes meet, respective SV is exchanged first, by comparing itself SV and other side
SV does not have and message that other side carries to determine in oneself caching, then sends solicited message to other side, both sides only transmit pair
Just no message.After enough exchanges, the node of each non-orphaned will receive data, and whole process is as infected
Disease or virus diffusion are the same.Epidemic agreement can theoretically maximize delivery success rate, but a large amount of message copy can be made
At competition and congestion.
Whether Prophet agreement determines a node using the transitivity of transmission prediction probability and probability between node
Message copy is forwarded, the interaction between node is divided into prediction probability and updates and two parts of interacting message.Prophet agreement is using general
Rate size reduces the blindness of Epidemic agreement, but there is no the message in stringent limitation network as restrictive condition
Copy amount is easy to produce the key node that over-burden.
In order to reduce a large amount of consumption of Internet resources, Spyropoulos et al. proposes Spray and Wait agreement to limit
Routing cost processed.The agreement is similar with Epidemic in the Spray stage, and message copy is spread in network, but limits
The upper limit of copy amount.Then enter the Wait stage after having existed the copy of specified quantity in network.The Wait stage then not
Message is replicated again, and the quantity of message copy not will increase, but directly submit (Direct by the completion of the node of carrying message copy
Delivery).The a large amount of expense for showing Spray and Wait agreement of testing is put down significantly less than Epidemic agreement
Postpone small, it is high to deliver success rate, is adapted to the network of different scales, is at present by Spray and there are many Routing Protocol
Wait protocol extension.
Although Spray and Wait Routing Protocol is reduced in message process by limiting maximum message number of copies
Expense, but there is also some shortcomingss simultaneously.
In the indiscriminate situation of node state, Spray and Wait agreement is had most fast using two dispersion originating party formulas
Message dissemination speed, if but applying in vehicle-mounted opportunistic network, effective benefit of the shortage to the network information and node-node transmission ability
With, only simply forward messages to the new node to meet, have apparent blindness and randomness.
Spray and Wait carries the node of message by the way of directly delivering when entering loitering phase, although
Which limit the hop counts of message, but have missed the machine for forwarding messages to relay node more suitable than itself
Meeting, leads to the reduction of message dilivery success rate, and message delay increases.
Spray and Wait uses the mechanism of " storage-carrying-forwarding ", but is a lack of suitable cache management plan
Slightly.Either source node or the relay node of carrying message after encountering destination node and submitting message, do not know by other nodes
The message has delivered success, save message in the buffer only TTL expires or cache be filled in the case where
It is abandoned by node.In the case where the limited storage space of node, the effective rate of utilization of caching may be made to reduce, when caching is empty
Between it is insufficient when lose the chance for receiving message.
How on above-mentioned Spray and Wait protocol basis, improves its indifference two dispersion originating party formula, breaks through waiting
Stage can only directly deliver the limitation of message and take more reasonable cache management strategy, become the main points of the protocol extension.
Summary of the invention
For the shortcoming of above-mentioned Spray and Wait Routing Protocol, the present invention is routed in Spray and Wait and is assisted
It proposes a kind of to distribute focusing (Transmission Capability based on vehicle node transmittability on the basis of view
Based Spray and Focus Routing, TC-SaF) Routing Protocol.TC-SaF Routing Protocol is divided into more copies and distributes rank
Section and single copy focussing stage, TC-SaF introduce a transmittability function, comprehensively considered vehicle node movement speed,
Spatial cache and the node change rate that meets, are distributing the stage, disperse to send out compared to Spray and Wait indifference two, this agreement
More copies are distributed for the higher node of transmittability, in focussing stage using vehicle node transmittability as comparison condition control
The forwarding of message processed.TC-SaF Routing Protocol, which additionally uses corresponding cache management strategy, reduces the degree of redundancy of message copy,
Rationally utilize cache resources.
The invention is realized by the following technical scheme, includes the following steps:
A kind of vehicle-mounted based on node-node transmission ability, which distributes, focuses Routing Protocol method, which is characterized in that includes following step
It is rapid:
Step 1: node meets the stage；Each vehicle node safeguards that a history is met node set, new when encountering one
When node, history is added in the ID of the new node and Encounter Time and is met in node set, if two nodes are in a short time again
It is secondary to meet, then Encounter Time is updated, if vehicle node is not met with the node in length at the appointed time, by corresponding record
It is deleted from set；Vehicle node periodically compares the set at current period initial time and current time, calculates the section that meets
The change rate of point；
Step 2: connection establishment stage；As node NiDetermining and another node NjAfter establishing connection, node will have been thrown first
It passs message summary vector DMSV and eap-message digest vector M SV is sent to other side；Node NjReceive NiAfter the DMSV for issuing oneself, root
According to its information update oneself safeguard DMSV, while delete oneself caching in by the message of successful delivery；According to NiIt sends
MSV and oneself MSV do logic and operation, judge which message is node NiCarry and itself is no, NjBy these information
It is encapsulated in Request message with the DMSV of oneself and issues node Ni, Xiang Jiedian NiRequest message is sent；
The step 3:Request Message Processing stage；Node NiAfter receiving Request message, Xiang Jiedian NjRequest is sent one by one
Message, the processing comprising following several situations:
If d) node NjIt is the destination node of message m, node NiTransmit the message to node Nj, then by its from oneself
Caching in delete, while updating DMSV；
If e) node NjIt is not the destination node of message m, while the current number of copies of message m is greater than 1, thens follow the steps
4 distribute the operation in stage；
If f) node NjIt is not the destination node of message m, while message m current copy number is equal to 1, thens follow the steps 5
The operation of focussing stage；
Step 4: message copy distributes the stage；Node NiThe comprehensive transmission ability for calculating oneself and Correspondent Node, further according to
Comprehensive transmission capacity calculation needs the number of copies for distributing and retaining, and message m copy is sent to node Nj, while modifying oneself and taking
The number of copies of the message m of band, according to priority rejoins in caching；
Step 5: message focussing stage；Node NiThe comprehensive transmission ability of oneself and Correspondent Node is calculated, then judges message
Whether forwarding condition meets, if it is satisfied, then to node NjMessage is forwarded, is otherwise not forwarded；
Step 6: the message sink stage；Node NjReceiving node N one by oneiThe message sended over, if the message received
Destination node is itself, then is directly handled message and carry out message dilivery confirmation, no longer put it into caching；Otherwise exist
Congestion detection is executed before placing the message in caching, the processing comprising following two situation:
C) caching is sufficient, node NjTraversal caching calculates the priority of message, and message is inserted into the suitable position in queue
It sets；
D) caching is insufficient, node NjCompare message and caches the priority of tail of the queue message；If tail of the queue message priority is big
In the message m newly to arrive, then message m is directly abandoned；If tail of the queue message priority is lower, tail of the queue message is abandoned, repetition is held
Row b) step executes a) step until caching abundance.
Node change rate is met measuring node liveness, node is reflected and saves around it at a certain time interval
The situation of change of point.Preferably, the node change rate that meets of vehicle node and new node can be calculate by the following formula in step 1
It arrives:
WhereinFor node NiIn T1The node set of meeting at moment,For T2The node set of meeting at moment, with Δ T
=T1-T2As the update cycle.
Preferably, it has delivered message vector DMSV and message summary vector M SV is encapsulated in Request message and is handed over
Mutually, what wherein DMSV saved is the summary info vector for having delivered success message that own node is known, and what MSV was saved is to exist
The summary info vector of message in own node caching.
Preferably, each node introduces a comprehensive transmission energy force function, and node used in step 4 and step 5 is comprehensive
Transmittability is calculated according to the status information of two nodes when meeting, and the comprehensive transmission ability of each node considers following
Factor: relative transport ability value, the Dynamic gene considered for each element；According to the relative transport ability of node and adjustment
The factor can be calculated separately to obtain the comprehensive transmission ability value of two nodes by following two formula:
Wherein ω is Dynamic gene, and U is relative transport ability value.
Preferably, two node N that meetiAnd NjRelative transport capacity calculation consider two nodes velocity magnitude, residue
Cache size and three influence factors of node change rate of meeting, can be calculated node N by following two formulaiAnd NjRelative transport energy
Force value:
Wherein, V is that node travels velocity magnitude, and B is remaining cache size, and H is the node change rate that meets, and α, β and γ
Respectively for node motion speed, remaining cache size and the meet preset weighting coefficient of node change rate and alpha+beta+γ=
1。
Preferably, in calculate node comprehensive transmission ability, introduce a Dynamic gene ω, i.e., consideration cache resources can
With grade, decayed accordingly according to caching available grades to the calculating of transmittability, the calculation of Dynamic gene is as follows:
ω=(1+ λ)-d
Wherein λ is fixed adjusted value, is chosen according to the actual situation, and λ=1 is set in TC-SaF agreement, and d is cache resources
Available grades；
Available grades are divided according to different threshold values in practical application:
| Available grades | Remaining cache range | Caching situation |
| 0 | B≥th2 | Caching is sufficient, can be used normally |
| 1 | th1≤B<th2 | Caching is nervous, should suitably reduce the reception of message |
| 2 | 0<B<th1 | Caching will overflow |
Since the value of caching available grades is non-negative integer, above formula ensure that the value range of Dynamic gene ω is
(0,1]；
Or Dynamic gene obtains according to the following formula:
Wherein λiFor the fixation adjusted value of i-th of factor, diFor the importance rate of corresponding i-th of factor.
Preferably, message copy distributes the stage in step 4, and the number of copies for distributing and retaining can be calculated by following formula:
Li=Lcur-Lj
Wherein LcurFor node NiCurrently hold number of copies, CiFor node NiComprehensive transmission ability value, CjFor node NjIt is comprehensive to pass
Delivery of energy force value, LiFor node NiRetain number of copies, LjNode N is given to distributejNumber of copies.
Preferably, the message of step 5 forwards condition by the driving direction of two node comprehensive transmission abilities and two vehicle nodes
Two factors determine, calculate two node NiAnd NjDriving direction can be obtained by following formula:
Wherein, (xi,yi) and (xj,yj) it is respectively coordinate of the velocity vector of two nodes in X-axis and Y-axis, θi、θjPoint
It Biao Shi not node Ni, node NjDriving direction, and the angle φ that meets of two nodes can be obtainedi,j:
The Rule of judgment whether forwarded such as following formula:
(φi,j< pi/2) ∩ (Cj> Ci+Cth)
If conditions above is very, to forward；Wherein,, CiFor node NiComprehensive transmission ability value, CjFor node Nj's
Integration capability transmission value, CthIt is preset threshold value, it is therefore an objective to improve forwarding condition.
Preferably, the message dilivery confirmation of step 6 destination node uses active message dilivery affirmation mechanism, i.e., actively divides
Send out ACK information；Each node maintenance one delivered success message vector DMSV, whenever having with this node node as a purpose
Message dilivery success after, added into the table and delivered successful message id, when two nodes meet in addition to send Hello and
Outside Echo message, it is also necessary to carry out the interaction of DMSV；Node is after the DMSV for obtaining other side, according to information wherein included to certainly
Oneself is updated the success message record sheet of delivery of maintenance, at the same time, enables in the caching of oneself that there are the message of identical ID
Then it is deleted.
Preferably, the cache management of each node is determined by message priority distribution mechanism；Message m in caching has currently
Life span TTLcurWith initial life span TTLinit, then having LcurThe message m of a copy cannot be by the general of successful delivery
Rate can indicate are as follows:
The calculation method for defining the priority level of message m is as follows:
In the mechanism, the current life span TTL of messagecurIt is longer, reproducible number of copies LcurIt is more, this probability value
Higher, node preferentially will send and cache the message.
Compared with prior art, advantages of the present invention is as follows:
(1) more copies that the present invention describes distribute the stage and single copy focusing forwarding stage combines single copy and more copies
Two kinds of strategies can regard a kind of tradeoff (Trade-off) in network overhead and aspect of performance as.The present invention uses for reference
The thought of Spray and Wait agreement, by the reproducible message copy number that setting is fixed, so that message will not be unlimitedly
It floods, that is, occurs serious congestion phenomenon when improving delivery success rate, and node being avoided to increase.
(2) copy that the present invention describes distributes the transmittability that node is considered with copy forwarding, and selection has compared with multi-pass
The node of letter chance and spatial cache abundance distributes task to undertake more duplication, overcomes the blindness of Spray and Wait
Property, the balanced load of node is unlikely to message copy is caused to distribute between the poor node of transmittability too quickly to finish, make
It obtains message dissemination not enough abundance and reduces and deliver success rate and increase time delay.The focussing stage based on transmittability can make simultaneously
The single copy of message is transferred to the higher node of ability from the poor node of ability, facilitates the life span for extending message.
(3) cache management strategy that the present invention describes is based on message priority setting mechanism.Using life span and can answer
Number of copies processed calculates message priority, is reasonably dispatched to message, abandons the expired message low with priority, avoids out
Existing message does not spread but the phenomenon that can not obtaining resource sufficiently.
(4) Spray and Wait is compared, the practical vehicular ad hoc network of vehicle node differentiation is more suitable for.
Detailed description of the invention
Fig. 1 is agreement flow chart of the present invention.
Fig. 2 is cache management flow chart of the present invention.
Fig. 3 is buffered message queue figure.
Specific embodiment
The attached figures are only used for illustrative purposes and cannot be understood as limitating the patent, below with reference to attached drawing to the present invention
It is further described.
A kind of vehicle-mounted based on node-node transmission ability, which distributes, focuses Routing Protocol method, comprising the following steps:
Step 1: each vehicle node safeguards that a history is met node set, when encountering a new node, the node
ID and Encounter Time be added set in, if two nodes meet again in a short time, Encounter Time is updated, if when long
Between do not meet with the node, then corresponding record is deleted from set.Node periodically compare current period initial time with
The set at current time calculates the change rate for the node that meets.In addition, each node simultaneously record itself travel speed size and
The information such as remaining cache size.
Step 2: as node NiDetermining and another node NjAfter establishing connection, node will deliver first message summary to
Amount DMSV and eap-message digest vector M SV is sent to other side.
Step 3: node NjReceive NiAfter the DMSV for issuing oneself, according to the throwing of the information update in DMSV oneself maintenance
Message Record table is passed, while deleting the message for being delivered successfully destination node in oneself caching；According to NiThe MSV of transmission
Logic and operation is done with the MSV of oneself, judges which message is node NiCarry and itself is no, NjBy these information and certainly
Oneself DMSV, which is encapsulated in Request message, issues node Ni, Xiang Jiedian NiRequest message is sent.
Step 4: node NiAfter receiving Request message, Xiang Jiedian NjThe message of request is sent one by one, comprising following several
The processing of situation:
If a) NjIt is the destination node of message m, NiTransmit the message to Nj, then it will be deleted in its caching from oneself,
DMSV is updated simultaneously；
If b) NjIt is not the destination node of message m, while the current number of copies of message m is greater than 1, then executes and distribute the stage
Operation, calculate the comprehensive transmission ability of oneself and Correspondent Node, further according to comprehensive transmission ability value calculate need distribute and protect
Message m copy is sent to node N by the number of copies stayedj, while the number of copies of the message m of oneself carrying is modified, according to priority weigh
It is new to be added in caching；
If c) NjIt is not the destination node of message m, while message m current copy number is equal to 1, then executes focussing stage
Operation, calculates the comprehensive transmission ability of oneself and Correspondent Node, then judges that can message focus forwarding condition and meet, if full
Foot, then to NjMessage is forwarded, is otherwise not forwarded；
Step 5: node NjN is received one by oneiThe message sended over is executed before each message to be put into caching and is gathered around
Plug detection, the processing comprising following two situation:
A) caching is sufficient, node NjTraversal caching, the priority of message is calculated according to message priority mechanism, and by message
The suitable position being inserted into queue.
B) caching is insufficient, node NjCompare message and caches the priority of tail of the queue message.If tail of the queue message priority is big
In the message m newly to arrive, then message m is directly abandoned；If tail of the queue message priority is lower, tail of the queue message is abandoned, repetition is held
Row b) step executes a) step until caching abundance.
Step 6: node NjAfter receiving using oneself as the message of purpose node, DMSV is updated.
Step 7: node NiAnd NjThe transmission of message is completed, respective waiting is met next time with other nodes.Invention has
Benefit
TC-SaF agreement proposed by the present invention point is utilized retrievable node related information and has fully considered resource
Restricted gender makes message copy duplication in a network and forwarding more targeted by comprehensive transmission ability, deliver at
Power and average delay aspect of delivering achieve certain improvement.It is preferably solved using active message dilivery affirmation mechanism
Other copies of message are still in the problem of other nodes of network after message of having determined successful delivery, use message priority dispenser
The cache management strategy of system controls the problem of network congestion well, and preferentially distributes delivery to a certain degree to prioritized messages
On improve the success rate of message dilivery.
Claims (8)
1. a kind of vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method, which is characterized in that comprise the steps of:
Step 1: node meets the stage；Each vehicle node safeguards that a history is met node set, when encountering a new node
When, history is added in the ID of the new node and Encounter Time and is met in node set, if two nodes phase again in a short time
It meets, then updates Encounter Time, if vehicle node is not met with new node in length at the appointed time, by corresponding record from collection
It is deleted in conjunction；Vehicle node periodically compares the set at current period initial time and current time, calculates the node that meets
Change rate；
Step 2: connection establishment stage；As node NiDetermining and another node NjAfter establishing connection, node will have been delivered first to disappear
Breath summary vector DMSV and eap-message digest vector M SV is sent to other side；Node NjReceive NiAfter the DMSV for issuing oneself, according to it
Information update oneself maintenance DMSV, while delete oneself caching in by the message of successful delivery；According to NiThe MSV of transmission
Logic and operation is done with the MSV of oneself, judges which message is node NiCarry and itself is no, NjBy these information and certainly
Oneself DMSV, which is encapsulated in Request message, issues node Ni, Xiang Jiedian NiRequest message is sent；
The step 3:Request Message Processing stage；Node NiAfter receiving Request message, Xiang Jiedian NjDisappearing for request is sent one by one
Breath, the processing comprising following several situations:
If a) node NjIt is the destination node of message m, node NiTransmit the message to node Nj, then by its delaying from oneself
Middle deletion is deposited, while updating DMSV；
If b) node NjIt is not the destination node of message m, while the current number of copies of message m is greater than 1, thens follow the steps 4 and distributes
The operation in stage；
If c) node NjIt is not the destination node of message m, while message m current copy number is equal to 1, thens follow the steps 5 focusing ranks
The operation of section；
Step 4: message copy distributes the stage；Node NiThe comprehensive transmission ability for calculating oneself and Correspondent Node is passed further according to comprehensive
Movement Capabilities calculate the number of copies for needing to distribute and retain, and message m copy is sent to node Nj, while modifying disappearing for oneself carrying
The number of copies for ceasing m, according to priority rejoins in caching；
Step 5: message focussing stage；Node NiThe comprehensive transmission ability of oneself and Correspondent Node is calculated, then judges that message forwards item
Whether part meets, if it is satisfied, then to node NjMessage is forwarded, is otherwise not forwarded；
Each node introduces a comprehensive transmission energy force function, and node comprehensive transmission ability used in step 4 and step 5 is root
It is calculated according to the status information of two nodes when meeting, the comprehensive transmission ability of each node considers following factor: opposite to pass
Delivery of energy force value, the Dynamic gene considered for each element；It, can be under according to the relative transport ability and Dynamic gene of node
Two formula of face calculates separately to obtain the comprehensive transmission ability value of two nodes:
Wherein ω is Dynamic gene, and U is relative transport ability value；
Two node N that meetiAnd NjRelative transport capacity calculation consider the velocity magnitudes of two nodes, remaining cache size and
It meets three influence factors of node change rate, node N can be calculated by following two formulaiAnd NjRelative transport ability value:
Wherein, V is that node travels velocity magnitude, and B is remaining cache size, and H is the node change rate that meets, and α, β and γ distinguish
For for node motion speed, remaining cache size and the meet preset weighting coefficient of node change rate and alpha+beta+γ=1；
Step 6: the message sink stage；Node NjReceiving node N one by oneiThe message sended over, if the purpose of the message received
Node is itself, then is directly handled message and carry out message dilivery confirmation, no longer put it into caching；Otherwise will disappear
Breath executes congestion detection before being put into caching, the processing comprising following two situation:
A) caching is sufficient, node NjTraversal caching calculates the priority of message, and message is inserted into the suitable position in queue；
B) caching is insufficient, node NjCompare message and caches the priority of tail of the queue message；It is newly arrived if tail of the queue message priority is greater than
The message m come then directly abandons message m；If tail of the queue message priority is lower, tail of the queue message is abandoned, repeats b) step
It is rapid sufficient up to caching, execute a) step.
2. vehicle-mounted distribute according to claim 1 based on node-node transmission ability focuses Routing Protocol method, feature exists
In the node change rate that meets of vehicle node and new node can be calculate by the following formula to obtain in step 1:
WhereinFor node NiIn T1The node set of meeting at moment,For T2The node set of meeting at moment, with Δ T=T1-
T2As the update cycle.
3. vehicle-mounted distribute according to claim 1 based on node-node transmission ability focuses Routing Protocol method, feature exists
In having delivered message vector DMSV and message summary vector M SV be encapsulated in Request message and interact, wherein DMSV
What is saved is the summary info vector for having delivered success message that own node is known, what MSV was saved is that there are own nodes to delay
The summary info vector of message in depositing.
4. vehicle-mounted distribute according to claim 1 based on node-node transmission ability focuses Routing Protocol method, feature exists
In, in calculate node comprehensive transmission ability, a Dynamic gene ω is introduced, that is, considers the available grades of cache resources, according to
Caching available grades decay accordingly to the calculating of transmittability, and the calculation of Dynamic gene is as follows:
ω=(1+ λ)-d
Wherein λ is fixed adjusted value, is chosen according to the actual situation, and d is the available grades of cache resources；
Due to caching available grades value be non-negative integer, above formula ensure that Dynamic gene ω value range be (0,1]；
Or Dynamic gene obtains according to the following formula:
Wherein λiFor the fixation adjusted value of i-th of factor, diFor the importance rate of corresponding i-th of factor, N is any non-negative whole
Several factors.
5. vehicle-mounted distribute according to claim 1 based on node-node transmission ability focuses Routing Protocol method, feature exists
In message copy distributes the stage in step 4, and the number of copies for distributing and retaining can be calculated by following formula:
Li=Lcur-Lj
Wherein LcurFor node NiCurrently hold message copy number, LiFor node NiRetain number of copies, LjNode N is given to distributejPair
This number, CjFor node NjComprehensive transmission ability value, CiFor node NiComprehensive transmission ability value.
6. vehicle-mounted distribute according to claim 1 based on node-node transmission ability focuses Routing Protocol method, feature exists
In, the message forwarding condition of step 5 is determined by two factors of driving direction of two node comprehensive transmission abilities and two vehicle nodes,
Calculate two node NiAnd NjDriving direction can be obtained by following formula:
Wherein, θi、θjRespectively indicate the driving direction direction of two nodes, (xi,yi) and (xj,yj) be respectively two nodes speed
Coordinate of the vector in X-axis and Y-axis is spent, and the angle φ that meets of two nodes can be obtainedi,j:
The Rule of judgment whether forwarded such as following formula:
(φi,j< pi/2) ∩ (Cj> Ci+Cth)
If conditions above is very, to forward；Wherein, CthIt is preset threshold value, it is therefore an objective to improve forwarding condition, Cj、CiRespectively
Indicate node NiAnd NjComprehensive transmission ability value.
7. vehicle-mounted distribute according to claim 1 based on node-node transmission ability focuses Routing Protocol method, feature exists
In the message dilivery confirmation of step 6 destination node uses active message dilivery affirmation mechanism, i.e., actively distributes ACK information；Often
A node maintenance one has delivered success message vector DMSV, whenever have with this node as a purpose node message dilivery success
Afterwards, successful message id has been delivered to having delivered to add in success message record sheet, in addition to sending when two nodes meet
Outside Hello and Echo message, it is also necessary to carry out the interaction of DMSV；Node is after the DMSV for obtaining other side, according to wherein included
The success message record sheet of delivery that information safeguards oneself is updated, at the same time, if there are identical in the caching of oneself
The message of ID is then deleted.
8. vehicle-mounted distribute according to claim 1 based on node-node transmission ability focuses Routing Protocol method, feature exists
In the cache management of each node is determined by message priority distribution mechanism；Message m in caching has current life span
TTLcurWith initial life span TTLinit, then having LcurThe message m of a copy cannot can be with table by the probability of successful delivery
It is shown as:
The calculation method for defining the priority level of message m is as follows:
In the mechanism, the current life span TTL of messagecurIt is longer, reproducible number of copies LcurMore, this probability value is got over
Height, node preferentially will send and cache the message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610641348.8A CN106209627B (en) | 2016-08-05 | 2016-08-05 | Vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610641348.8A CN106209627B (en) | 2016-08-05 | 2016-08-05 | Vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106209627A CN106209627A (en) | 2016-12-07 |
| CN106209627B true CN106209627B (en) | 2019-06-14 |
Family
ID=57513797
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610641348.8A Expired - Fee Related CN106209627B (en) | 2016-08-05 | 2016-08-05 | Vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106209627B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110650460B (en) * | 2019-09-24 | 2023-02-07 | 徐州工业职业技术学院 | Vehicle-mounted opportunity network file scheduling and data transmission method |
| CN111478859B (en) * | 2020-04-03 | 2022-10-18 | 北京大学深圳研究生院 | Message transmission method, node and storage medium in DTN (delay tolerant network) |
| CN111970731B (en) * | 2020-08-27 | 2022-09-16 | 华中师范大学 | Spray and Wait mobile opportunistic network routing method based on node reputation |
| CN112398737B (en) * | 2020-10-30 | 2022-05-17 | 中电海康集团有限公司 | Opportunistic routing method and device based on dynamic copy number and transmission priority |
| CN113225260B (en) * | 2021-04-25 | 2022-11-18 | 湖南大学 | Mixed clustering opportunistic routing implementation method based on machine learning |
| CN113709036B (en) * | 2021-08-05 | 2022-10-11 | 华中师范大学 | Route improvement method of Spray and Wait based on node history encounter information |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103763193A (en) * | 2014-02-21 | 2014-04-30 | 重庆邮电大学 | Multi-replication routing method for selecting eruption range in vehicular vdhoc networks |
| CN104168189A (en) * | 2014-08-26 | 2014-11-26 | 哈尔滨工程大学 | Spray and wait routing method based on node attribute model in DTN |
-
2016
- 2016-08-05 CN CN201610641348.8A patent/CN106209627B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103763193A (en) * | 2014-02-21 | 2014-04-30 | 重庆邮电大学 | Multi-replication routing method for selecting eruption range in vehicular vdhoc networks |
| CN104168189A (en) * | 2014-08-26 | 2014-11-26 | 哈尔滨工程大学 | Spray and wait routing method based on node attribute model in DTN |
Non-Patent Citations (2)
| Title |
|---|
| 《DTN中基于节点相遇规律的路由与拥塞控制策略研究》;丁安学;《中国优秀硕士学位论文全文数据库信息科技集》;20151015;全文 |
| 《Spray and Focus:efficient mobility-assisted routing for heterogeneous and correlated mobility》;T.Spyropoulos;《IEEE》;20071230;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106209627A (en) | 2016-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106209627B (en) | Vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method | |
| Ren et al. | Traffic-aware dynamic routing to alleviate congestion in wireless sensor networks | |
| Pan et al. | A comprehensive-integrated buffer management strategy for opportunistic networks | |
| CN101222438B (en) | Data transmission method in opportunity network | |
| CN103561446B (en) | Awareness routing method in vehicle-mounted self-organizing network based on road topology | |
| CN108449270A (en) | Buffer memory management method priority-based in opportunistic network | |
| CN102355406A (en) | Self-adaption data distributing method based on node density distribution in vehicle-mounted ad hoc network | |
| CN103634232A (en) | Vehicle message routing method based on delay tolerant network technology | |
| Izumikawa et al. | RoCNet: Spatial mobile data offload with user-behavior prediction through delay tolerant networks | |
| Radenkovic et al. | Framework for utility driven congestion control in delay tolerant opportunistic networks | |
| CN110809302A (en) | Self-adaptive multi-injection waiting routing method based on social circle | |
| CN106506373A (en) | A kind of delay-tolerant network route and cache management strategy based on non-cooperation game theory | |
| Meneguette et al. | A novel self-adaptive content delivery protocol for vehicular networks | |
| CN105407048A (en) | Delay tolerant network node cache management method facing epidemic and probabilistic hybrid routing | |
| Rashid et al. | Dynamic Prediction based Multi Queue (DPMQ) drop policy for probabilistic routing protocols of delay tolerant network | |
| CN107864092A (en) | A kind of cloud content distribution method, device based on multicasting technology | |
| Pan et al. | Transmission of multimedia contents in opportunistic networks with social selfish nodes | |
| CN110248392A (en) | Chance retransmission method based on node efficiency in a kind of car networking | |
| Gui et al. | Data scheduling for multi-item requests in vehicle-roadside data access with motion prediction based workload transfer | |
| Shi | Semi-Probabilistic Routing in Intermittently Connected Mobile Ad Hoc Networks. | |
| CN103312619B (en) | A kind of deletion simultaneously and the jamming control method of Transfer Message | |
| WO2020186655A1 (en) | Content forwarding node selection method in vehicle-mounted ad hoc network based on service type | |
| CN105141544B (en) | A kind of data distributing method in car networking | |
| CN102497325B (en) | DTN routing method based on reliable information distribution | |
| CN105072046A (en) | Delay tolerant network congestion prevention method based on data concurrence and forwarding by token control node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into 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: 20190614 |