CN108989224A - A kind of multicast route method of space DTN network - Google Patents
A kind of multicast route method of space DTN network Download PDFInfo
- Publication number
- CN108989224A CN108989224A CN201810942183.7A CN201810942183A CN108989224A CN 108989224 A CN108989224 A CN 108989224A CN 201810942183 A CN201810942183 A CN 201810942183A CN 108989224 A CN108989224 A CN 108989224A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- space
- dist
- path
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- 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/16—Multipoint routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of multicast route methods of space DTN network, belong to technical field of satellite communication.Using space nodes motion track in the DTN network of space, periodical and predictable feature obtains the information such as the contact beginning and ending time between node to the present invention, and according to the distinctive storage-carrying-forwarding mechanism of space DTN network, it is proposed the minimum timing path algorithm between node, and pass through continuous iteration minimum timing path algorithm, and utilize the common node in multicast path, construct multicast tree, the Multicast Routing constructed by the method for the invention can cope with space DTN cyberspace networking long delay well, high bit-error, the feature that intermittence connection and Internet resources are limited, the delivery rate of Logistics networks, improve network resource utilization.
Description
Technical field
The invention belongs to technical field of satellite communication, more particularly, to a kind of Multicast Routing side of space DTN network
Method.
Background technique
With the development of space technology, how space is timely and accurately obtained, handles and distribute using spacecraft networking to believe
Breath becomes key problem in technology.The structure feature and sky of DTN (Delay Tolerant Networks, i.e. time delay tolerant network) network
Between the feature height of spacecraft networking agree with, be suitable for the networking of space device and with the diversified network interconnection in ground, from
And form space DTN network.Space DTN network has the features such as traditional DTN network long delay, intermittent connection, high bit-error,
Additionally due to on-board equipment uses aerospace grade chip, the storage resource of space DTN nodes is very limited.Therefore, it is necessary to
Design specific routing plan under space environment.
Current DTN network multicast routing is studied primarily directed to application background as opportunistic network, and about space
The research of DTN network multicast routing is then seldom.Under opportunistic network environment, the motion track of node is unpredictable, that is to say, that
The mobility model of node does not have certainty.On the contrary, in the DTN network of space, node mobility model tool
There is certainty, though certain space nodes cause network topology change process to change since randomness is mobile, but due to
Space nodes movement has periodic regularity, and being formed by new network topology change process equally also has certainty, i.e., empty
The mobility model of intermediate node is the certainty node mobility model with certain randomness.
It is a determining process that the research of space DTN network route method, which is generally basede on its change in topology,.Sushant etc.
People expands the research work towards the space DTN network route method for determining link scheduling earliest, to certainty space DTN net
Network has carried out formalized description, and has studied the initial contact method for routing based on Zero Knowledge, the routing side based on partial knowledge
3 kinds of different method for routing such as method and linear programming method for routing based on global information.Sushant's et al. studies have shown that
With the increase of information content, above-mentioned 3 kinds of method for routing performance in terms of time delay and delivery of packets rate goes out advantage.Burleigh
Et al. propose hookup method for routing CGR (Contact Graph Routing) be one representational very classical
Space DTN network route method, router-level topology process are carried out according to hookup (Contact Graph).But Sushant and
Multicast problem of the research of Burleigh all without reference to space DTN network.
Summary of the invention
Aiming at the above defects or improvement requirements of the prior art, the present invention provides a kind of multicast paths of space DTN network
By method, its object is to make full use of space nodes motion track periodical and predictable feature obtains between node
The information such as beginning and ending time are contacted, and according to the distinctive storage-carrying-forwarding mechanism of DTN network, when proposing the minimum between node
Sequence routing algorithm, and by continuous iteration minimum timing path algorithm, and using the common node in multicast path, construct multicast
Tree, thus the technical issues of the Multicast Routing of solution space DTN network.
To achieve the above object, the present invention provides a kind of multicast route method of space DTN network, the method includes
Following steps:
(1) the multicast tree T for initializing space DTN network is sky, time shift initial time Ts=0；By in the DTN network of space two
Contact information between point determines the timing distance between two nodes, further in reckoning space DTN network source node s to all mesh
Node diMinimum timing distance and minimum timing path p (s, di) (i=1,2 ..., m)；Wherein, destination node set D=
{di| i=1,2 ..., m }, m is purpose node total number；
(2) path p (s, the d are pressedi) (i=1,2 ..., m) hop count hop (p (s, di)) descending all paths are arranged
Sequence, if hop (p (s, d1))≥hop(p(s,d2))≥…≥hop(p(s,dm))；
(3) by path p (s, the d of maximum hop count1) be added in multicast tree T, i.e. T=T ∪ { p (s, d1), and i=2；
(4) each node t in source node s and multicast tree T is calculated separatelyjBetween minimum timing distance dist [tj], and with
dist[tj] it is used as time shift initial time calculate node tjWith node diBetween minimum timing path p (tj,di)；Wherein, j=1,
2 ..., | T |, | T | indicate multicast tree interior joint quantity；
(5) in set of paths { p (tj,di)|tj∈ T, j=1,2 ..., | T | } in, if path p (tk,di) contain multicast
The node in T is set, and most with the common node number of multicast tree T, then by path p (tk,di) source node s is used as to pass through node tk
Reach destination node diIntermediate path, and be added in multicast tree T, i.e. T=T ∪ { p (tk,di)}；
(6) i=i+1；
(7) step (4)~(6) are repeated, until all purposes node diIt is all added in multicast tree T, thus obtains space
The multicast route method of DTN network.
Further, in the step (1) by the contact information between two o'clock in the network determine between two nodes when
Sequence distance specifically: the contact information between prediction space DTN nodes calculates message and connect from a node by multiple
Time needed for another node is passed in touching, obtain the timing distance between two nodes.
Further, the contact information between the two o'clock is according to space DTN nodes mobility model come pre-
It measures.
Further, the timing distance between two node specifically:
Dist (s, v)=min { ci(s,v).ts|ci(s,v).ts≥Ts, i=1,2 ..., n }
Wherein, dist (s, v) is expressed as the timing distance of node s to node v；ci(s, v) is indicated between node s and node v
I-th of contact, n indicates the sum that contacts between node s and node v, and contact is expressed as four-tuple: ci(s, v)=(s, v, ts,
te), tsTo contact i start time, teTo contact i end time；TsFor time shift initial time；If not having between node s to node v
There is contact, then dist (s, v)=∞.
Further, source node s to all purposes node d in the DTN network of space is further calculated in the step (1)i
Minimum timing distance specifically:
(11) set S={ s } is initialized, wherein S is the node set that minimum timing distance has been found out in the network；s
For the source node of the network；
(12) a node w is chosen from the network, if meeting:
W ∈ U and dist (s, w)=min dist (s, v) | v ∈ U }
Then minimum timing distance dist [w]=dist (s, w) of s to w；Node w is added in set S, i.e. S=S ∪
{ w }, U=U- { w }；Wherein, U is the node set that minimum timing distance is not yet determined in network；
(13) set in U has the node of contact as v with node w, updates dist (s, v) value:
Dist (s, v)=min { dist (s, v), min { ci(v,w).ts|ci(v,w).ts>=dist [w], i=1,2 ...,
K } } wherein, there are k contact, k >=1 between the node v in set U and node w；
(14) step (22)~(23) are repeated, until nodes all in network are all merged into set S, be calculated described in
Minimum timing distance of the source node to other all nodes in network.
Further, source node s to all purposes node d in the DTN network of space is further calculated in the step (1)i
Minimum timing path specifically: path composed by the node that minimum timing distance is passed through is minimum timing path.
In general, through the invention it is contemplated above technical scheme is compared with the prior art, have following technology special
Sign and the utility model has the advantages that
The method of the present invention makes full use of space nodes motion track periodical and predictable feature obtains between node
The information such as contact beginning and ending time.And according to the distinctive storage-carrying-forwarding mechanism of DTN network, the minimum between node is proposed
Timing path algorithm, and by continuous iteration minimum timing path algorithm, and utilize the common node in multicast path, building group
Tree is broadcast, the Multicast Routing constructed by the method for the invention can cope with space DTN cyberspace networking long delay, high bit error well
The feature that rate, intermittent connection and Internet resources are limited, the delivery rate of Logistics networks improve network resource utilization.
Detailed description of the invention
Fig. 1 is the method for the present invention implementation flow chart；
Fig. 2 is the typical case environment network node contact timing diagram of the method for the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that described herein, specific examples are only used to explain the present invention, not
For limiting the present invention.As long as in addition, technical characteristic involved in the various embodiments of the present invention described below that
Not constituting conflict between this can be combined with each other.
Enabling multicast source node in the DTN network of space is s, destination node set D={ di| i=1,2 .., m }, source node s
To destination node diPath be p (s, di), path p (s, di) hop count be hop (p (s, di)).Construct space DTN group of networks
It is for example as shown in Figure 1 to broadcast tree T (s, D) main procedural steps, comprising the following steps:
(1) it initializes, multicast tree T ← φ, time shift initial time Ts← 0, according to minimum timing distance algorithm, source node s
It is calculated to all purposes node diMinimum timing path p (s, di) (i=1,2 ..., m)；
(2) according to path p (s, di) (i=1,2 ..., hop count m) according to descending by all paths orderings, do not lose general
Property, if hop (p (s, d1))≥hop(p(s,d2))≥…≥hop(p(s,dm)), i.e. source node s to destination node d1Pass through
Hop count is maximum, and arrives destination node dmThe hop count of process is minimum；
(3) path p (s, the d of maximum hop count are selected1) be added in multicast tree T, i.e. T ← T ∪ { p (s, d1), and i ← 2；
(4) next destination node d is selectedi, according to minimum timing distance algorithm, respectively with node t each in multicast tree Tj
(j=1,2 ..., | T |) dist [tj] as time shift initial time calculating tjTo diMinimum timing path p (tj,di)；
(5) in minimum timing path set { p (tj,di)|tj∈ T, j=1,2 ..., | T | } in, if the node of multicast tree T
tk(1≤k≤| T |) arrive diMinimum timing path p (tk,di) comprising the node in multicast tree T, and common node number is most, then
Pass through node t for the minimum timing path as source node skReach destination node diPath, and be added in multicast tree T, i.e.,
T←T∪{p(tk,di)}；
(6) i=i+1；
(7) step (4)~(6) are repeated, until all purposes node diIt is all added in multicast tree T, thus obtains space
The multicast route method of DTN network.
Wherein, at the time of contact in sequence figure, the timing observation moment is known as time shift initial time, is denoted as Ts.If node u and
Node v is in time interval [ts,te] there is a contact, then node u can be denoted as a four-tuple with the contact c (u, v) of node v, i.e.,
C (u, v)=(u, v, ts,te), wherein tsFor contact start moment, teTo contact end time.Define timing distance be message from
Time needed for one node passes to another node by multiple contacts, then using following minimum timing that we are proposed away from
Source node can be found out into network with a distance from the minimum timing of other all nodes from algorithm, and there is minimum timing distance accordingly
Timing path is minimum timing path.
Enabling s is source node, and V is the node set of network, and S is the node set for having found out shortest path, and U is not yet to determine
The node set of shortest path, dist (s, v) indicate the timing distance of source node s to node v, and dist [v] indicates that source node s is arrived
The minimum timing distance of node v.Minimum timing distance algorithm specifically includes the following steps:
(1) it initializes: enabling S ← { s }, then U=V-S.If there is n (n >=1) a contact between the node v and s in U, source section
The timing distance dist (s, v) of point s to node v ← min { ci(s,v).ts|ci(s,v).ts≥Ts, i=1,2 ..., n }；Otherwise,
dist(s,v)←∞；
(2) a node w is chosen, is met: w ∈ U and dist (s, w)=min dist (s, v) | and v ∈ U }, w is added to S
In, i.e. S ← S ∪ { w }, U ← U- { w }.At this point, minimum timing distance dist [w] ← dist (s, w) of source node s to node w；
(3) original dist (s, the w) value for having the node v of contact in all U with node w is updated: if node v and section in U
There is k (k >=1) a contact between point w, then dist (s, v) ← min { dist (s, v), min { ci(v,w).ts|ci(v,w).ts≥
Dist [w], i=1,2 ..., k } }；
(4) step 2,3 are repeated, until all nodes are all merged into S.
Now in conjunction with embodiment as shown in Figure 2, the present invention is further described in detail:
(1) according to minimum timing distance algorithm, it can be deduced that the minimum timing path of source node a to each destination node is distinguished
Are as follows: a → b → d, a → l → m → k, a → f → g → j → i；The hop count of every minimum timing path is respectively as follows: hop (p (a, d))
=2, hop (p (a, k))=3, hop (p (a, i))=4；
(2) hop count is arranged according to descending: hop (p (a, i)) >=hop (p (a, k)) >=hop (p (a, d)), source node a is arrived
The hop count of node i minimum timing path is maximum, and path p (a, i) is added in multicast tree T；
(3) select next destination node for k, the node in multicast tree includes source node a, intermediate node f, g, j at this time
With destination node i；The minimum timing path of node f, g, j to destination node k be respectively p (f, k): f → g → k, p (g, k): g →
K, p (j, k): j → g → k；In order to avoid causing loop, during calculating minimal path, give up by this in path p (a, i)
The upstream node of node, thus path p (j, k) is unavailable；This three paths road most with common node in multicast tree simultaneously
Diameter is p (f, k), therefore path p (f, k) is added in multicast tree T, i.e. p (f, k) is source node a by node f to purpose section
The minimum timing path of point k；
(4) and so on, until all purposes node is added in multicast tree T.
The above content as it will be easily appreciated by one skilled in the art that the foregoing is merely illustrative of the preferred embodiments of the present invention,
It is not intended to limit the invention, any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention,
It should all be included in the protection scope of the present invention.
Claims (6)
1. a kind of multicast route method of space DTN network, which is characterized in that the method specifically includes the following steps:
(1) the multicast tree T for initializing space DTN network is sky, time shift initial time Ts=0；By two o'clock in the DTN network of space it
Between contact information determine the timing distance between two nodes, further calculate that source node s is to all purposes section in space DTN network
Point diMinimum timing distance and minimum timing path p (s, di) (i=1,2 ..., m)；Wherein, destination node set D={ di|
I=1,2 ..., m }, m is purpose node total number；
(2) path p (s, the d are pressedi) (i=1,2 ..., m) hop count hop (p (s, di)) descending to all paths orderings,
If hop (p (s, d1))≥hop(p(s,d2))≥…≥hop(p(s,dm))；
(3) by path p (s, the d of maximum hop count1) be added in multicast tree T, i.e. T=T ∪ { p (s, d1), and i=2；
(4) each node t in source node s and multicast tree T is calculated separatelyjBetween minimum timing distance dist [tj], and with dist
[tj] it is used as time shift initial time calculate node tjWith node diBetween minimum timing path p (tj,di)；Wherein, j=1,
2 ..., | T |, | T | indicate multicast tree interior joint quantity；
(5) in set of paths { p (tj,di)|tj∈ T, j=1,2 ..., | T | } in, if path p (tk,di) contain multicast tree T
In node, and it is most with the common node number of multicast tree T, then by path p (tk,di) source node s is used as to pass through node tkIt reaches
Destination node diIntermediate path, and be added in multicast tree T, i.e. T=T ∪ { p (tk,di)}；
(6) i=i+1；
(7) step (4)~(6) are repeated, until all purposes node diIt is all added in multicast tree T, thus obtains space DTN net
The multicast route method of network.
2. a kind of multicast route method of space DTN network according to claim 1, which is characterized in that the step (1)
In timing distance between two nodes is determined by the contact information between two o'clock in the network specifically: prediction space DTN network
Contact information between interior joint calculates message from a node and passes through the time needed for another node is passed in multiple contacts,
Obtain the timing distance between two nodes.
3. a kind of multicast route method of space DTN network according to claim 2, which is characterized in that the two o'clock it
Between contact information be to predict to obtain according to space DTN nodes mobility model.
4. a kind of multicast route method of space DTN network according to claim 2, which is characterized in that two node
Between timing distance specifically:
Dist (s, v)=min { ci(s,v).ts|ci(s,v).ts≥Ts, i=1,2 ..., n }
Wherein, dist (s, v) is expressed as the timing distance of node s to node v；ci(s, v) indicates i-th between node s and node v
A contact, n indicate the sum contacted between node s and node v, and contact is expressed as four-tuple: ci(s, v)=(s, v, ts,te),
tsTo contact i start time, teTo contact i end time；TsFor time shift initial time；If not connect between node s to node v
It touches, then dist (s, v)=∞.
5. a kind of multicast route method of space DTN network according to claim 1 or 4, which is characterized in that the step
(1) source node s to all purposes node d in the DTN network of space is further calculated iniMinimum timing distance specifically:
(11) set S={ s } is initialized, wherein S is the node set that minimum timing distance has been found out in the network；S is institute
State the source node of network；
(12) a node w is chosen from the network, if meeting:
W ∈ U and dist (s, w)=min dist (s, v) | v ∈ U }
Then minimum timing distance dist [w]=dist (s, w) of s to w；Node w is added in set S, i.e. S=S ∪ { w }, U
=U- { w }；Wherein, U is the node set that minimum timing distance is not yet determined in network；
(13) set in U has the node of contact as v with node w, updates dist (s, v) value:
Dist (s, v)=min { dist (s, v), min { ci(v,w).ts|ci(v,w).ts>=dist [w], i=1,2 ..., k } } its
In, there are k contact, k >=1 between the node v in set U and node w；
(14) step (22)~(23) are repeated, until nodes all in network are all merged into set S, the network is calculated
Minimum timing distance of the middle source node to other all nodes.
6. a kind of multicast route method of space DTN network according to claim 5, which is characterized in that the step (1)
In further calculate source node s to all purposes node d in the DTN network of spaceiMinimum timing path specifically: minimum timing
Path composed by the node that distance is passed through is minimum timing path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810942183.7A CN108989224B (en) | 2018-08-17 | 2018-08-17 | Multicast routing method of space DTN (delay tolerant network) |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810942183.7A CN108989224B (en) | 2018-08-17 | 2018-08-17 | Multicast routing method of space DTN (delay tolerant network) |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108989224A true CN108989224A (en) | 2018-12-11 |
| CN108989224B CN108989224B (en) | 2020-02-14 |
Family
ID=64553594
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810942183.7A Active CN108989224B (en) | 2018-08-17 | 2018-08-17 | Multicast routing method of space DTN (delay tolerant network) |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108989224B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114900853A (en) * | 2022-07-13 | 2022-08-12 | 武汉烽火凯卓科技有限公司 | Satellite network multicast retransmission method and system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101527680A (en) * | 2009-02-20 | 2009-09-09 | 西部矿业股份有限公司 | DDMC-based delay-constrained multicast routing method |
| CN101667885A (en) * | 2009-09-29 | 2010-03-10 | 天津大学 | Method for reducing redundancy message by using network coding technique on DTN or ICN network |
| CN102348250A (en) * | 2010-07-29 | 2012-02-08 | 华为技术有限公司 | Routing method and node device of delay tolerant network |
| CN102970722A (en) * | 2012-12-10 | 2013-03-13 | 北京科技大学 | Multicasting route algorithm of low-time-delay delay tolerant and disruption tolerant sensor network |
| CN103986653A (en) * | 2014-05-29 | 2014-08-13 | 苏州大学 | Network nodes and data transmission method and system |
| US20170289023A1 (en) * | 2016-03-31 | 2017-10-05 | FUJllTSU LIMITED | Non-transitory computer readable recording medium, communication method and communication device |
| US20180018713A1 (en) * | 2016-07-18 | 2018-01-18 | California Institute Of Technology | Delay-tolerant information-centric networking (dticn) |
-
2018
- 2018-08-17 CN CN201810942183.7A patent/CN108989224B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101527680A (en) * | 2009-02-20 | 2009-09-09 | 西部矿业股份有限公司 | DDMC-based delay-constrained multicast routing method |
| CN101667885A (en) * | 2009-09-29 | 2010-03-10 | 天津大学 | Method for reducing redundancy message by using network coding technique on DTN or ICN network |
| CN102348250A (en) * | 2010-07-29 | 2012-02-08 | 华为技术有限公司 | Routing method and node device of delay tolerant network |
| CN102970722A (en) * | 2012-12-10 | 2013-03-13 | 北京科技大学 | Multicasting route algorithm of low-time-delay delay tolerant and disruption tolerant sensor network |
| CN103986653A (en) * | 2014-05-29 | 2014-08-13 | 苏州大学 | Network nodes and data transmission method and system |
| US20170289023A1 (en) * | 2016-03-31 | 2017-10-05 | FUJllTSU LIMITED | Non-transitory computer readable recording medium, communication method and communication device |
| US20180018713A1 (en) * | 2016-07-18 | 2018-01-18 | California Institute Of Technology | Delay-tolerant information-centric networking (dticn) |
Non-Patent Citations (1)
| Title |
|---|
| WANGGUO等: ""Research on multicast routing for deep space networks based on DTN"", 《IEEE》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114900853A (en) * | 2022-07-13 | 2022-08-12 | 武汉烽火凯卓科技有限公司 | Satellite network multicast retransmission method and system |
| CN114900853B (en) * | 2022-07-13 | 2022-11-04 | 武汉烽火凯卓科技有限公司 | Satellite network multicast retransmission method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108989224B (en) | 2020-02-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Daly et al. | Social network analysis for routing in disconnected delay-tolerant manets | |
| Segui et al. | Enhancing contact graph routing for delay tolerant space networking | |
| Li et al. | Reliable topology design in time-evolving delay-tolerant networks with unreliable links | |
| CN108989223A (en) | A kind of satellite routing algorithm under strong link constraints | |
| Guo et al. | Generic prediction assisted single-copy routing in underwater delay tolerant sensor networks | |
| Geng et al. | An optimal delay routing algorithm considering delay variation in the LEO satellite communication network | |
| Sede et al. | Routing in large-scale buses ad hoc networks | |
| CN104579964A (en) | Dynamic route architecture system for quantum cryptography network | |
| Boldrini et al. | Modelling social-aware forwarding in opportunistic networks | |
| Nayyar et al. | Opportunistic networks: present scenario-a mirror review | |
| Zuo et al. | A hybrid multi-path routing algorithm for industrial wireless mesh networks | |
| CN107360093A (en) | Unmanned plane and satellite hybrid network communication routing method and system | |
| Yang et al. | CANDS: Continuous optimal navigation via distributed stream processing | |
| CN106888492B (en) | The limited satellite network method for routing being discontinuously connected to of Load-aware caching | |
| Chen et al. | Time-varying resource graph based resource model for space-terrestrial integrated networks | |
| CN106792963B (en) | A kind of car networking sub-clustering Che-vehicle multi-hop routing method based on particle group optimizing | |
| CN108989224A (en) | A kind of multicast route method of space DTN network | |
| Tang et al. | Reliable routing in mobile ad hoc networks based on mobility prediction | |
| Peyravi et al. | Link modeling and delay analysis in networks with disruptive links | |
| Verbas et al. | Finding least cost hyperpaths in multimodal transit networks: Methodology, algorithm, and large-scale application | |
| Er-rouidi et al. | A fuzzy-based routing strategy to improve route stability in MANET based on AODV | |
| Liu et al. | Load balancing routing algorithm of low-orbit communication satellite network traffic based on machine learning | |
| He et al. | Deephop on edge: Hop-by-hop routing bydistributed learning with semantic attention | |
| Sasirekha et al. | Efficient route map based ant colony optimization for route discovery in vanet | |
| Alaoui et al. | Stochastic analysis of dtn routing protocols in delay tolerant network routing hierarchical topology |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |