CN106341328B - A kind of method for routing of network quantum communication network - Google Patents
A kind of method for routing of network quantum communication network Download PDFInfo
- Publication number
- CN106341328B CN106341328B CN201610721412.3A CN201610721412A CN106341328B CN 106341328 B CN106341328 B CN 106341328B CN 201610721412 A CN201610721412 A CN 201610721412A CN 106341328 B CN106341328 B CN 106341328B
- Authority
- CN
- China
- Prior art keywords
- node
- hop
- address
- network
- span
- 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
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/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
- H04B10/70—Photonic quantum communication
Abstract
The invention discloses a kind of method for routing of network quantum communication network, according to the relativeness of source node and the address of destination node, to realize that maximum span determines source node next-hop node address as principle, according to the relativeness of the node address and destination node that have determined, determine its corresponding next-hop node address until destination node, the Path selection of completion source node to fewest number of hops between destination node one of by the way of two kinds of realization maximum spans.Selecting source node and during destination node intermediate node, determining node and a hop node thereon tangle particle to establishing a connection by the node distribution adjacent with both of which.The present invention reduces the expense of the quantum pair of about half compared to the mode for establishing connection between adjacent node, and then reduces the time that fewest number of hops path is established.
Description
Technical field
The present invention relates to the quantum communication networks that the method for routing of quantum network more particularly to network structure are network
Route selection method.
Background technique
Quantum teleportation is also known as Quantum Teleportation, is a kind of turn using dispersion quantum entanglement and some physical messages
Bring the technology of transmission quantum state to the position of any distance.In the network using quantum teleportation, if two nodes are total
It enjoys and tangles particle pair, it may be considered that there are quantum channels between two nodes.Loss problem when in view of practice, for reality
Now remote quantum teleportation must be realized by Quantum repeater, so, quantum teleportation is to the extensive quantum of building
Network has great importance.
Network is a kind of topological structure common in network, and satellite communication network is to use this knot than more typical
The network of structure.Satellite communication is led to using artificial earth satellite as what relaying carried out between tellurian radio communication station
Letter.In recent years, internet and land mobile service are grown rapidly, and greatly facilitate the work and life of people.Due to
The satellite of new generation that ever-increasing broadband multimedia services and ambulant demand, TCP/IP, ATM and satellite technology combine
Communication network is increasingly becoming the basis of next-generation global system for mobile communications.Compared to traditional terrestrial communication networks, satellite network energy
The bigger coverage area of enough offers has the ability of Global coverage in the enough situations of node.But the link of satellite network
Algorithm still has several drawbacks, this is because the backbone node of satellite network is the satellite of in-orbit high-speed motion, network topology
A large amount of link state modification information can be generated in the excessively frequent change in topology of lasting variable condition, reduces satellite network
The performance of network.Its quantum network is constructed on the basis of satellite network and establishes method for routing helps to improve satellite network routing
Performance.
The static topological type of satellite network is the network of network, and the intersection point of grid represents in-orbit satellite.Except this
Except, some other wireless network such as mesh network, the topological classification of cellular network can also be abstracted into the network of network.
Compared with traditional wireless communication, tangle particle pair by providing, can increase between node by quantum channel be directly connected to away from
From changing the topological structure of quantum communication network, for example particle pair can be tangled by providing, so that grid inner opposite angle line node
Between there are direct quantum channels.Currently, it is seldom for the structure quantum communication network Routing Protocol, and not according to grid
The design feature of shape network is major consideration, designs Routing Protocol, in view of this, this patent research is based on network amount
The characteristics of sub- communication network, designs corresponding method for routing.
Summary of the invention
Goal of the invention: in order to overcome the deficiencies in the prior art, the present invention provides a kind of network quantum communications
The method for routing of network selects the path of fewest number of hops according to source and destination address of node.This method can reduce quantum
Pair expense and fewest number of hops path establish time.
Technical solution: to achieve the above object, the technical solution adopted by the present invention are as follows:
A kind of method for routing of network quantum communication network includes at least a grid, the friendship in grid in network
Point indicates that node, each node have given address, include the following steps:
Step 1, according to the relativeness of source node and the address of destination node, to realize that maximum span determines source as principle
Node next-hop node address.Wherein, there are two types of the modes for realizing maximum span: one is the nodes on single grid diagonal line
Constitute connection relationship.Another kind is the two nodes composition connection relationship for being spaced a node on the same line.Selection is wherein
A kind of mode realize the next-hop node address of determining source node.
Step 2, according to the relativeness of the node address and destination node that have determined, using two kinds of realization maximum spans
One of mode determine its corresponding next-hop node address, repeat this step until destination node, complete source node and arrive
The Path selection of fewest number of hops between destination node.
Further: when the selection of next-hop node does not meet the mode of two kinds of realization maximum spans, selecting this next
Hop node is the adjacent node of the network where a hop node thereon.
It is preferred: when the mode that the selection of next-hop node does not meet two kinds of realization maximum spans refers to: when next-hop section
Point is unsatisfactory for the row on the network pane location diagonal line at the place of a hop node on it or where upper hop node
Or arrange upper and one, upper hop interval node.
It is preferred: method of the source node to the Path selection of fewest number of hops between destination node, packet are completed in the step 2
Include following steps:
Step 21, it is selected down in such a way that upper hop node determines the realization maximum span of next-hop node address choice
One hop node；It realizes that the mode of maximum span cannot generate until its is selected and meets the node in least hops path, Huo Zhetong
The selection in fewest number of hops path of the source node to destination node can be generated by crossing its selected mode for realizing maximum span.
Step 22, realize that the mode of maximum span cannot generate the section for meeting least hops path selected in step 21
When point, according to the relativeness of the last one address of node and destination node for having determined, using realization maximum span
Another way selects next-hop node.
Step 23, step 21 and 22 is repeated until destination node, completes source node to fewest number of hops between destination node
Path selection.
It is preferred: to realize that the mode of maximum span cannot generate the section for meeting least hops path selected in step 21
When point, select the method for next-hop node as follows in step 22:
Path selection from source node to destination node be limited to constituted using source node and destination node as vertex it is rectangular
In shape, if the row or column value of the next-hop node selected in the way of realization maximum span selected in step 21 is beyond source
The row or column value of node or destination node, then the selection of next-hop node, which is judged as, does not meet maximum span principle.At this point, root
It is another by the way of realizing maximum span according to the relativeness of the last one address of node and destination node for having determined
A kind of mode selects next-hop node.
Preferred: address of node is configured with the following method: according to the line number M and columns N of network, respectively according to
1,2,3 ..., M and 1,2,3 ..., N mark each row and column, and address of node is as the numerical value group of the row and column where the node
At expression are as follows:<i, j>, wherein i=1,2,3 ..., M.J=1,2,3 ..., N.
Preferred: span refers to that the address line, train value and upper hop node address row, column value difference value of next-hop node are absolute
The sum of value.
Preferred: the span of the mode of two kinds of realization maximum spans is all 2, and selects this next-hop node for its upper hop
The span of the adjacent node of network where node is 1.
It is preferred: by the principle for realizing maximum span, node<p,k>next-hop node are as follows:
A) connection relationship is constituted according to the node on single grid diagonal line, then the address of next-hop node are as follows:
<p±1,k±1>
B) connection relationship is constituted according to two nodes for being spaced a node on the same line, then the ground of next-hop node
Location are as follows:
<p,k±2>or<p±2,k>
Wherein, p indicates line number where node, and k indicates columns where node.
Preferred: each node in network, which has, tangles particle pair；In selection source node and destination node middle node
During point, one intermediate node of every determination, then all adjacent node adjacent node of a hop node with the node and thereon
Particle pair is tangled to the distribution of the upper hop node of the node and the node, the node is made to establish connection pass with a hop node thereon
System.
The utility model has the advantages that a kind of method for routing of network quantum communication network provided by the invention, compared with prior art,
It has the advantages that
Two node uses on the path of fewest number of hops tangle particle and set up communication channel, so that between two nodes
Information exchange do not influenced by wireless transmission distance, can be not by not realize the communication between node intermediate node.If pressing
Adjacent node establishes the mode of connection, then needs just set up channel by an intermediate node.If from source node to mesh
Node path selection process in all meet the principle of maximum span, then the hop count of half can be reduced.If from source node
Into the path selection process of destination node, the case where not meeting maximum span principle, then such case should be appeared in most
Latter jump because the possible span of final jump is odd number, and realizes that the span of the two ways of maximum span is all even number.Most
Before latter jump, always Path selection can be carried out in such a way that span is even number.In conclusion being selected with above two mode
The mode of next-hop node can reduce the hop count of about half, reduce the time of fewest number of hops path foundation, while saving one
Half EPR logarithm, to improve the performance of network traffic.
Detailed description of the invention
Fig. 1 is the quantum communication network method for routing flow chart for network.
Fig. 2 is the network topology of the quantum communication network of network.
Fig. 3 is two kinds of fundamental node selection modes of the quantum communication network method for routing of network.
Fig. 4 is the network structure of the quantum communication network method for routing specific implementation of network.
Specific embodiment
In the following with reference to the drawings and specific embodiments, the present invention is furture elucidated, it should be understood that these examples are merely to illustrate this
It invents rather than limits the scope of the invention, after the present invention has been read, those skilled in the art are to of the invention various
The modification of equivalent form falls within the application range as defined in the appended claims.
A kind of method for routing of network quantum communication network includes at least a net as shown in Figure 1, 2 in network
Lattice, the intersection point in grid indicate that node, each node have given address, and each node of network is can to distribute to tangle
For particle to its adjacent node is given, two nodes for keeping its adjacent establish connection.Specifically comprise the following steps:
Step 1, according to the relativeness of source node and the address of destination node, to realize that maximum span determines source as principle
Node next-hop node address.Wherein, as shown in figure 3, there are two types of the modes of realization maximum span: one is single grid is diagonal
Node on line constitutes connection relationship.Another kind is the two nodes composition connection pass for being spaced a node on the same line
System.One such mode is selected to realize the next-hop node address of determining source node.
In network quantum communication network, address of node is configured with the following method:
According to the line number M and columns N of network, respectively according to 1,2,3 ..., M and 1,2,3 ..., N mark each row and column,
Address of node is made of the numerical value of the row and column where the node, is indicated are as follows:
<i, j>, wherein i=1,2,3 ..., M.J=1,2,3 ..., N.
In network quantum communication network, span refers to the address line, train value and upper hop node of next-hop node
The sum of address line, train value absolute difference.
If any one address of node is<p,k>, then by the principle for realizing maximum span, node<p,k>next-hop section
Point are as follows:
A) connection relationship is constituted according to the node on single grid diagonal line, then the address of next-hop node are as follows:
<p±1,k±1>
B) connection relationship is constituted according to two nodes for being spaced a node on the same line, then the ground of next-hop node
Location are as follows:
<p,k±2>or<p±2,k>
Wherein, p indicates line number where node, and k indicates columns where node.
According to the definition of span, address line, train value and the upper hop node address row, column of both mode next-hop nodes
The sum of value absolute difference is 2, therefore the span of both modes is 2.Again because in network quantum communication network
In can not find out span be greater than 2 node selecting method, therefore, in network quantum communication network maximum span be 2.
The address for seeking source node next-hop node is exactly that the address of source node is brought into p, k, and according to the position of destination node
It sets, selects corresponding formula, find out the address of next-hop node.
Step 2, according to the relativeness of the node address and destination node that have determined, using two kinds of realization maximum spans
One of mode determine its corresponding next-hop node address, repeat this step until destination node, complete source node and arrive
The Path selection of fewest number of hops between destination node.
The node having determined can determine its correspondence one of in a manner of random two kinds of realization maximum spans of use
Next-hop node address, can also according to the idle channel of next-hop node (satellite) select using which kind of realization maximum span
Mode, in this way can effective node communication traffic, improving communication efficiency can adopt in addition to simplifying method for routing
Using the following method:
Step 21, it is selected down in such a way that upper hop node determines the realization maximum span of next-hop node address choice
One hop node.It realizes that the mode of maximum span cannot generate until its is selected and meets the node in least hops path, Huo Zhetong
The selection in fewest number of hops path of the source node to destination node can be generated by crossing its selected mode for realizing maximum span.
Step 22, realize that the mode of maximum span cannot generate the section for meeting least hops path selected in step 21
When point, according to the relativeness of the last one address of node and destination node for having determined, using realization maximum span
Another way selects next-hop node.
When realizing that the mode of maximum span cannot generate the node for meeting least hops path selected in step 21, step
Select the method for next-hop node as follows in rapid 22:
Path selection from source node to destination node be limited to constituted using source node and destination node as vertex it is rectangular
In shape, if the row or column value of the next-hop node selected in the way of realization maximum span selected in step 2 is beyond source
The row or column value of node or destination node, then the selection of next-hop node, which is judged as, does not meet maximum span principle.At this point, root
It is another by the way of realizing maximum span according to the relativeness of the last one address of node and destination node for having determined
A kind of mode selects next-hop node.
Namely in step 21, according to the selection mode of upper hop node, the method for selecting next-hop node is as follows:
The formula selected when being determined according to upper hop node brings upper hop address of node into p, k, according to identical public affairs
Formula finds out the address of next-hop node.
Step 23, step 21 and 22 is repeated until destination node, completes source node to fewest number of hops between destination node
Path selection.
When the selection of next-hop node does not meet the mode of two kinds of realization maximum spans, selecting this next-hop node is it
The adjacent node of network where upper hop node.And select this next-hop node for the net where a hop node thereon
The span of the adjacent node of lattice structure is 1.
When the mode that the selection of next-hop node does not meet two kinds of realization maximum spans refers to: when next-hop node is unsatisfactory for
On it in the row or column on the network pane location diagonal line at the place of a hop node or where upper hop node with
One, upper hop interval node.
If any one address of node is<p,k>, when the selection of next-hop node does not meet maximum span principle, node<
P, k > next-hop node be its where network adjacent node.The address of next-hop node are as follows:
<p,k±1>or<p±1,k>
Each node in network, which has, tangles particle pair；In the process of selection source node and destination node intermediate node
In, one intermediate node of every determination, then with the node and thereon all adjacent node adjacent node of a hop node to the node
Particle pair is tangled in upper hop node distribution with the node, and the node is made to establish a connection with a hop node thereon.
As shown in figure 4, illustrating specific reality of the invention by taking one 8 × 4 network quantum communication network as an example
It applies.The network contains altogether 32 nodes.According to the line number 8 and columns 4 of network, respectively according to 1,2,3,4,5,6,7,8 He
1,2,3, the 4 each row and column of label, address of node is made of the numerical value of the row and column where node.
In 8 × 4 network network, it is assumed that source node address be<1,1>, destination node address be<8,4>.From source
The path selection process of node<1,1>to destination node<8,4>is as follows:
(1) source node address be<1,1>, destination node address be<8,4>, due to 8 > Isosorbide-5-Nitrae > 1, it can be determined that purpose section
Point is in the lower right of source node.Therefore, according to the principle of maximum span, the node on single grid diagonal line is selected to constitute connection
The mode of relationship selects next-hop node.
Because destination node is in the lower right of source node, formula<p+1,k+1>, according to formula, next-hop node
Address be<2,2>；
(2) selection mode of upper hop node is that the node on single grid diagonal line constitutes connection relationship, therefore, next
Hop node according to upper hop node selection mode, according to formula<p+1,k+1>, next-hop node is<3,3>.
(3) step (2) being repeated, the node next selected is<4,4>.Step (2) are repeated again, according to upper hop node
Selection mode, next-hop node is<5,5>, and train value 5 has had exceeded the train value 4 of destination node, so according to upper hop
The selection mode of node cannot generate the node for meeting least hops path, at this time, it may be necessary to select node<4,4>to destination node<
8,4 > path.
Due to node<4,4>and destination node<8,4>on the same line, so according to being spaced one on the same line
Two nodes of node constitute connection relationship and select next-hop node.Due to destination node node<4,4>underface, so
Formula is<p+2,k>.According to formula, the address of next-hop node is<6,4>.
(4) next-hop node is selected according to the selection mode of upper hop node, i.e., according to one, interval on the same line
Two nodes of node constitute connection relationship and select next-hop node, therefore, next-hop node is<8,4>.At this point, rows of nodes,
Train value is identical as destination node, so the Path selection from source node to destination node is completed, the signal of Path selection
Figure is as shown in Figure 4.Node from source node<1,1>to destination node<8,4>Path selection is as shown in table 1 below:
Table 1
Certainly, the present invention also can choose the path such as the following table 2, table 3, and selection method is similar with upper narration, herein not
It repeats again.
Table 2
Table 3
By the selected path in table 1, table 2, table 3, it can show that its span is 5*2=10, therefore the present invention provides
Two kinds realization maximum span mode its select sequencing have no effect on final span.
Above-described Path selection is only a kind of routing form of the invention, and the next-hop node of source node can be with
First selected in such a way that two nodes for being spaced a node on the same line constitute connection relationship.Intermediate node
It can not also be selected according to the selection mode of upper hop node, as long as can be realized according to maximum span principle from source node
To the Path selection of destination node minimum hop count.But for the simplification of method for routing, in the item for meeting maximum span principle
Under part, intermediate node is selected according to the selection mode of upper hop node.Therefore, other path choosings for meeting maximum span
Selecting mode also should be regarded as protection scope of the present invention.
Claims (9)
1. a kind of method for routing of network quantum communication network, a grid, the intersection point in grid are included at least in network
Indicate that node, each node have given address, which comprises the steps of:
Step 1, according to the relativeness of source node and the address of destination node, to realize that maximum span determines source node as principle
Next-hop node address；Wherein, span refers to the address line, train value and upper hop node address row, column value difference of next-hop node
It is worth the sum of absolute value；There are two types of the modes for realizing maximum span: constituting connection one is the node on single grid diagonal line and closes
System；Another kind is the two nodes composition connection relationship for being spaced a node on the same line；Select one such mode
Realize the next-hop node address for determining source node；
Step 2, according to the relativeness of the node address and destination node that have determined, the side of maximum span is realized using two kinds
One of formula determines its corresponding next-hop node address, repeats this step until destination node, completes source node to purpose
The Path selection of fewest number of hops between node.
2. the method for routing of network quantum communication network according to claim 1, it is characterised in that: when next-hop section
When the selection of point does not meet the mode of two kinds of realization maximum spans, select this next-hop node for the net where a hop node thereon
The adjacent node of lattice structure.
3. the method for routing of network quantum communication network according to claim 2, it is characterised in that: when next-hop section
The mode that the selection of point does not meet two kinds of realization maximum spans refers to: when next-hop node is unsatisfactory for the institute of a hop node on it
Network pane location diagonal line on or upper hop node where row or column on one, upper hop interval node.
4. the method for routing of network quantum communication network according to claim 2, it is characterised in that: the step 2
Method of the middle completion source node to the Path selection of fewest number of hops between destination node, comprising the following steps:
Step 21, next-hop is selected in such a way that upper hop node determines the realization maximum span of next-hop node address choice
Node；It realizes that the mode of maximum span cannot generate until its is selected and meets the node in least hops path, or pass through it
The selected mode for realizing maximum span can generate the selection in fewest number of hops path of the source node to destination node；
Step 22, realize that the mode of maximum span cannot generate the node for meeting least hops path selected in step 21
When, according to the relativeness of the last one address of node and destination node for having determined, using the another of realization maximum span
A kind of mode selects next-hop node；
Step 23, step 21 and 22 is repeated until destination node, completes source node to the path of fewest number of hops between destination node
Selection.
5. the method for routing of network quantum communication network according to claim 4, it is characterised in that: when in step 21
When the selected mode for realizing maximum span cannot generate the node for meeting least hops path, next-hop section is selected in step 22
The method of point is as follows:
Path selection from source node to destination node is limited to using source node and destination node as in the rectangle that vertex is constituted,
If the row or column value of the next-hop node selected in the way of realization maximum span selected in step 21 is beyond source node
Or the row or column value of destination node, then the selection of next-hop node, which is judged as, does not meet maximum span principle；At this point, according to
Relativeness through the last one determining address of node and destination node, the another kind by the way of realizing maximum span
Mode selects next-hop node.
6. the method for routing of network quantum communication network according to claim 1, it is characterised in that: address of node
It is configured with the following method: according to the line number M and columns N of network, respectively according to 1,2,3 ..., M and 1,2,3 ..., N mark
Remember each row and column, address of node is made of the numerical value of the row and column where the node, is indicated are as follows:<i, j>, wherein i=1,
2,3 ..., M；J=1,2,3 ..., N.
7. the method for routing of network quantum communication network according to claim 2, it is characterised in that: two kinds are realized most
The span of the mode of large span is all 2, and selects this next-hop node for the adjacent of the network where a hop node thereon
Node span be 1.
8. the method for routing of network quantum communication network according to claim 1, it is characterised in that: maximum by realizing
The principle of span, node<p,k>next-hop node are as follows:
A) connection relationship is constituted according to the node on single grid diagonal line, then the address of next-hop node are as follows:
<p±1,k±1>
B) connection relationship is constituted according to two nodes for being spaced a node on the same line, then the address of next-hop node
Are as follows:
<p,k±2>or<p±2,k>
Wherein, p indicates line number where node, and k indicates columns where node.
9. the method for routing of network quantum communication network according to claim 1, it is characterised in that: every in network
A node, which all has, tangles particle pair；During selecting source node and destination node intermediate node, one centre of every determination
Node, then upper hop section of all adjacent node adjacent node of a hop node to the node and the node with the node and thereon
Particle pair is tangled in point distribution, and the node is made to establish a connection with a hop node thereon.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610721412.3A CN106341328B (en) | 2016-08-24 | 2016-08-24 | A kind of method for routing of network quantum communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610721412.3A CN106341328B (en) | 2016-08-24 | 2016-08-24 | A kind of method for routing of network quantum communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106341328A CN106341328A (en) | 2017-01-18 |
| CN106341328B true CN106341328B (en) | 2019-06-25 |
Family
ID=57824864
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610721412.3A Active CN106341328B (en) | 2016-08-24 | 2016-08-24 | A kind of method for routing of network quantum communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106341328B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107248888B (en) * | 2017-05-25 | 2019-04-30 | 东南大学 | That improves quantum communication network connectivity tangles particle to distribution node dispositions method |
| CN109714261B (en) * | 2019-01-11 | 2020-12-25 | 东南大学 | Multicast routing method based on fidelity measurement in quantum communication network |
| CN112073126B (en) * | 2020-08-14 | 2021-07-13 | 合肥本源量子计算科技有限责任公司 | Method and device for ordering network node importance |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7313630B1 (en) * | 2003-11-06 | 2007-12-25 | Sprint Communications Company L.P. | Method for altering link weights in a communication network to provide traffic information for improved forecasting |
| CN101834797A (en) * | 2010-05-06 | 2010-09-15 | 复旦大学 | Low-complexity and extensible fault-tolerant routing algorithm specific to network on chip |
| US8151088B1 (en) * | 2008-07-08 | 2012-04-03 | Tilera Corporation | Configuring routing in mesh networks |
| CN103001875A (en) * | 2013-01-07 | 2013-03-27 | 山东量子科学技术研究院有限公司 | Quantum cryptography network dynamic routing method |
| CN1918858B (en) * | 2003-12-23 | 2014-06-25 | 艾利森电话股份有限公司 | Cost determination in a multihop network |
| CN104581861A (en) * | 2014-12-18 | 2015-04-29 | 北京邮电大学 | Routing method and device based on satellite network |
| CN103401858B (en) * | 2013-07-29 | 2016-01-13 | 北京交通大学 | The expansion method of sheet upstream routers congestion aware scope |
| CN105681028A (en) * | 2015-12-28 | 2016-06-15 | 华南师范大学 | Multi-user network system for footballene structure and quantum key distribution method thereof |
| CN105846949A (en) * | 2015-01-14 | 2016-08-10 | 华为技术有限公司 | Method and node for determining transmission path of information |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7839856B2 (en) * | 2007-06-06 | 2010-11-23 | Cisco Technology, Inc. | Centrally controlled routing with tagged packet forwarding in a wireless mesh network |
| US8798034B2 (en) * | 2009-03-31 | 2014-08-05 | Motorola Solutions, Inc. | System and method for selecting a route based on link metrics incorporating channel bandwidth, spatial streams and/or guard interval in a multiple-input multiple-output (MIMO) network |
-
2016
- 2016-08-24 CN CN201610721412.3A patent/CN106341328B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7313630B1 (en) * | 2003-11-06 | 2007-12-25 | Sprint Communications Company L.P. | Method for altering link weights in a communication network to provide traffic information for improved forecasting |
| CN1918858B (en) * | 2003-12-23 | 2014-06-25 | 艾利森电话股份有限公司 | Cost determination in a multihop network |
| US8151088B1 (en) * | 2008-07-08 | 2012-04-03 | Tilera Corporation | Configuring routing in mesh networks |
| CN101834797A (en) * | 2010-05-06 | 2010-09-15 | 复旦大学 | Low-complexity and extensible fault-tolerant routing algorithm specific to network on chip |
| CN103001875A (en) * | 2013-01-07 | 2013-03-27 | 山东量子科学技术研究院有限公司 | Quantum cryptography network dynamic routing method |
| CN103401858B (en) * | 2013-07-29 | 2016-01-13 | 北京交通大学 | The expansion method of sheet upstream routers congestion aware scope |
| CN104581861A (en) * | 2014-12-18 | 2015-04-29 | 北京邮电大学 | Routing method and device based on satellite network |
| CN105846949A (en) * | 2015-01-14 | 2016-08-10 | 华为技术有限公司 | Method and node for determining transmission path of information |
| CN105681028A (en) * | 2015-12-28 | 2016-06-15 | 华南师范大学 | Multi-user network system for footballene structure and quantum key distribution method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106341328A (en) | 2017-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wu | Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links | |
| Gui et al. | Scalable multicasting in mobile ad hoc networks | |
| CN101945432B (en) | A kind of multi tate chance method for routing for wireless mesh network | |
| CN205389271U (en) | Jump mesh wireless holds in place with a net from network deployment emergent communication network more | |
| CN106341328B (en) | A kind of method for routing of network quantum communication network | |
| CN104486715A (en) | Mobile sensor network clustering method based on geographical position information | |
| CN110995333B (en) | Cluster QoS route design method | |
| CN107579758A (en) | A kind of two-way alternate communication method based on G3 PLC | |
| CN105007570B (en) | A kind of mobile ad-hoc network jamming control method based on OLSR agreement | |
| CN106941447A (en) | Free space optical network routing method based on Ants model | |
| CN104284388A (en) | Mobile Ad Hoc network independent clustering and routing method | |
| Fang et al. | Dynamic codeword routing (DCR): a cross-layer approach for performance enhancement of general multi-hop wireless routing | |
| CN104219156B (en) | A kind of multicast route method suitable for the aerial self-organizing network of stratification | |
| Zhu et al. | Efficient hybrid multicast approach in wireless data center network | |
| CN102098729A (en) | Construction method and related packet forwarding method for tree backbone structure in wireless network | |
| CN109714260B (en) | Implementation method for building virtual backbone network based on UCDS algorithm in OLSR routing protocol | |
| CN102111845B (en) | Multicast route method and system based on ad hoc on-demand distance vector | |
| CN112689275A (en) | Novel non-uniform power forming method for BLE mesh network | |
| De et al. | On throughput and load balancing of multipath routing in wireless networks | |
| Gui et al. | An entropy-based long-life multipath routing algorithm in manet | |
| Cheng et al. | Core-based shared tree multicast routing algorithms for LEO satellite IP networks | |
| Mangai et al. | Dynamic core multicast routing protocol implementation using ant colony optimization in ad hoc wireless networks | |
| CN107018546A (en) | A kind of method of clustering routing in manufacture Internet of Things | |
| Kies et al. | Self-organization framework for mobile ad hoc networks | |
| CN106792745A (en) | A kind of nodal hierarchy routing scheduling method and system towards mobile Ad hoc network |
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 |