CN117978248A - Dynamic routing method and device for space terahertz network - Google Patents
Dynamic routing method and device for space terahertz network Download PDFInfo
- Publication number
- CN117978248A CN117978248A CN202410153770.3A CN202410153770A CN117978248A CN 117978248 A CN117978248 A CN 117978248A CN 202410153770 A CN202410153770 A CN 202410153770A CN 117978248 A CN117978248 A CN 117978248A
- Authority
- CN
- China
- Prior art keywords
- delay
- satellite
- link
- node
- hop count
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000005540 biological transmission Effects 0.000 claims description 32
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 28
- 230000006870 function Effects 0.000 claims description 16
- 238000004891 communication Methods 0.000 claims description 10
- 230000003139 buffering effect Effects 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000010276 construction Methods 0.000 claims description 4
- 238000006073 displacement reaction Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 10
- 238000004590 computer program Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/18521—Systems of inter linked satellites, i.e. inter satellite service
-
- 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/90—Non-optical transmission systems, e.g. transmission systems employing non-photonic corpuscular radiation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18519—Operations control, administration or maintenance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Optics & Photonics (AREA)
- Electromagnetism (AREA)
- Radio Relay Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a dynamic routing method and a device for a space terahertz network, wherein the method comprises the following steps: constructing a satellite node coordinate graph model under a two-dimensional rectangular coordinate system; constructing a space terahertz network dynamic minimum hop count routing model based on the satellite node coordinate graph model; processing link state information based on the space terahertz network dynamic minimum hop count routing model to obtain satellite link delay information, so as to realize a space terahertz network dynamic routing method; the link state information includes a data packet size, an inter-satellite link rate, a straight line distance between two nodes, and a path minimum hop count. The method combines the time-varying graph and the link state, not only considers the information of the nodes, but also considers the link state information of the connection between the nodes, avoids the condition of invalid link paths, realizes more accurate path selection, and improves the routing efficiency and the reliability of the space terahertz network.
Description
Technical Field
The invention relates to the technical field of satellite communication, in particular to a dynamic routing method and device for a space terahertz network.
Background
In a spatial terahertz communication network, dynamic routing is an important network routing strategy, aiming at selecting an optimal data transmission path according to real-time changes of network topology and link state. Due to the dynamics of terahertz communication networks, dynamic routing is critical to optimizing network performance and reliability. By analyzing the network topology and designing a coordinate graph model combined with the link state, the shortest path between the nodes can be determined, invalid transmission paths are avoided, the time delay of data transmission is minimized, and therefore the transmission efficiency and reliability of the route are improved.
Disclosure of Invention
The invention aims to solve the technical problems of providing a space terahertz network dynamic routing method and a space terahertz network dynamic routing device, aiming at the situation that the network connectivity is reduced and invalid link paths appear due to the fact that the network topology and the link state are changed rapidly, and a time delay calculation method is provided on the basis of considering the link state information among nodes when a space terahertz network coordinate graph model is designed, so that a space terahertz network dynamic routing model is constructed.
In order to solve the technical problem, a first aspect of the embodiment of the present invention discloses a dynamic routing method for a space terahertz network, which includes:
S1, constructing a satellite node coordinate graph model under a two-dimensional rectangular coordinate system;
S2, constructing a space terahertz network dynamic minimum hop count routing model based on the satellite node coordinate graph model;
S3, acquiring link state information, processing the link state information based on the space terahertz network dynamic minimum hop count routing model to obtain satellite link time delay information, and realizing space terahertz network dynamic routing;
the link state information includes a data packet size, an inter-satellite link rate, a straight line distance between two nodes, and a path minimum hop count.
In an optional implementation manner, in the first aspect of the embodiment of the present invention, the satellite node coordinate graph model in the two-dimensional rectangular coordinate system is:
CG＝{V，E，T，Buf(T)，W，CE}
Wherein CG is a satellite node coordinate graph model under a two-dimensional rectangular coordinate system, V is a satellite node set, any satellite node v= (x, y) meets V epsilon V,1 is less than or equal to x is less than or equal to N,1 is less than or equal to y is less than or equal to M, the satellite node coordinate graph model under the two-dimensional rectangular coordinate system comprises N multiplied by M satellites, N is the number of satellites in the row direction, M is the number of satellites in the column direction, E is a link set, any link E a,b meets E a,b epsilon E, a and b are neighbor nodes, a epsilon V, b epsilon V, T is an observation period, buf (T) is a node cache set, a cache time function of the node V is expressed as Buf v (T) epsilon Buf (T), u epsilon V,0 is less than or equal to T, W is an inter-satellite link rate set, and the rate of any link E a,b is expressed as C E is a link communication time period set, the x-axis represents an orbit number, the y-axis represents a satellite serial number, a point represents a satellite node, and a line segment corresponds to an inter-satellite link;
Segments with the same track number are connected in sequence and are parallel to the y axis;
The line segments between satellites with serial numbers 1 and M corresponding to the same track number represent the same intra-track link;
The line segment parallel to the x-axis represents the inter-orbit link in the same-direction region, the reverse region between orbits 1 and N does not have an inter-orbit link, N is the number of satellites in the row direction, and M is the number of satellites in the column direction.
As an optional implementation manner, in the first aspect of the embodiment of the present invention, the function of the buffering time of the node v is:
bufv(t)＝bufv[u(t)-u(t-T)]
Wherein buf v (T) is a buffer time function when the node v has no buffer task, T is an observation period, buf v is a buffer capacity of the node v, namely, a maximum value of data quantity which can be buffered by the node v at the time T, and u (T) is a step function.
As an optional implementation manner, in the first aspect of the embodiment of the present invention, the dynamic minimum hop count routing model of the spatial terahertz network uses a source node S and a destination node D as diagonal vertices, so as to A rectangular area with Hops x,Hopsy as side length is a unit displacement vector in the x and y directions;
The end-to-end minimum hop path in the space terahertz network dynamic minimum hop count routing model is as follows:
Wherein Hops is the path minimum hop count, hops = Hops x+Hopsy, For the end-to-end minimum hop path Hops x is the hop count component in the x direction and Hops y is the hop count component in the y direction.
As an optional implementation manner, in the first aspect of the embodiment of the present invention, the processing the link state information based on the dynamic minimum hop count routing model of the spatial terahertz network to obtain satellite link delay information includes:
s31, processing the data packet size and the inter-satellite link rate to obtain transmission delay;
the transmission delay is as follows:
Wherein Delay transmit is transmission Delay, f is data packet size, and w is inter-satellite link rate;
S32, processing the linear distance between the two nodes to obtain propagation delay;
The propagation delay is:
wherein Delay propagation is propagation Delay, dist is linear distance between two nodes, and c is propagation velocity of electromagnetic wave in vacuum;
s33, processing the minimum hop count of the path to obtain end-to-end time delay;
The end-to-end delay is:
Where Delay path is the end-to-end Delay, hops is the path minimum hop count, Is the ith jump time delay;
S34, processing the queuing delay, the transmission delay and the propagation delay to obtain single-hop forwarding delay;
And S35, the transmission delay, the propagation delay, the end-to-end delay, the queuing delay and the single-hop forwarding delay form satellite link delay information.
As an optional implementation manner, in the first aspect of the embodiment of the present invention, the single-hop forwarding delay is:
Delayhop＝Delaytransmit+Delaypropagation+Delayqueue
The Delay hop is a single-hop forwarding Delay, the Delay transmit is a transmission Delay, the Delay propagation is a propagation Delay, and the Delay queue is a queuing Delay, and the queuing Delay queue is a time for the data to be buffered in the satellite node to wait for retransmission, including a time required for the data packet to reach the node to be processed and a waiting time for the data packet to be transmitted from the node to the next hop.
The second aspect of the embodiment of the invention discloses a dynamic routing device of a space terahertz network, which comprises:
The coordinate graph model construction module is used for constructing a satellite node coordinate graph model under a two-dimensional rectangular coordinate system;
The minimum hop count route model building module is used for building a space terahertz network dynamic minimum hop count route model based on the satellite node coordinate graph model;
The time delay information calculation module is used for obtaining link state information, processing the link state information based on the space terahertz network dynamic minimum hop count routing model to obtain satellite link time delay information, and realizing space terahertz network dynamic routing;
the link state information includes a data packet size, an inter-satellite link rate, a straight line distance between two nodes, and a path minimum hop count.
In a second aspect of the embodiment of the present invention, the satellite node coordinate graph model in the two-dimensional rectangular coordinate system is:
CG＝{V，E，T，Buf(T)，W，CE}
Wherein CG is a satellite node coordinate graph model under a two-dimensional rectangular coordinate system, V is a satellite node set, any satellite node v= (x, y) meets V epsilon V,1 is less than or equal to x is less than or equal to N,1 is less than or equal to y is less than or equal to M, the satellite node coordinate graph model under the two-dimensional rectangular coordinate system comprises N multiplied by M satellites, N is the number of satellites in the row direction, M is the number of satellites in the column direction, E is a link set, any link E a,b meets E a,b epsilon E, a and b are neighbor nodes, a epsilon V, b epsilon V, T is an observation period, buf (T) is a node cache set, a cache time function of the node u is expressed as Buf υ (T) epsilon Buf (T), V epsilon V,0 is less than or equal to T, W is an inter-satellite link rate set, and the rate of any link E a,b is expressed as C E is a link communication time period set, the x-axis represents an orbit number, the y-axis represents a satellite serial number, a point represents a satellite node, and a line segment corresponds to an inter-satellite link;
Segments with the same track number are connected in sequence and are parallel to the y axis;
The line segments between satellites with serial numbers 1 and M corresponding to the same track number represent the same intra-track link;
The line segment parallel to the x-axis represents the inter-orbit link in the same-direction region, the reverse region between orbits 1 and N does not have an inter-orbit link, N is the number of satellites in the row direction, and M is the number of satellites in the column direction.
As an optional implementation manner, in the second aspect of the embodiment of the present invention, the function of the buffering time of the node v is:
bufv(t)＝bufv[u(t)-u(t-T)]
Wherein buf v (T) is a buffer time function when the node u has no buffer task, T is an observation period, buf v is a buffer capacity of the node v, namely, a maximum value of data volume which can be buffered by the node v at the time T, and u (T) is a step function.
In a second aspect of the embodiment of the present invention, the dynamic minimum hop count routing model of the spatial terahertz network uses a source node S and a destination node D as diagonal vertices, so as to A rectangular area with Hops x,Hopsy as side length is a unit displacement vector in the x and y directions;
The end-to-end minimum hop path in the space terahertz network dynamic minimum hop count routing model is as follows:
Wherein Hops is the path minimum hop count, hops = Hops x+Hopsy, For the end-to-end minimum hop path Hops x is the hop count component in the x direction and Hops y is the hop count component in the y direction.
In a second aspect of the embodiment of the present invention, the processing the link state information based on the dynamic minimum hop routing model of the spatial terahertz network to obtain satellite link delay information includes:
s31, processing the data packet size and the inter-satellite link rate to obtain transmission delay;
the transmission delay is as follows:
Wherein Delay transmit is transmission Delay, f is data packet size, and w is inter-satellite link rate;
S32, processing the linear distance between the two nodes to obtain propagation delay;
The propagation delay is:
wherein Delay propagation is propagation Delay, dist is linear distance between two nodes, and c is propagation velocity of electromagnetic wave in vacuum;
s33, processing the minimum hop count of the path to obtain end-to-end time delay;
The end-to-end delay is:
Where Delay path is the end-to-end Delay, hops is the path minimum hop count, Is the ith jump time delay;
S34, processing the queuing delay, the transmission delay and the propagation delay to obtain single-hop forwarding delay;
And S35, the transmission delay, the propagation delay, the end-to-end delay, the queuing delay and the single-hop forwarding delay form satellite link delay information.
As an optional implementation manner, in the second aspect of the embodiment of the present invention, the single-hop forwarding delay is:
Delayhop＝Delaytransmit+Delaypropagation+Delayqueue
The Delay hop is a single-hop forwarding Delay, the Delay transmit is a transmission Delay, the Delay propagation is a propagation Delay, and the Delay queue is a queuing Delay, and the queuing Delay queue is a time for the data to be buffered in the satellite node to wait for retransmission, including a time required for the data packet to reach the node to be processed and a waiting time for the data packet to be transmitted from the node to the next hop.
The third aspect of the invention discloses another dynamic routing device for a space terahertz network, which comprises:
A memory storing executable program code;
A processor coupled to the memory;
The processor invokes the executable program code stored in the memory to execute part or all of the steps in the dynamic routing method for the spatial terahertz network disclosed in the first aspect of the embodiment of the invention.
A fourth aspect of the present invention discloses a computer-readable medium storing computer instructions that, when invoked, are used to perform part or all of the steps in the spatial terahertz network dynamic routing method disclosed in the first aspect of the present invention.
Compared with the prior art, the embodiment of the invention has the following beneficial effects:
(1) The invention considers the link state information in the time-varying diagram of the network topology, improves the selectivity of the path and avoids the condition of invalid paths.
(2) The space terahertz network dynamic routing model constructed by the invention adopts the minimum hop count routing model, and reduces the end-to-end path delay.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic flow chart of a dynamic routing method of a space terahertz network, which is disclosed in the embodiment of the invention;
Fig. 2 is a satellite node coordinate diagram in a two-dimensional rectangular coordinate system according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a minimum hop count routing model disclosed in an embodiment of the present invention;
Fig. 4 is a schematic structural diagram of a dynamic routing device for a space terahertz network according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of another dynamic routing device for a spatial terahertz network according to an embodiment of the present invention.
Detailed Description
In order to make the present invention better understood by those skilled in the art, the following description will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The terms first, second and the like in the description and in the claims and in the above-described figures are used for distinguishing between different objects and not necessarily for describing a sequential or chronological order. Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, apparatus, article, or device that comprises a list of steps or elements is not limited to the list of steps or elements but may, in the alternative, include other steps or elements not expressly listed or inherent to such process, method, article, or device.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the invention. The appearances of such phrases in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.
The invention discloses a dynamic routing method and a device for a space terahertz network, wherein the method comprises the following steps: constructing a satellite node coordinate graph model under a two-dimensional rectangular coordinate system; constructing a space terahertz network dynamic minimum hop count routing model based on the satellite node coordinate graph model; processing link state information based on the space terahertz network dynamic minimum hop count routing model to obtain satellite link delay information, so as to realize a space terahertz network dynamic routing method; the link state information includes a data packet size, an inter-satellite link rate, a straight line distance between two nodes, and a path minimum hop count. The method combines the time-varying graph and the link state, not only considers the information of the nodes, but also considers the link state information of the connection between the nodes, avoids the condition of invalid link paths, realizes more accurate path selection, and improves the routing efficiency and the reliability of the space terahertz network. The following will describe in detail.
Example 1
Referring to fig. 1, fig. 1 is a schematic flow chart of a dynamic routing method for a space terahertz network according to an embodiment of the present invention. The dynamic routing method of the space terahertz network described in fig. 1 is applied to the technical field of satellite communication, a dynamic routing model of the space terahertz network is constructed, and the embodiment of the invention is not limited. As shown in fig. 1, the spatial terahertz network dynamic routing method may include the following operations:
S1, constructing a satellite node coordinate graph model under a two-dimensional rectangular coordinate system;
S2, constructing a space terahertz network dynamic minimum hop count routing model based on the satellite node coordinate graph model;
S3, acquiring link state information, processing the link state information based on the space terahertz network dynamic minimum hop count routing model to obtain satellite link time delay information, and realizing space terahertz network dynamic routing;
the link state information includes a data packet size, an inter-satellite link rate, a straight line distance between two nodes, and a path minimum hop count.
Optionally, the satellite node coordinate graph model under the two-dimensional rectangular coordinate system is:
CG＝{V，E，T，Buf(T)，W，CE}
Wherein CG is a satellite node coordinate graph model under a two-dimensional rectangular coordinate system, V is a satellite node set, any satellite node v= (x, y) meets V epsilon V,1 is less than or equal to x is less than or equal to N,1 is less than or equal to y is less than or equal to M, the satellite node coordinate graph model under the two-dimensional rectangular coordinate system comprises N multiplied by M satellites, N is the number of satellites in the row direction, M is the number of satellites in the column direction, E is a link set, any link E a,b meets E a,b epsilon E, a and b are neighbor nodes, a epsilon V, b epsilon V, T is an observation period, buf (T) is a node cache set, a cache time function of the node u is expressed as Buf v (T) epsilon Buf (T), V epsilon V,0 is less than or equal to T, W is an inter-satellite link rate set, and the rate of any link E a,b is expressed as C E is a link communication time period set, the x-axis represents an orbit number, the y-axis represents a satellite serial number, a point represents a satellite node, and a line segment corresponds to an inter-satellite link;
Segments with the same track number are connected in sequence and are parallel to the y axis;
The line segments between satellites with serial numbers 1 and M corresponding to the same track number represent the same intra-track link;
The line segment parallel to the x-axis represents the inter-orbit link in the same-direction region, the reverse region between orbits 1 and N does not have an inter-orbit link, N is the number of satellites in the row direction, and M is the number of satellites in the column direction. Fig. 2 is a satellite node coordinate diagram in a two-dimensional rectangular coordinate system according to an embodiment of the present invention.
Optionally, the buffering time function of the node v is:
bufv(t)＝bufv[u(t)-u(t-T)]
Wherein buf v (T) is a buffer time function when node v has no buffer task, T is an observation period, buf v is a buffer capacity of node v, namely, a maximum value of data quantity which can be buffered by node u at time T, and u (T) is a step function.
Optionally, the dynamic minimum hop count routing model of the space terahertz network uses a source node S and a destination node D as diagonal vertices toA rectangular area with Hops x,Hopsy as side length is a unit displacement vector in the x and y directions;
The end-to-end minimum hop path in the space terahertz network dynamic minimum hop count routing model is as follows:
Wherein Hops is the path minimum hop count, hops = Hops x+Hopsy, For the end-to-end minimum hop path Hops x is the hop count component in the x direction and Hops y is the hop count component in the y direction. FIG. 3 is a schematic diagram of a minimum hop count routing model disclosed in an embodiment of the present invention,/>Respectively correspond to the positive directions of x, y, and their modes are respectively 1.
Time delay is the time required for a data packet to be relayed between stars. The time delay for the satellite link mainly comprises a transmitting time delay of a transmitter end, a transmission time delay in a free space, a processing time delay and a queuing time delay of a receiver end and the like.
Optionally, the processing the link state information based on the space terahertz network dynamic minimum hop count routing model to obtain satellite link delay information includes:
s31, processing the data packet size and the inter-satellite link rate to obtain transmission delay;
the transmission delay is as follows:
Wherein Delay transmit is transmission Delay, f is data packet size, and w is inter-satellite link rate; the transmission Delay transmit refers to the time required for the satellite node data to completely enter the transmission medium.
S32, processing the linear distance between the two nodes to obtain propagation delay;
The propagation delay is:
Wherein Delay propagation is propagation Delay, dist is linear distance between two nodes, and c is propagation velocity of electromagnetic wave in vacuum; the propagation Delay propagation is the time required for the data packet to propagate in the transmission medium, and is mainly aimed at the propagation Delay of the free space, and the influence of the link distance in the propagation Delay of the free space is the greatest.
S33, processing the minimum hop count of the path to obtain end-to-end time delay;
The end-to-end delay is:
Where Delay path is the end-to-end Delay, hops is the path minimum hop count, Is the ith jump time delay; the end-to-end delay is the sum of the delays of each hop on the path.
S34, processing the queuing delay, the transmission delay and the propagation delay to obtain single-hop forwarding delay; the single-hop forwarding delay is the single-hop forwarding delay of the data packet between any two nodes.
And S35, the transmission delay, the propagation delay, the end-to-end delay, the queuing delay and the single-hop forwarding delay form satellite link delay information.
Optionally, the single-hop forwarding delay is:
Delayhop＝Delaytransmit+Delaypropagation+Delayqueue
The Delay hop is a single-hop forwarding Delay, the Delay transmit is a transmission Delay, the Delay propagation is a propagation Delay, and the Delay queue is a queuing Delay, and the queuing Delay queue is a time for the data to be buffered in the satellite node to wait for retransmission, including a time required for the data packet to reach the node to be processed and a waiting time for the data packet to be transmitted from the node to the next hop.
Therefore, the invention considers the link state information in the time-varying diagram of the network topology, improves the selectivity of the path and avoids the condition of invalid paths. The space terahertz network dynamic routing model constructed by the invention adopts the minimum hop count routing model, and reduces the end-to-end path delay.
Example two
Referring to fig. 4, fig. 4 is a schematic structural diagram of a dynamic routing device for a space terahertz network according to an embodiment of the present invention. The spatial terahertz network dynamic routing device described in fig. 4 is applied to the technical field of satellite communication, a dynamic routing model of the spatial terahertz network is constructed, and the embodiment of the invention is not limited. As shown in fig. 4, the spatial terahertz network dynamic routing apparatus may include the following operations:
S301, a coordinate graph model construction module is used for constructing a satellite node coordinate graph model under a two-dimensional rectangular coordinate system;
s302, a minimum hop count routing model construction module is used for constructing a space terahertz network dynamic minimum hop count routing model based on the satellite node coordinate graph model;
S303, a time delay information calculation module acquires link state information, processes the link state information based on the space terahertz network dynamic minimum hop count routing model to acquire satellite link time delay information, and realizes space terahertz network dynamic routing;
the link state information includes a data packet size, an inter-satellite link rate, a straight line distance between two nodes, and a path minimum hop count.
Example III
Referring to fig. 5, fig. 5 is a schematic structural diagram of another dynamic routing device for a space terahertz network according to an embodiment of the present invention. The spatial terahertz network dynamic routing device described in fig. 5 is applied to the technical field of satellite communication, a dynamic routing model of the spatial terahertz network is constructed, and the embodiment of the invention is not limited. As shown in fig. 5, the spatial terahertz network dynamic routing apparatus may include the following operations:
a memory 401 storing executable program codes;
A processor 402 coupled with the memory 401;
the processor 402 invokes executable program code stored in the memory 401 for performing the steps in the spatial terahertz network dynamic routing method described in embodiment one.
Example IV
The embodiment of the invention discloses a computer readable storage medium storing a computer program for electronic data exchange, wherein the computer program causes a computer to perform the steps in the spatial terahertz network dynamic routing method described in the embodiment one.
The apparatus embodiments described above are merely illustrative, in which the modules illustrated as separate components may or may not be physically separate, and the components shown as modules may or may not be physical, i.e., may be located in one place, or may be distributed over multiple network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above detailed description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course by means of hardware. Based on such understanding, the foregoing technical solutions may be embodied essentially or in part in the form of a software product that may be stored in a computer-readable storage medium including Read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), programmable Read-Only Memory (Programmable Read-Only Memory, PROM), erasable programmable Read-Only Memory (Erasable Programmable Read Only Memory, EPROM), one-time programmable Read-Only Memory (OTPROM), electrically erasable programmable Read-Only Memory (EEPROM), compact disc Read-Only Memory (Compact Disc Read-Only Memory, CD-ROM) or other optical disc Memory, magnetic disc Memory, tape Memory, or any other medium that can be used for computer-readable carrying or storing data.
Finally, it should be noted that: the embodiment of the invention discloses a dynamic routing method and a dynamic routing device for a space terahertz network, which are disclosed by the embodiment of the invention and are only used for illustrating the technical scheme of the invention, but not limiting the technical scheme; although the invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art will understand that; the technical scheme recorded in the various embodiments can be modified or part of technical features in the technical scheme can be replaced equivalently; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions.
Claims (9)
1. A method for dynamic routing of a spatial terahertz network, the method comprising:
S1, constructing a satellite node coordinate graph model under a two-dimensional rectangular coordinate system;
S2, constructing a space terahertz network dynamic minimum hop count routing model based on the satellite node coordinate graph model;
S3, acquiring link state information, processing the link state information based on the space terahertz network dynamic minimum hop count routing model to obtain satellite link time delay information, and realizing space terahertz network dynamic routing;
the link state information includes a data packet size, an inter-satellite link rate, a straight line distance between two nodes, and a path minimum hop count.
2. The dynamic routing method of the space terahertz network according to claim 1, wherein the satellite node coordinate graph model in the two-dimensional rectangular coordinate system is:
CG＝{V，E，T，Buf(T)，W，CE}
Wherein CG is a satellite node coordinate graph model under a two-dimensional rectangular coordinate system, V is a satellite node set, arbitrary satellite nodes v= (x, y) meet V epsilon V,1 is less than or equal to x is less than or equal to N,1 is less than or equal to y is less than or equal to M, the satellite node coordinate graph model under the two-dimensional rectangular coordinate system comprises N multiplied by M satellites, N is the number of satellites in the row direction, M is the number of satellites in the column direction, E is a link set, arbitrary link E a,b meets E a,b E, a and b are neighbor nodes, a epsilon V, b epsilon V, T is an observation period, buf (T) is a node cache set, a cache time function of the node V is expressed as Buf υ (T) epsilon Buf (T), V epsilon V,0 is less than or equal to T, W is an inter-satellite link rate set, and the rate of arbitrary link E a,b is expressed as C E is a link communication time period set, the x-axis represents an orbit number, the y-axis represents a satellite serial number, a point represents a satellite node, and a line segment corresponds to an inter-satellite link;
Segments with the same track number are connected in sequence and are parallel to the y axis;
The line segments between satellites with serial numbers 1 and M corresponding to the same track number represent the same intra-track link;
The line segment parallel to the x-axis represents the inter-orbit link in the same-direction region, the reverse region between orbits 1 and N does not have an inter-orbit link, N is the number of satellites in the row direction, and M is the number of satellites in the column direction.
3. The dynamic routing method of the spatial terahertz network according to claim 2, wherein the buffering time function of the node v is:
bufυ(t)＝bufυ[u(t)-u(t-T)]
Wherein buf v (T) is a buffer time function when the node v has no buffer task, T is an observation period, buf υ is a buffer capacity of the node v, namely, a maximum value of data volume which can be buffered by the node v at time T, and u (T) is a step function.
4. The method according to claim 2, wherein the dynamic minimum hop count routing model of the space terahertz network uses a source node S and a destination node D as diagonal vertices toA rectangular area with Hops x,Hopsy as side length is a unit displacement vector in the x and y directions;
The end-to-end minimum hop path in the space terahertz network dynamic minimum hop count routing model is as follows:
Wherein Hops is the path minimum hop count, hops = Hops x+Hopsy, For the end-to-end minimum hop path Hops x is the hop count component in the x direction and Hops y is the hop count component in the y direction.
5. The method for dynamically routing a space terahertz network according to claim 1, wherein the processing the link state information based on the space terahertz network dynamic minimum hop count routing model to obtain satellite link delay information includes:
s31, processing the data packet size and the inter-satellite link rate to obtain transmission delay;
the transmission delay is as follows:
Wherein Delay transmit is transmission Delay, f is data packet size, and w is inter-satellite link rate;
S32, processing the linear distance between the two nodes to obtain propagation delay;
The propagation delay is:
wherein Delay propagation is propagation Delay, dist is linear distance between two nodes, and c is propagation velocity of electromagnetic wave in vacuum;
s33, processing the minimum hop count of the path to obtain end-to-end time delay;
The end-to-end delay is:
Where Delay path is the end-to-end Delay, hops is the path minimum hop count, Is the ith jump time delay;
S34, processing the queuing delay, the transmission delay and the propagation delay to obtain single-hop forwarding delay;
And S35, the transmission delay, the propagation delay, the end-to-end delay, the queuing delay and the single-hop forwarding delay form satellite link delay information.
6. The method for dynamic routing of a spatial terahertz network according to claim 5, wherein the single-hop forwarding delay is:
Delayhop＝Delaytransmit+Delaypropagation+Delayqueue
The Delay hop is a single-hop forwarding Delay, the Delay transmit is a transmission Delay, the Delay propagation is a propagation Delay, and the Delay queue is a queuing Delay, and the queuing Delay queue is a time for the data to be buffered in the satellite node to wait for retransmission, including a time required for the data packet to reach the node to be processed and a waiting time for the data packet to be transmitted from the node to the next hop.
7. A spatial terahertz network dynamic routing apparatus, the apparatus comprising:
The coordinate graph model construction module is used for constructing a satellite node coordinate graph model under a two-dimensional rectangular coordinate system;
The minimum hop count route model building module is used for building a space terahertz network dynamic minimum hop count route model based on the satellite node coordinate graph model;
The time delay information calculation module is used for obtaining link state information, processing the link state information based on the space terahertz network dynamic minimum hop count routing model to obtain satellite link time delay information, and realizing space terahertz network dynamic routing;
the link state information includes a data packet size, an inter-satellite link rate, a straight line distance between two nodes, and a path minimum hop count.
8. A spatial terahertz network dynamic routing apparatus, the apparatus comprising:
A memory storing executable program code;
A processor coupled to the memory;
the processor invokes the executable program code stored in the memory to perform the spatial terahertz network dynamic routing method of any one of claims 1-6.
9. A computer-storable medium storing computer instructions that, when invoked, are operable to perform the spatial terahertz network dynamic routing method of any one of claims 1-6.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2023115974250 | 2023-11-27 | ||
| CN202311597425 | 2023-11-27 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117978248A true CN117978248A (en) | 2024-05-03 |
| CN117978248B CN117978248B (en) | 2024-07-02 |
Family
ID=90861319
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410153770.3A Active CN117978248B (en) | 2023-11-27 | 2024-02-02 | Dynamic routing method for space terahertz network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117978248B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180323863A1 (en) * | 2017-05-05 | 2018-11-08 | Via Space Networks Inc. | Low latency satellite communication relay network |
| CN112996019A (en) * | 2021-03-01 | 2021-06-18 | 军事科学院系统工程研究院网络信息研究所 | Terahertz frequency band distributed constellation access control method based on multi-objective optimization |
| CN116192760A (en) * | 2023-01-12 | 2023-05-30 | 中国人民解放军军事科学院系统工程研究院 | Traffic shaping method and device for space terahertz communication network |
-
2024
- 2024-02-02 CN CN202410153770.3A patent/CN117978248B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180323863A1 (en) * | 2017-05-05 | 2018-11-08 | Via Space Networks Inc. | Low latency satellite communication relay network |
| CN112996019A (en) * | 2021-03-01 | 2021-06-18 | 军事科学院系统工程研究院网络信息研究所 | Terahertz frequency band distributed constellation access control method based on multi-objective optimization |
| CN116192760A (en) * | 2023-01-12 | 2023-05-30 | 中国人民解放军军事科学院系统工程研究院 | Traffic shaping method and device for space terahertz communication network |
Non-Patent Citations (1)
| Title |
|---|
| 张娣;张焱;文晋晓;何遵文;: "太赫兹频段星地通信信道建模与仿真", 电波科学学报, no. 05, 15 October 2017 (2017-10-15) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117978248B (en) | 2024-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2280513B1 (en) | Router, information processing device having said router, and packet routing method | |
| US7889725B2 (en) | Computer cluster | |
| US5175733A (en) | Adaptive message routing for multi-dimensional networks | |
| US7502378B2 (en) | Flexible wrapper architecture for tiled networks on a chip | |
| Jiang et al. | A space–time graph based multipath routing in disruption-tolerant earth-observing satellite networks | |
| US5777986A (en) | Method and apparatus for controlling quality of service in an ATM network | |
| US8483216B2 (en) | Simple fairness protocols for daisy chain interconnects | |
| JP5004869B2 (en) | Network route selection method and communication system | |
| CN116248164A (en) | Fully distributed routing method and system based on deep reinforcement learning | |
| Yi et al. | Satellite constellation of MEO and IGSO network routing with dynamic grouping | |
| US20050157717A1 (en) | Method and system for transmitting messages in an interconnection network | |
| CN117978248B (en) | Dynamic routing method for space terahertz network | |
| Gnawali et al. | Data centric, position-based routing in space networks | |
| Nag et al. | Designing a disruption tolerant network for reactive spacecraft constellations | |
| Dhara et al. | CGR-BF: An efficient contact utilization scheme for predictable deep space delay tolerant network | |
| US20050154843A1 (en) | Method of managing a device for memorizing data organized in a queue, and associated device | |
| Mikheev et al. | Performance of transport connection with selective failure mode when competing for throughput of data transmission path | |
| Bogushevsky et al. | The time-out length influence on the available bandwidth of the selective failure mode of transport protocol in the load data transmission path | |
| US7382721B2 (en) | Nodal computer network | |
| EP1387535B1 (en) | Minimum deflection routing in bufferless networks | |
| CN115665041B (en) | Network-on-chip structure, data transmission method, electronic device, and storage medium | |
| CN116633426B (en) | Satellite routing method, device and storage medium | |
| CN116566834A (en) | Method for determining data transmission path and related device | |
| WO2022209801A1 (en) | Communication device, communication system, and communication method | |
| WO2024221126A1 (en) | Method and apparatus for packet forwarding in a manhattan grid network |
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 |