CN105072031B - A kind of delay-disruption tolerant network method for routing based on link transmission ability - Google Patents
A kind of delay-disruption tolerant network method for routing based on link transmission ability Download PDFInfo
- Publication number
- CN105072031B CN105072031B CN201510471199.0A CN201510471199A CN105072031B CN 105072031 B CN105072031 B CN 105072031B CN 201510471199 A CN201510471199 A CN 201510471199A CN 105072031 B CN105072031 B CN 105072031B
- Authority
- CN
- China
- Prior art keywords
- message
- capacity
- node
- forwarding
- link
- 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.)
- Expired - Fee Related
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/125—Shortest path evaluation based on throughput or bandwidth
-
- 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/127—Shortest path evaluation based on intermediate node capabilities
Abstract
A kind of DTN network route methods based on link transmission ability.To improve message-submission rate as target, using link transmission capacity calculation and message priority as core methed, solves message routing issue in DTN networks.The concept of " virtual link " is defined to represent the inter-node link in DTN networks, defines capacity to represent the transmittability of virtual link, and the computational methods of design capacity, memory mechanism, propagation update method.On capacity definition basis, the forwarding capacity of message is defined, and designs the loss priority of message and the forwarding priority of (message, node) two tuples.When message carries out robin, according to (message, node) two tuple priority, the two tuple new type of messages forwarding that priority is high is selected.Into during row buffer application, the discarding of message is selected according to the loss priority of message, and the message for selecting loss priority high is abandoned.By rational message selection mechanism, so as to improve the delivery rate of message in DTN networks.
Description
Technical field
The present invention relates to disappearing for delay-disruption tolerant network (Delay-and Disrupted-Tolerant Network, DTN)
Routing field is ceased, more particularly to a kind of DTN internet message method for routing based on link transmission ability.
Background technology
Different from traditional network, DTN networks are usually operated in constrained environment.Which dictates that DTN networks have tradition
Many characteristics that network does not have, including：Intermittent connection, high latency, chance transmission etc..Traditional routing method can not all fit
For this network environment, it is therefore desirable to re-start research and design to the routing algorithm in DTN networks.
Up to the present, many DTN network route methods have been proposed in researcher, can be with according to routing strategy
It is divided into following three classes：
(1) method for routing based on contact probability：
Method for routing based on contact probability, according to the contact historical information between node, two nodes of prediction it is following certain
The probability contacted again in one time.Node forwards messages to those contact target nodes when carrying out message forwarding
The big node of likelihood ratio oneself, so as to improve the probability that message is forwarded to destination node.Has method for routing based on probability
Including：Prophet Router, MaxProp Router and Delegation Router etc.
(2) method for routing based on node relationships
Method for routing based on node relationships according to motion model, contact model between node etc., predicts the pass between node
System, is then forwarded according to the relationship between node.Mobile social networking is mainly used at present, by the society for predicting node
Attribute and social relationships forward the messages to the node in close relations with destination node, and mesh is forwarded to so as to reach raising message
Tag splice treats your probability.The existing method for routing based on node relationships includes：Social Feature-based Multi-path
Routing and An OptimalProbabilistic Forwarding Protocol etc..
(3) method for routing based on node density
Method for routing based on node density, according to the density of local nodes in DTN networks, by the higher section of local density
Then the repeating process of message is converted into cluster two parts between cluster by point regional organization into a cluster.Such method for routing, one
As by choosing a Leader node for each cluster, be responsible for forwarding of the message in cluster between cluster.There is message progress in cluster
During forwarding, Leader nodes are first forwarded messages to, forwarding is then responsible for by Leader nodes.The existing road based on node density
Included by method：CAMR, EIMD etc..
Any of the above method for routing has its advantage and applicable scene, but in DTN networks, they are not perfect
Method for routing.Moreover, these method for routing are all the selections being route from the angle of node, link in network is not accounted for
To the directive function of routing, the utilization to the network information is not very sufficient.It is abstracted in the link between DTN nodes
After definition, the network information can be more fully utilized, so as to improve the efficiency of network routing.
Invention content
The present invention is to improve internet message delivery rate as target, using link transmission ability and message prioritization as core concept,
Solve the message routing issue in DTN networks.It specifically includes：
1. in order to describe the transmission link in DTN networks, it is proposed that the concept of " virtual link ".To the general of link " capacity "
Thought is defined, come the transmittability for representing and distinguishing virtual link.Define computational methods, storage mode and the propagation of capacity
With update method.
2. define concept, storage mode and the storage organization of message forwarding capacity.Define message loss priority and
Forwarding priority, and herein the routing forwarding strategy based on link transmission ability is devised on basis.
Compared with prior art, innovation of the invention is：With the preferential of DTN network link transmissions ability and message
Grade is core concept, improves DTN internet message delivery rates.It is embodied in：
On the one hand 1. the definition of virtual link embodies in DTN networks the spy of " Route Selection i.e. next-hop node selects "
Property, another aspect also embodies the transmission link asymmetry of DTN networks.Virtual chain in DTN networks has been distinguished in the definition of capacity
Link transmission ability in road and non-DTN networks reflects in DTN networks transmittability end to end.
2. the definition of forwarding capacity embodies the current delivery status of message, the message defined on basis herein abandons excellent
First grade is embodied in the possibility being dropped into message when row buffer application.The forwarding priority of message considers to establish more
In the case of a link, the selection of message and link how is carried out.On the basis defined in message priority, the forwarding of routing
Decision process is then converted into the process of message and link selection.
Description of the drawings
Fig. 1 virtual links and capacity description
Fig. 2 memory configurations
Fig. 3 forwarding capacity data structures
Specific embodiment
Refering to Fig. 1.Fig. 1 describes the DTN networks for including two virtual links.In DTN networks, the forwarding of message is root
Decision is carried out according to next-hop node, the transmittability of next-hop node to destination node is higher, also means that message more
It may or faster be transmitted to destination node.Source node is only concerned about how soon can next-hop node or forward the messages to target
How node forwards the messages to destination node without concern for next-hop node, thus can by source node, next-hop node and
The path of destination node these three nodes composition is regarded as one " virtual link ", and source node is according to the biography of this " virtual link "
Movement Capabilities select next-hop node.
Consider the virtual link of node A (source node), node B (next-hop node) and node C (destination node) compositions.Figure
Between interior joint using dotted line connect, be due to the connection between node be not it is lasting, dotted line connect represent two nodes with
Before established connection or in the future will establish connection.This is also why to be referred to as link " virtual ", i.e. DTN networks
In there is no continuous link, link is sudden and of short duration.In addition, there are a piece of for the connection between node B and node D
" cloud ", this is because source node is indifferent to how next-hop node forwards the messages to destination node, it is only necessary to which knowing can incite somebody to action
Message is forwarded to destination node.
In the present invention virtual link, source node A, next-hop node B, target are represented using vl (A, B, C)
Node is C.The presence of virtual link is conditional, and is defined first below up to node and the Node Concepts that can go directly：
● up to node：If nodes X can forward the messages to node Y, then node Y is the reachable node of nodes X.It can
Definition up to node is asymmetrical.Even node Y is the reachable node of nodes X, do not illustrate nodes X be also node Y can
Up to node.
● can go directly node：If nodes X can be in direct contact with node Y, then node Y is going directly for nodes X
Node.The definition of node of can going directly is symmetrical.It is, if node Y is the node that goes directly of nodes X, then nodes X is also
The node that goes directly of node Y.Intuitively understand, be both that nodes X is directly connect with node Y after nodes X is met with node Y
It touches and node Y is in direct contact with nodes X.In addition, if node Y is the node that goes directly of nodes X, then node Y must be
The reachable node of nodes X.Not vice versa.
Later, we can introduce necessary and sufficient condition existing for virtual link, i.e.,：Virtual link vl (A, B, C) is existing to be filled
Want condition be node B be node A go directly node and node C be node B reachable node.Thus necessary and sufficient condition can be known
Road, the existence of virtual link is also asymmetrical.When virtual link vl (A, B, C) there are when, we do not know vl (C,
B, A) it whether there is.Additionally, there are a kind of special virtual link, i.e. vl (A, B, B).Vl (A, B, B) represents one only by two
The virtual link of a node composition, when message is forwarded on this virtual link, source node directly forwards the messages to mesh
Mark node.Identical from the requirement of different virtual links for the existence of vl (A, B, B), node B must be going directly for node A
Node, and obviously node B is the reachable node of oneself.
In order to carry out the forwarding of message according to " virtual link ", need to be defined the transmittability of virtual link.
The transmittability for defining " virtual link " is " capacity ".The capacity definition of nodes X to node Y is：It can be from section in unit interval
Point X is transmitted to the data volume of node Y, is represented with C (X, Y).From the definition of capacity as can be seen that capacity is oriented, that is,
The capacity of nodes X to node Y from the capacity of node Y to nodes X are different, i.e. C (X, Y) ≠ C (Y, X), this meets DTN networks
The asymmetry of transmittability.If representing network with graph structure, then cable network is exactly a non-directed graph, and
DTN networks are then a digraphs.The capacity of virtual link vl (A, B, C) is represented using C (A, B, C), by virtual link not
Symmetry understands C (A, B, C) ≠ C (C, B, A) (assuming that vl (A, B, C) and vl (C, B, A) exists).
In order to calculate the computational methods of export capacity, the situation of single virtual link is considered first.Node A to node D is deposited
At one " virtual link " --- vl (A, B, D).Consider node A need forward 1 byte message arrive node D, then node A need
Node B is forwarded messages to, node D is then forwarded to by node B again.According to the definition of capacity it is found that node A is forwarded to section
It is the time required to point BNode B is forwarded the time required to this message to node DSo node A forwards 1 byte to disappear
It is that the capacity so as to obtain " virtual link " vl (A, B, D) is the time required to breath to node C：
The situation of two virtual links is considered again, is then generalized to the situation of arbitrary finite item " virtual link ".Still
Consider that node A needs to transmit the message of 1 byte, then the time that node D is transmitted to by " virtual link " vl (A, B, D) isThe time that node D is transmitted to by " virtual link " vl (A, C, D) isBut node A is to node B and section
The capacity of point C is different, i.e. C (A, B, B) and C (A, C, C) is different.In practical application scene, node is more likely to
The larger path of selection capacity is forwarded, therefore can useWithIt is secondary represent vl (A,
B, D) and vl (A, B, D) weights, then node A transmission 1 byte to node D average time be:
So as to which the capacity for obtaining egress A to node D is：
It is generalized to ordinary circumstance, it is assumed that nodes X can reach node Y by the n nodes that can go directly, wherein i-th can be straight
Up to node ZiThat is represented, then nodes X to the capacity between node Y is：
Refering to Fig. 2.Fig. 2 describes the storage organization of capacity, including two table structures：Capacities chart (Node Capacity
Table, NCT) and virtual link capacities chart (Virtual Link Capacity Table, VLCT).The Y in node capacity tablei
Represent the destination node of this record, C (X, Yi) source node X is represented to destination node YiCapacity.In virtual link capacities chart
In, ZiRepresent this record destination node, be nodes X the node that can go directly, C (X, Zi, Zi) represent link vl (X, Zi,
Zi) capacity, btiRepresent the settling time of record.There is no any record in table when initial, when encountering a node, save thus
Point establishes record.Therefore, ntiAlso it represents nodes X and meets node Z for the first timeiTime.totaliIt represents up to the present, node
X can be to node ZiThe data volume that can be transmitted.Here it can transmit, not be to represent nodes X to node ZiThe data volume transmitted,
But node Z can be transferred to by being in direct contact by representing nodes XiData volume.For example, nodes X and node ZiBetween the transmission that connects
Rate is v, link time t, then this time link can transmitted data amount be v × t.
When nodes X just adds in network, nodes X knows nothing network.Therefore, the node capacity of nodes X
It is sky when table is initial.Over time, nodes X constantly meets other nodes, then collecting network information uses this
A little information are come to instruct possible message forwarding in the future (may be the message that oneself is created, it is also possible to the forwarding of other nodes be helped to disappear
Breath).The capacity information of other nodes and itself capacity information is updated in process, that is, collection network of node collecting network information
Process.
When two nodes, --- by taking nodes X and node Y as an example --- when meeting, they need to exchange its respective appearance
Measure the information of information, i.e. node capacity table, then each self refresh own node capacities chart.It is noted herein that work as nodes X
After node Y switching node capacities charts, nodes X update NCTX, then the NCT that node Y is receivedXIt is out-of-date just to become.But
At this time need not exchange capacity again because its newer only increases the update after node Y.Therefore, the friendship of node capacity table
It changes when only occur in link and establish.After nodes X has exchanged node capacity table with node Y, nodes X needs to update itself
Node capacity table, but its update is not related to entire node capacity table, pertains only to the reachable node of all node Y.
When meeting in addition to node, when disconnection is connected between node, it is also desirable to capacity is recalculated, but
The capacity calculated at this time pertains only to the node disconnected.After nodes X and node Y are disconnected, nodes X needs to weigh first
It is new to calculate C (X, Y, Y), C (X, Y) is then recalculated again.The former calculation is as follows：
Wherein, ct represents current time, and sp represents the transmission rate of this time link, and duration represents holding for this time connection
The continuous time.In addition, it is also desirable to which refreshing is timed to node capacity table.It is, each a period of time is to node capacity table
Refreshed, so as to reduce the property delayed of node capacity table.The method for refreshing of node capacity table is fairly simple, and calculation formula is such as
Under：
In order to be ranked up to message and the forwarding of guide message, we define turning for message on the basis of capacity
Send out capacity (relay capacity, rc).The forwarding capacity of one message be defined as " counted from this message creation time, this
Message has been forwarded to the data volume of destination node ".Certainly, we can not possibly accurately obtain the forwarding capacity of message, therefore this
In forwarding capacity be an estimated value, be to be determined by the forwarding situation of message.
Refering to Fig. 3.Fig. 3 message forwarding capacity stores data structure --- MessageInfo (MI).The MI of message is by three
It is grouped as, including：The current forwarding capacity of message (rc), capacity acceleration (acceleration) and message forwarding capacity are nearest
A renewal time (ut).When message establishing, one MI of message establishing thus, and by the forwarding capacity of this message and
Capacity acceleration is initialized as 0, and the last update time of this message forwarding capacity is set as current time.Once message into
Forwarding is gone, it is necessary to the capacity acceleration of message be recalculated, computational methods are as follows：
MIm.acceleration=MIm.accleration+C (Y, desm)
The capacity acceleration of message m is increased to the capacity between node Y to m destination nodes.And the forwarding capacity of message is
It is calculated by the capacity acceleration of message, computational methods are as follows：
MIm.rc=MIm.rc+MIm.acceleration*(ct-MIm.ut)
Wherein, ct represents current time.Intuitively understand, that is, the forwarding capacity of message was increased from last time and is updated
To the increased capacity of current time.
On the basis of message forwarding capacity, the priority of message can be defined, including：Loss priority and forwarding are excellent
First grade.Loss priority is defined when node messages buffering area is full, it should which message be selected to be abandoned.Message
Loss priority is directly determined that a message forwarding capacity is bigger by the forwarding capacity of message, then illustrates that message has been transmitted
Data volume to destination node is more.Therefore, when buffering area is full, it should preferentially abandon this message.Use pmRepresent message m
Loss priority, computational methods are：
pm=1/MIm.rc
The p of one messagemIt is worth smaller, it is higher to represent its priority, also with regard to this message more it is possible that being dropped.
The forwarding priority of message is determined when connection is established, it should preferentially forward which message.In DTN networks
In, a node may establish multiple connections in synchronization with multiple nodes.Therefore, when message is forwarded, not only
Consider message, also to consider to connect.That is, repeating process is not only the process of selection message and selects connection
Process.In order to solve this problem, the priority of (message, node) two tuples is defined, then according to the excellent of this two tuple
First grade selects the message to be transmitted to a specific node.We use pT (m, Y)Represent two tuples (m, Y) priority,
Computational methods are as follows：
That is two tuples (m, Y) determine by the capacity of node Y to message m destination node divided by the capacity acceleration of message, directly
Understand in sight and m is namely forwarded to the increased capacity acceleration ratios of node Y.The p of two tuplesT (m, Y)Value is bigger, then preferential choosing
This two tuple is selected to be forwarded.In addition, work as MIm.acceleration when being 0, pT (m, Y)It is set as C (Y, desm)。
On the basis of message priority, the forwarding strategy of message can be defined, is included the following steps：
(1) MI of all message in buffering area is calculated.
(2) two all tuples (message, connection) are established.
(3) priority of all two tuples is calculated, and according to priority size sorts.
(4) if there is more message can be transmitted, two tuples (m, Y) for selecting and removing highest priority are transmitted.
Otherwise, 7 are gone to.
(5) it attempts message m being forwarded to node Y, if node Y received messages, start this transmission；Otherwise, 4 are gone to.
(6) when message m is transmitted, MI is updatedmAnd by MImNode Y is sent to, goes to 4.It is led if being disconnected with node Y
Transmission is caused, then directly goes to 4.
(7) no message is transmitted, and waits for new connection or new message.
If step 5 describes, when message m is transmitted to node Y, node Y needs to decide whether received message m.Section
Point Y decides whether to receive this message according to many factors.Node Y is first determining first oneself not to transmit message, then
It needs to be determined that there is no this message in buffering area.When the condition of front all meets, next node Y is just only needed to receive
This message does last preparation --- application space.If node Y has enough free spaces to store message m, then then connects
By this message.Otherwise node Y needs to decide whether to carry out message discarding, so as to which vacating space stores message m.When having
When sufficient space carrys out received message m, then receive this message；Otherwise refusal receives this message.
Claims (1)
1. a kind of DTN network route methods based on link transmission ability, portraying and counting including DTN network link transmission abilities
Calculate, message forwarding capacity portray and calculate and based on virtual capacity message forwarding and abandon effectiveness calculate, it is characterised in that：
First, " virtual link capacity " is designed to portray DTN network multi-hops path one-way transmission ability end to end, is jumped based on one
The capacity of tie link calculates " the virtual link capacity " of multi-hop link；Next, by design " forwarding capacity " and " capacity adds
Speed " portrays the total quantity size that message is forwarded；Third, message based " forwarding capacity ", " capacity acceleration " and
The forwarding of " virtual link capacity " design message and discarding effectiveness of the present node to destination node；After the completion of above-mentioned steps, section
Point forwards and abandons message based on forwarding effectiveness and discarding effectiveness, completes route messages forwarding；
" virtual link capacity " calculating of multihop path comprises the following steps：
1) for any one paths P (X, Y), P (X, Z are calculated firsti) virtual link capacity, wherein ZiOne for X jumps neighbour
It occupies, calculation formula is：Capacity refreshes formula： Wherein
Ct is current time, btiFor the last link (X, Zi) the connection time started, totaliTo arrive btiTotal data until time
Transmission quantity, sp are the transmission rate of this link, and duration represents the duration of this time connection；
2) if nodes X has a n hop neighbor Zi, then the virtual link calculation of capacity formula of path P (X, Y) be：
Wherein C (X, Zi,Zi), C (Zi, Y) and it is path P (X, Zi) and path P (Zi, Y) virtual link capacity, ZiA jump for X
Neighbours；
According to virtual link capacity, calculate the current forwarding capacity (rc) of message, capacity acceleration (acceleration) and disappear
Forwarding capacity recent renewal time (ut) is ceased to portray the data volume MI that message has been forwarded to destination nodem, message
Current forwarding capacity calculation formula is as follows：
MIm.rc=MIm.rc+MIm.acceleration*(ct-MIm.ut)
Wherein MIm.rc it is the forwarding capacity of message m, MIm.acceleration it is that (initial value is for the capacity acceleration of message m
0), MIm.ut it is message forwarding capacity recent renewal time, ct is current time；
Message current capacities acceleration formula is as follows：
MIm.acceleration=MIm.acceleration+C(Y,desm)
Wherein C (Y, desm) for the node Y where message m and message destination node desmBetween virtual link capacity；
On the basis of virtual link capacity and message forwarding capacity, message m is in the discarding effectiveness p of place node YmCalculating
Formula is as follows：
pm=1/MIm.rc
Wherein MIm.rc it is forwarding capacity of the message m on node Y；
Message m is in the forwarding effectiveness p of place node Yt(m,Y)Calculation formula it is as follows：
Wherein MIm.acceleration it is capacity acceleration of the message m on node Y, C (Y, desm) the node Y where message m
To message destination node desmVirtual link capacity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510471199.0A CN105072031B (en) | 2015-08-04 | 2015-08-04 | A kind of delay-disruption tolerant network method for routing based on link transmission ability |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510471199.0A CN105072031B (en) | 2015-08-04 | 2015-08-04 | A kind of delay-disruption tolerant network method for routing based on link transmission ability |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105072031A CN105072031A (en) | 2015-11-18 |
| CN105072031B true CN105072031B (en) | 2018-07-06 |
Family
ID=54501317
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510471199.0A Expired - Fee Related CN105072031B (en) | 2015-08-04 | 2015-08-04 | A kind of delay-disruption tolerant network method for routing based on link transmission ability |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105072031B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105681203B (en) * | 2016-01-14 | 2018-07-20 | 北京交通大学 | A kind of countermeasure that the connection of space delay tolerant network is surprisingly failed |
| CN114257527B (en) * | 2021-11-01 | 2024-02-02 | 北京思特奇信息技术股份有限公司 | Network bearing capacity estimation method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102780637A (en) * | 2012-08-14 | 2012-11-14 | 虞万荣 | Routing method for data transmission in space delay/disruption tolerant network |
| WO2012160417A1 (en) * | 2011-05-25 | 2012-11-29 | Nokia Corporation | Method and apparatus for facilitating disaster communications |
| CN102882778A (en) * | 2012-10-25 | 2013-01-16 | 西安电子科技大学 | DTN (Delay Tolerant Network) network routing method with limited node buffering |
-
2015
- 2015-08-04 CN CN201510471199.0A patent/CN105072031B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012160417A1 (en) * | 2011-05-25 | 2012-11-29 | Nokia Corporation | Method and apparatus for facilitating disaster communications |
| CN102780637A (en) * | 2012-08-14 | 2012-11-14 | 虞万荣 | Routing method for data transmission in space delay/disruption tolerant network |
| CN102882778A (en) * | 2012-10-25 | 2013-01-16 | 西安电子科技大学 | DTN (Delay Tolerant Network) network routing method with limited node buffering |
Non-Patent Citations (2)
| Title |
|---|
| COMSP: Correlated Contact and Message Scheduling Policy in DTN;Zhenxi Sun,et al.;《2013 IEEE International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computin》;20131115;正文第3-4节，图1-3 * |
| Data Dissemination in Delay and Disruption Tolerant Networks Based on Content Classification;Yazhou Jiao，et al.;《 Mobile Ad-hoc and Sensor Networks, 2009. MSN "09. 5th International Conference on》;20091216;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105072031A (en) | 2015-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Prodhan et al. | TTL based routing in opportunistic networks | |
| CN106789648B (en) | Software defined network route decision method based on content storage and Network status | |
| Shen et al. | Routing protocols in delay tolerant networks: A comparative survey | |
| Radenkovic et al. | Congestion aware forwarding in delay tolerant and social opportunistic networks | |
| Grundy et al. | Promoting congestion control in opportunistic networks | |
| Liu et al. | Improvement of AODV routing protocol with QoS support in wireless mesh networks | |
| CN102571571A (en) | Multilayer effective routing method applied to delay tolerant network (DTN) | |
| CA2441579A1 (en) | Multi-path dynamic routing algorithm | |
| CN107294852B (en) | Network routing method using topology dispersed short path set | |
| Mehto et al. | Comparing delay tolerant network routing protocols for optimizing L-copies in spray and wait routing for minimum delay | |
| CN105072031B (en) | A kind of delay-disruption tolerant network method for routing based on link transmission ability | |
| Yamunadevi et al. | Efficient comparison of multipath routing protocols in WSN | |
| CN104270324B (en) | A kind of jamming control method suitable for tethered satellite network | |
| CN104469874A (en) | Message forwarding method of opportunistic network based on probability centrality | |
| WO2005079001A1 (en) | Network architecture | |
| Devarajan et al. | An enhanced cluster gateway switch routing protocol (ECGSR) for congestion control using AODV algorithm in MANET | |
| Ma | Coupling degree seeking based routing strategy for delay tolerant networks | |
| Qin et al. | A cross-layer QoS design with energy and traffic balance aware for different types of traffic in MANETs | |
| Kumar et al. | ACO based QoS aware routing for wireless sensor networks with heterogeneous nodes | |
| Srivastava et al. | Implementation of Ant Colony Optimization Algorithm for Load Balancing Routing in MANET Network | |
| Wei et al. | A routing optimization method based on ACA for FANETs | |
| CN105072046A (en) | Delay tolerant network congestion prevention method based on data concurrence and forwarding by token control node | |
| CN104954284B (en) | A kind of delay-tolerant network congestion-preventing approach towards probability routing | |
| Divyashree et al. | Performance Analysis and Enhancement of QoS Parameters for Real-Time Applications in MANETs-Comparative Study | |
| Balamurugan et al. | Designing Novel Routing Algorithms for Wireless Mobile Ad-Hoc Networks to Improve Their Enactment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210420 Address after: 100160, No. 4, building 12, No. 128, South Fourth Ring Road, Fengtai District, Beijing, China (1515-1516) Patentee after: Kaixi (Beijing) Information Technology Co.,Ltd. Address before: 100191 Haidian District, Xueyuan Road, No. 37, Patentee before: BEIHANG University |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180706 Termination date: 20210804 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |