CN108989224B - Multicast routing method of space DTN (delay tolerant network) - Google Patents
Multicast routing method of space DTN (delay tolerant network) Download PDFInfo
- Publication number
- CN108989224B CN108989224B CN201810942183.7A CN201810942183A CN108989224B CN 108989224 B CN108989224 B CN 108989224B CN 201810942183 A CN201810942183 A CN 201810942183A CN 108989224 B CN108989224 B CN 108989224B
- Authority
- CN
- China
- Prior art keywords
- node
- path
- nodes
- dist
- minimum
- 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.)
- Active
Links
Images
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
Abstract
The invention discloses a multicast routing method of a space DTN (delay tolerant network), belonging to the technical field of satellite communication. The invention obtains the information of the contact start and stop time and the like between the nodes by utilizing the characteristics of periodicity and predictability of the moving track of the space nodes in the space DTN, provides the minimum time sequence path algorithm between the nodes according to the specific storage-carrying-forwarding mechanism of the space DTN, constructs the multicast tree by continuously iterating the minimum time sequence path algorithm and utilizing the public nodes in the multicast path, and ensures the delivery rate of the network and improves the utilization rate of network resources by well responding to the characteristics of long time delay, high error rate, intermittent connection and limited network resources of the space DTN space networking by the multicast route constructed by the method.
Description
Technical Field
The invention belongs to the technical field of satellite communication, and particularly relates to a multicast routing method of a space DTN network.
Background
With the development of the aerospace technology, how to timely and accurately acquire, process and distribute spatial information by using spacecraft networking becomes a technical key. The structure characteristics of DTN (Delay Tolerant Networks) network and the characteristics of space spacecraft networking are highly matched, and the DTN network is suitable for space spacecraft networking and is interconnected with various Networks on the ground, thereby forming the space DTN network. The space DTN has the characteristics of long delay, intermittent connection, high error rate and the like of the traditional DTN, and in addition, the space equipment uses an aerospace-level chip, so that the storage resources of nodes in the space DTN are very limited. Therefore, a specific routing scheme in a spatial environment needs to be designed.
The current research on the multicast routing of the DTN is mainly aimed at the application background of the opportunity network, and the research on the multicast routing of the spatial DTN is very little. In an opportunistic network environment, the movement trajectory of a node is unpredictable, that is, the mobility model of the node is not deterministic. In contrast, in the spatial DTN network, the node mobility model has determinacy, and even if some spatial nodes change the network topology change process due to random movement, the new network topology change process formed has determinacy due to the periodic law of the spatial node movement, that is, the mobility model of the spatial nodes is a deterministic node mobility model with certain randomness.
The study of the routing method of the spatial DTN network is generally based on that the topology change is a definite process. Sushant et al originally developed the research work for determining the spatial DTN network routing method for link scheduling, formally described the deterministic spatial DTN network, and studied 3 different routing methods, such as a zero-knowledge-based first-time contact routing method, a partial-knowledge-based routing method, and a global-information-based linear programming routing method. Studies by Sushant et al show that the above 3 routing methods show advantages in terms of latency and packet delivery rate as the amount of information increases. The Contact Graph routing method cgr (Contact Graph routing) proposed by Burleigh et al is a representative very classical spatial DTN network routing method, and the routing calculation process is performed according to the Contact Graph (Contact Graph). But the Sushant and Burleigh studies do not address the multicast problem of spatial DTN networks.
Disclosure of Invention
Aiming at the defects or the improvement requirements of the prior art, the invention provides a multicast routing method of a space DTN, which aims to obtain information such as contact start and stop time between nodes by fully utilizing the characteristics of periodicity and predictability of the moving track of the space nodes, provide a minimum time sequence path algorithm between the nodes according to a specific storage-carrying-forwarding mechanism of the DTN, construct a multicast tree by continuously iterating the minimum time sequence path algorithm and utilizing common nodes in the multicast path, and thus solve the technical problem of the multicast routing of the space DTN.
In order to achieve the above object, the present invention provides a multicast routing method for a spatial DTN network, which comprises the following steps:
let the multicast source node in the spatial DTN network be s, and the destination node set D ═ D i1,2, m, from source node s to destination node diHas a path of p (s, d)i) Path p (s, d)i) Hop count of (c) is hop (p (s, d)i) ); the method for constructing the spatial DTN network multicast tree T (s, D) comprises the following steps:
(1) initializing, multicast tree T ═ phi, time shift starting time Ts0, the source node s computes it to all destination nodes d according to a minimum timing distance algorithmiP (s, d) of the minimum timing pathi)(i＝1,2,...,m)；
(2) According to path p (s, d)i) The hop count of (i ═ 1, 2.., m) sorts all paths in descending order, setting hop (p (s, d)1))≥hop(p(s,d2))≥…≥hop(p(s,dm) I.e., source node s to destination node d)1The number of hops passed is the largest and reaches the destination node dmThe number of hops passed is minimal;
(3) selecting the path p (s, d) of the largest number of hops1) Added to the multicast tree T, i.e. T ═ T ∪ { p (s, d)1) And i ═ 2;
(4) selecting the next destination node diAccording to the minimum time sequence distance algorithm, each node T in the multicast tree T is respectively used forjDist [ T ] of (j ═ 1,2,., | T |)j]Calculating t as a time-shift start timejTo diMinimum timing path p (t)j,di)；
(5) At the minimum set of timing paths p (t)j,di)|tjE.g. if the node T of the multicast tree T in e.t, j ═ 1,2k(k is more than or equal to 1 and less than or equal to | T |) to diMinimum timing path p (t)k,di) If the number of the common nodes is the maximum, the minimum time sequence path is taken as a source node s to pass through the node TkTo the destination node diAnd join multicast tree T, i.e., T ═ T ∪ { p (T)k,di)}；
(6)i＝i+1；
(7) Repeating the steps (4) to (6) until all destination nodes diAll the information is added into a multicast tree T, so that a multicast routing method of a space DTN network is obtained;
if node u and node v are in time interval ts,te]If there is one contact, the contact c (u, v) between the node u and the node v can be represented as a quadruple, i.e. c (u, v) ═ u, v, ts,te) Wherein t issAt the contact start time, teIs the contact termination time; defining a timing distance as a message passing through multiple contacts from one nodeThe time required for transmitting to another node, the corresponding time sequence path with the minimum time sequence distance is the minimum time sequence path;
let S be a source node, V be a node set of the network, S be a node set of which the shortest path is obtained, U be a node set of which the shortest path is not determined yet, dist (S, V) represents a time sequence distance from the source node S to the node V, and dist [ V ] represents a minimum time sequence distance from the source node S to the node V; the minimum timing distance algorithm specifically comprises the following steps:
(S1) initialization: let S be { S }, then U be V-S; if there are n (n ≧ 1) contacts between nodes v and s in U, the timing distance dist (s, v) from source node s to node v is min { ci(s,v).ts|ci(s,v).ts≥TsI ═ 1,2, …, n }; otherwise, dist (s, v) ═ infinity;
(S2) selecting a node w, wherein w belongs to U and dist (S, w) belongs to min { dist (S, v) | v belongs to U }, adding w into S, namely S is S ∪ { w }, and U is U- { w }, and at the moment, the minimum time sequence distance dist [ w ] from the source node S to the node w is disct (S, w);
(S3) updating the original dist (S, v) value of the node v which is in contact with the node w in all the U: if there are k (k ≧ 1) contacts between node v and node w in U, dist (s, v) is min { dist (s, v), min { c ≧ 1i(v,w).ts|ci(v,w).ts≥dist[w]，i＝1,2,…,k}}；
(S4) repeating the steps (S2), (S3) until all nodes are merged into S.
Further, the step (1) of determining the time-sequence distance between two nodes according to the contact information between two points in the network specifically includes: the contact information between the nodes in the spatial DTN is predicted, and the time required for the message to be transmitted from one node to another node through a plurality of contacts is calculated to obtain the time sequence distance between the two nodes.
Further, the contact information between the two points is predicted according to a node mobility model in the spatial DTN network.
Further, in the step (1), the source node s to all the destination nodes d in the spatial DTN network are further calculatediMinimum timing path ofThe body is as follows: the path formed by the nodes passed by the minimum timing distance is the minimum timing path.
Generally, compared with the prior art, the technical scheme of the invention has the following technical characteristics and beneficial effects:
the method of the invention fully utilizes the characteristics of the periodicity and predictability of the moving track of the space nodes to obtain the information such as the contact starting and stopping time between the nodes. The multicast routing constructed by the method can well respond to the characteristics of long time delay, high error rate, intermittent connection and limited network resources of spatial DTN network space networking, ensure the delivery rate of the network and improve the utilization rate of the network resources.
Drawings
FIG. 1 is a flow chart of a method embodying the present invention;
fig. 2 is a typical application environment network node contact timing diagram of the method of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
Let the multicast source node in the spatial DTN network be s, and the destination node set D ═ D i1,2, m, from source node s to destination node diHas a path of p (s, d)i) Path p (s, d)i) Hop count of (c) is hop (p (s, d)i)). The main process steps for constructing the spatial DTN network multicast tree T (s, D) are as shown in fig. 1, and include the following steps:
(1) initialization, multicast tree T ← phi, time-shift start time TsWen jiao 0, based on the best resultSmall time sequence distance algorithm, source node s calculates it to all destination nodes diP (s, d) of the minimum timing pathi)(i＝1,2,...,m)；
(2) According to path p (s, d)i) The hop count of (i ═ 1, 2.., m) sorts all paths in descending order, without loss of generality, by hop (p (s, d)1))≥hop(p(s,d2))≥…≥hop(p(s,dm) I.e., source node s to destination node d)1The number of hops passed is the largest and reaches the destination node dmThe number of hops passed is minimal;
(3) selecting the path p (s, d) of the largest number of hops1) Adding into the multicast tree T, T ← T ∪ { p (s, d)1) And i ← 2;
(4) selecting the next destination node diAccording to the minimum time sequence distance algorithm, each node T in the multicast tree T is respectively used forjDist [ T ] of (j ═ 1,2,., | T |)j]Calculating t as a time-shift start timejTo diMinimum timing path p (t)j,di)；
(5) At the minimum set of timing paths p (t)j,di)|tjE.g. if the node T of the multicast tree T in e.t, j ═ 1,2k(k is more than or equal to 1 and less than or equal to | T |) to diMinimum timing path p (t)k,di) If the number of the common nodes is the maximum, the minimum time sequence path is taken as a source node s to pass through the node TkTo the destination node diAnd is added to the multicast tree T, i.e., T ← T ∪ { p (T)k,di)}；
(6)i＝i+1；
(7) Repeating the steps (4) to (6) until all destination nodes diAll add into the multicast tree T, thus obtaining the multicast routing method of the space DTN network.
In the contact timing chart, the time-shift start time is referred to as "time-shift observation time", and is denoted as "T"s. If node u and node v are in time interval ts,te]If there is one contact, the contact c (u, v) between the node u and the node v can be represented as a quadruple, i.e. c (u, v) ═ u, v, ts,te) Wherein t issFor the contact to startTime of day teIs the contact termination time. Defining the time sequence distance as the time required for the message to pass from one node to another node through a plurality of contacts, then using the following minimum time sequence distance algorithm, the minimum time sequence distance from the source node to all other nodes in the network can be obtained, and the corresponding time sequence path with the minimum time sequence distance is the minimum time sequence path.
Let S be the source node, V be the node set of the network, S be the node set of which the shortest path has been found, U be the node set of which the shortest path has not been determined, dist (S, V) represents the time sequence distance from the source node S to the node V, dist [ V ] represents the minimum time sequence distance from the source node S to the node V. The minimum timing distance algorithm specifically comprises the following steps:
(1) initialization: let S ← { S }, then U ═ V-S. If n (n is more than or equal to 1) contacts exist between the nodes v and s in the U, the time sequence distance dist (s, v) ← min { c) from the source node s to the node vi(s,v).ts|ci(s,v).ts≥TsI ═ 1,2, …, n }; otherwise, dist (s, v) ← ∞;
(2) selecting a node w, wherein w belongs to U and dist (S, w) ═ min { dist (S, v) | v belongs to U }, adding w into S, namely S ← S ∪ { w }, U ← U- { w }, and then, the minimum time sequence distance dist [ w ] ← dist (S, w) from a source node S to the node w;
(3) updating the original dist (s, v) value of the node v in contact with the node w in all the U: if there are k (k ≧ 1) contacts between node v and node w in U, dist (s, v) ← min { dist (s, v), min { c ≧ 1)i(v,w).ts|ci(v,w).ts≥dist[w]，i＝1,2,…,k}}；
(4) And repeating the steps 2 and 3 until all the nodes are merged into the S.
The invention will now be described in further detail with reference to the embodiment shown in fig. 2:
(1) according to the minimum time sequence distance algorithm, the minimum time sequence paths from the source node a to each destination node can be obtained as follows: a → b → d, a → l → m → k, a → f → g → j → i; the hop count of each minimum timing path is respectively: hop (p (a, d)) ═ 2, hop (p (a, k)) ═ 3, and hop (p (a, i)) ═ 4;
(2) the hop counts are arranged in descending order: hop (p (a, i)) > hop (p (a, k)) > hop (p (a, d)), the minimum time sequence path from the source node a to the node i has the maximum hop count, and the path p (a, i) is added into the multicast tree T;
(3) selecting a next destination node as k, wherein the nodes in the multicast tree comprise a source node a, intermediate nodes f, g and j and a destination node i; the minimum time sequence paths from the nodes f, g and j to the destination node k are respectively p (f, k): f → g → k, p (g, k): g → k, p (j, k): j → g → k; in order to avoid causing loops, upstream nodes passing through the node in the path p (a, i) are abandoned in the process of calculating the minimum path, so that the path p (j, k) is unavailable; meanwhile, the three paths and the path with the most common nodes in the multicast tree are p (f, k), so that the path p (f, k) is added into the multicast tree T, namely p (f, k) is the minimum time sequence path from the source node a to the destination node k through the node f;
(4) and so on until all destination nodes are added into the multicast tree T.
It will be appreciated by those skilled in the art that the foregoing is only a preferred embodiment of the invention, and is not intended to limit the invention, such that various modifications, equivalents and improvements may be made without departing from the spirit and scope of the invention.
Claims (4)
1. A multicast routing method of a space DTN network is characterized by comprising the following steps:
let the multicast source node in the spatial DTN network be s, and the destination node set D ═ Di1,2, m, from source node s to destination node diHas a path of p (s, d)i) Path p (s, d)i) Hop count of (c) is hop (p (s, d)i) ); the method for constructing the spatial DTN network multicast tree T (s, D) comprises the following steps:
(1) initializing, multicast tree T ═ phi, time shift starting time Ts0, the source node s computes it to all destination nodes d according to a minimum timing distance algorithmiP (s, d) of the minimum timing pathi)(i＝1,2,...,m)；
(2) According to path p (s, d)i) The hop count of (i ═ 1, 2.., m) sorts all paths in descending order, setting hop (p (s, d)1))≥hop(p(s,d2))≥…≥hop(p(s,dm) I.e., source node s to destination node d)1The number of hops passed is the largest and reaches the destination node dmThe number of hops passed is minimal;
(3) selecting the path p (s, d) of the largest number of hops1) Added to the multicast tree T, i.e. T ═ T ∪ { p (s, d)1) And i ═ 2;
(4) selecting the next destination node diAccording to the minimum time sequence distance algorithm, each node T in the multicast tree T is respectively used forjDist [ T ] of (j ═ 1,2,., | T |)j]Calculating t as a time-shift start timejTo diMinimum timing path p (t)j,di)；
(5) At the minimum set of timing paths p (t)j,di)|tjE.g. if the node T of the multicast tree T in e.t, j ═ 1,2k(k is more than or equal to 1 and less than or equal to | T |) to diMinimum timing path p (t)k,di) If the number of the common nodes is the maximum, the minimum time sequence path is taken as a source node s to pass through the node TkTo the destination node diAnd join multicast tree T, i.e., T ═ T ∪ { p (T)k,di)}；
(6)i＝i+1；
(7) Repeating the steps (4) to (6) until all destination nodes diAll the information is added into a multicast tree T, so that a multicast routing method of a space DTN network is obtained;
if node u and node v are in time interval ts,te]If there is one contact, the contact c (u, v) between the node u and the node v can be represented as a quadruple, i.e. c (u, v) ═ u, v, ts,te) Wherein t issAt the contact start time, teIs the contact termination time; defining a time sequence distance as the time required for a message to be transmitted from one node to another node through a plurality of contacts, wherein the corresponding time sequence path with the minimum time sequence distance is the minimum time sequence path;
let S be a source node, V be a node set of the network, S be a node set of which the shortest path is obtained, U be a node set of which the shortest path is not determined yet, dist (S, V) represents a time sequence distance from the source node S to the node V, and dist [ V ] represents a minimum time sequence distance from the source node S to the node V; the minimum timing distance algorithm specifically comprises the following steps:
(S1) initialization: let S be { S }, then U be V-S; if there are n (n ≧ 1) contacts between nodes v and s in U, the timing distance dist (s, v) from source node s to node v is min { ci(s,v).ts|ci(s,v).ts≥TsI ═ 1,2, …, n }; otherwise, dist (s, v) ═ infinity;
(S2) selecting a node w, wherein w belongs to U and dist (S, w) belongs to min { dist (S, v) | v belongs to U }, adding w into S, namely S is S ∪ { w }, and U is U- { w }, and at the moment, the minimum time sequence distance dist [ w ] from the source node S to the node w is disct (S, w);
(S3) updating the original dist (S, v) value of the node v which is in contact with the node w in all the U: if there are k (k ≧ 1) contacts between node v and node w in U, dist (s, v) is min { dist (s, v), min { c ≧ 1i(v,w).ts|ci(v,w).ts≥dist[w]，i＝1,2,…,k}}；
(S4) repeating the steps (S2), (S3) until all nodes are merged into S.
2. The multicast routing method of the spatial DTN network according to claim 1, wherein the step (1) of determining the timing distance between two nodes according to the contact information between two points in the network specifically comprises: the contact information between the nodes in the spatial DTN is predicted, and the time required for the message to be transmitted from one node to another node through a plurality of contacts is calculated to obtain the time sequence distance between the two nodes.
3. The multicast routing method of a spatial DTN network of claim 2, wherein the contact information between the two points is predicted according to a node mobility model in the spatial DTN network.
4. The multicast path of a spatial DTN network of claim 1The method is characterized in that in the step (1), the source node s to all destination nodes d in the spatial DTN network are further calculatediThe minimum timing path of (a) is specifically: the path formed by the nodes passed by the minimum timing distance is the 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 CN108989224A (en) | 2018-12-11 |
| CN108989224B true 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) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114900853B (en) * | 2022-07-13 | 2022-11-04 | 武汉烽火凯卓科技有限公司 | Satellite network multicast retransmission method and system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667885A (en) * | 2009-09-29 | 2010-03-10 | 天津大学 | Method for reducing redundancy message by using network coding technique on DTN or ICN network |
| CN103986653A (en) * | 2014-05-29 | 2014-08-13 | 苏州大学 | Network nodes and data transmission method and system |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101527680B (en) * | 2009-02-20 | 2011-06-22 | 西部矿业股份有限公司 | DDMC-based delay-constrained multicast routing method |
| CN102348250A (en) * | 2010-07-29 | 2012-02-08 | 华为技术有限公司 | Routing method and node device of delay tolerant network |
| CN102970722B (en) * | 2012-12-10 | 2015-07-15 | 北京科技大学 | Multicasting route algorithm of low-time-delay delay tolerant and disruption tolerant sensor network |
| JP6662152B2 (en) * | 2016-03-31 | 2020-03-11 | 富士通株式会社 | Communication program, communication method, and communication device |
| US10997636B2 (en) * | 2016-07-18 | 2021-05-04 | California Institute Of Technology | Delay-tolerant information-centric networking (DTICN) |
-
2018
- 2018-08-17 CN CN201810942183.7A patent/CN108989224B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101667885A (en) * | 2009-09-29 | 2010-03-10 | 天津大学 | Method for reducing redundancy message by using network coding technique on DTN or ICN network |
| CN103986653A (en) * | 2014-05-29 | 2014-08-13 | 苏州大学 | Network nodes and data transmission method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108989224A (en) | 2018-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xiao et al. | Tour: time-sensitive opportunistic utility-based routing in delay tolerant networks | |
| Liu et al. | Scalable routing in delay tolerant networks | |
| US8520556B2 (en) | Terminal and N-tree constructing method | |
| Khandakar | Step by step procedural comparison of DSR, AODV and DSDV routing protocol | |
| Li et al. | Reliable topology design in time-evolving delay-tolerant networks with unreliable links | |
| CN105530195A (en) | Sparse graph coding scheduling for deterministic ethernet | |
| Sede et al. | Routing in large-scale buses ad hoc networks | |
| CN109041010B (en) | Vehicle-mounted delay tolerant network data forwarding method based on half-naive Bayes classifier | |
| CN104601473A (en) | Route generating method and system for multi-target path with restriction | |
| Soares et al. | Performance assessment of a geographic routing protocol for vehicular delay-tolerant networks | |
| Hou et al. | Interference-aware QoS multicast routing for smart grid | |
| Guo et al. | A location aided controlled spraying routing algorithm for Delay Tolerant Networks | |
| CN108989224B (en) | Multicast routing method of space DTN (delay tolerant network) | |
| Ren et al. | BLLC: A batch-level update mechanism with low cost for SDN-IoT networks | |
| Birrane | Improving graph-based overlay routing in delay tolerant networks | |
| Guo et al. | HoP-DTN: Modeling and evaluation of homing-pigeon-based delay-tolerant networks | |
| CN103619047B (en) | A kind of chance method for routing in many concurrently stream wireless mesh networks | |
| JP4589978B2 (en) | Route setting method and route setting device | |
| Chen et al. | On using contact expectation for routing in delay tolerant networks | |
| Souza et al. | Drop less known strategy for buffer management in dtn nodes | |
| Pozveh et al. | Improving the AODV protocol to satisfy the required level of reliability for home area networks | |
| Vijayalakshmi et al. | Energy Aware Multicast Clustering (EAMC) with increased Quality of Service (QoS) in MANETs | |
| Abbas et al. | Bounded message delay with threshold time constraint in delay tolerant networks (DTNs) | |
| Wang et al. | Social routing based on location preference prediction in DTN | |
| Wu et al. | ENHANCING POINT-TO-POINT PERFORMANCE IN LOW-POWER AND LOSSY NETWORKS BASED ON GROUP AD HOC ON-DEMAND DISTANCE VECTOR AND PROJECTED DESTINATION ADVERTISEMENT OBJECT |
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 |