CN110233797A - The DTN network most short time-delay method for routing limited based on motion interval - Google Patents
The DTN network most short time-delay method for routing limited based on motion interval Download PDFInfo
- Publication number
- CN110233797A CN110233797A CN201910565211.2A CN201910565211A CN110233797A CN 110233797 A CN110233797 A CN 110233797A CN 201910565211 A CN201910565211 A CN 201910565211A CN 110233797 A CN110233797 A CN 110233797A
- Authority
- CN
- China
- Prior art keywords
- node
- time
- link
- delay
- moment
- 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/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
Abstract
The invention discloses a kind of time delay tolerant network most short time-delay method for routing limited based on motion interval, and it is big to solve prior art amount of storage, there are problems that bulk redundancy calculating.Realization step of the invention is that building discrete time polymerization first is schemed, and is converted by node arrival time sequence chain circuit transmission time delay sequence all in discrete time polymerization figure being converted to node arrival time sequence.Motion interval qualifications are determined with the relationship between the corresponding moment according to the node arrival time sequence of link, and the most short time-delay between fixed initial time lower node is calculated according to the condition and is routed.The present invention effectively saves the storage demand of method execution, reduces a large amount of redundant computation, reduces the communication overhead of time delay tolerant network.
Description
Technical field
The invention belongs to fields of communication technology, further relate to one of network communication technology field and are based on dynamic area
Between time delay tolerant network DTN (Delay-Tolerant NetWorks) most short time-delay method for routing for limiting.The present invention can be
The most short time-delay routing that an end-to-end transmission is chosen in time delay tolerant network DTN, guarantees the high efficiency of information transmission.
Background technique
Time delay tolerant network DTN is a kind of novel self-organizing network, due to can, connection frequency long in end-to-end round-trip delay
It is communicated under the conditions of numerous interruption etc. is network limited, so before the fields such as military affairs, traffic, disaster relief have a wide range of applications
Scape.Compared with conventional communication networks, time delay tolerant network DTN unstable end-to-end transmission path, in conventional communication networks
Routing algorithm can be not applied directly in time delay tolerant network DTN.So the effectively reliable route technology of research becomes time delay
Critical issue in tolerant network DTN.
Patent document " the time diffusivity of satellite DTN network of the Harbin Institute of Technology Shenzhen Graduate School in its application
A kind of base is disclosed in routing method for searching " (number of patent application 201510677212.8, application publication number CN 105245451A)
Method for searching is routed in the DTN network of time extension.All information of time-varying network are stored in time expander graphs by this method,
The end-to-end path being directly connected to based on time expander graphs search and the path communicated by interruption link, and quantified
Analysis.Shortcoming existing for this method is to store time-varying network information using time expander graphs, it may appear that amount of storage is big, deposits
In redundant node, and the problems such as compute repeatedly, the communication overhead of network is increased.
Gunturi V, Shekhar S, Yang K S are in paper " the A Critical-Time-Point delivered at it
Approach to All-Departure-Time Lagrangian Shortest Paths”(IEEE Transactions
On Knowledge and Data Engineering, 2015,27 (10): 2591-2603) in propose it is a kind of based on key
The shortest route method CTAS (Critical Time-point based ALSP Solver) at time point.This method use from
It dissipates time aggregation figure to be modeled, the propagation delay time sequence of link is converted into node arrival time sequence first, passes through difference
Opposite change between link nodes arrival time sequence determines material time point, passes through material time point and arrival time sequence meter
Source node is calculated under the different time starteds to the shortest path of destination node.Shortcoming existing for this method is to be directly based upon section
Point arrival time sequence calculates shortest path, does not carry out any processing, and the computation complexity for causing method to execute increases, and increases
The communication overhead of network.
Summary of the invention
It is an object of the invention in view of the above shortcomings of the prior art, propose it is a kind of based on motion interval limit when
Prolong tolerant network DTN most short time-delay method for routing, figure storage time-varying network information is polymerize by discrete time, due to discrete time
Polymerization figure is the link information for being indicated and being stored time-varying in the form of sequence, therefore saves memory space, reduces the meter of method
Calculate complexity；The most short time-delay routing between calculate node is limited by motion interval, reduces bulk redundancy calculating, is effectively reduced
Network overhead.
The present invention realizes that the concrete thought of above-mentioned purpose is: according to time delay tolerant network DTN topological structure and link state
Variation, construction discrete time polymerization figure.Then discrete time is polymerize in figure by the conversion of node arrival time sequence and is owned
Chain circuit transmission time delay sequence be converted to node arrival time sequence.Consider the pass of node arrival time sequence and corresponding moment
System, obtains motion interval qualifications, calculates the most short time-delay between fixed initial time lower node according to the condition and routes.
The present invention realizes that the step of above-mentioned purpose includes the following:
(1) construction discrete time polymerization figure:
All nodes in time delay tolerant network DTN are formed a node set by (1a)；
Link if it exists between every two node in (1b) node set, by the link in all transmission at moment per second
Prolong, forms a chain circuit transmission time delay sequence；
(1c) is connected by directed edge by there are the nodes of link in node set, knows corresponding link in directed edge subscript
Propagation delay time sequence obtains discrete time polymerization figure；
(2) according to the following formula, each of the links are calculated in the node arrival time at each moment, the node at all moment is reached
Time forms the node arrival time sequence of the link:
ak(t)=σk(t)+t
Wherein, ak(t) node arrival time of the kth link t-th of moment, σ in time delay tolerant network DTN are indicatedk
(t) propagation delay time of the kth link t-th of moment in time delay tolerant network DTN is indicated, t is indicated in time delay tolerant network DTN
The node arrival time of link corresponds to the serial number at moment, in seconds；
(3) the most shortest time delay path information between motion interval qualifications calculate node is utilized:
(3a) respectively construct one be used for memory node work queue and destination queue, size with node set
It is equal in magnitude；
The source node is added in work queue by (3b) optional node in node set as source node；
(3c) successively extracts a node from work queue, and extracted node is marked, and tolerates net in time delay
All nodes adjacent with the node are found out in network DTN, are added in destination queue；
(3d) calculate under fixed initial time the extracted node of process of each node in source node and destination queue when
Prolong the length in path:
eij=min { aij(t)}
Wherein, eijIndicate the length of the latency path of the extracted node i of process of j-th of node in source node and destination queue
Degree, min { } indicate operation of minimizing, aij(t) j-th of inter-node link in extracted node i and destination queue is indicated
In the node arrival time at t-th of moment, t indicates that the node arrival time of link corresponds to the serial number at moment, in seconds,
Value range is [ci,lij], ciThe length for indicating the most shortest time delay path of source node and extracted node i, when i is source node
When, ciInitial value be fixed initial time, when i is intermediate node, ciInitial value be ∞, lijIndicate extracted node i with
The node arrival time of j-th of inter-node link corresponds to the moment and is greater than all of the link before the moment for the first time in destination queue
The value of node arrival time minimum value；
(3e), which chooses in destination queue, meets cj> eijNode, cjIndicate j-th of node in source node and destination queue
Most shortest time delay path length, initial value ∞, eijIndicate that source node is extracted with j-th of passing through for node in destination queue
The length of the latency path of node i；
(3f)；Use eijIt updates source node and chooses the length of the most shortest time delay path of node, with extracted node updates
Next-hop node in the most shortest time delay path of source node and selection node；
(3g) judges whether each node in destination queue is labeled or in work queue, if so, by the node
It is deleted from destination queue, otherwise, then the node is added to work queue after extracting in destination queue；
(3h) judges whether work queue is sky, if so, thening follow the steps (4)；Otherwise, step (3c) is executed；
(4) it obtains in time tolerant network DTN and fixes the most shortest time delay path between initial time lower node.
Compared with prior art, the invention has the following advantages that
First, the present invention use by node set there are the node of link by directed edge connection, in directed edge subscript
Know corresponding chain circuit transmission time delay sequence, the method for obtaining discrete time polymerization figure is overcome and expanded in the prior art using the time
Exhibition figure storage time-varying network information, brings that amount of storage is big, there are redundant nodes, and the problems such as compute repeatedly, so that of the invention
Have the advantages that effectively to save the storage demand of method execution.
Second, the present invention using limit link node arrival time correspond to the value range at moment come between calculate node most
The method of short time-delay routing, overcomes and calculates shortest path due to being directly based upon node arrival time sequence in the prior art, not
The problem of carrying out any processing, the computation complexity of method execution caused to increase, increase the communication overhead of network, so that this hair
It is bright to have the advantages that effectively reduce bulk redundancy calculating.
Detailed description of the invention
Fig. 1 is flow chart of the invention；
Fig. 2 is the schematic diagram of a scenario that present invention emulation uses；
Fig. 3 is simulation result diagram of the invention.
Specific embodiment
Present invention is further described in detail with reference to the accompanying drawing.
Referring to attached drawing 1, specific steps of the invention are described in detail as follows.
Step 1, construction discrete time polymerization figure.
All nodes in time delay tolerant network DTN are formed into a node set.
Link if it exists between every two node, all propagation delay times by the link at the moment per second, group in node set
At a chain circuit transmission time delay sequence.
It is connected by directed edge by there are the nodes of link in node set, knows corresponding link transmission in directed edge subscript
Time-delay series obtain discrete time polymerization figure.
Step 2, according to the following formula, each of the links are calculated in the node arrival time at each moment, by the node at all moment
Arrival time forms the node arrival time sequence of the link:
ak(t)=σk(t)+t
Wherein, ak(t) node arrival time of the kth link t-th of moment, σ in time delay tolerant network DTN are indicatedk
(t) propagation delay time of the kth link t-th of moment in time delay tolerant network DTN is indicated, t is indicated in time delay tolerant network DTN
The node arrival time of link corresponds to the serial number at moment, in seconds.
Step 3, the most shortest time delay path information between motion interval qualifications calculate node is utilized.
Step 1 constructs the work queue and destination queue for being used for memory node respectively, and size is and node set
It is equal in magnitude.
Step 2, the source node is added in work queue by an optional node as source node in node set.
Step 3 successively extracts a node from work queue, extracted node is marked, and tolerates in time delay
All nodes adjacent with the node are found out in network DTN, are added in destination queue.
Step 4 calculates source node and the extracted node of process of each node in destination queue under fixed initial time
The length of latency path:
eij=min { aij(t)}
Wherein, eijIndicate the length of the latency path of the extracted node i of process of j-th of node in source node and destination queue
Degree, min { } indicate operation of minimizing, aij(t) j-th of inter-node link in extracted node i and destination queue is indicated
In the node arrival time at t-th of moment, t indicates that the node arrival time of link corresponds to the serial number at moment, in seconds,
Value range is [ci,lij], ciThe length for indicating the most shortest time delay path of source node and extracted node i, when i is source node
When, ciInitial value be fixed initial time, when i is intermediate node, ciInitial value be ∞, lijIndicate extracted node i with
The node arrival time of j-th of inter-node link corresponds to the moment and is greater than all of the link before the moment for the first time in destination queue
The value of node arrival time minimum value.
Step 5 is chosen in destination queue and meets cj> eijNode, cjIndicate j-th of section in source node and destination queue
The length of the most shortest time delay path of point, initial value ∞, eijIndicate that source node is mentioned with j-th of passing through for node in destination queue
Take the length of the latency path of node i.
Step 6 uses eijIt updates source node and chooses the length of the most shortest time delay path of node, with extracted node updates
Next-hop node in the most shortest time delay path of source node and selection node；
Step 7 judges whether each node in destination queue is labeled or in work queue, if so, by the section
Point is deleted from destination queue, otherwise, then the node is added to work queue after extracting in destination queue.
Step 8 judges whether work queue is sky, if so, thening follow the steps 4；Otherwise, the step 3 of this step is executed.
Step 4, it obtains in time tolerant network DTN and fixes the most shortest time delay path between initial time lower node.
According to the next-hop node in the most shortest time delay path of source node to destination node, using the side of " backtracking "
Method can determine each node on source node to the most shortest time delay path of destination node, and then obtain time tolerant network DTN
Most shortest time delay path between interior joint.
Effect of the invention is described further below with reference to emulation experiment:
1. emulation experiment condition:
The hardware platform of emulation experiment of the invention are as follows: processor be Intel Pentium CPU, dominant frequency 3.30GHz,
Memory 8GB.
The software platform of emulation experiment of the invention are as follows: 7 operating system of Windows and MATLAB.
Emulation experiment of the present invention uses typical DTN network comet system, as shown in Fig. 2.Comet system is one low
Track satellite network communication system shares 66 satellites in system, is distributed on 6 equally spaced tracks, has 11 on every track
Satellite, the topological period of comet system is about 100 minutes.For algorithm under more different node arrival time sequence lengths
Can, 21 satellites of stationary nodes number, and successively choose node arrival time sequence and carry out analysis pair for 120,240,360,480
Than.On the rail layout of satellite, at least guarantee there is 1,2 or 3 satellite on every track.
2. emulation content and its interpretation of result:
Emulation experiment of the present invention is using the present invention and the prior art (the shortest route NF- based on discrete time polymerization figure
SP-TAG method) calculate separately most short time-delay road of the above-mentioned communication system between different node arrival time sequence length lower nodes
By when required time, time comparison diagram is obtained by software MATLAB, as shown in Figure 3.
In emulation experiment, the prior art of use is based on the shortest route method NF-SP-TAG of discrete time polymerization figure
Refer to, paper " the Spatio-temporal Network Databases and Routing that George B et al. is delivered at it
Algorithms,Department of Computer Science and Engineering University of
MinnesotaTechnical Report, most short time-delay routes between the fixation initial time condition lower nodes proposed in 2008 "
Method for solving, referred to as the shortest route NF-SP-TAG method based on discrete time polymerization figure.
Effect of the invention is further described below with reference to the analogous diagram of Fig. 3.
Fig. 3 is the shortest route NF-SP-TAG method point using the present invention and the prior art based on discrete time polymerization figure
It does not calculate required when most short time-delay routing of the above-mentioned communication system between different node arrival time sequence length lower nodes
Time comparison diagram.Abscissa in Fig. 3 is the length of node arrival time sequence, and the ordinate in Fig. 3 is between calculate node
Most short time-delay routes required runing time, indicates to calculate using the present invention in different sections with the curve of "-ο " mark in Fig. 3
The curve that required time obtains when most short time-delay routing between point arrival time sequence length lower node, with "-* " in Fig. 3
The curve of mark indicates to calculate based on the shortest route NF-SP-TAG method of discrete time polymerization figure in difference using the prior art
Most short time-delay between the node arrival time sequence length lower node curve that the required time obtains when routing.
As seen from Figure 3, shortest route NF-SP-TAG method and this hair of the prior art based on discrete time polymerization figure
The bright time delay tolerant network DTN most short time-delay method for routing limited based on motion interval is compared, and the required execution time is obvious
It is higher, it is primarily due to this method and is directly based upon most short time-delay routing between node arrival time sequence calculate node, do not appointed
Where reason, the computation complexity for causing method to execute increase.
The above emulation experiment shows: the present invention is defined on the basis of node arrival time sequence by motion interval
Effect reduces bulk redundancy calculating, reduces the time complexity of method execution, solves and be directly based upon node in the prior art
Most short time-delay routes between arrival time sequence calculate node, does not carry out any processing, and the computation complexity for causing method to execute increases
Big problem is most short time-delay method for routing between a kind of very efficient solution node.
Claims (2)
1. a kind of DTN network most short time-delay method for routing limited based on motion interval, which is characterized in that according to the node of link
Relationship between arrival time sequence and corresponding moment determines motion interval qualifications, obtains any source section under fixed initial time
The step of point is routed to the most short time-delay between other purposes node, this method is as follows:
(1) construction discrete time polymerization figure:
All nodes in time delay tolerant network DTN are formed a node set by (1a)；
Link if it exists between every two node, all propagation delay times by the link at the moment per second, group in (1b) node set
At a chain circuit transmission time delay sequence；
(1c) is connected by directed edge by there are the nodes of link in node set, knows corresponding link transmission in directed edge subscript
Time-delay series obtain discrete time polymerization figure；
(2) according to the following formula, each of the links are calculated in the node arrival time at each moment, by the node arrival time at all moment
Form the node arrival time sequence of the link:
ak(t)=σk(t)+t
Wherein, ak(t) node arrival time of the kth link t-th of moment, σ in time delay tolerant network DTN are indicatedk(t) table
Show propagation delay time of the kth link t-th of moment in time delay tolerant network DTN, t indicates link in time delay tolerant network DTN
Node arrival time correspond to the serial number at moment, in seconds；
(3) the most shortest time delay path information between motion interval qualifications calculate node is utilized:
(3a) respectively construct one be used for memory node work queue and destination queue, size with the size of node set
It is equal；
The source node is added in work queue by (3b) optional node in node set as source node；
(3c) successively extracts a node from work queue, and extracted node is marked, in time delay tolerant network DTN
In find out all nodes adjacent with the node, be added in destination queue；
(3d) calculates the time delay road of source node and the extracted node of process of each node in destination queue under fixed initial time
The length of diameter:
eij=min { aij(t)}
Wherein, eijIndicate the length of the latency path of the extracted node i of process of j-th of node in source node and destination queue,
Min { } indicates operation of minimizing, aij(t) indicate in extracted node i and destination queue j-th of inter-node link the
The node arrival time at t moment, t indicate that the node arrival time of link corresponds to the serial number at moment, in seconds, value
Range is [ci,lij], ciThe length for indicating the most shortest time delay path of source node and extracted node i, when i is source node, ci
Initial value be fixed initial time, when i is intermediate node, ciInitial value be ∞, lijIndicate extracted node i and purpose team
In column the node arrival time of j-th of inter-node link correspond to the moment be greater than the moment for the first time before all nodes of the link arrive
Up to the value of time minimum value；
(3e), which chooses in destination queue, meets cj> eijNode, cjIndicate source node in destination queue j-th node it is most short
The length of latency path, initial value ∞, eijIndicate the extracted node i of process of j-th of node in source node and destination queue
Latency path length；
(3f) uses eijIt updates source node and chooses the length of the most shortest time delay path of node, with extracted node updates source node
With the next-hop node in the most shortest time delay path of selection node；
(3g) judges whether each node in destination queue is labeled or in work queue, if so, by the node from mesh
Queue in delete, otherwise, then the node is added to work queue after extracting in destination queue；
(3h) judges whether work queue is sky, if so, thening follow the steps (4)；Otherwise, step (3c) is executed；
(4) it obtains in time tolerant network DTN and fixes the most shortest time delay path between initial time lower node.
2. DTN network most short time-delay method for routing, the feature according to claim 1 limited based on motion interval is existed
In successively extracting a node described in step (3b) from work queue and refer to: the node extracted for the first time is source node,
The node extracted later is intermediate node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910565211.2A CN110233797B (en) | 2019-06-27 | 2019-06-27 | DTN (delay tolerant network) shortest time delay routing method based on dynamic interval limitation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910565211.2A CN110233797B (en) | 2019-06-27 | 2019-06-27 | DTN (delay tolerant network) shortest time delay routing method based on dynamic interval limitation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110233797A true CN110233797A (en) | 2019-09-13 |
| CN110233797B CN110233797B (en) | 2020-08-25 |
Family
ID=67856551
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910565211.2A Active CN110233797B (en) | 2019-06-27 | 2019-06-27 | DTN (delay tolerant network) shortest time delay routing method based on dynamic interval limitation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110233797B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114070773A (en) * | 2021-10-13 | 2022-02-18 | 杭州电子科技大学 | Space network routing strategy based on shortest path length |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006237A (en) * | 2010-12-13 | 2011-04-06 | 西安电子科技大学 | Routing decision method for delay tolerant network |
| US20110299392A1 (en) * | 2010-06-04 | 2011-12-08 | Alcatel-Lucent Usa, Inc. | Quality of service aware rate throttling of delay tolerant traffic for energy efficient routing |
| CN104683016A (en) * | 2015-03-15 | 2015-06-03 | 西安电子科技大学 | Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay |
| CN105376157A (en) * | 2015-11-22 | 2016-03-02 | 东北大学 | Method and device for routing path selection |
| CN105407049A (en) * | 2015-10-26 | 2016-03-16 | 西安电子科技大学 | Delay tolerance network maximum flow routing method based on time aggregation graph |
| CN108964746A (en) * | 2018-08-04 | 2018-12-07 | 西安电子科技大学 | The more topology search shortest route methods of time-varying satellite network |
-
2019
- 2019-06-27 CN CN201910565211.2A patent/CN110233797B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110299392A1 (en) * | 2010-06-04 | 2011-12-08 | Alcatel-Lucent Usa, Inc. | Quality of service aware rate throttling of delay tolerant traffic for energy efficient routing |
| CN102006237A (en) * | 2010-12-13 | 2011-04-06 | 西安电子科技大学 | Routing decision method for delay tolerant network |
| CN104683016A (en) * | 2015-03-15 | 2015-06-03 | 西安电子科技大学 | Method for distributing and routing optimal services of multi-layer satellite network based on minimum time delay |
| CN105407049A (en) * | 2015-10-26 | 2016-03-16 | 西安电子科技大学 | Delay tolerance network maximum flow routing method based on time aggregation graph |
| CN105376157A (en) * | 2015-11-22 | 2016-03-02 | 东北大学 | Method and device for routing path selection |
| CN108964746A (en) * | 2018-08-04 | 2018-12-07 | 西安电子科技大学 | The more topology search shortest route methods of time-varying satellite network |
Non-Patent Citations (4)
| Title |
|---|
| MAHNOOSH ALIZADEH等: "Optimized Path Planning for Electric Vehicle Routing and Charging", 《2014 52ND ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON)》 * |
| VENKATA M.V. GUNTURI等: "A Critical-Time-Point Approach to All-Departure-Time Lagrangian Shortest Paths", 《IEEE》 * |
| 王鹏等: "基于时间聚合图的DTN网络最短时延路由算法", 《通信学报》 * |
| 陈诚: "基于时变图的DTN网络路由算法研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114070773A (en) * | 2021-10-13 | 2022-02-18 | 杭州电子科技大学 | Space network routing strategy based on shortest path length |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110233797B (en) | 2020-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102638820B (en) | Ad Hoc network link stability prediction method | |
| CN110233797A (en) | The DTN network most short time-delay method for routing limited based on motion interval | |
| Zhang et al. | Evaluation of transportation network reliability under emergency based on reserve capacity | |
| Wu et al. | Urban rail transit system network reliability analysis based on a coupled map lattice model | |
| Li et al. | A maximum algebraic connectivity increment edge-based strategy for capacity enhancement in scale-free networks | |
| Zheng et al. | A heuristic algorithm for the earliest arrival flow with multiple sources | |
| Zhang et al. | Evaluation of bus networks in china: from topology and transfer perspectives | |
| Xu et al. | Discovering the influences of complex network effects on recovering large scale multiagent systems | |
| Senturk et al. | Mobile data collection in smart city applications: the impact of precedence-based route planning on data latency | |
| JP3232962B2 (en) | Route selection method and apparatus | |
| Fukushima | A nonsmooth optimization approach to nonlinear multicommodity network flow problems | |
| Zhang et al. | Partition connectivity recovery based on relay node deployment for wireless sensor networks | |
| El-Hajj et al. | Fast distributed dominating set based routing in large scale MANETs | |
| Lv et al. | Research on routing algorithm based on limitation arrangement principle in mathematics | |
| Sehgal | MODELING AND ANALYSIS OF DELAY TOLERANT NETWROKS | |
| CN102547902A (en) | Multipath routing method for Ad-Hoc network based on planar region division | |
| CN108989224A (en) | A kind of multicast route method of space DTN network | |
| Cho et al. | A Hybrid Routing Algorithm for an Efficient Shortest Path Decision in Network Routing | |
| CN110098972A (en) | A kind of heuristic of measuring node placement and detective path planning | |
| Ni et al. | Simulation and Performance Analysis of Bridge Monitoring System | |
| Wang et al. | Time-varying Contact Management with Dynamic Programming for LEO Satellite Networks | |
| Jiang et al. | A re-optimization dynamic shortest path algorithm for vehicle navigation | |
| Wang et al. | Compressed sensing and mobile agent based sparse data collection in wireless sensor networks | |
| Nandi et al. | An optimal network for passenger traffic | |
| Chen et al. | Urban metro network topology evolution and evaluation modelling based on complex network theory: a case study of Guangzhou, China |
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 |