CN105307231A - Routing implementation method for delay tolerant network based on encounter probability and social analysis - Google Patents
Routing implementation method for delay tolerant network based on encounter probability and social analysis Download PDFInfo
- Publication number
- CN105307231A CN105307231A CN201510772878.1A CN201510772878A CN105307231A CN 105307231 A CN105307231 A CN 105307231A CN 201510772878 A CN201510772878 A CN 201510772878A CN 105307231 A CN105307231 A CN 105307231A
- Authority
- CN
- China
- Prior art keywords
- node
- community
- probability
- decay
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention discloses a routing implementation method for a delay tolerant network based on an encounter probability and social analysis. When a pair of nodes encounter in a DTN network, an encounter attenuation probability of the encounter nodes relative to nodes in the same community and an encounter attenuation probability of the encounter nodes relative to nodes in an external community are updated; then, updating of an encounter probability of other nodes or other communities relative to the encounter nodes or the encounter communities is carried out by utilizing the updated attenuation probability; updating of a transfer probability of the encounter nodes and other communities or other nodes is carried out; and, when a message is generated in the DTN network, a source node generates a message; the message is spread in the network; and thus, the message arrives at a destination node from the source node. According to the invention, excellent DTN social network routing is determined by utilizing a given community structure and distributed probability calculation; contributions are made for developing DTN routing and establishing practical DTN communication network routing; and simultaneously, the message delivery success rate, the transfer time delay and balance of node memories are ensured.
Description
Technical field
The present invention relates to the wireless self-organization network communications field, particularly relate to a kind of dependence chance of meeting and realize the tolerate delays network route implementation method of self-organizing network of communication.
Background technology
As the special network service of a class, namely between source node and destination node, there is not link complete, that determine, that planned in DTN (DelayTolerantNetworks) communication; But message-oriented, utilize node motion to bring to meet chance to realize the self-organizing network of communication; It has manifested huge practicality and reliability in particular surroundings (as animal migrates, region of war enemy's situation detection etc.), gets the attention and application.
In view of the problem of the delivery success rate of message in DTN network, the time delay rate of message and node memory size is more and more outstanding; Therefore, if DTN route only relies on merely node, the chance of meeting that movement brings at random realizes pass-along message between different node, and this plain mode cannot meet the requirement of DTN application.Particularly for the DTN route depending on node Social Characteristics.Social DTN route needs pass-along message in different community networks, and is delivered to as much as possible in the community network belonging to destination node.In DTN network, the high success rate of transmission of messages, the relation between low delay rate and this three of limited node memory, all propose very high requirement to the routing policy of message.So how at high success rate, find a kind of technical scheme of balance just to seem very important between low retardation rate and limited node memory.
Be compared to other social DTN routing policy, the advantage that " routing policy based on collision probability and social analysis " has it special, wherein collision probability is the historical information of meeting utilizing node, is carried out the selection of route by probability more each other; And " community structure " is one of primary circuit routing strategy of present society DTN route, the prerequisite of this routing policy divides the community of nodes, and above two kinds of tactful combinations, can realize the DTN route of better performance.
Be compared to the social routing algorithms such as label (label), " the tolerate delays network router strategy based thereon based on collision probability and social analysis " can realize higher Message Transmission success rate, lower time delay rate and the requirement to node memory also good control, substantially can be applied in any social DTN route; And for Bubble routing policy, when message is transmitted beyond object community, owing to only considered the popularity of node, thus not as " the tolerate delays network router strategy based thereon based on collision probability and social analysis ", more targetedly, the effect of realization also generally can not be better than the latter.
Summary of the invention
Based on above-mentioned prior art Problems existing, the present invention proposes a kind of tolerate delays network route implementation method based on collision probability and social analysis, in conjunction with community structure technology, this route can obtain good message dilivery success rate, lower delivery lag, and also have good control to the use of node memory.This route implementing is in social DTN application, and message is transmitted in time reliably, has well theoretical and practical value.
The invention discloses a kind of tolerate delays network route implementation method based on collision probability and social analysis, the method comprises the following steps:
DTN network comprises multiple community, and each community comprises multiple node, when a pair node meets, meets node respectively for the probability of final extinction of same community interior nodes and upgrade for the probability of final extinction of outside community described in carrying out; Next, utilize the probability of final extinction after upgrading to carry out other nodes or other communities the collision probability of described meet node or the community that meets is upgraded; And the transfer probability of meet described in carrying out node and other community or other node upgrades;
When having message to produce in DTN network, carry out the initialization of nodes: the destination node place community producing message m is defined as object community, the life span of the message of the node in outside, object community is set as T
1; The life span of the message of the node in inside, object community is set as T
2; Source node produces message, and message spreads in a network, and this diffusion comprises message and transmits in object community and message transmission three processes between outside, object community and inside, object community in the transmission of outside, object community, message; Wherein: message at the transmittance process of outside, object community is: by calculating and the collision probability for object community of more different node, be delivered to the large node of collision probability by the node that collision probability is little; And message at the transmittance process of inside, object community is: by calculating and comparing the collision probability of object community interior nodes for destination node, then be delivered to the large node of probability by the node that collision probability is little; Achieve message and arrive destination node from source node; Message transmittance process between outside, object community and inside, object community is: the object community external node and the object community internal node that carry message meet, and so this message can be delivered to inside, object community from outside, object community; If carry the object community internal node of message and object community external node meets, so message will can not be transmitted certainly.
The step that described message spreads in a network, specifically comprises following process:
If the source node producing message is outside in object community, so it at most can to the copy of other node diffusion n part message; If the message number of source node diffusion reaches n part, so delete the message of source node; If the life span of the message in source node is more than T
1even if the message number of so source node diffusion does not reach n part, same message of deleting source node; If source node is inner in object community, so to the number not requirement of source node flood message; But, if the message life span in source node is more than T
2time, namely delete the message of source node.
Described probability of final extinction upgrades, and specifically comprises following process:
On time dimension, equally spaced time slot τ will be divided into the time, the sheet number of time slot τ that node will experience between meeting according to twice, upgrade the probability of final extinction of oneself.
When there being node x in network, when y meets, for node x, the node that meets needs to upgrade the probability of final extinction with outside community on the one hand, as shown in formula (1):
P
meet (x, L) oldfor community L external node x, before y meets, the collision probability of node x and community L; P
decay (x, L)for node x, after y meets, the probability of final extinction that the node x obtained and community L meets; P
meet (y, L) oldfor community L external node x, before y meets, the collision probability of node y and community L; P
decay (y, L)for node x, after y meets, the probability of final extinction that the node y obtained and community L meets; γ is decay factor; K is the time feeler number experienced till now after meeting with other node in a network node x or the y last time;
Need the probability of final extinction upgraded and in same community, other node meets on the other hand, as shown in formula (2):
P
meet (x, i) oldfor node x, before i meets, node x is to the collision probability of same community interior nodes i; P
decay (x, i)for node x, after y meets, the probability of final extinction that node x and node meet; P
meet (y, i) oldfor node x, before i meets, node y is to the collision probability of same community interior nodes i; P
decay (y, i)for node x, after y meets, the probability of final extinction that node y and node meet; γ is decay factor; K is the time feeler number experienced till now after meeting with other node in a network node x or the node y last time; Node i is other nodes of same community, comprises meet node y, x or node x, y.
The probability updating of inside, same community, node x, for collision probability upgrades between y; In node x, y and community, other node z is that transfer probability upgrades; Specifically comprise following process:
If a pair node x met, y belongs to same community L, and so node x, y will upgrade the collision probability with other node in community in the following manner:
First node x/ node y upgrades the probability of final extinction with other node in community according to formula (2); The collision probability of following more new node x/ node y and the node y/ node x that meets, as shown in formula (4):
Wherein P
init_dthe initialization collision probability of community's internal node, P
decay (x, i)for node x, after y meets, node x and community L interior joint i, the i.e. probability of final extinction of node y; P
meet (x, i) newbe after node meets, the node x obtained is to the collision probability of node y; P
decay (y, i)for node x, after y meets, node y and community L interior joint i, the i.e. probability of final extinction of node x; P
meet (y, i) newbe after node meets, the node y obtained is to the collision probability of node x;
Then, computing node x needs to upgrade the transfer probability for other node in community L; After node x/ node y have updated the probability of final extinction met with node z, if P
decay (x, z)=P
decay (y, z), so the probability updating of this node completes.If P
decay (x, z)≠ P
decay (y, z), suppose P
decay (x, z)>P
decay (y, z), at this moment node x no longer carries out upgrading for the transfer probability of node z, and node y carries out upgrading for the transfer probability of node z according to formula (5) again:
P
transmit (y, z) new=P
decay (y, z)+ (1-P
decay (y, z)) * β (5)
Wherein β is transmission factor; P
transmit (y, z) newafter node y carries out probability updating again, with the transfer probability of arbitrary node z in community L; P
decay (y, z)for node x, after y meets, the probability of final extinction that in the node y obtained and community L, arbitrary node z meets.
Meet the probability updating of community, specifically comprises following process:
If a pair node x met, y belongs to different communities, and so node x, y will upgrade the collision probability with community each other in the following manner;
Node x (node y) carries out probability of final extinction renewal according to formula (1) to the affiliated community of node y (node x), then, node x (node y) upgrades the collision probability of community L belonging to itself and node y (node x) according to formula (6):
P
meet (x, L) new=P
decay (x, L)+ (1-P
decay (x, L)) * P
init_L(6)
P
meet (y, L) new=P
decay (y, L)+ (1-P
decay (y, L)) * P
init_L
Wherein: P
meet (x, L) newnode x, after y meets, the collision probability of node x and community L; P
decay (x, L)node x, after y meets, the probability of final extinction that node x meets to community L; : P
meet (y, L) newnode x, after y meets, the collision probability of node y and community L; P
decay (y, L)node x, after y meets, the probability of final extinction that node y meets to community L; Pinit_L is the initialization collision probability of community's external node for this community.
The transfer probability of outside, community upgrades, and specifically comprises following process:
Described transfer probability step of updating specifically comprises following process: if meet node x, y are all outside at some community L, to have updated separately and after the probability of final extinction of community L, if P at node x, y
decay (x, L)=P
decay (y, L), so the transfer probability of this node has upgraded; If P
decay (x, L)≠ P
decay (y, L), suppose P
decay (x, L)>P
decay (y, L), so, at this moment node x no longer carries out transfer probability renewal, and node y carries out upgrading the transfer probability of community L according to formula (3-1), (3-2) again:
P
transmit (y, L) new=P
decay (y, L)+ (1-P
decay (y, L)) * P
decay (x, L)* β (3-1)
Wherein β is transmission factor, P
transmit (y, L) newafter node y carries out transfer probability renewal again, with the transfer probability of community L; P
decay (y, L) isnode x, after y meets, the probability of final extinction that node y and community L meets; P
decay (x, L)for node x, after y meets, the probability of final extinction that the node x obtained and community L meets;
In addition: if P
decay (x, L)≠ P
decay (y, L), suppose P
decay (x, L)<P
decay (y, L), so, at this moment node y no longer carries out transfer probability renewal, and node x carries out upgrading the transfer probability of community L according to formula (3) again:
P
transmit (x, L) new=P
decay (x, L)+ (1-P
decay (x, L)) * P
decay (y, L)* β (3-2)
Wherein β is transmission factor, P
transmit (x, L) newafter node x carries out transfer probability renewal again, with the transfer probability of community L; P
decay (y, L)for node x, after y meets, the probability of final extinction that the node y obtained and community L meets; P
decline subtract (x, L)for node x, after y meets, the probability of final extinction that the node x obtained and community L meets;
Same, node x, y need to upgrade the transfer probability to other all outside community except community belonging to self.
The present invention is by the community structure of DTN network, and probability transmission and the feature of message dissemination combine, and determines a kind of based on collision probability, postpones tolerable community network route.The historical information that the design meets for Social Characteristics and the node of DTN network node, the development for DTN community network route provides a kind of technical support newly, has also expanded the scope of application of DTN community network comparatively widely simultaneously.The thinking of this design also can be applied to other DTN network route simultaneously.The design given community structure and distributed probability calculation, determine outstanding DTN community network route, for the development of DTN route, be transferred to social transmission from the inundation of message and provide strong support, ensure that message dilivery success rate simultaneously, delivery lag, the balance of node memory, for the DTN telecommunication network route setting up " practicality " has made contribution.
Accompanying drawing explanation
Fig. 1 is the delay tolerable community network route matrix based on the information of meeting;
Fig. 2 is initialization and upgrades the flow chart of the probability of the node that meets;
Fig. 3 is the flow chart whether decision node can carry out the transmission of message;
Fig. 4 is the flow chart of the message dissemination mode of source node;
Fig. 5 is the flow chart whether message existed in decision node exceedes life span;
Fig. 6 is the flow chart of the route transfer mode of message;
Fig. 7 is the preferred forms schematic diagram of the tolerate delays network route based on collision probability and social analysis.
Embodiment
Below in conjunction with accompanying drawing, the specific embodiment of the present invention is described in detail, if these execution modes exist exemplary content, should not be construed to limitation of the present invention.
Meanwhile, " the tolerate delays network router strategy based thereon based on collision probability and social analysis ", in order to improve Message Transmission success rate further, reduce time delay, have employed many copies routing policy of restriction copy amount in the message dissemination stage; Although it is also proposed higher requirement to the size of node memory, but the transmitting more of the tolerate delays network route based on collision probability and social analysis can be realized.
In order to assess using the routing policy of community structure, adopt message dilivery success rate, Message Transmission time delay, node memory uses percentage and the total jumping figure of message four kinds of evaluation criterions, compares their superiority-inferiority.
The tolerate delays network route matrix based on collision probability and social analysis as shown in Figure 1, can be divided into two aspects:
When a pair node meets, (a pair node here comprises three kinds of situations, namely a pair node belonging to outside, a certain community, a pair node belonging to different community and belong to a pair node of same community) time, the node met needs the probability met upgraded for other community and other node, comprising: upgrade for the probability of final extinction met of same community node and the probability of final extinction met for outside community node; Upgrade the collision probability with meet node or the community that meets; Upgrade the transfer probability with other community or other node;
When there being message to produce in network, source node produces message, message spreads in a network, and this diffusion comprises that message is transmitted outside object community, message is transmitted in object community and message transmission three main process in object community between outside and inside, object community.Wherein: message at the transmittance process of outside, object community is: by calculating and the collision probability for object community of more different node, be delivered to the large node of probability by the node that probability is little; And message at the transmittance process of inside, object community is: by calculating and comparing the collision probability of object community interior nodes for destination node, then be delivered to the large node of probability by the node that probability is little; Achieve message and arrive destination node from source node.The concrete handling process of this part comprises the following steps:
The initialization of step 1, nodes: when producing message m in network, is defined as object community by the destination node place community producing message m; The life span of the message m produced by the node in outside, object community is set as; The life span of the message m produced by the node in inside, object community is set as;
The message dissemination mode of step 2, source node s: if the source node s producing message m is outside at object community L, so it at most can to the copy of other node diffusion n part message; If the message number that source node s spreads reaches n part, so delete the message m of source node; If the life span of the message m in source node exceedes, even if the message number of so source node diffusion does not reach n part, same message m of deleting source node;
If source node s is inner at object community L, so to the number not requirement of source node flood message m; But, if when the message m life span in source node s exceedes, namely delete the message m of source node;
Step 3, object community external node carry message m, meet with another external node y:
The node met first carries out collision probability renewal, judges whether the transmission carrying out message subsequently again; After the node updates probability that meets producing message m, first node x can judge whether message m wherein exceedes life span, if exceeded, then can not carry out the exchange of any message between node, and node x deletes message m;
If the message m in node x does not exceed life span, then need decision node y whether to mark and received message m.If node y mark received message m, the exchange of any information between the node met so specifically, can not be carried out; Further, need to judge whether message m is also stored in node y, if message m is still stored in node y, so judge whether message m has exceeded life span, exceed the message m of then deleting in y;
If node y does not have labeled message m, so node x, y compare the collision probability with object community L, if P
meet (x, L)<P
meet (y, L), then message m is sent to node y by node x, and node x deletes message m.
Step 4, object community external node x carry message m, meet with object community internal node y:
First node x can judge whether message m wherein exceedes life span, if exceeded, then node x deletes message m; And the transmission of message can not be carried out;
If the message m in node x does not exceed life span, then need decision node y whether to mark and received message m.If node y mark received message m, the transmission of any information between the node so met first specifically, can not be carried out; Secondly, judge whether message m is also stored in node y.If message m is still stored in node y, so judge whether message m has exceeded life span, exceed the message m in then deletion of node y; Otherwise message m is stayed in the continuation of insurance of node y relaying;
If node y does not have labeled message m, then message m is sent to node y by node x; Then, node x deletes message m.
Step 5, carry the object community internal node x of message m, meet with any node y of inside, object community:
First node x can judge whether the message m stored exceedes life span, if exceeded, then node x deletes message m; And the transmission of message can not be carried out.
If the message m in node x does not exceed life span, then need decision node y whether to mark and received message m.If node y mark received message m, met so specifically and can not carry out the transmission of any information; Secondly, judge whether message m is also stored in node y.If message m is still stored in node y, so judge whether message m has exceeded life span, exceed the message m of then deleting in y.
If node y does not have labeled message m, so node x, y compare the collision probability with destination node d, if P
meet (x, d)<P
meet (y, d), then message m is sent to node y by node x.
Described probability of final extinction step of updating specifically comprises following process: on time dimension, will be divided into equally spaced time slot the time, the sheet number of time slot that node will experience between meeting according to twice, upgrades the probability of final extinction of oneself.Such as: when there being node x in network, when y meets, for node x, the node that meets needs to upgrade the probability of final extinction with outside community on the one hand, as shown in formula (1):
P
decay (x, L)=P
meet (x, L) old* γ
k(1)
P
meet (x, L) oldfor community L external node x, before y meets, the collision probability of node x and community L; P
decay (x, L) fornode x, after y meets, the probability of final extinction that the node x obtained and community L meets; γ is decay factor; K is the time feeler number experienced till now after meeting with other node in a network the node x last time;
Need the probability of final extinction upgraded and in same community, other node meets on the other hand, as shown in formula (2):
P
decay (x, i)=P
meet (x, i) old* γ
k(2)
P
meet (x, i) oldfor node x, before i meets, node x is to the collision probability of same community interior nodes i; P
decay (x, i)for node x, after y meets, the probability of final extinction that node x and node meet; γ is decay factor; K is the time feeler number experienced till now after meeting with other node in a network the node x last time; Node i is other nodes of same community, comprises the node y that meets.
Described transfer probability step of updating specifically comprises following process: if meet node x, y are all outside at some community L, to have updated separately and after the probability of final extinction of community L, if P at node x, y
decay (x, L)=P
decay (y, L), so the transfer probability of this node has upgraded; If P
decay (x, L)≠ P
decay (y, L), suppose P
decay (x, L)>P
decay (y, L), so, at this moment node x no longer carries out transfer probability renewal, and node y carries out upgrading the transfer probability of community L according to formula (3) again:
P
transmit (y, L) new=P
decay (y, L)+ (1-P
decay (y, L)) * P
decay (x, L)* β (3-1)
Wherein β is transmission factor, P
transmit (y, L) newafter node y carries out transfer probability renewal again, with the transfer probability of community L; P
decay (y, L) isnode x, after y meets, the probability of final extinction that node y and community L meets; P
decay (x, L) isnode x, after y meets, the probability of final extinction that the node x obtained and community L meets;
In addition: if P
decay (x, L)≠ P
decay (y, L), suppose P
decay (x, L)<P
decay (y, L), so, at this moment node y no longer carries out transfer probability renewal, and node x carries out upgrading the transfer probability of community L according to formula (3) again:
P
transmit (x, L) new=P
decay (x, L)+ (1-P
decay (x, L)) * P
decay (y, L)* β (3-2)
Wherein β is transmission factor, P
transmit (x, L) newafter node x carries out transfer probability renewal again, with the transfer probability of community L; P
decay (y, L) isnode x, after y meets, the probability of final extinction that the node y obtained and community L meets; P
decay (x, L) fornode x, after y meets, the probability of final extinction that the node x obtained and community L meets;
Same, node x, y need to upgrade the transfer probability to other all outside community except community belonging to self, namely for all outside communities, consider the renewal whether carrying out transfer probability.
Described collision probability step of updating specifically comprises following process:
(1) if a pair node x met, y belongs to same community L, and so node x, y will upgrade the collision probability with other node in community in the following manner:
First node x upgrades the probability of final extinction with other node in community according to formula (2); The collision probability of following more new node x and the node y that meets, as shown in formula (4):
P
meet (x, i) new=P
decay (x, i)+ (1-P
decay (x, i)) * P
init_d(4)
Wherein the initialization collision probability of community's internal node, P
decay (x, i)for node x, after y meets, the probability of final extinction that node y and community L interior joint i meets; P
decay (x, i)for node x, after y meets, the probability of final extinction that node x and community L interior joint i meets.
Then, computing node x needs to upgrade the transfer probability for other node in community L.Here illustrate for the arbitrary node z in the L of same community.
After have updated at node x, y the probability of final extinction met with node z, if P
decay (x, z)=P
decay (y, z), so the probability updating of this node completes.If P
decay (x, z)≠ P
decay (y, z), suppose P
decay (x, z)>P
decay (y, z), at this moment node x no longer carries out upgrading for the transfer probability of node z, and node y carries out upgrading for the transfer probability of node z according to formula (5) again:
P
transmit (y, z) new=P
decay (y, z)+ (1-P
decay (y, z)) * β (5)
Wherein β is transmission factor, between transmission factor (0,1).Be 0.5 according to the best value of emulation experiment; P
transmit (y, z) newafter node y carries out transfer probability renewal again, with the transfer probability of arbitrary node z in community L; P
decay (y, z)for node x, after y meets, the probability of final extinction that in the node y obtained and community L, arbitrary node z meets;
(2) if a pair node x met, y belongs to different communities, and so node x, y will upgrade the collision probability with community each other in the following manner.
Here still just for node x.First node x carries out probability of final extinction renewal according to formula (1) to community belonging to node y.Then, node x upgrades the collision probability of community L belonging to itself and node y according to formula (6):
P
meet (x, L) new=P
decay (x, L)+ (1-P
decay (x, L)) * P
init_L(6)
Wherein: P
meet (x, L) newnode x, after y meets, the collision probability of node x and community L; P
decay (x, L)node x, before y meets, the probability of final extinction that node x meets to community L; P
init_Lthe initialization collision probability of community's external node for this community.
As shown in Figure 7, the most preferred embodiment of the tolerate delays network route based on collision probability and social analysis of the present invention:
(1) collision probability of oneself is upgraded between the node first met in network each other;
(2) source node produces message m, carries out the diffusion of message in a network;
(3) message m is transmitted in a network, and message is at object community external node x, and x runs into does not have labeled message m, and meet with object community general larger node y simultaneously, then by Message Transmission to node y; Message m in deletion of node x;
(4) node y runs into the community internal node z not having labeled message m, then node y by Message Transmission to node z; Message m simultaneously in deletion of node y;
(5) node z runs into the object community node p not having labeled message m, and node p and destination node have larger collision probability, then node z by Message Transmission to node p;
(6) node p runs into destination node d, then message m is passed to destination node; Delete in network simultaneously, except destination node, all message m.
Claims (6)
1., based on a tolerate delays network route implementation method for collision probability and social analysis, it is characterized in that, the method comprises the following steps:
DTN network comprises multiple community, and each community comprises multiple node, when a pair node meets, meets node respectively for the probability of final extinction of same community interior nodes and upgrade for the probability of final extinction of outside community described in carrying out; Next, utilize the probability of final extinction after upgrading to carry out other nodes or other communities the collision probability of described meet node or the community that meets is upgraded; And the transfer probability of meet described in carrying out node and other community or other node upgrades;
When having message to produce in DTN network, carry out the initialization of nodes: the destination node place community producing message m is defined as object community, the life span of the message of the node in outside, object community is set as T
1; The life span of the message of the node in inside, object community is set as T
2; Source node produces message, and message spreads in a network, and this diffusion comprises message and transmits in object community and message transmission three processes between outside, object community and inside, object community in the transmission of outside, object community, message; Wherein: message at the transmittance process of outside, object community is: by calculating and the collision probability for object community of more different node, be delivered to the large node of collision probability by the node that collision probability is little; And message at the transmittance process of inside, object community is: by calculating and comparing the collision probability of object community interior nodes for destination node, then be delivered to the large node of probability by the node that collision probability is little; Achieve message and arrive destination node from source node; Message transmittance process between outside, object community and inside, object community is: the object community external node and the object community internal node that carry message meet, and so this message can be delivered to inside, object community from outside, object community; If carry the object community internal node of message and object community external node meets, so message will can not be transmitted certainly.
2. a kind of tolerate delays algorithm network routing based on collision probability and social analysis as claimed in claim 1, is characterized in that the step that described message spreads in a network specifically comprises following process:
If the source node producing message is outside in object community, so it at most can to the copy of other node diffusion n part message; If the message number of source node diffusion reaches n part, so delete the message of source node; If the life span of the message in source node is more than T
1even if the message number of so source node diffusion does not reach n part, same message of deleting source node; If source node is inner in object community, so to the number not requirement of source node flood message; But, if the message life span in source node is more than T
2time, namely delete the message of source node.
3. a kind of tolerate delays network route implementation method based on collision probability and social analysis as claimed in claim 1, it is characterized in that, described probability of final extinction upgrades, and specifically comprises following process:
On time dimension, equally spaced time slot τ will be divided into the time, the sheet number of time slot τ that node will experience between meeting according to twice, upgrade the probability of final extinction of oneself.
When there being node x in network, when y meets, for node x, the node that meets needs to upgrade the probability of final extinction with outside community on the one hand, as shown in formula (1):
P
meet (x, L) oldfor community L external node x, before y meets, the collision probability of node x and community L; P
decay (x, L)for node x, after y meets, the probability of final extinction that the node x obtained and community L meets; P
meet (y, L) oldfor community L external node x, before y meets, the collision probability of node y and community L; P
decay (y, L)for node x, after y meets, the probability of final extinction that the node y obtained and community L meets; γ is decay factor; K is the time feeler number experienced till now after meeting with other node in a network node x or the y last time;
Need the probability of final extinction upgraded and in same community, other node meets on the other hand, as shown in formula (2):
P
meet (x, i) oldfor node x, before i meets, node x is to the collision probability of same community interior nodes i; P
decay (x, i)for node x, after y meets, the probability of final extinction that node x and node meet; P
meet (y, i) oldfor node x, before i meets, node y is to the collision probability of same community interior nodes i; P
decay (y, i)for node x, after y meets, the probability of final extinction that node y and node meet; γ is decay factor; K is the time feeler number experienced till now after meeting with other node in a network node x or the node y last time; Node i is other nodes of same community, comprises meet node y, x or node x, y.
4. a kind of tolerate delays network route implementation method based on collision probability and social analysis as claimed in claim 1, it is characterized in that, the probability updating of inside, same community, node x, is that collision probability upgrades between y; In node x, y and community, other node z is that transfer probability upgrades; Specifically comprise following process:
If a pair node x met, y belongs to same community L, and so node x, y will upgrade the collision probability with other node in community in the following manner:
First node x/ node y upgrades the probability of final extinction with other node in community according to formula (2); The collision probability of following more new node x/ node y and the node y/ node x that meets, as shown in formula (4):
Wherein P
init_dthe initialization collision probability of community's internal node, P
decay (x, i)for node x, after y meets, node x and community L interior joint i, the i.e. probability of final extinction of node y; P
meet (x, i) newbe after node meets, the node x obtained is to the collision probability of node y; P
decay (y, i)for node x, after y meets, node y and community L interior joint i, the i.e. probability of final extinction of node x; P
meet (y, i) newbe after node meets, the node y obtained is to the collision probability of node x;
Then, computing node x needs to upgrade the transfer probability for other node in community L; After node x/ node y have updated the probability of final extinction met with node z, if P
decay (x, z)=P
decay (y, z), so the probability updating of this node completes.If P
decay (x, z)≠ P
decay (y, z), suppose P
decay (x, z)>P
decay (y, z), at this moment node x no longer carries out upgrading for the transfer probability of node z, and node y carries out upgrading for the transfer probability of node z according to formula (5) again:
P
transmit (y, z) new=P
decay (y, z)+ (1-P
decay (y, z)) * β (5)
Wherein β is transmission factor; P
transmit (y, z) newafter node y carries out probability updating again, with the transfer probability of arbitrary node z in community L; P
decay (y, z)for node x, after y meets, the probability of final extinction that in the node y obtained and community L, arbitrary node z meets.
5. a kind of tolerate delays network route implementation method based on collision probability and social analysis as claimed in claim 1, is characterized in that the probability updating of the community that meets specifically comprises following process:
If a pair node x met, y belongs to different communities, and so node x, y will upgrade the collision probability with community each other in the following manner;
Node x (node y) carries out probability of final extinction renewal according to formula (1) to the affiliated community of node y (node x), then, node x (node y) upgrades the collision probability of community L belonging to itself and node y (node x) according to formula (6):
P
meet (x, L) new=P
decay (x, L)+ (1-P
decay (x, L)) * P
init_L(6)
P
meet (y, L) new=P
decay (y, L)+ (1-P
decay (y, L)) * P
init_L
Wherein: P
meet (x, L) newnode x, after y meets, the collision probability of node x and community L; P
decay (x, L)node x, after y meets, the probability of final extinction that node x meets to community L; : P
meet (y, L) newnode x, after y meets, the collision probability of node y and community L; P
decay (y, L)node x, after y meets, the probability of final extinction that node y meets to community L; P
init_Lthe initialization collision probability of community's external node for this community.
6. a kind of tolerate delays network route implementation method based on collision probability and social analysis as claimed in claim 1, it is characterized in that, the transfer probability of outside, community upgrades, and specifically comprises following process:
Described transfer probability step of updating specifically comprises following process: if meet node x, y are all outside at some community L, to have updated separately and after the probability of final extinction of community L, if P at node x, y
decay (x, L)=P
decay (y, L), so the transfer probability of this node has upgraded; If P
decay (x, L)≠ P
decay (y, L), suppose P
decay (x, L)>P
decay (y, L), so, at this moment node x no longer carries out transfer probability renewal, and node y carries out upgrading the transfer probability of community L according to formula (3-1), (3-2) again:
P
transmit (y, L) new=P
decay (y, L)+ (1-P
decay (y, L)) * P
decay (x, L)* β (3-1)
Wherein β is transmission factor, P
transmit (y, L) newafter node y carries out transfer probability renewal again, with the transfer probability of community L; P
decay (y, L) isnode x, after y meets, the probability of final extinction that node y and community L meets; P
decay (x, L)for node x, after y meets, the probability of final extinction that the node x obtained and community L meets;
In addition: if P
decay (x, L)≠ P
decay (y, L), suppose P
decay (x, L)<P
decay (y, L), so, at this moment node y no longer carries out transfer probability renewal, and node x carries out upgrading the transfer probability of community L according to formula (3) again:
P
transmit (x, L) new=P
decay (x, L)+ (1-P
decay (x, L)) * P
decay (y, L)* β (3-2)
Wherein β is transmission factor, P
transmit (x, L) newafter node x carries out transfer probability renewal again, with the transfer probability of community L; P
decay (y, L)for node x, after y meets, the probability of final extinction that the node y obtained and community L meets; P
decline subtract (x, L)for node x, after y meets, the probability of final extinction that the node x obtained and community L meets;
Same, node x, y need to upgrade the transfer probability to other all outside community except community belonging to self.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510772878.1A CN105307231B (en) | 2015-11-12 | 2015-11-12 | Tolerance delay network route implementation method based on collision probability and social analysis |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510772878.1A CN105307231B (en) | 2015-11-12 | 2015-11-12 | Tolerance delay network route implementation method based on collision probability and social analysis |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105307231A true CN105307231A (en) | 2016-02-03 |
| CN105307231B CN105307231B (en) | 2019-04-09 |
Family
ID=55203854
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510772878.1A Expired - Fee Related CN105307231B (en) | 2015-11-12 | 2015-11-12 | Tolerance delay network route implementation method based on collision probability and social analysis |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105307231B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106028415A (en) * | 2016-04-27 | 2016-10-12 | 浙江工商大学 | Routing method of delay tolerant network for applications of Internet of Things |
| CN106102118A (en) * | 2016-08-08 | 2016-11-09 | 北京理工大学 | Effectively support the movable random D2D network route method of service quality |
| CN106255170A (en) * | 2016-08-08 | 2016-12-21 | 北京理工大学 | A kind of movable random D2D network data query method based on minimal-overhead path |
| CN108429678A (en) * | 2018-04-12 | 2018-08-21 | 中国人民解放军火箭军工程大学 | A kind of EER Routing Protocols contacting information and TTL based on history |
| CN108882257A (en) * | 2018-04-09 | 2018-11-23 | 长安大学 | Adaptive chance retransmission method in vehicular ad hoc network based on collision probability |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100265951A1 (en) * | 2007-12-17 | 2010-10-21 | Norihito Fujita | Routing method and node |
| CN102572941A (en) * | 2011-12-12 | 2012-07-11 | 华中科技大学 | Buffer zone managing method in mobile delay tolerant network based on probabilistic routing |
| CN103297343A (en) * | 2013-05-17 | 2013-09-11 | 华中科技大学 | Routing method based on delay tolerant network |
| CN103546377A (en) * | 2013-10-14 | 2014-01-29 | 南京邮电大学 | Method for transmitting data of delay tolerant network on basis of improved transmission probability estimation |
-
2015
- 2015-11-12 CN CN201510772878.1A patent/CN105307231B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100265951A1 (en) * | 2007-12-17 | 2010-10-21 | Norihito Fujita | Routing method and node |
| CN102572941A (en) * | 2011-12-12 | 2012-07-11 | 华中科技大学 | Buffer zone managing method in mobile delay tolerant network based on probabilistic routing |
| CN103297343A (en) * | 2013-05-17 | 2013-09-11 | 华中科技大学 | Routing method based on delay tolerant network |
| CN103546377A (en) * | 2013-10-14 | 2014-01-29 | 南京邮电大学 | Method for transmitting data of delay tolerant network on basis of improved transmission probability estimation |
Non-Patent Citations (1)
| Title |
|---|
| 涂仲秋: "移动容迟网络中基于节点递交概率和消息冗余的路由策略研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106028415A (en) * | 2016-04-27 | 2016-10-12 | 浙江工商大学 | Routing method of delay tolerant network for applications of Internet of Things |
| CN106028415B (en) * | 2016-04-27 | 2019-06-18 | 浙江工商大学 | A kind of Delay Tolerant Network method for routing of internet of things oriented application |
| CN106102118A (en) * | 2016-08-08 | 2016-11-09 | 北京理工大学 | Effectively support the movable random D2D network route method of service quality |
| CN106255170A (en) * | 2016-08-08 | 2016-12-21 | 北京理工大学 | A kind of movable random D2D network data query method based on minimal-overhead path |
| CN106255170B (en) * | 2016-08-08 | 2019-03-26 | 北京理工大学 | A kind of movable random D2D network data query method based on minimal-overhead path |
| CN108882257A (en) * | 2018-04-09 | 2018-11-23 | 长安大学 | Adaptive chance retransmission method in vehicular ad hoc network based on collision probability |
| CN108882257B (en) * | 2018-04-09 | 2019-04-09 | 长安大学 | Adaptive chance retransmission method in vehicular ad hoc network based on collision probability |
| CN108429678A (en) * | 2018-04-12 | 2018-08-21 | 中国人民解放军火箭军工程大学 | A kind of EER Routing Protocols contacting information and TTL based on history |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105307231B (en) | 2019-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | Adaptive repair algorithm for TORA routing protocol based on flood control strategy | |
| Chen et al. | Cross-layer design for data accessibility in mobile ad hoc networks | |
| CN105307231A (en) | Routing implementation method for delay tolerant network based on encounter probability and social analysis | |
| Lenando et al. | Epsoc: Social-based epidemic-based routing protocol in opportunistic mobile social network | |
| Marwaha et al. | A novel routing protocol using mobile agents and reactive route discovery for ad hoc wireless networks | |
| CN105848247A (en) | Vehicular Ad Hoc network self-adaption routing protocol method | |
| CN105577547A (en) | Multi-Qos based route selection method in mobile self-organizing network | |
| CN103118412A (en) | Trust-based on-demand multipath vector routing algorithm of Ad Hoc network | |
| Zhang et al. | An efficient hop count routing protocol for wireless ad hoc networks | |
| Zuo et al. | A hybrid multi-path routing algorithm for industrial wireless mesh networks | |
| CN101800692A (en) | Wireless sensor network geographic location route addressing method based on Hull tree | |
| US20130148658A1 (en) | Systems and methods for scalable multicast communication using self-rooted forwarding trees | |
| Bendale et al. | Study of various routing protocols in mobile ad-hoc networks | |
| Wang et al. | ARAG: A routing algorithm based on incentive mechanisms for DTN with nodes’ selfishness | |
| Liang et al. | A dynamic source routing protocol based on path reliability and link monitoring repair | |
| CN109511151A (en) | The network-building method and communication means of star networking | |
| Banerjee et al. | Expected residual lifetime based ad hoc on-demand multipath routing protocol (ERL-AOMDV) in mobile ad hoc networks | |
| Xu et al. | Efficient opportunistic routing with social context awareness for distributed mobile social networks | |
| Wang et al. | Opportunistic protocol based on social probability and resources efficiency for the intelligent and connected transportation system | |
| Pham et al. | Geographical awareness hybrid routing protocol in mobile ad hoc networks | |
| Ren et al. | Epidemic routing based on adaptive compression of vectors: efficient low‐delay routing for opportunistic networks based on adaptive compression of vectors | |
| Ayub et al. | Resource refrain quota based routing protocol for delay tolerant network | |
| Pal et al. | Trust calculation and route discovery for delay tolerant networks | |
| Beniwal et al. | MM-SPEED: Multipath multi-speed routing protocol in 6LoWPAN networks | |
| Patra et al. | Effect of gossiping on some basic wireless sensor network protocols |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190409 Termination date: 20201112 |