CN104410999B - Method for routing, equipment and the system of time delay tolerant network - Google Patents

Method for routing, equipment and the system of time delay tolerant network Download PDF

Info

Publication number
CN104410999B
CN104410999B CN201410675883.6A CN201410675883A CN104410999B CN 104410999 B CN104410999 B CN 104410999B CN 201410675883 A CN201410675883 A CN 201410675883A CN 104410999 B CN104410999 B CN 104410999B
Authority
CN
China
Prior art keywords
node
message
neighbors
social characteristics
run
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.)
Active
Application number
CN201410675883.6A
Other languages
Chinese (zh)
Other versions
CN104410999A (en
Inventor
邢建兵
王明会
严斌峰
刘敏
王煜炜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN201410675883.6A priority Critical patent/CN104410999B/en
Publication of CN104410999A publication Critical patent/CN104410999A/en
Application granted granted Critical
Publication of CN104410999B publication Critical patent/CN104410999B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

Abstract

The present invention provides a kind of method for routing, equipment and the system of time delay tolerant network.This method includes：The node for carrying message determines the node type of itself according to the source of the message；If the node for carrying message determines that the node type of itself is source node, the message is transmitted to the neighbors run into；If the node for carrying message determines that the node type of itself is intermediate node, then the message is transmitted to run into addition to the message is forwarded to the neighbors of itself, and other neighbors bigger than the Social Characteristics similarity of itself and destination node with the Social Characteristics similarity of destination node.Method for routing, equipment and the system of time delay tolerant network provided by the invention, progressively forward the message to the node similar to destination node, destination node is posted messages to faster speed so as to realize, improves router efficiency.

Description

Method for routing, equipment and the system of time delay tolerant network
Technical field
The present invention relates to communication technical field, more particularly to a kind of method for routing, equipment and the system of time delay tolerant network.
Background technology
In recent years, wireless technology development and application it is more and swifter and more violent, the quantity of mobile device turns into more than fixed host computer A kind of trend, substantial amounts of mobile device constitute a kind of new application scenarios of wireless network, i.e. time delay tolerant network (Delay Tolerant Network, abbreviation DTN).And with the mobile communication equipments such as smart mobile phone, PAD turn into people life in must Estovers, the DTN using personal mobile device as node more receives the control of " people ", and people has a social nature, each People is in continuous movement and contacted according to oneself hobby and demand, if two people have phase in society For other people more identical points, then, the contact between them can more frequent, the net that this node has a social nature Network is social time delay tolerant network.DTN is route, i.e. the source node of message is carried in DTN wirelessly, such as bluetooth, red Outside line, WIFI etc., other nodes run into, i.e. intermediate node are forwarded messages to, the node is wirelessly by the message Continue to be transmitted to other nodes run into, so go on until forwarding that message to destination node.
Existing DTN method for routing improves the efficiency of route by capturing the historical movement path of each node, and for For social time delay tolerant network, because its network size is big, number of nodes is more, the historical movement path for capturing each node is suitable Difficulty, therefore router efficiency is relatively low.
The content of the invention
The present invention provides a kind of method for routing, equipment and the system of time delay tolerant network, to solve to deposit in the prior art Router efficiency it is relatively low the problem of.
The invention provides a kind of method for routing of time delay tolerant network, including：
The node for carrying message determines the node type of itself according to the source of the message；
If the node for carrying message determines that the node type of itself is source node, the message is transmitted to and run into Neighbors；
If the node for carrying message determines that the node type of itself is intermediate node, the message is transmitted to chance Arrive in addition to the message is forwarded to the neighbors of itself, and with the Social Characteristics similarity of destination node than itself and mesh Node bigger other neighbors of Social Characteristics similarity.
The invention provides a kind of node device, including：
Determining module, the source of the message for being carried according to the node device determine the node class of the node device Type；
First forwarding module, if the node type for determining the node device for the determining module saves for source Point, then the message is transmitted to the neighbors run into；
Second forwarding module, if determining that the node type of the node device is middle node for the determining module Point, then the message is transmitted to run into addition to the neighbors of the message to the node device is forwarded, and and mesh Node Social Characteristics similarity it is bigger than the Social Characteristics similarity of the node device and destination node other neighbour section Point.
The invention provides a kind of route system of time delay tolerant network, including source node, destination node and multiple centres Node；The source node and the intermediate node are node device as described above.
Method for routing, equipment and the system of time delay tolerant network provided by the invention, source node, which forwards messages to, to be run into Neighbors, the neighbors by with Social Characteristics similarity of the Social Characteristics similarity of destination node than itself and destination node Bigger node as forwarding message next node, i.e., progressively forward the message to the node similar to destination node, Destination node is posted messages to faster speed so as to realize, improves router efficiency.
Brief description of the drawings
Fig. 1 is the schematic flow sheet of method for routing one embodiment of time delay tolerant network provided by the invention；
Fig. 2 is the schematic flow sheet of another embodiment of the method for routing of time delay tolerant network provided by the invention；
Node Social Characteristics schematic diagram when Fig. 3 is m=3 in embodiment illustrated in fig. 2；
Fig. 4 is the structural representation of node device one embodiment provided by the invention；
Fig. 5 is the structural representation of route system one embodiment of time delay tolerant network provided by the invention.
Embodiment
Below by specific embodiment and accompanying drawing, technical scheme is described in further detail.
Fig. 1 is the schematic flow sheet of method for routing one embodiment of time delay tolerant network provided by the invention.Such as Fig. 1 institutes Show, this method can specifically include：
S101, the node for carrying message determine the node type of itself according to the source of message.
Specifically, if the node for carrying message judges the message caused by itself, it is determined that the node type of itself is Source node.If the node for carrying message judges that the message is transmitted to itself for other nodes, it is determined that the node type of itself For intermediate node.
S102, if the node for carrying message determines that the node type of itself is source node, forward messages to what is run into Neighbors.
Specifically, if the node that message is carried in step S101 determines that the node type of itself is source node, the carrying The node of message forwards that message to the neighbors run into.Neighbors i.e. from present node only have a Social Characteristics it is different its The node of his Social Characteristics all same.
S103, if the node for carrying message determines that the node type of itself is intermediate node, forward messages to and run into In addition to the neighbors for forwarding the message to itself, and with the Social Characteristics similarity of destination node than itself and destination node Bigger other neighbors of Social Characteristics similarity.
Specifically, if the node that message is carried in step S101 determines that the node type of itself is intermediate node, this is taken Node with message is used as the next node of forwarding message by the characteristic matching selection neighbors similar to destination node.Tool Body, if the neighbors run into is to forward the message to the neighbors of itself, message is not forwarded, wait runs into other neighbour's sections Point；If the Social Characteristics similarity of the neighbors run into and destination node is equal to or less than itself society with destination node Characteristic similarity, then do not forward message, and wait runs into other neighbors；If the society of the neighbors run into and destination node is special Property similarity be more than itself Social Characteristics similarity with destination node, then forward the message to the neighbors run into.
The method for routing for the time delay tolerant network that the present embodiment provides, source node forward messages to the neighbors run into, The neighbors is by the section bigger than the Social Characteristics similarity of itself and destination node with the Social Characteristics similarity of destination node Point as forward message next node, i.e., progressively forward the message to the node similar to destination node, so as to realize Destination node is posted messages to faster speed, improves router efficiency.
Fig. 2 is the schematic flow sheet of another embodiment of the method for routing of time delay tolerant network provided by the invention.Such as Fig. 2 It is shown, the present embodiment on the basis of embodiment illustrated in fig. 1, further describe source node and intermediate node how to select it is next The process of node, this method can specifically include：
S201, the node for carrying message determine the node type of itself according to the source of message.
Specifically, if the node for carrying message judges the message caused by itself, it is determined that the node type of itself is Source node, and perform step S202.If the node for carrying message judges that the message is transmitted to itself for neighbors, it is determined that from The node type of body is intermediate node, and performs step S207.
S202, if the node for carrying message determines that the node type of itself is source node, the neighbors for judging to run into Whether Social Characteristics and the Social Characteristics of destination node are consistent.
Specifically, if the node that message is carried in step S201 determines that the node type of itself is source node, the carrying The node (i.e. source node) of message judge the neighbors run into m Social Characteristics and destination node m Social Characteristics whether It is completely the same.If consistent, step S203 is performed；If inconsistent, step S204 is performed.Wherein, the selection of m Social Characteristics Specifically the m Social Characteristics that wherein entropy is maximum can be taken as each node by calculating the entropys of each node whole Social Characteristics Social Characteristics.For example, there is n node (corresponding n people), each node has M kinds characteristic (such as nationality, mother tongue etc.), uses respectively F1、F2、……、FMRepresent, E (Fj) (j=1,2 ... ..., M) be characteristic FjEntropy, Pj() is characteristic FjProbability density function. The entropy of each characteristic is calculated according to equation below：
According to result of calculation, the maximum m (m of entropy are selected<M) individual Social Characteristics.
S203, the node for carrying message forward messages to the neighbors run into.
Specifically, if m Social Characteristics of the neighbors run into and m Social Characteristics of destination node are completely the same, The node (i.e. source node) of the carrying message thinks the neighbors i.e. destination node that this runs into, so as to directly turn the message of carrying Issue the neighbors run into.
S204, the node for carrying message judge itself Social Characteristics F different from the neighbors run intorWhether be itself with One in k different Social Characteristics of destination node.
Specifically, assume the carrying message node (i.e. source node) and the r of the neighbors run into (r is 1 between m Natural number) individual Social Characteristics FrDifference, the node (i.e. source node) and destination node of the carrying message have k (k are 1 between m Natural number) individual different Social Characteristics, such as the 1-k Social Characteristics, then this k different Social Characteristics form set d ={ F1, F2... ..., Fk}.If m Social Characteristics of the neighbors run into and the m Social Characteristics incomplete one of destination node Cause, i.e., at least 1 Social Characteristics is inconsistent, then the adjacent section that the node (i.e. source node) of the carrying message judges itself and run into The different Social Characteristics F of pointrWhether it is one in itself and destination node k different Social Characteristics, that is, judges FrWhether belong to In set d={ F1, F2... ..., Fk}.If so, then perform step S205；If it is not, then perform step S206.
S205, the node of message is carried by sequence Cr, message pass-through mode mod=0 and message be transmitted to the adjacent section run into Point.
If specifically, Fr∈ d={ F1, F2... ..., Fk, then the node (i.e. source node) of the carrying message is by sequence Cr, disappear Breath pass-through mode mod=0 and the message carried are transmitted to the neighbors run into.Wherein, sequence CrIt is defined as follows：As r=k, Cr =Ck=<F1, F2... ..., Fk>；As r ≠ k, Cr=<Fr+1, Fr+2... ..., Fk, F1, F2... ..., Fr>.Message pass-through mode Mod=0, representative currently forward message in a manner of short path.
S206, the node of message is carried by sequence Ck, message pass-through mode mod=1 and message be transmitted to the adjacent section run into Point.
If specifically, FrIt is not belonging to d={ F1, F2... ..., Fk, then the node (i.e. source node) of the carrying message is by sequence Ck, message pass-through mode mod=1 and carrying message be transmitted to the neighbors run into.Wherein, Ck=<F1, F2... ..., Fk>.Disappear Pass-through mode mod=1 is ceased, is represented current with long path fashion forwarding message.
S207, if the node for carrying message determines that the node type of itself is intermediate node, judge the neighbors run into Whether it is to forward the message to the neighbors of itself.
Specifically, if the node that message is carried in step S201 determines that the node type of itself is intermediate node, this is taken Node (i.e. intermediate node) with message judges the neighbors run into and neighbors (the i.e. upper section for forwarding the message to itself Point) whether it is same node.If so, not forwarding message then, wait runs into other neighbors；If it is not, then perform step S208.
S208, carry message node judge the Social Characteristics of the neighbors and destination node run into Social Characteristics whether Unanimously.
Specifically, if the neighbors run into is different nodes from forwarding the message to the node of itself, the carrying message Node (i.e. intermediate node) judge whether m Social Characteristics of m Social Characteristics of the neighbors and destination node run into complete It is complete consistent.If consistent, step S209 is performed；If inconsistent, step S210 is performed.
S209, the node for carrying message forward messages to the neighbors run into.
Specifically, if m Social Characteristics of the neighbors run into and m Social Characteristics of destination node are completely the same, The node (i.e. intermediate node) of the carrying message thinks the neighbors i.e. destination node that this runs into, so as to directly by the message of carrying It is transmitted to the neighbors run into.
S210, the node for carrying message judge whether the message pass-through mode mod that receives is equal to 0.
Specifically, if m Social Characteristics of the neighbors run into and m Social Characteristics of destination node are not quite identical, I.e. at least 1 Social Characteristics is inconsistent, then the node (i.e. intermediate node) of the carrying message judges the message itself received Whether pass-through mode mod is equal to 0.If so, then perform step S211；If it is not, then perform step S213.
S211, the node for carrying message judge itself Social Characteristics F different from the neighbors run intosWhether it is to receive Sequence CtIn first element.
Specifically, assume the node (i.e. intermediate node) of the carrying message and the neighbors run into s (s be 1 to m it Between natural number) individual Social Characteristics FsDifference, what the node (i.e. intermediate node) of the carrying message received from a upper node Sequence is Ct(t is 1 to the natural number between k).If the message pass-through mode mod=0 itself received, the carrying message Node (i.e. intermediate node) judges itself Social Characteristics F different from the neighbors run intosWhether it is the sequence C receivedtIn First element.If so, then perform step S212；If it is not, not forwarding message then, wait runs into other neighbors.
S212, the node of message is carried by sequence Ct-s, message pass-through mode mod=0 and carrying message be transmitted to and run into Neighbors.
If specifically, itself Social Characteristics F different from the neighbors run intosFor the sequence C receivedtIn first Element, then the node (i.e. intermediate node) of the carrying message is by sequence Ct-s, message pass-through mode mod=0 and carrying message turn Issue the neighbors run into.Wherein, Ct-sFor from sequence CtMiddle deletion Social Characteristics FsSequence afterwards, i.e. Ct-s=Ct-Fs。
S213, the node for carrying message judge itself Social Characteristics F different from the neighbors run intosWhether it is to receive Sequence CtIn an element.
If specifically, message pass-through mode mod ≠ 0 itself received, i.e. mod=1, then the carrying message node (i.e. intermediate node) judges itself Social Characteristics F different from the neighbors run intosWhether it is the sequence C receivedtIn one Element.If so, then perform step S214；If it is not, not forwarding message then, wait runs into other neighbors.
S214, the node of message is carried by sequence Ct-s, message pass-through mode mod=1 and carrying message be transmitted to and run into Neighbors.
If specifically, itself Social Characteristics F different from the neighbors run intosFor the sequence C receivedtIn a member Element, then the node (i.e. intermediate node) of the carrying message is by sequence Ct-s, message pass-through mode mod=1 and carrying message forwarding To the neighbors run into.
The method for routing of the time delay tolerant network of the present embodiment is described in detail by taking m=3 as an example below：
Node Social Characteristics schematic diagram when Fig. 3 is m=3 in embodiment illustrated in fig. 2.As shown in Figure 3, it is assumed that time delay is tolerated 8 node (G in network be present0、G1、……、G7), the corresponding 3 Social Characteristics (F of each node1、F2And F3), G0Corresponding (0,0, 0), G1Corresponding (0,0,1), G2Corresponding (0,1,0), G3Corresponding (0,1,1), G4Corresponding (1,0,0), G5Corresponding (1,0,1), G6It is corresponding (1,1,0), G7Corresponding (1,1,1), 3 Social Characteristics of each node constitute a 3-dimensional cube.
Assuming that G0(0,0,0) it is source node, G6(1,1,0) it is purpose node, due to G0With G6The 1st characteristic F1With the 2nd Individual characteristic F2Difference, the 3rd characteristic F3It is identical, therefore set d={ F be present1, F2, k=2, C1=<F2, F1>, C2=<F2, F1 >。
Source node G0Message is transmitted to destination node G by (0,0,0) by intermediate node6The process of (1,1,0) is as follows：
From G0(0,0,0) sets out, due to G0(0,0,0) it is source node, therefore performs above-mentioned steps S202-S206.
Assuming that G0(0,0,0) at a time encounters neighbors G4(1,0,0), due to G4(1,0,0) and destination node G6 3 Social Characteristics of (1,1,0) are not quite identical, therefore G0(0,0,0) judges itself and G4(1,0,0) different Social Characteristics Fr=F1Whether it is G0(0,0,0) and G6The individual different Social Characteristics (F of (1,1,0) k (k=2)1And F2) in one, that is, judge F1Whether set d={ F is belonged to1, F2, due to F1∈ d={ F1, F2, therefore G0By sequence Cr=C1=<F2, F1>, message forwarding Mode mod=0 and the message carried are transmitted to G4。
Assuming that G0(0,0,0) encounters neighbors G at another moment2(0,1,0), due to G2(0,1,0) and destination node G6 3 Social Characteristics of (1,1,0) are not quite identical, therefore G0(0,0,0) judges itself and G2(0,1,0) different Social Characteristics Fr=F2Whether it is G0(0,0,0) and G6The individual different Social Characteristics (F of (1,1,0) k (k=2)1And F2) in one, that is, judge F2Whether set d={ F is belonged to1, F2, due to F2∈ d={ F1, F2, therefore G0By sequence Cr=C2=<F1, F2>, message forwarding Mode mod=0 and the message carried are transmitted to G2。
Assuming that G0(0,0,0) encounters neighbors G at another moment1(0,0,1), due to G1(0,0,1) and destination node G6 3 Social Characteristics of (1,1,0) are not quite identical, therefore G0(0,0,0) judges itself and G1(0,0,1) different Social Characteristics Fr=F3Whether it is G0(0,0,0) and G6The individual different Social Characteristics (F of (1,1,0) k (k=2)1And F2) in one, that is, judge F2Whether set d={ F is belonged to1, F2, due to F3It is not belonging to d={ F1, F2, therefore G0By sequence Ck=C2=<F1, F2>, message Pass-through mode mod=1 and the message carried are transmitted to G1。
From G4(1,0,0) sets out, due to G4(1,0,0) it is intermediate node, therefore performs above-mentioned steps S207-S214.
Assuming that G4(1,0,0) at a time encounters G0, due to G0To forward the message to G4Node, therefore G4Do not forward Message, wait are met with other nodes.
Assuming that G4(1,0,0) encounters G at another moment5, due to G5It is not to forward the message to G4Node, and G5(1,0, 1) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G4Judge the message pass-through mode mod received Whether 0 is equal to, due to mod=0, therefore G4(1,0,0) judges itself and G5(1,0,1) different Social Characteristics Fs=F3Whether For the sequence C receivedt=C1=<F2, F1>In first element, due to F3It is not C1=<F2, F1>In first element, Therefore G4Message is not forwarded, wait is met with other nodes.
Assuming that G4(1,0,0) encounters G at another moment6, due to G6It is not to forward the message to G4Node, and G6(1,0, 1) with destination node G63 Social Characteristics of (1,1,0) are completely the same, therefore G4The message of carrying is directly transmitted to G6, complete Source node G0To destination node G6Message forwarding process.
From G2(0,1,0) sets out, due to G2(0,1,0) it is intermediate node, therefore performs above-mentioned steps S207-S214.
Assuming that G2(0,1,0) at a time encounters G0, due to G0To forward the message to G2Node, therefore G2Do not forward Message, wait are met with other nodes.
Assuming that G2(0,1,0) encounters G at another moment3, due to G3It is not to forward the message to G4Node, and G3(0,1, 1) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G2Judge the message pass-through mode mod received Whether 0 is equal to, due to mod=0, therefore G2(0,1,0) judges itself and G3(0,1,1) different Social Characteristics Fs=F3Whether For the sequence C receivedt=C2=<F1, F2>In first element, due to F3It is not C2=<F1, F2>In first element, Therefore G2Message is not forwarded, wait is met with other nodes.
Assuming that G2(0,1,0) encounters G at another moment6, due to G6It is not to forward the message to G2Node, and G6(1,0, 1) with destination node G63 Social Characteristics of (1,1,0) are completely the same, therefore G2The message of carrying is directly transmitted to G6, complete Source node G0To destination node G6Message forwarding process.
From G1(0,0,1) sets out, due to G1(0,0,1) it is intermediate node, therefore performs above-mentioned steps S207-S214.
Assuming that G1(0,0,1) at a time encounters G0, due to G0To forward the message to G1Node, therefore G1Do not forward Message, wait are met with other nodes.
Assuming that G1(0,0,1) encounters G at another moment3, due to G3It is not to forward the message to G1Node, and G3(0,1, 1) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G1Judge the message pass-through mode mod received Whether 0 is equal to, due to mod ≠ 0, therefore G1(0,0,1) judges itself and G3(0,1,1) different Social Characteristics Fs=F2Whether For the sequence C receivedt=C2=<F1, F2>In an element, due to F2For C2=<F1, F2>In an element, therefore G2 By sequence Ct-s=Ct-Fs=<F1, F2>-F2=<F1>, message pass-through mode mod=1 and carrying message be transmitted to G3。
Assuming that G1(0,0,1) encounters G at another moment5, due to G5It is not to forward the message to G1Node, and G5(1,0, 1) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G1Judge the message pass-through mode mod received Whether 0 is equal to, due to mod ≠ 0, therefore G1(0,0,1) judges itself and G5(1,0,1) different Social Characteristics Fs=F1Whether For the sequence C receivedt=C2=<F1, F2>In an element, due to F1For C2=<F1, F2>In an element, therefore G1 By sequence Ct-s=Ct-Fs=<F1, F2>-F1=<F2>, message pass-through mode mod=1 and carrying message be transmitted to G5。
From G3(0,1,1) sets out, due to G3(0,1,1) it is intermediate node, therefore performs above-mentioned steps S207-S214.
Assuming that G3(0,1,1) at a time encounters G1, due to G1To forward the message to G3Node, therefore G3Do not forward Message, wait are met with other nodes.
Assuming that G3(0,1,1) encounters G at another moment2, due to G2It is not to forward the message to G3Node, and G2(0,1, 0) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G3Judge the message pass-through mode mod received Whether 0 is equal to, due to mod ≠ 0, therefore G3(0,1,1) judges itself and G2(0,1,0) different Social Characteristics Fs=F3Whether For the sequence C receivedt=<F1>In an element, due to F3It is not Ct=<F1>In an element, therefore G3Do not forward Message, wait are met with other nodes.
Assuming that G3(0,1,1) encounters G at another moment7, due to G7It is not to forward the message to G3Node, and G7(1,1, 1) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G3Judge the message pass-through mode mod received Whether 0 is equal to, due to mod ≠ 0, therefore G3(0,1,1) judges itself and G7(1,1,1) different Social Characteristics Fs=F1Whether For the sequence C receivedt=<F1>In an element, due to F1For Ct=<F1>In an element, therefore G3By sequenceMessage pass-through mode mod=1 and the message carried are transmitted to G7。
From G5(1,0,1) sets out, due to G5(1,0,1) it is intermediate node, therefore performs above-mentioned steps S207-S214.
Assuming that G5(1,0,1) at a time encounters G1, due to G1To forward the message to G5Node, therefore G5Do not forward Message, wait are met with other nodes.
Assuming that G5(1,0,1) encounters G at another moment4, due to G4It is not to forward the message to G5Node, and G4(1,0, 0) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G5Judge the message pass-through mode mod received Whether 0 is equal to, due to mod ≠ 0, therefore G5(1,0,1) judges itself and G4(1,0,0) different Social Characteristics Fs=F3Whether For the sequence C receivedt=<F2>In an element, due to F3It is not Ct=<F2>In an element, therefore G5Do not forward Message, wait are met with other nodes.
Assuming that G5(1,0,1) encounters G at another moment7, due to G7It is not to forward the message to G5Node, and G7(1,1, 1) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G5Judge the message pass-through mode mod received Whether 0 is equal to, due to mod ≠ 0, therefore G5(1,0,1) judges itself and G7(1,1,1) different Social Characteristics Fs=F2Whether For the sequence C receivedt=<F2>In an element, due to F2For Ct=<F2>In an element, therefore G5By sequenceMessage pass-through mode mod=1 and the message carried are transmitted to G7。
G3By sequenceMessage pass-through mode mod=1 and the message forwarding carried To G7Afterwards, from G7(1,1,1) sets out, due to G7(1,1,1) it is intermediate node, therefore performs above-mentioned steps S207-S214.
Assuming that G7(1,1,1) at a time encounters G3, due to G3To forward the message to G7Node, therefore G7Do not forward Message, wait are met with other nodes.
Assuming that G7(1,1,1) encounters G at another moment5, due to G5It is not to forward the message to G7Node, and G5(1,0, 1) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G7Judge the message pass-through mode mod received Whether 0 is equal to, due to mod ≠ 0, therefore G7(1,1,1) judges itself and G5(1,0,1) different Social Characteristics Fs=F2Whether For the sequence receivedIn an element, due to F2It is notIn an element, therefore G7Do not forward and disappear Breath, wait are met with other nodes.
Assuming that G7(1,1,1) encounters G at another moment6, due to G6It is not to forward the message to G7Node, and G6(1,1, 0) with destination node G63 Social Characteristics of (1,1,0) are completely the same, therefore G7The message of carrying is directly transmitted to G6, complete Source node G0To destination node G6Message forwarding process.
G5By sequenceMessage pass-through mode mod=1 and the message carried are transmitted to G7Afterwards, from G7(1,1,1) sets out, due to G7(1,1,1) it is intermediate node, therefore performs above-mentioned steps S207-S214.
Assuming that G7(1,1,1) at a time encounters G5, due to G5To forward the message to G7Node, therefore G7Do not forward Message, wait are met with other nodes.
Assuming that G7(1,1,1) encounters G at another moment3, due to G3It is not to forward the message to G7Node, and G3(0,1, 1) with destination node G63 Social Characteristics of (1,1,0) are not quite identical, therefore G7Judge the message pass-through mode mod received Whether 0 is equal to, due to mod ≠ 0, therefore G7(1,1,1) judges itself and G3(0,1,1) different Social Characteristics Fs=F1Whether For the sequence receivedIn an element, due to F1It is notIn an element, therefore G7Do not forward and disappear Breath, wait are met with other nodes.
Assuming that G7(1,1,1) encounters G at another moment6, due to G6It is not to forward the message to G7Node, and G6(1,1, 0) with destination node G63 Social Characteristics of (1,1,0) are completely the same, therefore G7The message of carrying is directly transmitted to G6, complete Source node G0To destination node G6Message forwarding process.
The method for routing for the time delay tolerant network that the present embodiment provides, source node forward messages to the neighbors run into, The neighbors is by the section bigger than the Social Characteristics similarity of itself and destination node with the Social Characteristics similarity of destination node Point as forward message next node, i.e., progressively forward the message to the node similar to destination node, so as to realize Destination node is posted messages to faster speed, improves router efficiency.
Fig. 4 is the structural representation of node device one embodiment provided by the invention.As shown in figure 4, the present embodiment carries The node device of confession is the specific executive agent for the method for routing for performing above-mentioned time delay tolerant network.The node device specifically can be with Including：Determining module 41, the first forwarding module 42 and the second forwarding module 43, wherein：
Determining module 41, the source of the message for being carried according to node device determine the node type of node device.
First forwarding module 42, for if it is determined that module 41 determine node device node type be source node, then will disappear Breath is transmitted to the neighbors run into.
Second forwarding module 43, for if it is determined that module 41 determine node device node type be intermediate node, then general Message be transmitted to run into addition to the neighbors for forwarding the message to node device, it is and similar to the Social Characteristics of destination node Degree other neighbors bigger than the Social Characteristics similarity of node device and destination node.
Further, determining module 41 specifically can be used for：
If judge message for caused by node device, it is determined that the node type of node device is source node；
If judging, message is transmitted to node device for neighbors, it is determined that the node type of node device is middle node Point.
Further, the first forwarding module 42 specifically can be used for：
If it is determined that module 41 determines that the node type of node device is source node, then the society spy of neighbors run into is judged Whether the Social Characteristics of property and destination node are consistent；
If consistent, the neighbors run into is forwarded messages to；
If inconsistent, the decision node equipment Social Characteristics F different from the neighbors run intorWhether it is itself and purpose One in k different Social Characteristics of node；
If so, then by sequence Cr, message pass-through mode mod=0 and message be transmitted to the neighbors run into；
If it is not, then by sequence Ck, message pass-through mode mod=1 and message be transmitted to the neighbors run into；
Wherein, Social Characteristics FrFor r-th of Social Characteristics, r is 1 to the natural number between m, and m is total of Social Characteristics Number, and m is equal to or more than k；If r ≠ k, Cr=<Fr+1, Fr+2... ..., Fk, F1, F2... ..., Fr>；If r=k, Cr=< F1, F2... ..., Fk>；Ck=<F1, F2... ..., Fk>。
Further, the second forwarding module 43 specifically can be used for：
If it is determined that module 41 determines that the node type of node device is intermediate node, then the neighbors for judging to run into whether be Forward the message to the neighbors of node device；
If it is not, then judge whether the Social Characteristics of the Social Characteristics of the neighbors and destination node run into are consistent；
If consistent, the neighbors run into is forwarded messages to；
If inconsistent, whether the message pass-through mode mod for judging to receive is equal to 0；
If message pass-through mode mod is equal to 0, the decision node equipment Social Characteristics F different from the neighbors run intosIt is The no sequence C to receivetIn first element；
If so, then by sequence Ct-s, message pass-through mode mod=0 and message be transmitted to the neighbors run into；
If message pass-through mode mod is not equal to 0, the decision node equipment Social Characteristics F different from the neighbors run intos Whether it is the sequence C receivedtIn an element；
If so, then by sequence Ct-s, message pass-through mode mod=1 and message be transmitted to the neighbors run into；
Wherein, Social Characteristics FsFor s-th of Social Characteristics, s is 1 to the natural number between m；T is 1 to the nature between k Number；Ct-sFor from sequence CtMiddle deletion Social Characteristics FsSequence afterwards.
Specifically, modules realize that the detailed process of its function is retouched referring to the correlation in Fig. 1 or embodiment illustrated in fig. 2 State, here is omitted.
The node device that the present embodiment provides, source node forward messages to the neighbors run into, and the source node will be with mesh Node the Social Characteristics similarity node bigger than the Social Characteristics similarity of itself and destination node as forwarding message Next node, i.e., progressively forward the message to the node similar to destination node, so as to realize with faster speed will Message transmission improves router efficiency to destination node.
Fig. 5 is the structural representation of route system one embodiment of time delay tolerant network provided by the invention.Such as Fig. 5 institutes Show, the system includes source node 51, destination node 52 and multiple intermediate nodes 53.Wherein, source node 51 and intermediate node 53 are Node device as described above.
The route system for the time delay tolerant network that the present embodiment provides, source node forward messages to the neighbors run into, The neighbors is by the section bigger than the Social Characteristics similarity of itself and destination node with the Social Characteristics similarity of destination node Point as forward message next node, i.e., progressively forward the message to the node similar to destination node, so as to realize Destination node is posted messages to faster speed, improves router efficiency.
Finally it should be noted that：Various embodiments above is merely illustrative of the technical solution of the present invention, rather than its limitations；To the greatest extent The present invention is described in detail with reference to foregoing embodiments for pipe, it will be understood by those within the art that：Its according to The technical scheme described in foregoing embodiments can so be modified, either which part or all technical characteristic are entered Row equivalent substitution；And these modifications or replacement, the essence of appropriate technical solution is departed from various embodiments of the present invention technology The scope of scheme.

Claims (8)

  1. A kind of 1. method for routing of time delay tolerant network, it is characterised in that including：
    The node for carrying message determines the node type of itself according to the source of the message；
    If the node for carrying message determines that the node type of itself is source node, the message is transmitted to the neighbour run into Node；
    If the node for carrying message determines that the node type of itself is intermediate node, the message is transmitted to what is run into In addition to the message is forwarded to the neighbors of itself, and with the Social Characteristics similarity of destination node than itself and purpose section Bigger other neighbors of Social Characteristics similarity of point；
    Wherein, if the node for carrying message determines that the node type of itself is source node, the message is forwarded To the neighbors run into, it is specially：
    If the node for carrying message determines that the node type of itself is source node, the society of the neighbors run into described in judgement Whether the Social Characteristics of meeting characteristic and destination node are consistent；
    If consistent, the message is transmitted to the neighbors run into by the node for carrying message；
    If inconsistent, the node for carrying message judges itself Social Characteristics F different from the neighbors run intorIt is One in no k different Social Characteristics for itself and destination node；
    If so, then the node for carrying message is by sequence Cr, message pass-through mode mod=0 and the message be transmitted to the chance The neighbors arrived；
    If it is not, then the node for carrying message is by sequence Ck, message pass-through mode mod=1 and the message be transmitted to the chance The neighbors arrived；
    Wherein, the Social Characteristics FrFor r-th of Social Characteristics, the r is Social Characteristics for 1 to the natural number between m, the m Total number, and the m is equal to or more than the k；If r ≠ k, the Cr=<Fr+1, Fr+2... ..., Fk, F1, F2... ..., Fr>；If r=k, the Cr=<F1, F2... ..., Fk>；The Ck=<F1, F2... ..., Fk>。
  2. 2. according to the method for claim 1, it is characterised in that the node for carrying message is according to the source of the message The node type of itself is determined, is specially：
    If the node for carrying message judges the message caused by itself, it is determined that the node type of itself saves for source Point；
    If the node for carrying message judges that the message is transmitted to itself for neighbors, it is determined that the node type of itself For intermediate node.
  3. 3. according to the method for claim 1, it is characterised in that if the node for carrying message determines the section of itself Vertex type is intermediate node, then the message is transmitted to run into addition to the message is forwarded to the neighbors of itself, And other neighbors bigger with the Social Characteristics similarity of destination node than itself with the Social Characteristics similarity of destination node, Specially：
    If the node for carrying message determines that the node type of itself is intermediate node, the neighbors run into described in judgement is No is to forward the message to the neighbors of itself；
    If it is not, the Social Characteristics of the neighbors then run into described in the node judgement for carrying message and the society of destination node are special Whether property is consistent；
    If consistent, the message is transmitted to the neighbors run into by the node for carrying message；
    If inconsistent, whether the message pass-through mode mod that the node for carrying message judges to receive is equal to 0；
    If the message pass-through mode mod is equal to 0, the node for carrying message judges itself and the neighbors run into Different Social Characteristics FsWhether it is the sequence C receivedtIn first element；
    If so, then the node for carrying message is by sequence Ct-s, the message pass-through mode mod=0 and the message is transmitted to The neighbors run into；
    If the message pass-through mode mod is not equal to 0, the node for carrying message judges itself and the adjacent section run into The different Social Characteristics F of pointsWhether it is the sequence C receivedtIn an element；
    If so, then the node for carrying message is by sequence Ct-s, the message pass-through mode mod=1 and the message is transmitted to The neighbors run into；
    Wherein, the Social Characteristics FsFor s-th of Social Characteristics, the s is 1 natural number arrived between the m；The t arrives for 1 Natural number between the k；The Ct-sFor from the sequence CtIt is middle to delete the Social Characteristics FsSequence afterwards.
  4. 4. according to the method for claim 3, it is characterised in that the m Social Characteristics are in all Social Characteristics of node M maximum Social Characteristics of entropy.
  5. A kind of 5. node device, it is characterised in that including：
    Determining module, the source of the message for being carried according to the node device determine the node type of the node device；
    First forwarding module, if determining that the node type of the node device is source node for the determining module, The message is transmitted to the neighbors run into；
    Second forwarding module, if determining that the node type of the node device is intermediate node for the determining module, Then the message is transmitted to run into addition to the neighbors of the message to the node device is forwarded, and with purpose section Social Characteristics similarity other neighbors bigger than the Social Characteristics similarity of the node device and destination node of point；
    Wherein, first forwarding module is specifically used for：
    If the determining module determines that the node type of the node device is source node, judge described in the neighbors that runs into Whether Social Characteristics and the Social Characteristics of destination node are consistent；
    If consistent, the message is transmitted to the neighbors run into；
    If inconsistent, the node device Social Characteristics F different from the neighbors run into is judgedrWhether be itself with One in k different Social Characteristics of destination node；
    If so, then by sequence Cr, message pass-through mode mod=0 and the message be transmitted to the neighbors run into；
    If it is not, then by sequence Ck, message pass-through mode mod=1 and the message be transmitted to the neighbors run into；
    Wherein, the Social Characteristics FrFor r-th of Social Characteristics, the r is Social Characteristics for 1 to the natural number between m, the m Total number, and the m is equal to or more than the k；If r ≠ k, the Cr=<Fr+1, Fr+2... ..., Fk, F1, F2... ..., Fr>；If r=k, the Cr=<F1, F2... ..., Fk>；The Ck=<F1, F2... ..., Fk>。
  6. 6. node device according to claim 5, it is characterised in that the determining module is specifically used for：
    If judge the message for caused by the node device, it is determined that the node type of the node device is source node；
    If judging, the message is transmitted to the node device for neighbors, it is determined that the node type of the node device is Intermediate node.
  7. 7. node device according to claim 5, it is characterised in that second forwarding module is specifically used for：
    If the determining module determines that the node type of the node device is intermediate node, judge described in the neighbors that runs into Whether it is neighbors of the forwarding message to the node device；
    If it is not, whether the Social Characteristics of the neighbors run into described in then judging and the Social Characteristics of destination node are consistent；
    If consistent, the message is transmitted to the neighbors run into；
    If inconsistent, whether the message pass-through mode mod for judging to receive is equal to 0；
    If the message pass-through mode mod is equal to 0, the node device society different from the neighbors run into is judged Characteristic FsWhether it is the sequence C receivedtIn first element；
    If so, then by sequence Ct-s, the message pass-through mode mod=0 and the message be transmitted to the neighbors run into；
    If the message pass-through mode mod is not equal to 0, the node device society different from the neighbors run into is judged Can characteristic FsWhether it is the sequence C receivedtIn an element；
    If so, then by sequence Ct-s, the message pass-through mode mod=1 and the message be transmitted to the neighbors run into；
    Wherein, the Social Characteristics FsFor s-th of Social Characteristics, the s is 1 natural number arrived between the m；The t arrives for 1 Natural number between the k；The Ct-sFor from the sequence CtIt is middle to delete the Social Characteristics FsSequence afterwards.
  8. 8. a kind of route system of time delay tolerant network, it is characterised in that including source node, destination node and multiple middle nodes Point；The source node and the intermediate node are the node device as described in claim any one of 5-7.
CN201410675883.6A 2014-11-21 2014-11-21 Method for routing, equipment and the system of time delay tolerant network Active CN104410999B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410675883.6A CN104410999B (en) 2014-11-21 2014-11-21 Method for routing, equipment and the system of time delay tolerant network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410675883.6A CN104410999B (en) 2014-11-21 2014-11-21 Method for routing, equipment and the system of time delay tolerant network

Publications (2)

Publication Number Publication Date
CN104410999A CN104410999A (en) 2015-03-11
CN104410999B true CN104410999B (en) 2017-12-15

Family

ID=52648581

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410675883.6A Active CN104410999B (en) 2014-11-21 2014-11-21 Method for routing, equipment and the system of time delay tolerant network

Country Status (1)

Country Link
CN (1) CN104410999B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106102118A (en) * 2016-08-08 2016-11-09 北京理工大学 Effectively support the movable random D2D network route method of service quality
CN106255170B (en) * 2016-08-08 2019-03-26 北京理工大学 A kind of movable random D2D network data query method based on minimal-overhead path
CN107333320A (en) * 2017-06-30 2017-11-07 湖北工程学院 Data forwarding method and device

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103973556A (en) * 2013-02-04 2014-08-06 无锡南理工科技发展有限公司 Credible routing method of vehicular delay-tolerant network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5293426B2 (en) * 2009-06-09 2013-09-18 ソニー株式会社 COMMUNICATION METHOD, INFORMATION PROCESSING DEVICE, AND PROGRAM

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103973556A (en) * 2013-02-04 2014-08-06 无锡南理工科技发展有限公司 Credible routing method of vehicular delay-tolerant network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
延迟容忍网络中路由与缓存管理算法;刘耀;《中南大学》;20120601;正文第28页 *

Also Published As

Publication number Publication date
CN104410999A (en) 2015-03-11

Similar Documents

Publication Publication Date Title
Wei et al. A survey of social-aware routing protocols in delay tolerant networks: Applications, taxonomy and design-related issues
Vastardis et al. Mobile social networks: Architectures, social properties, and key research challenges
Daly et al. Social network analysis for routing in disconnected delay-tolerant manets
Quercia et al. Friendsensing: recommending friends using mobile phones
Qiu et al. A survey of mobile social networks: Applications, social characteristics, and challenges
Municio et al. Whisper: Programmable and flexible control on industrial IoT networks
Madni et al. DTN and Non-DTN routing protocols for inter-cubesat communications: A comprehensive survey
Suraj et al. Mobility prediction in mobile ad hoc networks using a lightweight genetic algorithm
Wang et al. Analysis of a hypercube-based social feature multipath routing in delay tolerant networks
CN104410999B (en) Method for routing, equipment and the system of time delay tolerant network
Kandris et al. COALA: a protocol for the avoidance and alleviation of congestion in wireless sensor networks
Booranawong et al. Energy consumption and control response evaluations of AODV routing in WSANs for building-temperature control
Mhemed et al. Void avoidance opportunistic routing protocol for underwater wireless sensor networks
Rango et al. Exploiting online and offline activity-based metrics for opportunistic forwarding
Lin et al. Trustworthiness-hypercube-based reliable communication in mobile social networks
Sharma et al. Adaptive load distribution approach based on congestion control scheme in ad-hoc networks
Velusamy et al. Multi-objective function-based node-disjoint multipath routing for mobile ad hoc networks
Mhemed et al. Void avoiding opportunistic routing protocols for underwater wireless sensor networks: a survey
Yao et al. An Efficient Routing Protocol for Quantum Key Distribution Networks
Behdani et al. The lifetime maximization problem in wireless sensor networks with a mobile sink: mixed-integer programming formulations and algorithms
CN104994464B (en) Mobile social network data forwarding method based on hierarchical community structure
De Rango et al. Social and dynamic graph-based scalable routing protocol in a DTN network
Du et al. A geometric routing protocol in disruption tolerant network
Ranga et al. Restoration of lost connectivity of partitioned wireless sensor networks
PS et al. Enhanced STR based geographic location in ZigBee wireless networks: a hybrid PSACO method

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