CN104410999A - Routing method, equipment and system for delay tolerant network - Google Patents

Abstract

The invention provides a routing method, equipment and system for a delay tolerant network. The method includes: the node type of a node carrying a message is determined according to the source of the message; if the node carrying the message is a source node, the message is forwarded to every met adjacent node; if the node carrying the message is an intermediate node, the message is forwarded to other met adjacent nodes except the adjacent node forwarding the message to the itself, wherein the social feature similarity of the other adjacent nodes and a target node is larger than the social feature similarity of the intermediate node and the target node. By the routing method, equipment and system for the delay tolerant network, the message is forwarded to the nodes similar to the target node step by step, the message is transmitted to the target node fast, and routing efficiency is increased.

Description

The method for routing of time delay tolerant network, equipment and system

Technical field

The present invention relates to communication technical field, particularly relate to a kind of method for routing of time delay tolerant network, equipment and system.

Background technology

In recent years, the development and apply of wireless technology is more and swifter and more violent, and the quantity of mobile device exceedes fixed host computer becomes a kind of trend, and a large amount of mobile devices constitutes the new application scenarios of a kind of wireless network, i.e. time delay tolerant network (Delay Tolerant Network is called for short DTN).And along with the mobile communication equipment such as smart mobile phone, PAD become people life in necessity, the control of " people " is more received with the DTN that individual mobile device is node, and people has a social nature, everyone is constantly mobile and carry out contacting according to oneself hobby and demand, if two people have relative to other people more identical point in society, so, contact between them can be more frequent, the network that this node has a social nature and social time delay tolerant network.DTN route, namely the source node of message is carried in DTN wirelessly, such as bluetooth, infrared ray, WIFI etc., message is transmitted to other nodes run into, i.e. intermediate node, this message wirelessly continues to be transmitted to other nodes run into by this node, so goes on until this message is transmitted to destination node.

Existing DTN method for routing improves the efficiency of route by the historical movement path of catching each node, and for social time delay tolerant network, because its network size is large, number of nodes is many, the historical movement path of catching each node is quite difficult, and therefore router efficiency is lower.

Summary of the invention

The invention provides a kind of method for routing of time delay tolerant network, equipment and system, in order to solve the lower problem of the router efficiency that exists in prior art.

The invention provides a kind of method for routing of time delay tolerant network, comprising:

The node carrying message determines the node type of self according to the source of described message;

If described in carry message node determine that the node type of self is source node, then described message is transmitted to the neighbors run into;

If described in carry message node determine that the node type of self is intermediate node, then described message to be transmitted to run into except forwarding described message to except the neighbors of self, and other neighborss larger than the Social Characteristics similarity of self and destination node with the Social Characteristics similarity of destination node.

The invention provides a kind of node device, comprising:

Determination module, the node type of described node device is determined in the source for the message of carrying according to described node device;

First forwarding module, if determine that the described node type of described node device is source node for described determination module, is then transmitted to the neighbors run into by described message;

Second forwarding module, if determine that the described node type of described node device is intermediate node for described determination module, then described message to be transmitted to run into except forwarding described message to except the neighbors of described node device, and other neighborss larger than the Social Characteristics similarity of described node device and destination node with the Social Characteristics similarity of destination node.

The invention provides a kind of route system of time delay tolerant network, comprise source node, destination node and multiple intermediate node; Described source node and described intermediate node are node device as above.

The method for routing of time delay tolerant network provided by the invention, equipment and system, message is transmitted to the neighbors run into by source node, this neighbors using with the next node of the Social Characteristics similarity of the destination node node larger than the Social Characteristics similarity of self and destination node as forwarding messages, namely progressively message is transmitted to the node similar to destination node, thus to realize Message Transmission with speed faster, to destination node, improve router efficiency.

Accompanying drawing explanation

Fig. 1 is the schematic flow sheet of a method for routing embodiment of time delay tolerant network provided by the invention;

Fig. 2 is the schematic flow sheet of another embodiment of method for routing of time delay tolerant network provided by the invention;

Node Social Characteristics schematic diagram when Fig. 3 is middle m=3 embodiment illustrated in fig. 2;

Fig. 4 is the structural representation of a node device provided by the invention embodiment;

Fig. 5 is the structural representation of a route system embodiment of time delay tolerant network provided by the invention.

Embodiment

Below by specific embodiment and accompanying drawing, technical scheme of the present invention is described in further detail.

Fig. 1 is the schematic flow sheet of a method for routing embodiment of time delay tolerant network provided by the invention.As shown in Figure 1, the method specifically can comprise:

S101, the node carrying message determines the node type of self according to the source of message.

Concrete, if the node carrying message judges that this message is that self produces, then determine that the node type of self is source node.If the node carrying message judges that this message is that other nodes are transmitted to self, then determine that the node type of self is intermediate node.

S102, if the node carrying message determines that the node type of self is source node, is then transmitted to the neighbors run into by message.

Concrete, if the node carrying message in step S101 determines that the node type of self is source node, then this message is transmitted to the neighbors run into by this node carrying message.Namely neighbors only has the node that Social Characteristics other Social Characteristics different are all identical from present node.

S103, if the node carrying message determines that the node type of self is intermediate node, then message is transmitted to run into except forwarding messages is to except self neighbors, and other neighborss larger than the Social Characteristics similarity of self and destination node with the Social Characteristics similarity of destination node.

Concrete, if the node carrying message in step S101 determines that the node type of self is intermediate node, then this node carrying message selects the neighbors similar to destination node as the next node of forwarding messages by characteristic matching.Concrete, if this neighbors run into be forwarding messages to the neighbors of self, then not forwarding messages, waits for and runs into other neighborss; If the Social Characteristics similarity of this neighbors run into and destination node is equal to or less than the Social Characteristics similarity of self and destination node, then not forwarding messages, waits for and runs into other neighborss; If the Social Characteristics similarity of this neighbors run into and destination node is greater than the Social Characteristics similarity of self and destination node, then the neighbors that runs into this of forwarding messages.

The method for routing of the time delay tolerant network that the present embodiment provides, message is transmitted to the neighbors run into by source node, this neighbors using with the next node of the Social Characteristics similarity of the destination node node larger than the Social Characteristics similarity of self and destination node as forwarding messages, namely progressively message is transmitted to the node similar to destination node, thus to realize Message Transmission with speed faster, to destination node, improve router efficiency.

Fig. 2 is the schematic flow sheet of another embodiment of method for routing of time delay tolerant network provided by the invention.As shown in Figure 2, the present embodiment is on basis embodiment illustrated in fig. 1, and further describe the process how source node and intermediate node select next node, the method specifically can comprise:

S201, the node carrying message determines the node type of self according to the source of message.

Concrete, if the node carrying message judges that this message is that self produces, then determine that the node type of self is source node, and perform step S202.If the node carrying message judges that this message is that neighbors is transmitted to self, then determine that the node type of self is intermediate node, and perform step S207.

S202, if the node carrying message determines that the node type of self is source node, then judges that whether the Social Characteristics of the neighbors run into is consistent with the Social Characteristics of destination node.

Concrete, if the node carrying message in step S201 determines that the node type of self is source node, then this node (i.e. source node) carrying message judges that whether m Social Characteristics of m Social Characteristics of the neighbors run into and destination node be completely the same.If consistent, then perform step S203; If inconsistent, then perform step S204.Wherein, choosing of m Social Characteristics specifically by calculating the entropy of the whole Social Characteristics of each node, can get the Social Characteristics of the maximum m of a wherein entropy Social Characteristics as each node.Such as, have n node (a corresponding n people), each node has M kind characteristic (such as nationality, mother tongue etc.), uses F respectively ₁, F ₂..., F _mrepresent, E (F _j) (j=1,2 ..., M) and be characteristic F _jentropy, P _j() is characteristic F _jprobability density function.Entropy according to following each characteristic of formulae discovery:

$E\left(F_j\right)=-\underset{i=1}{\overset{n}{\mathrm{\Σ}}}P\left(F_{\mathrm{ij}}\right){\log }_{2}P\left(F_{\mathrm{ij}}\right)$

According to result of calculation, select the maximum m of entropy (m<M) individual Social Characteristics.

S203, message is transmitted to the neighbors run into by the node carrying message.

Concrete, if m Social Characteristics of the m of the neighbors a run into Social Characteristics and destination node is completely the same, then this node (i.e. source node) carrying message thinks this neighbors run into and destination node, thus directly the message of carrying is transmitted to this neighbors run into.

S204, the node carrying message judges the Social Characteristics F that self is different from the neighbors run into _rwhether be self and in the individual different Social Characteristics of destination node k.

Concrete, r (r is the natural number between 1 to m) the individual Social Characteristics F of neighbors supposing this node carrying message (i.e. source node) and run into _rdifference, this node (i.e. source node) carrying message has k (k is the natural number between 1 to m) individual different Social Characteristics, such as 1-k Social Characteristics from destination node, then the individual different Social Characteristics of this k forms set d={F ₁, F ₂..., F _k.If m Social Characteristics of the m of the neighbors a run into Social Characteristics and destination node is not quite identical, namely have at least 1 Social Characteristics inconsistent, then this node (i.e. source node) carrying message judges the Social Characteristics F that self is different from the neighbors run into _rbe whether in self Social Characteristics different from destination node k, namely judge F _rwhether belong to set d={F ₁, F ₂..., F _k.If so, then step S205 is performed; If not, then step S206 is performed.

S205, carries the node of message by sequence C ^r, message pass-through mode mod=0 and message is transmitted to the neighbors run into.

Concrete, if F _r∈ d={F ₁, F ₂..., F _k, then this node (i.e. source node) carrying message is by sequence C ^r, message pass-through mode mod=0 and the message of carrying is transmitted to the neighbors run into.Wherein, sequence C ^rbe defined as follows: as r=k, C ^r=C ^k=<F ₁, F ₂..., F _k>; As r ≠ k, C ^r=<F _r+1, F _r+2..., F _k, F ₁, F ₂..., F _r>.Message pass-through mode mod=0, represents current with short path mode forwarding messages.

S206, carries the node of message by sequence C ^k, message pass-through mode mod=1 and message is transmitted to the neighbors run into.

Concrete, if F _rdo not belong to d={F ₁, F ₂..., F _k, then this node (i.e. source node) carrying message is by sequence C ^k, message pass-through mode mod=1 and the message of carrying is transmitted to the neighbors run into.Wherein, C ^k=<F ₁, F ₂..., F _k>.Message pass-through mode mod=1, represents current with long path fashion forwarding messages.

S207, if the node carrying message determines that the node type of self is intermediate node, then judges whether the neighbors run into is that forwarding messages is to the neighbors of self.

Concrete, if the node carrying message in step S201 determines that the node type of self is intermediate node, then this node (i.e. intermediate node) carrying message judges whether the neighbors that runs into and forwarding messages are same node to the neighbors (namely going up a node) of self.If so, then not forwarding messages, waits for and runs into other neighborss; If not, then step S208 is performed.

S208, the node carrying message judges that whether the Social Characteristics of the neighbors run into is consistent with the Social Characteristics of destination node.

Concrete, if the neighbors run into and forwarding messages are different nodes to the node of self, then this node (i.e. intermediate node) carrying message judges that whether m Social Characteristics of m Social Characteristics of the neighbors run into and destination node be completely the same.If consistent, then perform step S209; If inconsistent, then perform step S210.

S209, message is transmitted to the neighbors run into by the node carrying message.

Concrete, if m Social Characteristics of the m of the neighbors a run into Social Characteristics and destination node is completely the same, then this node (i.e. intermediate node) carrying message thinks this neighbors run into and destination node, thus directly the message of carrying is transmitted to this neighbors run into.

S210, the node carrying message judges whether the message pass-through mode mod received equals 0.

Concrete, if m Social Characteristics of the m of the neighbors a run into Social Characteristics and destination node is not quite identical, namely have at least 1 Social Characteristics inconsistent, then this node (i.e. intermediate node) carrying message judges whether the message pass-through mode mod self received equals 0.If so, then step S211 is performed; If not, then step S213 is performed.

S211, the node carrying message judges the Social Characteristics F that self is different from the neighbors run into _swhether be the sequence C received ^tin first element.

Concrete, s (s is the natural number between 1 to m) the individual Social Characteristics F of neighbors supposing this node carrying message (i.e. intermediate node) and run into _sdifference, the sequence that this node (i.e. intermediate node) carrying message receives from a upper node is C ^t(t is the natural number between 1 to k).If the message pass-through mode mod=0 self received, then this node (i.e. intermediate node) carrying message judges the Social Characteristics F that self is different from the neighbors run into _swhether be the sequence C received ^tin first element.If so, then step S212 is performed; If not, then not forwarding messages, waits for and runs into other neighborss.

S212, carries the node of message by sequence C ^t-s, message pass-through mode mod=0 and the message of carrying is transmitted to the neighbors run into.

Concrete, if self Social Characteristics F different from the neighbors run into _sfor the sequence C received ^tin first element, then this node (i.e. intermediate node) carrying message is by sequence C ^t-s, message pass-through mode mod=0 and the message of carrying is transmitted to the neighbors run into.Wherein, C ^t-sfor from sequence C ^tmiddle deletion Social Characteristics F _safter sequence, i.e. C ^t-s=C ^t-F _s.

S213, the node carrying message judges the Social Characteristics F that self is different from the neighbors run into _swhether be the sequence C received ^tin an element.

Concrete, if message pass-through mode mod ≠ 0 self received, i.e. mod=1, then this node (i.e. intermediate node) carrying message judges the Social Characteristics F that self is different from the neighbors run into _swhether be the sequence C received ^tin an element.If so, then step S214 is performed; If not, then not forwarding messages, waits for and runs into other neighborss.

S214, carries the node of message by sequence C ^t-s, message pass-through mode mod=1 and the message of carrying is transmitted to the neighbors run into.

Concrete, if self Social Characteristics F different from the neighbors run into _sfor the sequence C received ^tin an element, then this node (i.e. intermediate node) carrying message is by sequence C ^t-s, message pass-through mode mod=1 and the message of carrying is transmitted to the neighbors run into.

For m=3, the method for routing of the time delay tolerant network of the present embodiment is described in detail below:

Node Social Characteristics schematic diagram when Fig. 3 is middle m=3 embodiment illustrated in fig. 2.As shown in Figure 3, suppose to there are 8 node (G in time delay tolerant network ₀, G ₁..., G ₇), corresponding 3 the Social Characteristics (F of each node ₁, F ₂and F ₃), G ₀corresponding (0,0,0), G ₁corresponding (0,0,1), G ₂corresponding (0,1,0), G ₃corresponding (0,1,1), G ₄corresponding (1,0,0), G ₅corresponding (1,0,1), G ₆corresponding (1,1,0), G ₇corresponding (1,1,1), 3 Social Characteristics of each node constitute one 3 dimension cube.

Suppose G ₀(0,0,0) is source node, G ₆node for the purpose of (1,1,0), due to G ₀with G ₆the 1st characteristic F ₁with the 2nd characteristic F ₂difference, the 3rd characteristic F ₃identical, therefore there is set d={F ₁, F ₂, k=2, C ¹=<F ₂, F ₁>, C ²=<F ₂, F ₁>.

Source node G ₀message is transmitted to destination node G by intermediate node by (0,0,0) ₆the process of (1,1,0) is as follows:

From G ₀(0,0,0) sets out, due to G ₀(0,0,0) is source node, therefore performs above-mentioned steps S202-S206.

Suppose G ₀(0,0,0) at a time encounters neighbors G ₄(1,0,0), due to G ₄(1,0,0) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₀(0,0,0) judges self and G ₄the Social Characteristics F that (1,0,0) is different _r=F ₁whether be G ₀(0,0,0) and G ₆(1,1,0) k (k=2) individual different Social Characteristics (F ₁and F ₂) in one, namely judge F ₁whether belong to set d={F ₁, F ₂, due to F ₁∈ d={F ₁, F ₂, therefore G ₀by sequence C ^r=C ¹=<F ₂, F ₁>, message pass-through mode mod=0 and the message of carrying are transmitted to G ₄.

Suppose G ₀(0,0,0) encounters neighbors G in another moment ₂(0,1,0), due to G ₂(0,1,0) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₀(0,0,0) judges self and G ₂the Social Characteristics F that (0,1,0) is different _r=F ₂whether be G ₀(0,0,0) and G ₆(1,1,0) k (k=2) individual different Social Characteristics (F ₁and F ₂) in one, namely judge F ₂whether belong to set d={F ₁, F ₂, due to F ₂∈ d={F ₁, F ₂, therefore G ₀by sequence C ^r=C ²=<F ₁, F ₂>, message pass-through mode mod=0 and the message of carrying are transmitted to G ₂.

Suppose G ₀(0,0,0) encounters neighbors G in another moment ₁(0,0,1), due to G ₁(0,0,1) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₀(0,0,0) judges self and G ₁the Social Characteristics F that (0,0,1) is different _r=F ₃whether be G ₀(0,0,0) and G ₆(1,1,0) k (k=2) individual different Social Characteristics (F ₁and F ₂) in one, namely judge F ₂whether belong to set d={F ₁, F ₂, due to F ₃do not belong to d={F ₁, F ₂, therefore G ₀by sequence C ^k=C ²=<F ₁, F ₂>, message pass-through mode mod=1 and the message of carrying are transmitted to G ₁.

From G ₄(1,0,0) sets out, due to G ₄(1,0,0) is intermediate node, therefore performs above-mentioned steps S207-S214.

Suppose G ₄(1,0,0) at a time encounters G ₀, due to G ₀for forwarding messages is to G ₄node, therefore G ₄not forwarding messages, waits for and other node meets.

Suppose G ₄(1,0,0) encounters G in another moment ₅, due to G ₅not that forwarding messages is to G ₄node, and G ₅(1,0,1) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₄judge whether the message pass-through mode mod received equals 0, due to mod=0, therefore G ₄(1,0,0) judges self and G ₅the Social Characteristics F that (1,0,1) is different _s=F ₃whether be the sequence C received ^t=C ¹=<F ₂, F ₁first element in >, due to F ₃be not C ¹=<F ₂, F ₁first element, therefore G in > ₄not forwarding messages, waits for and other node meets.

Suppose G ₄(1,0,0) encounters G in another moment ₆, due to G ₆not that forwarding messages is to G ₄node, and G ₆(1,0,1) and destination node G ₆3 Social Characteristics of (1,1,0) are completely the same, therefore G ₄directly the message of carrying is transmitted to G ₆, complete source node G ₀to destination node G ₆message forwarding process.

From G ₂(0,1,0) sets out, due to G ₂(0,1,0) is intermediate node, therefore performs above-mentioned steps S207-S214.

Suppose G ₂(0,1,0) at a time encounters G ₀, due to G ₀for forwarding messages is to G ₂node, therefore G ₂not forwarding messages, waits for and other node meets.

Suppose G ₂(0,1,0) encounters G in another moment ₃, due to G ₃not that forwarding messages is to G ₄node, and G ₃(0,1,1) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₂judge whether the message pass-through mode mod received equals 0, due to mod=0, therefore G ₂(0,1,0) judges self and G ₃the Social Characteristics F that (0,1,1) is different _s=F ₃whether be the sequence C received ^t=C ²=<F ₁, F ₂first element in >, due to F ₃be not C ²=<F ₁, F ₂first element, therefore G in > ₂not forwarding messages, waits for and other node meets.

Suppose G ₂(0,1,0) encounters G in another moment ₆, due to G ₆not that forwarding messages is to G ₂node, and G ₆(1,0,1) and destination node G ₆3 Social Characteristics of (1,1,0) are completely the same, therefore G ₂directly the message of carrying is transmitted to G ₆, complete source node G ₀to destination node G ₆message forwarding process.

From G ₁(0,0,1) sets out, due to G ₁(0,0,1) is intermediate node, therefore performs above-mentioned steps S207-S214.

Suppose G ₁(0,0,1) at a time encounters G ₀, due to G ₀for forwarding messages is to G ₁node, therefore G ₁not forwarding messages, waits for and other node meets.

Suppose G ₁(0,0,1) encounters G in another moment ₃, due to G ₃not that forwarding messages is to G ₁node, and G ₃(0,1,1) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₁judge whether the message pass-through mode mod received equals 0, due to mod ≠ 0, therefore G ₁(0,0,1) judges self and G ₃the Social Characteristics F that (0,1,1) is different _s=F ₂whether be the sequence C received ^t=C ²=<F ₁, F ₂an element in >, due to F ₂for C ²=<F ₁, F ₂element, therefore a G in > ₂by sequence C ^t-s=C ^t-F _s=<F ₁, F ₂>-F ₂=<F ₁>, message pass-through mode mod=1 and the message of carrying are transmitted to G ₃.

Suppose G ₁(0,0,1) encounters G in another moment ₅, due to G ₅not that forwarding messages is to G ₁node, and G ₅(1,0,1) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₁judge whether the message pass-through mode mod received equals 0, due to mod ≠ 0, therefore G ₁(0,0,1) judges self and G ₅the Social Characteristics F that (1,0,1) is different _s=F ₁whether be the sequence C received ^t=C ²=<F ₁, F ₂an element in >, due to F ₁for C ²=<F ₁, F ₂element, therefore a G in > ₁by sequence C ^t-s=C ^t-F _s=<F ₁, F ₂>-F ₁=<F ₂>, message pass-through mode mod=1 and the message of carrying are transmitted to G ₅.

From G ₃(0,1,1) sets out, due to G ₃(0,1,1) is intermediate node, therefore performs above-mentioned steps S207-S214.

Suppose G ₃(0,1,1) at a time encounters G ₁, due to G ₁for forwarding messages is to G ₃node, therefore G ₃not forwarding messages, waits for and other node meets.

Suppose G ₃(0,1,1) encounters G in another moment ₂, due to G ₂not that forwarding messages is to G ₃node, and G ₂(0,1,0) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₃judge whether the message pass-through mode mod received equals 0, due to mod ≠ 0, therefore G ₃(0,1,1) judges self and G ₂the Social Characteristics F that (0,1,0) is different _s=F ₃whether be the sequence C received ^t=<F ₁an element in >, due to F ₃be not C ^t=<F ₁element, therefore a G in > ₃not forwarding messages, waits for and other node meets.

Suppose G ₃(0,1,1) encounters G in another moment ₇, due to G ₇not that forwarding messages is to G ₃node, and G ₇(1,1,1) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₃judge whether the message pass-through mode mod received equals 0, due to mod ≠ 0, therefore G ₃(0,1,1) judges self and G ₇the Social Characteristics F that (1,1,1) is different _s=F ₁whether be the sequence C received ^t=<F ₁an element in >, due to F ₁for C ^t=<F ₁element, therefore a G in > ₃by sequence message pass-through mode mod=1 and the message of carrying are transmitted to G ₇.

From G ₅(1,0,1) sets out, due to G ₅(1,0,1) is intermediate node, therefore performs above-mentioned steps S207-S214.

Suppose G ₅(1,0,1) at a time encounters G ₁, due to G ₁for forwarding messages is to G ₅node, therefore G ₅not forwarding messages, waits for and other node meets.

Suppose G ₅(1,0,1) encounters G in another moment ₄, due to G ₄not that forwarding messages is to G ₅node, and G ₄(1,0,0) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₅judge whether the message pass-through mode mod received equals 0, due to mod ≠ 0, therefore G ₅(1,0,1) judges self and G ₄the Social Characteristics F that (1,0,0) is different _s=F ₃whether be the sequence C received ^t=<F ₂an element in >, due to F ₃be not C ^t=<F ₂element, therefore a G in > ₅not forwarding messages, waits for and other node meets.

Suppose G ₅(1,0,1) encounters G in another moment ₇, due to G ₇not that forwarding messages is to G ₅node, and G ₇(1,1,1) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₅judge whether the message pass-through mode mod received equals 0, due to mod ≠ 0, therefore G ₅(1,0,1) judges self and G ₇the Social Characteristics F that (1,1,1) is different _s=F ₂whether be the sequence C received ^t=<F ₂an element in >, due to F ₂for C ^t=<F ₂element, therefore a G in > ₅by sequence message pass-through mode mod=1 and the message of carrying are transmitted to G ₇.

G ₃by sequence message pass-through mode mod=1 and the message of carrying are transmitted to G ₇after, from G ₇(1,1,1) sets out, due to G ₇(1,1,1) is intermediate node, therefore performs above-mentioned steps S207-S214.

Suppose G ₇(1,1,1) at a time encounters G ₃, due to G ₃for forwarding messages is to G ₇node, therefore G ₇not forwarding messages, waits for and other node meets.

Suppose G ₇(1,1,1) encounters G in another moment ₅, due to G ₅not that forwarding messages is to G ₇node, and G ₅(1,0,1) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₇judge whether the message pass-through mode mod received equals 0, due to mod ≠ 0, therefore G ₇(1,1,1) judges self and G ₅the Social Characteristics F that (1,0,1) is different _s=F ₂whether be the sequence received in an element, due to F ₂be not in element, therefore a G ₇not forwarding messages, waits for and other node meets.

Suppose G ₇(1,1,1) encounters G in another moment ₆, due to G ₆not that forwarding messages is to G ₇node, and G ₆(1,1,0) and destination node G ₆3 Social Characteristics of (1,1,0) are completely the same, therefore G ₇directly the message of carrying is transmitted to G ₆, complete source node G ₀to destination node G ₆message forwarding process.

G ₅by sequence message pass-through mode mod=1 and the message of carrying are transmitted to G ₇after, from G ₇(1,1,1) sets out, due to G ₇(1,1,1) is intermediate node, therefore performs above-mentioned steps S207-S214.

Suppose G ₇(1,1,1) at a time encounters G ₅, due to G ₅for forwarding messages is to G ₇node, therefore G ₇not forwarding messages, waits for and other node meets.

Suppose G ₇(1,1,1) encounters G in another moment ₃, due to G ₃not that forwarding messages is to G ₇node, and G ₃(0,1,1) and destination node G ₆3 Social Characteristics of (1,1,0) are not quite identical, therefore G ₇judge whether the message pass-through mode mod received equals 0, due to mod ≠ 0, therefore G ₇(1,1,1) judges self and G ₃the Social Characteristics F that (0,1,1) is different _s=F ₁whether be the sequence received in an element, due to F ₁be not in element, therefore a G ₇not forwarding messages, waits for and other node meets.

Suppose G ₇(1,1,1) encounters G in another moment ₆, due to G ₆not that forwarding messages is to G ₇node, and G ₆(1,1,0) and destination node G ₆3 Social Characteristics of (1,1,0) are completely the same, therefore G ₇directly the message of carrying is transmitted to G ₆, complete source node G ₀to destination node G ₆message forwarding process.

The method for routing of the time delay tolerant network that the present embodiment provides, message is transmitted to the neighbors run into by source node, this neighbors using with the next node of the Social Characteristics similarity of the destination node node larger than the Social Characteristics similarity of self and destination node as forwarding messages, namely progressively message is transmitted to the node similar to destination node, thus to realize Message Transmission with speed faster, to destination node, improve router efficiency.

Fig. 4 is the structural representation of a node device provided by the invention embodiment.As shown in Figure 4, the node device that the present embodiment provides is the specific executive agent of the method for routing performing above-mentioned time delay tolerant network.This node device specifically can comprise: determination module 41, first forwarding module 42 and the second forwarding module 43, wherein:

Determination module 41, the node type of node device is determined in the source for the message of carrying according to node device.

First forwarding module 42, if determine that the node type of node device is source node for determination module 41, is then transmitted to the neighbors run into by message.

Second forwarding module 43, if determine that the node type of node device is intermediate node for determination module 41, then message to be transmitted to run into except forwarding messages is to except the neighbors of node device, and other neighborss larger than the Social Characteristics similarity of node device and destination node with the Social Characteristics similarity of destination node.

Further, determination module 41 specifically may be used for:

If judge, message is that node device produces, then determine that the node type of node device is source node;

If judge, message is that neighbors is transmitted to node device, then determine that the node type of node device is intermediate node.

Further, the first forwarding module 42 specifically may be used for:

If determination module 41 determines that the node type of node device is source node, then judge that whether the Social Characteristics of the neighbors run into is consistent with the Social Characteristics of destination node;

If consistent, then message is transmitted to the neighbors run into;

If inconsistent, then the Social Characteristics F that decision node equipment is different from the neighbors run into _rwhether be self and in the individual different Social Characteristics of destination node k;

If so, then by sequence C ^r, message pass-through mode mod=0 and message is transmitted to the neighbors run into;

If not, then by sequence C ^k, message pass-through mode mod=1 and message is transmitted to the neighbors run into;

Wherein, Social Characteristics F _rbe r Social Characteristics, r is the natural number between 1 to m, and m is total number of Social Characteristics, and m is equal to, or greater than k; If r ≠ k, then C ^r=<F _r+1, F _r+2..., F _k, F ₁, F ₂..., F _r>; If r=k, then C ^r=<F ₁, F ₂..., F _k>; C ^k=<F ₁, F ₂..., F _k>.

Further, the second forwarding module 43 specifically may be used for:

If determination module 41 determines that the node type of node device is intermediate node, then judge whether the neighbors run into is that forwarding messages is to the neighbors of node device;

If not, then judge that whether the Social Characteristics of the neighbors run into is consistent with the Social Characteristics of destination node;

If consistent, then message is transmitted to the neighbors run into;

If inconsistent, then judge whether the message pass-through mode mod received equals 0;

If message pass-through mode mod equals 0, then the Social Characteristics F that decision node equipment is different from the neighbors run into _swhether be the sequence C received ^tin first element;

If so, then by sequence C ^t-s, message pass-through mode mod=0 and message is transmitted to the neighbors run into;

If message pass-through mode mod is not equal to 0, then the Social Characteristics F that decision node equipment is different from the neighbors run into _swhether be the sequence C received ^tin an element;

If so, then by sequence C ^t-s, message pass-through mode mod=1 and message is transmitted to the neighbors run into;

Wherein, Social Characteristics F _sbe s Social Characteristics, s is the natural number between 1 to m; T is the natural number between 1 to k; C ^t-sfor from sequence C ^tmiddle deletion Social Characteristics F _safter sequence.

Concrete, the detailed process that modules realizes its function see Fig. 1 or embodiment illustrated in fig. 2 in associated description, repeat no more herein.

The node device that the present embodiment provides, message is transmitted to the neighbors run into by source node, this source node using with the next node of the Social Characteristics similarity of the destination node node larger than the Social Characteristics similarity of self and destination node as forwarding messages, namely progressively message is transmitted to the node similar to destination node, thus to realize Message Transmission with speed faster, to destination node, improve router efficiency.

Fig. 5 is the structural representation of a route system embodiment of time delay tolerant network provided by the invention.As shown in Figure 5, this system comprises source node 51, destination node 52 and multiple intermediate node 53.Wherein, source node 51 and intermediate node 53 are node device as above.

The route system of the time delay tolerant network that the present embodiment provides, message is transmitted to the neighbors run into by source node, this neighbors using with the next node of the Social Characteristics similarity of the destination node node larger than the Social Characteristics similarity of self and destination node as forwarding messages, namely progressively message is transmitted to the node similar to destination node, thus to realize Message Transmission with speed faster, to destination node, improve router efficiency.

Last it is noted that above each embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to foregoing embodiments to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein some or all of technical characteristic; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the scope of various embodiments of the present invention technical scheme.

Claims (10)

1. a method for routing for time delay tolerant network, is characterized in that, comprising:

The node carrying message determines the node type of self according to the source of described message;

If described in carry message node determine that the node type of self is source node, then described message is transmitted to the neighbors run into;

If described in carry message node determine that the node type of self is intermediate node, then described message to be transmitted to run into except forwarding described message to except the neighbors of self, and other neighborss larger than the Social Characteristics similarity of self and destination node with the Social Characteristics similarity of destination node.

2. method according to claim 1, is characterized in that, described in carry message node determine according to the source of described message to be specially self node type:

If described in carry message node judge that described message is that self produces, then determine that the node type of self is source node;

If described in carry message node judge that described message is that neighbors is transmitted to self, then determine that the node type of self is intermediate node.

3. method according to claim 1 and 2, is characterized in that, if the described node carrying message determines that the node type of self is source node, then described message is transmitted to the neighbors run into, is specially:

If described in carry message node determine that the node type of self is source node, then whether the Social Characteristics of the neighbors run into described in judging consistent with the Social Characteristics of destination node;

The neighbors run into described in if described message is transmitted to by the node unanimously, then carrying message described in;

If inconsistent, then the node carrying message described in judges the Social Characteristics F that self is different from the described neighbors run into _rwhether be self and in the individual different Social Characteristics of destination node k;

If so, then described in carry the node of message by sequence C ^r, message pass-through mode mod=0 and described message be transmitted to described in the neighbors that runs into;

If not, then described in carry the node of message by sequence C ^k, message pass-through mode mod=1 and described message be transmitted to described in the neighbors that runs into;

Wherein, described Social Characteristics F _rbe r Social Characteristics, described r is the natural number between 1 to m, and described m is total number of Social Characteristics, and described m is equal to, or greater than described k; If r ≠ k, then described C ^r=<F _r+1, F _r+2..., F _k, F ₁, F ₂..., F _r>; If r=k, then described C ^r=<F ₁, F ₂..., F _k>; Described C ^k=<F ₁, F ₂..., F _k>.

4. method according to claim 3, it is characterized in that, if the described node carrying message determines that the node type of self is intermediate node, then described message to be transmitted to run into except forwarding described message to except the neighbors of self, and other neighborss larger than the Social Characteristics similarity of self and destination node with the Social Characteristics similarity of destination node, be specially:

If described in carry message node determine that the node type of self is intermediate node, then whether the neighbors run into described in judging is forward described message to the neighbors of self;

If not, then described in carry message node judge described in the Social Characteristics of neighbors that runs into whether consistent with the Social Characteristics of destination node;

The neighbors run into described in if described message is transmitted to by the node unanimously, then carrying message described in;

If inconsistent, then the node carrying message described in judges whether the described message pass-through mode mod received equals 0;

If described message pass-through mode mod equals 0, then the node carrying message described in judges the Social Characteristics F that self is different from the described neighbors run into _swhether be the sequence C received ^tin first element;

If so, then described in carry the node of message by sequence C ^t-s, described message pass-through mode mod=0 and described message be transmitted to described in the neighbors that runs into;

If described message pass-through mode mod is not equal to 0, then the node carrying message described in judges the Social Characteristics F that self is different from the described neighbors run into _swhether be the sequence C received ^tin an element;

If so, then described in carry the node of message by sequence C ^t-s, described message pass-through mode mod=1 and described message be transmitted to described in the neighbors that runs into;

Wherein, described Social Characteristics F _sbe s Social Characteristics, described s is the natural number between 1 to described m; Described t is the natural number between 1 to described k; Described C ^t-sfor from described sequence C ^tthe described Social Characteristics F of middle deletion _safter sequence.

5. method according to claim 4, is characterized in that, a described m Social Characteristics is m the Social Characteristics that in all Social Characteristics of node, entropy is maximum.

6. a node device, is characterized in that, comprising:

Determination module, the node type of described node device is determined in the source for the message of carrying according to described node device;

First forwarding module, if determine that the described node type of described node device is source node for described determination module, is then transmitted to the neighbors run into by described message;

Second forwarding module, if determine that the described node type of described node device is intermediate node for described determination module, then described message to be transmitted to run into except forwarding described message to except the neighbors of described node device, and other neighborss larger than the Social Characteristics similarity of described node device and destination node with the Social Characteristics similarity of destination node.

7. node device according to claim 6, is characterized in that, described determination module specifically for:

If judge, described message is that described node device produces, then determine that the node type of described node device is source node;

If judge, described message is that neighbors is transmitted to described node device, then determine that the node type of described node device is intermediate node.

8. the node device according to claim 6 or 7, is characterized in that, described first forwarding module specifically for:

If described determination module determines that the node type of described node device is source node, then whether the Social Characteristics of the neighbors run into described in judging is consistent with the Social Characteristics of destination node;

If consistent, then the neighbors run into described in described message being transmitted to;

If inconsistent, then judge the Social Characteristics F that described node device is different from the described neighbors run into _rwhether be self and in the individual different Social Characteristics of destination node k;

If so, then by sequence C ^r, message pass-through mode mod=0 and described message be transmitted to described in the neighbors that runs into;

If not, then by sequence C ^k, message pass-through mode mod=1 and described message be transmitted to described in the neighbors that runs into;

Wherein, described Social Characteristics F _rbe r Social Characteristics, described r is the natural number between 1 to m, and described m is total number of Social Characteristics, and described m is equal to, or greater than described k; If r ≠ k, then described C ^r=<F _r+1, F _r+2..., F _k, F ₁, F ₂..., F _r>; If r=k, then described C ^r=<F ₁, F ₂..., F _k>; Described C ^k=<F ₁, F ₂..., F _k>.

9. node device according to claim 8, is characterized in that, described second forwarding module specifically for:

If described determination module determines that the node type of described node device is intermediate node, then whether the neighbors run into described in judging is forward described message to the neighbors of described node device;

If not, then whether the Social Characteristics of the neighbors run into described in judgement is consistent with the Social Characteristics of destination node;

If consistent, then the neighbors run into described in described message being transmitted to;

If inconsistent, then judge whether the described message pass-through mode mod received equals 0;

If described message pass-through mode mod equals 0, then judge the Social Characteristics F that described node device is different from the described neighbors run into _swhether be the sequence C received ^tin first element;

If so, then by sequence C ^t-s, described message pass-through mode mod=0 and described message be transmitted to described in the neighbors that runs into;

If described message pass-through mode mod is not equal to 0, then judge the Social Characteristics F that described node device is different from the described neighbors run into _swhether be the sequence C received ^tin an element;

If so, then by sequence C ^t-s, described message pass-through mode mod=1 and described message be transmitted to described in the neighbors that runs into;

Wherein, described Social Characteristics F _sbe s Social Characteristics, described s is the natural number between 1 to described m; Described t is the natural number between 1 to described k; Described C ^t-sfor from described sequence C ^tthe described Social Characteristics F of middle deletion _safter sequence.

10. a route system for time delay tolerant network, is characterized in that, comprises source node, destination node and multiple intermediate node; Described source node and described intermediate node are the node device as described in any one of claim 6-9.