CN107171962A - A kind of delay-tolerant network method for routing based on optimal control information generating method - Google Patents
A kind of delay-tolerant network method for routing based on optimal control information generating method Download PDFInfo
- Publication number
- CN107171962A CN107171962A CN201710415764.0A CN201710415764A CN107171962A CN 107171962 A CN107171962 A CN 107171962A CN 201710415764 A CN201710415764 A CN 201710415764A CN 107171962 A CN107171962 A CN 107171962A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- network
- control information
- submission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
- H04L45/245—Link aggregation, e.g. trunking
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention is to provide a kind of delay-tolerant network method for routing based on optimal control information generating method.(1) communicated between node and control centre；The mode that control centre sends optimal control information to node is to use satellite as via node to be broadcasted, and it is the chance link by node motion progress message relaying that node sends message-submission situation to control centre；(2) inter-node communication；During inter-node communication, message transmission is carried out using many copy modes.When carrying out message transmission for existing DTN routing policies, the unbalanced environment of resource-constrained or resource is not considered.Meanwhile, also global network state is not judged so that global network state and routing policy are difficult to the target agreed.The present invention proposes a kind of resource-constrained DTN routing policies RC RP based on OCIGM.
Description
Technical field
The present invention relates to a kind of delay-tolerant network (DTN) method for routing, relate generally to a kind of based on optimal control
The DTN method for routing of information generating method.
Background technology
For architecture such as OSI Reference Model, Internet architectures, mobile ad-hoc network etc. of legacy network
Situations such as mainly solving that propagation delay time is small, error rate is low, there is link between node.But in disaster scene, remote districts etc.
Under network environment, these traditional architectures will be no longer applicable.However, propagation delay time is big, error rate is high, the net such as resource-constrained
Network environment is more universal；DTN appearance solves as above problem well.DTN is a kind of new network, and it is different from traditional net
Network, with high latency, high error rate, low transfer rate, may be not present the characteristic such as connecting path end to end.
In view of DTN many characteristics, the mode of legacy network " Store and forword " can not meet its communication, it, which is used, " deposits
Node in the route pattern of storage-carrying-forwarding ", network will always before suitable via node or destination node is found
Carry message, and message relays to another node by a node always, unless the message reach destination node or by
Abandon.Therefore, the communication of DTN interior joints is mainly by the movement of node, using the connected component that function in network is intact, to the greatest extent
Maximum possible is by message-submission to destination node.DTN is in order to realize " storage-carrying-forwarding ", on conventional network transfer layer
One Bundle layers of framework, so that the route pattern of traditional " Store and forword " be converted to " storage-carrying-forwarding "
Route pattern, to adapt to high latency, high error rate, the network environment without end-to-end access path.
Rational DTN routing policies can utilize resource limited in DTN, and carrying out message according to certain forwarding strategy turns
Hair so that while network overhead is not increased, improves the successful delivery of probability of message in network.But current DTN routes
Strategy also exists many not enough, and it is mainly directed towards the unrestricted environment of resources in network, consider resources in network it is limited or
The unbalanced situation of resource；Meanwhile, when carrying out message forwarding, message forwarding success rate is relatively low and network overhead is larger.Cause
This, needs a kind of DTN routing policies towards limited resources of proposition badly, makes it according to the limited situation and distribution situation of resource,
Implement the forwarding of message.For problem above, the resource-constrained DTN routing policies of OCIGM, the route plan are based on set forth herein one kind
Trunk node selection can be slightly carried out using local nodes resource, and copy control is carried out according to optimal control information, so as to reach
To the overall performance preferably purpose of network.
Document《Dynamic Replication and Forwarding Control Based on Node
Surroundings in Cooperative Delay-Tolerant Networks》In, Nishiyama H et al. point out association
This form that the message that making DTN can be produced by will be far from the node of base station is sent to base station in multi-hop mode extends another
The coverage of a little type networks, this article is for cooperation DTN, it is proposed that a kind of ring distribution route, around source node
The forwarding of environmental Kuznets Curves message copy quantity and message.Zhang L et al. exist《Mobility-aware routing in
delay tolerant networks》In the problem of do not consider node space information for existing routing algorithm, wherein space
Information is, in residence time and the connection transitivity during the prediction of node collision probability of position etc., to propose
A kind of routing policy that transitivity is connected based on node space information and node.Document《Exploiting Small World
Properties for Message Forwarding in Delay Tolerant Networks》In, Wei K et al. designs
A kind of new message-submission linear module represents the transfer capability of node, and designs trunk node selection using small world
Rule, then devises a kind of society based on cost efficiency using node transfer capability and trunk node selection rule and perceives road
By algorithm.Document《Performance analysis of hop-limited epidemic routing in DTN with
limited forwarding times》In, Yahui Wu et al. are in order to reduce network overhead, it is proposed that a kind of hop count limitation
Infectious disease routing algorithm, the routing algorithm limits the hop count of node.Document《Routing in delay tolerant
networks with periodic connections》In order to meet the demand of heterogeneous networks model, it is a variety of that analysis is predicted
Rank, provide different routing mechanisms for the connection of different types of periodicity ensures earliest delivery time and minimum jump with this
Number.
In summary, existing DTN routing policies rely primarily on and meet information (when such as meeting lasting between node at present
Between, the number of times that meets etc.) or some characteristics (such as translational speed, node deliver probability etc.) of node carry out message transmission, and
The unbalanced environment of resource-constrained or resource is not considered.However, in DTN many application scenarios, often there is resource
Limited, the unbalanced situation of resource, such as disaster scene, network from far-off regions etc..Meanwhile, existing DTN routing policies are not right
Global network state is judged so that global network state and routing policy are difficult to the target agreed.
The content of the invention
It is an object of the invention to provide a kind of base for the target that global network state can be made to be agreed with routing policy
In the delay-tolerant network method for routing of optimal control information generating method.
The object of the present invention is achieved like this：
(1) communicated between node and control centre
The mode that control centre sends optimal control information to node is to use satellite as via node to be broadcasted, section
It is the chance link by node motion progress message relaying that point sends message-submission situation to control centre；
(2) inter-node communication
During inter-node communication, message transmission is carried out using many copy modes.
The present invention can also include：
1st, the node sends message-submission situation to control centre and specifically included：
(a) whether judge moment t is that node sends message-submission situation cycle t2 (time t2 is the value being previously set)
Multiple, if it is, going to (b)；Otherwise (e) is gone to；
(b) node i calculates message-submission situation of the node in moment t-t2 to moment t time interval
MdSituationt { message successfully delivers number, message-submission expense, message-submission delay, discarding message count }；
(c) message-submission situation mdSituationt life cycle is set to t2 by node i；
(d) whether decision node i directly can be delivered to control centre by message-submission situation mdSituationt, if can
Directly to deliver, then message-submission situation mdSituationt is delivered to control centre, and go to (h)；Otherwise, (e) is gone to；
(e) whether decision node i sets up with arbitrary node j in network and is connected；If it is, going to (f)；Otherwise, go to
(h)；
(f) node i is set up with arbitrary node j in network be connected after, acquisition node j's can successfully deliver probability dProj, and
It is that node i itself can successfully deliver probability dPro with this nodeiIt is compared, if dProjSmaller, then node i continues to carry
Message-submission situation, until running into the node for meeting relay condition, and goes to (g)；Otherwise (h) is gone to；
(g) by the message-submission situation mdSituationt of node i and its other nodes of carrying message-submission situation
Node j is relayed to, the message-submission situation queue of node i is updated after relaying successfully；
(h) judge whether to reach simulation time, if it is, terminating；Otherwise, (a) is gone to.
2nd, t at any time, inter-node communication is specifically included：
(a1) judge whether arbitrary node i receives optimal control information in moment t in network, if it is, going to
(b1)；Otherwise, go to (c1)；
(b1) OCIGM () is called to carry out copy limitation；
(c1) whether decision node i sets up with arbitrary node j in network and is connected；If it is, going to (d1)；Otherwise, turn
To (e1)；
(d1) node i is set up with arbitrary node j in network be connected after, acquisition node j's can successfully deliver probability dProj,
And be that node i itself can successfully deliver probability dPro with this nodeiIt is compared, if dProjSmaller, then node i continues to take
Band message-submission situation, until running into the node for meeting relay condition, and goes to (e1)；Otherwise go to (f1)；
(e1) message that node i is carried is relayed into node j, more new node is limited according to message copy after relaying successfully
I message queue；
(f1) judge whether to reach simulation time, if it is, terminating；Otherwise, go to (a1).
3rd, the generation method of the optimal control information is：
(1) mobile terminal by chance link in moment t using time interval t2 as the cycle, send the movement to control centre
Terminal juncture t-t2 to moment t message-submission situation mdSituation；
(2) control centre receives in moment t ' according to moment t '-t1 (time t1 be previously set value) to moment t '
Message-submission situation, assess probabilistic global network state NS, the global network state NS includes：Message is forwarded into
Power mDelivery, network overhead mOverhead and network packet loss rate mDrop；If control centre in t1 time intervals not
The new message-submission situation of mobile terminal transmission is received, then sends voluntarily control command to mobile terminal；Otherwise perform
(3)；
(3) judge whether message forwarding success rate mDelivery is more than the threshold alpha being previously set in global network state NS
1, if it is, performing (4)；Otherwise, the raising message forwarding success rate pDelivery decision-makings in scheduling decision collection P, are performed
(6)；
(4) judge whether network overhead mOverhead is less than the threshold alpha 2 being previously set in global network state NS, if
It is then to perform (5)；Otherwise, the reduction network overhead pOverhead decision-makings in scheduling decision collection P, are performed (7)；
(5) judge whether the flat packet loss mDrop of network is less than the threshold alpha 3 being previously set in global network state NS, if
It is then to send and voluntarily control, and terminate；Otherwise, the reduction network delay pDelay decision-makings in scheduling decision collection P, are performed (8)；
(6) formula is utilizedCopy limitation is carried out to routing policy,
And terminate；
(7) formula is utilizedCopy limit is carried out to routing policy
System, and terminate；
(8) formula is utilizedCopy limitation is carried out to routing policy, and
Terminate.
4、0<α1<1。
5、α2>0。
6、α3>0。
When carrying out message transmission for existing DTN routing policies, the unbalanced ring of resource-constrained or resource is not considered
Border.Meanwhile, also global network state is not judged so that global network state and routing policy are difficult to the mesh agreed
Mark.The present invention proposes a kind of based on OCIGM (Optimized Control Information Generating Method
For DTN Routing) resource-constrained DTN routing policies RC-RP.
Brief description of the drawings
A kind of network topology structures of Fig. 1 and weak feedback exemplary plot.
A kind of optimal control information generating method functional diagrams being route towards DTN of Fig. 2.
A kind of optimal control information generating method flow charts being route towards DTN of Fig. 3.
Fig. 4 nodes send message-submission situation mode figure to control centre.
Fig. 5 inter-node communication mode figures.
Fig. 6 RC-RP routing policies send message-submission situation flow chart for node to control centre.
Fig. 7 RC-RP routing policies are directed to inter-node communication flow chart.
Embodiment
Illustrate below and the present invention is described in more detail.
The effect of OCIGM optimal control information generating methods
OCIGM optimal control information generating method main functions are DTN routing policy of the generation to mobile terminal (node)
Optimal control information (improve message forwarding success rate, reduction network overhead, reduction network packet loss rate).Believed according to optimal control
Routing policy in breath, mobile terminal carries out the adjustment of routing policy by limiting the number of copies of message.DTN routing policies according to
The different type of optimal control information, the situation of limitation message copy number is specifically divided into following three kinds：
It is assumed that the number of copies of message is nrofCopies before the suboptimization control information is received, assess uncertain
Property global network state NS be message forward success rate mDelivery, network overhead mOverhead, network packet loss rate
mDrop}。
Situation one：Optimal control information is to improve message forwarding success rate
Message forwarding success rate is successful delivery of message count and the ratio of the message count produced in network, therefore, works as shifting
, can be by increasing message pair to a certain extent when the optimal control information that dynamic terminal is received is raising message forwarding success rate
This number improves the successful probability of message-submission, utilizes formula (1) to carry out the control of number of copies.
In formula (1), α 1 is message forwarding success rate in the threshold value being previously set, and global network state NS
mDelivery<α1<1。
Situation two：Optimal control information is reduction network overhead
Network overhead=(relay message sum-successfully deliver message sum)/message sum is successfully delivered, when reduction network
During the number of copies of middle message, relay message sum can decline therewith in network, although successfully delivering message sum also can be under
Drop, still, the amplitude that relay message sum declines are larger.Therefore, when the optimal control information that mobile terminal is received is reduction
During network overhead, network overhead can be reduced by reducing message copy number to a certain extent, copy is carried out using formula (2)
Several control.
In formula (2), α 2 is network overhead mOverhead in the threshold value being previously set, and global network state NS>α2.
Situation three：Optimal control information is reduction network packet loss rate
Network packet loss rate is ratio of the discarding message sum with producing message count in network in network.The node of each in network
The main cause for abandoning message is that the caching message count that is limited, can storing carrying of node is limited.Therefore, when node receive it is excellent
It is that when reducing network packet loss rate, can improve message-submission success to a certain extent by reducing message copy number to change control information
Probability, utilize formula (3) carry out number of copies control.
In formula (3), α 3 is network packet loss rate mDrop in the threshold value being previously set, and global network state NS>α3.
The thought of OCIGM optimal control information generating methods
The optimal control information generating method OCIGM of DTN routes makes full use of mixed topology (centralization topology, distribution
Topology；Direct link, chance link) under weak Feedback polarity, so-called weak feedback refers to that mobile node can be (straight by Weak link
Chain link road and chance link composition compounded link) mode message-submission situation is sent to control centre, control centre is but
Can not directly it be got in touch with all nodes in network, the current state for all mobile nodes of more having no way of knowing, such as distribution situation,
Resource situation etc..In this case, control centre can assess global network state according to message-submission situation, so as to produce
Raw corresponding optimal control information.Then by one way link (such as satellite link), into network, each mobile node sends optimization
Control information, is limited, up satellite link is to it and does not apply to by mobile node itself transmit power.Each in network is moved
The optimal control information that dynamic terminal is produced by OCIGM avoids mobile terminal and selects to deteriorate net to maximize itself delivery performance
The strategy of network performance, is finally reached the approximate maximized target of network utility.OCIGM optimal control information generating method networks are opened up
Structure and weak feedback exemplary plot are flutterred as shown in figure 1, functional block diagram is as shown in Figure 2.
Network topology structure mainly includes control centre, satellite, mobile terminal.
Control centre's major function is the message-submission situation sent according to mobile terminal by chance link
MdSituation { message successfully delivers number, message-submission expense, abandons message count }, and (time t1 is prior every time t1
The value of setting) assessing probabilistic global network state NS, { message forwards success rate mDelivery, network overhead
MOverhead, network packet loss rate mDrop }, optimal control information is then generated according to probabilistic overall network state and { carried
High message forwarding success rate, reduction network overhead, reduction network packet loss rate }, and satellite is delivered to, utilize the direct of satellite
Link sends optimal control information to each mobile terminal.
Satellite major function is to provide the direct link between control centre and mobile terminal, and the message of control centre is sent out
Each mobile terminal is delivered to, but is due to the limitation of mobile terminal itself transmit power, mobile terminal can not be sent to satellite to disappear
Breath.The optimal control information of satellite reception control centre, each mobile terminal is sent to direct link.
Mobile terminal first by chance link using time t2 be the cycle (time t2 be previously set value) periodically to control
Center processed sends message-submission situation mdSituation of the mobile terminal within the t2 cycles (time t2 be previously set value)
{ message successfully delivers number, message-submission expense, abandons message count }, and receive the optimal control information of satellite transmission.It is mobile whole
Hold according to optimal control information to optimize the adjustment that global network effectiveness (Global Utility) carries out routing policy for target.
Wherein global network effectiveness is defined as (mDelivery/ α 1)/(mOverhead/ α 2+mDrop/ α 3).
Note：OCIGM optimal controls information generating method is set carries out commenting for global network state every time time t1
Estimate, and the message-submission situation that the mobile terminal is periodically sent every t2 times mobile terminal is set.So set the reason for be：
Because towards network environment be with it is weak feedback and resource-constrained characteristic, therefore propose OCIGM optimal controls information generation
Method is distributed, for the degree of accuracy for economizing on resources and assessing, therefore the transmission cycle of setting assessment cycle t1 and mobile terminal
t2。
OCIGM optimal control information generating method flows
The global network state NS that OCIGM optimal controls information generating method is received according to control centre：{ message is forwarded
Success rate mDelivery, network overhead mOverhead, network packet loss rate mDrop }, it is only as target to optimize global network effectiveness
On the spot make the decision-making controlled DTN routing optimalities, decision set P：{ message forwarding success rate pDelivery is improved, network is reduced
Expense pOverhead, reduction network packet loss rate pDrop }.
In limited DTN networks, it is it in weighing that message can be successfully delivered to destination node using the movement of node
Weight, therefore OCIGM optimal controls information generating method is message forwarding success rate in observation global network state NS first
mDelivery；Secondly, network is flat in network overhead mOverhead, global network state NS in observation global network state NS loses
Bag rate mDrop.
OCIGM optimal control information generating method flows are as follows：
(1) by chance link, in moment t, by the cycle of time interval t2, (time, t2 was previously set mobile terminal
Value) mobile terminal moment t-t2 to moment t message-submission situation mdSituation is sent to control centre；
(2) the message-submission situation that control centre receives in moment t ' according to moment t '-t1 to moment t ', is assessed not true
Qualitatively global network state NS, { message forwards success rate mDelivery, network overhead mOverhead, network packet loss rate
mDrop}；If control centre does not receive the new message-submission situation of mobile terminal transmission in t1 time intervals, to
Mobile terminal sends voluntarily control command；Otherwise (3) are performed；
(3) the whether big α 1 (0 of message forwarding success rate mDelivery in global network state NS are judged<α1<1, α 1 is thing
The threshold value first set), if it is, performing (4)；Otherwise, the raising message forwarding success rate in scheduling decision collection P
PDelivery decision-makings, are performed (6)；
(4) judge whether network overhead mOverhead is less than the (α 2 of α 2 in global network state NS>0, α 2 is to be previously set
Threshold value), if it is, perform (5)；Otherwise, the reduction network overhead pOverhead decision-makings in scheduling decision collection P, are performed
(7)；
(5) judge whether the flat packet loss mDrop of network is less than the (α 3 of α 3 in global network state NS>0, α 3 is to be previously set
Threshold value), voluntarily control, and terminate if it is, sending；Otherwise, the reduction network delay pDrop in scheduling decision collection P determines
Plan, is performed (8)；
(6) copy limitation is carried out to routing policy using formula (1), and terminated；
(7) copy limitation is carried out to routing policy using formula (2), and terminated；
(8) copy limitation is carried out to routing policy using formula (3), and terminated.
Resource-constrained DTN routing policies based on OCIGM
RC-RP routing policy thoughts
Being proposed to of RC-RP routing policies solves that nodes are mobile restricted, node communication is limited, node holds
The nodes such as amount, communication range, node bandwidth are resource-constrained and the unbalanced problem of resource.RC-RP routing policies are being disappeared
Local resource is not only considered during breath transmission, while being controlled by the optimal control information generated, so that in network
Limited resource is fully utilized, and is finally reached the purpose of optimization network transmission performance.
In resource-constrained DTN networks, in order to improve network transmission performance, it is combined using single copy, many copies
Hybrid transmission means, present invention firstly provides it is a kind of towards DTN route optimal control information generating method OCIGM, its
Each node feeding back optimal control information into network, so that each node is not only the Local resource for considering to perceive
(node capacity, node communication range, node motion speed, node bandwidth etc.), moreover it is possible to consider the global situation of network, so
It is adaptively adjusted the node routing policy of itself to a certain extent afterwards.
Inter-node communication is mainly the message between via node, i.e. communication information in network between each node,
Its primary and foremost purpose is to improve the successful delivery of probability of message；And the communication between node and control centre, primarily to control
Center can be according to the current global network state of the message-submission assessment of scenario of the multiple nodes of certain in network.Therefore, in order to improve
The successful delivery of probability of message, reduction network packet loss rate, network overhead and message-submission delay etc., to improve the globality of network
Can, RC-RP routing policies will communicate between inter-node communication and node and control centre and make a distinction.
RC-RP routing policies communicate (message that the node of some in junction network itself is produced between node) among the nodes
Shi Liyong is more, and copy mode carries out message transmission；So as to improve the successful delivery of probability of message.On the other hand, in order to save node
Cache resources, reduce node load, reduction network packet loss rate and network overhead, and node is sent by chance chain road direction control centre
When the message-submission situation of the node and the message-submission situation to the other nodes relayed using the node, single copy side is utilized
Formula is transmitted.
RC-RP routing policies carry out copy control according to optimal control information and utilize week during many transfer copies
The Local resource for enclosing node carries out trunk node selection.RC-RP routing policies are that each node definition of network one can be handed over successfully
Probability dPro is paid, the foundation of trunk node selection is used as.RC-RP routing policies are each node two queues of setting in network,
It is message queue, message-submission situation queue respectively.Wherein what message queue was stored is message (the message source section of inter-node communication
Point, destination node are all the mobile terminals in network)；Message-submission situation queue storage is nodes to control centre
Message-submission situation of each node sent in time interval t2, and the life cycle of message-submission situation is t2.
Resource-constrained DTN routing policies framework based on OCIGM methods is as shown in Figure 3.
(1) communicated between node and control centre
Communicated between node and control centre and send optimal control information and node to control centre from control centre to node
Send message-submission situation two parts composition.
(a) control centre sends optimal control information to node
Control centre sends the mode of optimal control information to node, it was mentioned that the invention that it is to use satellite as in Section 3
Via node is broadcasted, from without regard to specific routing policy.
(b) node sends message-submission situation to control centre
Node sends message-submission situation to control centre, is the chance link that message relaying is carried out by node motion.
It is as shown in Figure 4 that node sends message-submission situation mode to control centre.
As shown in figure 4, for control centre set a timer, every the t1 times by satellite each node into network
Send the global network state in t1 time intervals.Meanwhile, it is one timer of each node setting in network, for any section
Point i calculates the message-submission situation of the node every the t2 times, and via node j, node i selection are forwarded in single copy mode
Node j as the condition of message-submission situation via node be node j can successfully deliver probability dProi more than node i can
Probability dProj is delivered in success, and wherein arbitrary node i can be delivered successfully shown in probability dProi calculating such as formula (4).
In formula (4), speediIt is the translational speed of node i, distanceiBe present node i and control centre away from
From transmitRangeiIt is the communication range of node i.Node motion speed and communication range can characterize node to a certain degree will
Message-submission situation is transmitted to the possibility of control centre.
(2) inter-node communication
The primary and foremost purpose of inter-node communication is to improve the successful delivery of probability of message, therefore RC-RP routing policies are in node
Between when communicating, many copy modes of use carry out message transmission.Inter-node communication mode is as shown in Figure 5.Arbitrary node i in network
With the message in many copy mode scheduling message queues.In order to save Internet resources, reduce node load, believed according to optimal control
Breath limitation message copy number.In order to improve network performance, selected according to local nodes resource (node communication range, node capacity)
Via node.
In the DTN that resourceoriented is limited, the node of each in network is not only that node motion is limited, node communication is limited
And the node such as node capacity, communication range, node bandwidth is resource-constrained, also there is the problem of node resource skewness weighs.
It is not only to be believed according to optimal control in inter-node communication to solve the problem of maldistribution of the resources is weighed to a certain extent
Breath (improving message forwarding success rate, reduction network overhead reduction packet loss) limitation message copy number, also introduces node communication model
Enclose and node capacity selects message via node.Node communication range can characterize the node to a certain extent can be with other nodes
The probability of connection is set up, node communication range is bigger higher with the attachable probability of other nodes；Meanwhile, node capacity can be certain
The ability that node stores message is characterized in degree, node capacity is bigger, can store more message.
It is that node j can successfully deliver probability that arbitrary node i, which selects node j as the condition of message via node, in network
dProjProbability dPro can be successfully delivered more than node ii, wherein arbitrary node i can successfully deliver probability dProiCalculation formula is such as
Shown in formula (5)：
dproi=β 1*transmitRangei+β2*bufferi (5)
In formula (5), transmitRangeiIt is communication range, the buffer of node iiIt is the capacity of node i, due to
Node communication range transmitRangeiWith node capacity bufferiThe magnitude of two parameters is different, is to section using β 1 and β 2
Point communication range transmitRangeiWith node capacity bufferiMake normalized.
RC-RP routing policy flows
(1) communicated between node and control centre
In communication between node and control centre, it is by satellite that control centre sends optimal control information to node
Direct link, the form of broadcast, therefore without corresponding routing policy.And due to the limitation of mobile node itself transmit power, on
Row satellite link is to it and does not apply to.Therefore, when node is to control centre's transmission message-submission situation, chance chain can only be passed through
Road, by the forwarding of the mobile carry out message-submission situation of node.In order to save Internet resources, node is sent to control centre to disappear
Breath is to utilize single copy version.
Arbitrary node i, RC-RP routing policy send message to control centre for node and handed in t at any time, network
Pay situation idiographic flow as follows：
(a) judge moment t whether be node send message-submission situation cycle t2 multiple, if it is, going to (b)；
Otherwise (e) is gone to；
(b) node i calculates message-submission situation of the node in moment t-t2 to moment t time interval
MdSituationt { message successfully delivers number, message-submission expense, message-submission delay, discarding message count }；
(c) message-submission situation mdSituationt life cycle is set to t2 by node i；
(d) whether decision node i directly can be delivered to control centre by message-submission situation mdSituationt, if can
Directly to deliver, then message-submission situation mdSituationt is delivered to control centre, and go to (h)；Otherwise, (e) is gone to；
(e) whether decision node i sets up with arbitrary node j in network and is connected；If it is, going to (f)；Otherwise, go to
(h)；
(f) node i is set up with arbitrary node j in network be connected after, acquisition node j's can successfully deliver probability dProj, and
Probability dPro can be successfully delivered with this node (node i) itselfiIt is compared, if dProjSmaller, then node i continues to carry
Message-submission situation, until running into the node for meeting relay condition, and goes to (g)；Otherwise (h) is gone to；
(g) by the message-submission situation mdSituationt of node i and its other nodes of carrying message-submission situation
Node j is relayed to, the message-submission situation queue of node i is updated after relaying successfully；
(h) judge whether to reach simulation time, if it is, terminating；Otherwise, (a) is gone to.
(2) inter-node communication
Because the primary and foremost purpose of inter-node communication is to improve the successful delivery of probability of message, therefore RC-RP routing policies exist
During inter-node communication, many copy modes of use carry out message transmission.In order to reduce the blindness of node trunk node selection with
And solve to be full of the problem of resource waste that a large amount of copies of same message are brought in network, RC-RP routing policies are in inter-node communication
Shi Liyong nodes communication range and node capacity (referring to formula (5)) carry out trunk node selection, are entered using optimal control information
Row copy is limited.
T at any time, RC-RP routing policies are as follows for the flow of inter-node communication：
(a) judge whether arbitrary node i receives optimal control information in moment t in network, if it is, going to (b)；
Otherwise, (c) is gone to；
(b) OCIGM () is called to carry out copy limitation；
(c) whether decision node i sets up with arbitrary node j in network and is connected；If it is, going to (d)；Otherwise, go to
(e)；
(d) node i is set up with arbitrary node j in network be connected after, acquisition node j's can successfully deliver probability dProj, and
Probability dPro can be successfully delivered with this node (node i) itselfiIt is compared, if dProjSmaller, then node i continues to carry
Message-submission situation, until running into the node for meeting relay condition, and goes to (e)；Otherwise (f) is gone to；
(e) message that node i is carried is relayed into node j, node i is updated according to message copy limitation after relaying successfully
Message queue.
(f) judge whether to reach simulation time, if it is, terminating；Otherwise, (a) is gone to.
Claims (7)
1. a kind of delay-tolerant network method for routing based on optimal control information generating method, it is characterized in that：
(1) communicated between node and control centre
Control centre to node send optimal control information mode be to use satellite as via node to be broadcasted, node to
It is the chance link that message relaying is carried out by node motion that control centre, which sends message-submission situation,；
(2) inter-node communication
During inter-node communication, message transmission is carried out using many copy modes.
2. the delay-tolerant network method for routing according to claim 1 based on optimal control information generating method, it is special
Levying is：The node sends message-submission situation to control centre and specifically included：
(a) judge moment t whether be node send message-submission situation cycle t2 (time t2 is the value being previously set) multiple,
If it is, going to (b)；Otherwise (e) is gone to；
(b) node i calculates message-submission situation mdSituationt of the node in moment t-t2 to moment t time interval
{ message successfully delivers number, message-submission expense, message-submission delay, discarding message count }；
(c) message-submission situation mdSituationt life cycle is set to t2 by node i；
(d) whether decision node i directly can be delivered to control centre by message-submission situation mdSituationt, if can be straight
Delivery is connect, then message-submission situation mdSituationt is delivered to control centre, and go to (h)；Otherwise, (e) is gone to；
(e) whether decision node i sets up with arbitrary node j in network and is connected；If it is, going to (f)；Otherwise, (h) is gone to；
(f) node i is set up with arbitrary node j in network be connected after, acquisition node j's can successfully deliver probability dProj, and with this
Node is that node i itself can successfully deliver probability dProiIt is compared, if dProjSmaller, then node i continues to carry message
Delivery situation, until running into the node for meeting relay condition, and goes to (g)；Otherwise (h) is gone to；
(g) the message-submission situation of the message-submission situation mdSituationt of node i and its other nodes of carrying is relayed
To node j, the message-submission situation queue of node i is updated after relaying successfully；
(h) judge whether to reach simulation time, if it is, terminating；Otherwise, (a) is gone to.
3. the delay-tolerant network method for routing according to claim 2 based on optimal control information generating method, it is special
Levying is：T at any time, inter-node communication is specifically included：
(a1) judge whether arbitrary node i receives optimal control information in moment t in network, if it is, going to (b1)；It is no
Then, go to (c1)；
(b1) OCIGM () is called to carry out copy limitation；
(c1) whether decision node i sets up with arbitrary node j in network and is connected；If it is, going to (d1)；Otherwise, go to
(e1)；
(d1) node i is set up with arbitrary node j in network be connected after, acquisition node j's can successfully deliver probability dProj, and with this
Node is that node i itself can successfully deliver probability dProiIt is compared, if dProjSmaller, then node i continues to carry message
Delivery situation, until running into the node for meeting relay condition, and goes to (e1)；Otherwise go to (f1)；
(e1) message that node i is carried is relayed into node j, is limited after relaying successfully according to message copy and update node i
Message queue；
(f1) judge whether to reach simulation time, if it is, terminating；Otherwise, go to (a1).
4. the delay-tolerant network method for routing according to claim 3 based on optimal control information generating method, it is special
Levy is that the generation method of the optimal control information is：
(1) mobile terminal by chance link in moment t using time interval t2 as the cycle, send the mobile terminal to control centre
Moment t-t2 to moment t message-submission situation mdSituation；
(2) control centre in moment t ' according to moment t '-t1 (time t1 be previously set value) to disappearing that moment t ' is received
Delivery situation is ceased, probabilistic global network state NS is assessed, the global network state NS includes：Message forwards success rate
MDelivery, network overhead mOverhead and network packet loss rate mDrop；If control centre does not receive in t1 time intervals
The new message-submission situation sent to mobile terminal, then send voluntarily control command to mobile terminal；Otherwise (3) are performed；
(3) judge whether message forwarding success rate mDelivery is more than the threshold alpha 1 being previously set in global network state NS, such as
Fruit is then to perform (4)；Otherwise, the raising message forwarding success rate pDelivery decision-makings in scheduling decision collection P, are performed (6)；
(4) judge whether network overhead mOverhead is less than the threshold alpha 2 being previously set in global network state NS, if it is,
Then perform (5)；Otherwise, the reduction network overhead pOverhead decision-makings in scheduling decision collection P, are performed (7)；
(5) judge whether the flat packet loss mDrop of network is less than the threshold alpha 3 being previously set in global network state NS, if it is,
Then send and voluntarily control, and terminate；Otherwise, the reduction network delay pDelay decision-makings in scheduling decision collection P, are performed (8)；
(6) formula is utilizedCopy limitation is carried out to routing policy, and tied
Beam；
(7) formula is utilizedCopy limitation is carried out to routing policy, and tied
Beam；
(8) formula is utilizedCopy limitation is carried out to routing policy, and terminated.
5. the delay-tolerant network method for routing according to claim 4 based on optimal control information generating method, it is special
Levying is：0<α1<1.
6. the delay-tolerant network method for routing according to claim 5 based on optimal control information generating method, it is special
Levying is：α2>0.
7. the delay-tolerant network method for routing according to claim 6 based on optimal control information generating method, it is special
Levying is：α3>0.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610899755 | 2016-10-14 | ||
| CN2016108997559 | 2016-10-14 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107171962A true CN107171962A (en) | 2017-09-15 |
Family
ID=59824689
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710415764.0A Pending CN107171962A (en) | 2016-10-14 | 2017-06-06 | A kind of delay-tolerant network method for routing based on optimal control information generating method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107171962A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114221900A (en) * | 2022-01-20 | 2022-03-22 | 北京理工大学 | Bullet group collaborative information returning method based on inter-bullet data chain |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101478805A (en) * | 2009-01-20 | 2009-07-08 | 中国科学院软件研究所 | DTN network Anycast routing method based on opportunistic communication |
| CN103634232A (en) * | 2013-11-06 | 2014-03-12 | 南京邮电大学 | Vehicle message routing method based on delay tolerant network technology |
| WO2014186614A2 (en) * | 2013-05-17 | 2014-11-20 | Raytheon Bbn Technologies Corp. | Disrupted adaptive routing |
| CN104936225A (en) * | 2015-06-18 | 2015-09-23 | 哈尔滨工程大学 | Message distribution optimized control method for hybrid mobile social network |
-
2017
- 2017-06-06 CN CN201710415764.0A patent/CN107171962A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101478805A (en) * | 2009-01-20 | 2009-07-08 | 中国科学院软件研究所 | DTN network Anycast routing method based on opportunistic communication |
| WO2014186614A2 (en) * | 2013-05-17 | 2014-11-20 | Raytheon Bbn Technologies Corp. | Disrupted adaptive routing |
| CN103634232A (en) * | 2013-11-06 | 2014-03-12 | 南京邮电大学 | Vehicle message routing method based on delay tolerant network technology |
| CN104936225A (en) * | 2015-06-18 | 2015-09-23 | 哈尔滨工程大学 | Message distribution optimized control method for hybrid mobile social network |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114221900A (en) * | 2022-01-20 | 2022-03-22 | 北京理工大学 | Bullet group collaborative information returning method based on inter-bullet data chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ji et al. | SDGR: An SDN-based geographic routing protocol for VANET | |
| Lakkakorpi et al. | Adaptive routing in mobile opportunistic networks | |
| Toh et al. | Load balanced routing protocols for ad hoc mobile wireless networks | |
| CN102970722B (en) | Multicasting route algorithm of low-time-delay delay tolerant and disruption tolerant sensor network | |
| CN106535280B (en) | A kind of car networking chance method for routing based on geographical location | |
| CN105245451B (en) | The time diffusivity of satellite DTN network routes method for searching | |
| CN106209627B (en) | Vehicle-mounted distribute based on node-node transmission ability focuses Routing Protocol method | |
| CN102231896B (en) | Load-balance-based satellite network on-demand routing method | |
| CN103634232B (en) | Vehicle message method for routing based on delay-tolerant network technology | |
| CN103561446B (en) | Awareness routing method in vehicle-mounted self-organizing network based on road topology | |
| CN106953803A (en) | A kind of improvement probabilistic routing method based on deep space delay-tolerant network | |
| CN101674220B (en) | Forwarding history-based asynchronous rooting algorithm | |
| Meneguette et al. | Autonomic data dissemination in highway Vehicular Ad Hoc Networks with diverse traffic conditions | |
| CN107171962A (en) | A kind of delay-tolerant network method for routing based on optimal control information generating method | |
| Adler et al. | Context-adaptive information dissemination in vanets-maximizing the global benefit. | |
| CN106487671B (en) | A kind of optimal control information generating method towards delay-tolerant network routing | |
| CN108881049A (en) | A kind of congestion control policy based on Epidemic routing | |
| Shah et al. | Adaptive anycast: A new anycast protocol for performance improvement in delay tolerant networks | |
| Akabane et al. | Data dissemination in highway scenarios using car-to-car communication | |
| Husain et al. | Receiver-based data forwarding in vehicular ad hoc networks | |
| Song et al. | The research of one self-adapt wireless sensor network rate flow control | |
| De Oliveira et al. | A predicted-contact routing scheme for Brazilian rural networks | |
| Bitam | Bandwidth impact on bee swarm routing for vehicular ad hoc networks | |
| Aung et al. | Hybrid opportunistic routing in highly dynamic MANET | |
| Ziane et al. | Inductive routing based on dynamic end-to-end delay for mobile networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170915 |