CN116470955A - Network perception data transmission method and device, computer equipment and storage medium - Google Patents

Network perception data transmission method and device, computer equipment and storage medium Download PDF

Info

Publication number
CN116470955A
CN116470955A CN202310506650.2A CN202310506650A CN116470955A CN 116470955 A CN116470955 A CN 116470955A CN 202310506650 A CN202310506650 A CN 202310506650A CN 116470955 A CN116470955 A CN 116470955A
Authority
CN
China
Prior art keywords
link
transmission
satellite
network
time slot
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.)
Pending
Application number
CN202310506650.2A
Other languages
Chinese (zh)
Inventor
刘世栋
卜宪德
刘川
李炳林
陶静
位祺
金广祥
肖智宏
范超
张�浩
付振霄
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Economic And Technological Research Institute Co LtdB412 State Grid Office
State Grid Smart Grid Research Institute Co ltd
State Grid Corp of China SGCC
State Grid Shandong Electric Power Co Ltd
Economic and Technological Research Institute of State Grid Shandong Electric Power Co Ltd
Original Assignee
State Grid Economic And Technological Research Institute Co LtdB412 State Grid Office
State Grid Smart Grid Research Institute Co ltd
State Grid Corp of China SGCC
State Grid Shandong Electric Power Co Ltd
Economic and Technological Research Institute of State Grid Shandong Electric Power Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by State Grid Economic And Technological Research Institute Co LtdB412 State Grid Office, State Grid Smart Grid Research Institute Co ltd, State Grid Corp of China SGCC, State Grid Shandong Electric Power Co Ltd, Economic and Technological Research Institute of State Grid Shandong Electric Power Co Ltd filed Critical State Grid Economic And Technological Research Institute Co LtdB412 State Grid Office
Priority to CN202310506650.2A priority Critical patent/CN116470955A/en
Publication of CN116470955A publication Critical patent/CN116470955A/en
Pending legal-status Critical Current

Links

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
    • 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/18513—Transmission in a satellite or space-based system
    • 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/02—Topology update or discovery
    • 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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/125—Shortest path evaluation based on throughput or bandwidth
    • 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)
  • Radio Relay Systems (AREA)

Abstract

The invention relates to the satellite communication field, and discloses a transmission method, a device, computer equipment and a storage medium of network perception data, wherein the method comprises the steps of acquiring the running states and network service time of all satellite nodes in a low-orbit satellite network; constructing a time-varying graph model based on all satellite nodes and links among the satellite nodes and network service time; and calculating the link transmission capacity of each transmission link based on the time-varying graph model and the running state, and carrying out maximum link transmission capacity route searching of each time slot to obtain a data transmission scheme of the low-orbit satellite network. By implementing the invention, a time-varying graph model is constructed by considering the high-speed motion of satellite nodes along the orbit in a low-orbit satellite network along the time, and the network topology calculation link transmission capacity of each time slot is obtained through the time-varying graph model to carry out the path finding. The method combines the time-varying graph model to determine the data transmission link on the basis of considering the transmission capacity, improves the network load balancing capability and improves the transmission robustness.

Description

Network perception data transmission method and device, computer equipment and storage medium
Technical Field
The present invention relates to the field of satellite communications, and in particular, to a method and apparatus for transmitting network-aware data, a computer device, and a storage medium.
Background
With the continuous development of communication network infrastructures deployed worldwide, users can access the internet through intelligent terminals at any time and any place in the city range. However, the ground network construction range is greatly affected by geographical conditions. In remote areas, the number of base stations is small due to high infrastructure construction cost and low network utilization, resulting in insufficient network coverage. In desert and high altitude areas, because of the difficulty in infrastructure construction, network coverage is not generally available, and data transmission requirements are often not met. In response to the increasing network demands of users in these areas and the evolving demands of 5G communication systems for global ubiquitous interconnects, emerging Low Earth Orbit (LEO) satellite constellations can solve these problems. The LEO satellite constellation is networked by dense LEO satellites, each of which moves in orbit around the earth at high speeds, so the LEO satellite network is a dynamic network. LEO satellites can be connected with a plurality of surrounding LEO satellites through Inter-Satellite Links (ISL) according to the configuration of an on-Satellite antenna to construct a transmission network, so that the topography factors can be ignored, the global seamless network coverage can be realized, and the area which is difficult to reach by a ground network can also obtain network services through STIN (Satellite-Terrestrial Integrated Networks, satellite-ground fusion network). Thus, in STIN, the construction of LSNs (LEO Satellite networks ) is important for future global ubiquitous interconnect landscape.
The conventional communication satellites are not deployed with inter-satellite links, and data transmission and traffic management are controlled by ground stations, so that data needs to be transmitted from a sender to a receiver through multi-hop ground and satellite switching. The sender firstly sends information to the satellite, the forwarding satellite needs to send to the ground station for forwarding, and the ground station forwards the information to the next satellite, so that the number of transmission times from the ground to the satellite is increased, and the traditional satellite communication efficiency is low due to excessive transmission time delay.
With the increasing data processing capabilities of low earth orbit satellites onboard, current low earth orbit satellites have been provided with the ability to establish inter-satellite links. Two LEO satellites in the visible range can dynamically establish inter-satellite links through positioning, tracking, calibration and other processes, thereby forming a satellite transmission network, which can significantly improve the efficiency of global data transmission. However, due to limited on-board transmission resources of the LSN and rapid mobility of the nodes, the existing terrestrial data transmission scheme is not applicable, so that it is necessary to study the transmission link deployment and network traffic scheduling scheme of the LSN to improve the communication quality and efficiency.
Disclosure of Invention
In view of the above, the present invention provides a method, apparatus, computer device and storage medium for transmitting network-aware data, so as to solve the problem that the existing terrestrial data transmission scheme is not suitable for LSN data transmission.
In a first aspect, the present invention provides a method for transmitting network-aware data, where the method includes: acquiring the running states and network service time of all satellite nodes in a low-orbit satellite network, wherein the network service time comprises a plurality of time slots; constructing a time-varying graph model based on all satellite nodes, links among the satellite nodes and network service time, wherein the links are data transmission links between two adjacent satellite nodes; and calculating the link transmission capacity of each transmission link based on the time-varying graph model and the running state, and carrying out maximum link transmission capacity route searching of each time slot to obtain a data transmission scheme of the low-orbit satellite network, wherein the transmission links are data transmission links from the source node to the destination node.
According to the network perception data transmission method, the running states and network service time of all satellite nodes in a low-orbit satellite network are obtained, meanwhile, the satellite nodes in the low-orbit satellite network move at high speed along the orbit along the time are considered, so that a time-varying graph model is built on the basis of the network service time, and when data are transmitted, the network topology calculation link transmission capacity of each time slot is obtained through the time-varying graph model, and the maximum link transmission capacity route finding is conducted. Therefore, the method combines the time-varying graph model determined by the node mobility to determine the data transmission link on the basis of considering the satellite transmission resource, namely the transmission capacity, thereby improving the network load balancing capability and improving the transmission robustness.
In an alternative embodiment, constructing a time-varying graph model based on all satellite nodes, links between satellite nodes, and network service time, includes: and constructing a time-varying graph model by taking all satellite nodes as vertexes of the graph model and taking links among the satellite nodes as edges of the vertexes, wherein the vertexes and the edges are functions of network service time.
According to the network perception data transmission method, the time-varying graph model is built by taking all satellite nodes as the vertexes of the graph model and the transmission links among the satellite nodes as the edges of the vertexes, and meanwhile, the vertexes and the edges are functions of network service time, so that the built time-varying graph model realizes tracking of network topology at different time periods.
In an alternative embodiment, calculating the link transmission capacity of each transmission link based on the time-varying graph model and the running state, and performing the maximum link transmission capacity routing of each time slot to obtain the data transmission scheme of the low-orbit satellite network, including: acquiring the low orbit satellite network topology of the current time slot according to the time-varying graph model and the running state; calculating the link transmission capacity according to the low orbit satellite network topology of the current time slot, and carrying out the maximum link transmission capacity route searching of the current time slot; calculating the duration of the current time slot according to the satellite ephemeris data, and determining the starting time of the next time slot; acquiring the low orbit satellite network topology of the next time slot according to the starting time of the next time slot and the time-varying graph model; and calculating the link transmission capacity according to the low-orbit satellite network topology of the next time slot, carrying out the maximum link transmission capacity route searching of the next time slot, and taking the transmission link corresponding to the maximum link transmission capacity of each time slot as the data transmission scheme of the corresponding time slot of the low-orbit satellite network.
According to the transmission method of the network perception data, different time slots are divided, meanwhile, the starting time of each time slot is determined according to satellite ephemeris data, the network topology of each time slot is determined by combining a time-varying graph model, and the maximum link transmission capacity is searched in the different time slots, so that continuous transmission measurement of dynamic network topology calculation is realized, and the transmission robustness is improved.
In an alternative embodiment, calculating the link transmission capacity according to the low orbit satellite network topology of the current time slot, and performing the maximum link transmission capacity route searching of the current time slot includes: acquiring a source node and a destination node corresponding to a transmission link of data transmission in a current time slot; calculating the link transmission capacity of two adjacent satellites in the transmission link of the current time slot according to the network topology of the low-orbit satellite of the current time slot based on the source node and the destination node; and determining the link transmission capacity of each transmission link according to the link transmission capacities of two adjacent satellites, and taking the transmission link with the maximum link transmission capacity as a data transmission path.
The network perception data transmission method provided by the invention determines the source node and the destination node of data transmission in each time slot when the maximum link transmission capacity is searched in each time slot, and combines the link transmission capacity to search the maximum link transmission capacity between the source node and the destination node of each transmission link, thereby realizing the deployment of the transmission link and the network flow scheduling.
In an alternative embodiment, determining the link transmission capacity of each transmission link according to the link transmission capacities of two adjacent satellites, and taking the transmission link with the largest link transmission capacity as the data transmission path includes: traversing each node which can establish a link by adopting an MST algorithm from a source node; calculating the link transmission capacity from the source node to the current node according to the link transmission capacities of two adjacent satellites; calculating a first distance between the current node and the destination node and a second distance between any next-hop node and the destination node; selecting a next hop node according to the relation between the first distance and the second distance; and repeating the steps of calculating the transmission capacity of the link, calculating the first distance and the second distance and comparing the first distance and the second distance until the destination node is reached, and obtaining the transmission path from the source node to the destination node.
According to the network perception data transmission method, when the maximum link transmission capacity is found, the transmission capacity of the link is considered, and meanwhile, the transmission process can be ensured to be always carried out along the direction from the source node to the destination node through judging the relation between the first distance between the current node and the destination node and the second distance between any next-hop node and the destination node. And simultaneously, the data transmission delay is reduced.
In an alternative embodiment, the operational state includes the transmission capabilities of each satellite node; calculating the link transmission capacity of two adjacent satellites in the current time slot according to the low orbit satellite network topology of the current time slot, comprising: determining the occupied transmission capacity of each satellite node in the current time slot according to the low orbit satellite network topology of the current time slot; determining the available transmission capacity of each satellite node according to the difference between the transmission capacity of each satellite node and the occupied transmission capacity; the smaller value of the available transmission capacity of each satellite node in the two adjacent satellites is taken as the link transmission capacity of the two adjacent satellites.
According to the network perception data transmission method provided by the invention, the small value of the difference value corresponding to each satellite in two adjacent satellites is selected as the link transmission capacity of the two adjacent satellites by calculating the difference value of the transmission capacity and the occupied transmission capacity of each satellite node. The calculation of the link transmission capacity lays a foundation for the selection of the maximum capacity.
In an alternative embodiment, acquiring the operational status of all satellite nodes in the low-orbit satellite network includes: and acquiring the running states of all satellite nodes in the low-orbit satellite network by adopting the high-orbit satellite.
According to the network perception data transmission method, the running states of satellite nodes in the low-orbit satellite network are collected through the high-orbit satellite based on the global network coverage of the high-orbit satellite to the low-orbit satellite. Thereby realizing the global perception of the running state of the low-orbit satellite network.
In a second aspect, the present invention provides a network-aware data transmission apparatus, the apparatus comprising: the data acquisition module is used for acquiring the running states of all satellite nodes in the low-orbit satellite network and network service time, wherein the network service time comprises a plurality of time slots; the model construction module is used for constructing a time-varying graph model based on all satellite nodes, links among the satellite nodes and network service time, wherein the links are data transmission links among two adjacent satellite nodes; and the path searching module is used for calculating the link transmission capacity of each transmission link based on the time-varying graph model and the running state, and carrying out the maximum link transmission capacity path searching of each time slot to obtain the data transmission scheme of the low-orbit satellite network, wherein the transmission links are the data transmission links from the source node to the destination node.
In an alternative embodiment, the model building module is specifically configured to: and constructing a time-varying graph model by taking all satellite nodes as vertexes of the graph model and taking links among the satellite nodes as edges of the vertexes, wherein the vertexes and the edges are functions of network service time.
In an alternative embodiment, the routing module includes: the current topology determining unit is used for obtaining the low orbit satellite network topology of the current time slot according to the time-varying graph model and the running state; the current path searching unit is used for calculating the link transmission capacity according to the low-orbit satellite network topology of the current time slot and carrying out the maximum link transmission capacity path searching of the current time slot; a time slot calculating unit for calculating the duration of the current time slot according to the satellite ephemeris data and determining the starting time of the next time slot; the next topology determining unit is used for obtaining the low orbit satellite network topology of the next time slot according to the starting time of the next time slot and the time-varying graph model; and the next path searching unit calculates the link transmission capacity according to the low-orbit satellite network topology of the next time slot, performs the maximum link transmission capacity path searching of the next time slot, and takes the transmission link corresponding to the maximum link transmission capacity of each time slot as the data transmission scheme of the corresponding time slot of the low-orbit satellite network.
In an alternative embodiment, the current routing unit includes: the node acquisition unit is used for acquiring a source node and a destination node corresponding to a transmission link of data transmission in the current time slot; the adjacent capacity calculation unit is used for calculating the link transmission capacity of two adjacent satellites in the current time slot transmission link according to the low-orbit satellite network topology of the current time slot based on the source node and the destination node; and the searching sub-unit is used for determining the link transmission capacity of each transmission link according to the link transmission capacities of two adjacent satellites, and taking the transmission link with the maximum link transmission capacity as a data transmission path.
In an alternative embodiment, the seek subunit is specifically configured to: traversing each node which can establish a link by adopting an MST algorithm from a source node; calculating the link transmission capacity from the source node to the current node according to the link transmission capacities of two adjacent satellites; calculating a first distance between the current node and the destination node and a second distance between any next-hop node and the destination node; selecting a next hop node according to the relation between the first distance and the second distance; and repeating the steps of calculating the transmission capacity of the link, calculating the first distance and the second distance and comparing the first distance and the second distance until the destination node is reached, and obtaining the transmission path from the source node to the destination node.
In an alternative embodiment, the operational state includes the transmission capabilities of each satellite node; the adjacent capacity calculation unit is specifically configured to: determining the occupied transmission capacity of each satellite node in the current time slot according to the low orbit satellite network topology of the current time slot; determining the available transmission capacity of each satellite node according to the difference between the transmission capacity of each satellite node and the occupied transmission capacity; the smaller value of the available transmission capacity of each satellite node in the two adjacent satellites is taken as the link transmission capacity of the two adjacent satellites.
In an alternative embodiment, the data acquisition module is specifically configured to: and acquiring the running states of all satellite nodes in the low-orbit satellite network by adopting the high-orbit satellite.
In a third aspect, the present invention provides a computer device comprising: the memory and the processor are in communication connection with each other, the memory stores computer instructions, and the processor executes the computer instructions, so as to execute the network-aware data transmission method according to the first aspect or any implementation manner corresponding to the first aspect.
In a fourth aspect, the present invention provides a computer readable storage medium having stored thereon computer instructions for causing a computer to perform the method for transmitting network awareness data of the first aspect or any of its corresponding embodiments.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are needed in the description of the embodiments or the prior art will be briefly described, and it is obvious that the drawings in the description below are some embodiments of the present invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a method for transmitting network-aware data according to an embodiment of the present invention;
FIG. 2 is a flow chart of another method for transmitting network-aware data according to an embodiment of the invention;
fig. 3 is a schematic diagram of a transmission scenario in a transmission method of network-aware data according to an embodiment of the present invention;
FIG. 4 is a flow chart of a method of transmitting network awareness data according to an embodiment of the present invention;
fig. 5 is a block diagram of a transmission apparatus of network-aware data according to an embodiment of the present invention;
fig. 6 is a schematic diagram of a hardware structure of a computer device according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. 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 application scenario is described herein in connection with an application scenario on which execution of a network-aware data transmission method depends.
Just as in the background art, due to limited on-board transmission resources of the LSN and rapid mobility of the nodes, the existing terrestrial data transmission scheme is not applicable, so that it is necessary to study the transmission link deployment and network traffic scheduling scheme of the LSN to improve the communication quality and efficiency. There are many problems to be solved in the data transmission of LSNs. Firstly, with the rapid development of ground communication service, the communication demand is higher and higher, which leads to the increase of the transmission demand of LSN, and the utilization of limited satellite transmission resources is needed, thereby improving the LSN traffic management efficiency and the network load balancing capability. Secondly, a time-varying transmission link is caused by node mobility, and a continuous transmission strategy needs to be designed facing a dynamic network topology, so that the transmission robustness is improved.
In view of this, an embodiment of the present invention provides a method for transmitting network-aware data, by acquiring an operation state and network service time of all satellite nodes in a low-orbit satellite network, and considering that the satellite nodes in the low-orbit satellite network move at a high speed along an orbit along time, a time-varying graph model is constructed based on the network service time, and when data is transmitted, a network topology calculation link transmission capacity of each time slot is acquired through the time-varying graph model, a path is searched for a maximum transmission capacity, and then a link corresponding to the maximum transmission capacity is utilized to transmit data. Therefore, the method combines the time-varying graph model determined by the node mobility to determine the data transmission link on the basis of considering the satellite transmission resource, namely the transmission capacity, thereby improving the network load balancing capability and improving the transmission robustness.
According to an embodiment of the present invention, there is provided an embodiment of a method for transmitting network-aware data, it should be noted that the steps shown in the flowcharts of the drawings may be executed in a computer system such as a set of computer-executable instructions, and that although a logical order is shown in the flowcharts, in some cases the steps shown or described may be executed in an order different from that herein.
In this embodiment, a method for transmitting network awareness data is provided, which may be used by an SDN controller, and fig. 1 is a flowchart of a method for transmitting network awareness data according to an embodiment of the present invention, as shown in fig. 1, where the flowchart includes the following steps:
step S101, acquiring the running states of all satellite nodes in the low orbit satellite network and the network service time, wherein the network service time comprises a plurality of time slots. In particular, the global network coverage of the high orbit satellite (Geostationary Satellite, GEO) may be utilized to collect the operational status of all satellite nodes in the low orbit satellite network, i.e., the low orbit satellite, including the current flight position, transmission demand, transmission capacity, etc. of all satellite nodes, thereby enabling global awareness of the operational status of the low orbit satellite network. When determining a specific flight position, a Cartesian coordinate system can be established by taking the center of the earth as the origin of coordinates, and then the three-dimensional space coordinate of each satellite node in the coordinate system is the flight position of the satellite node. The transmission requirement is specifically a transmission request of a user in an area covered by the low-orbit satellite network for a transmission resource of a satellite node in the low-orbit satellite network. The transmission capacity is the total capacity that each satellite node can transmit. The network service time is specifically the working time of the low orbit satellite network.
In addition, the transmission method of the network perception data can be realized in the SDN controller, namely, the SDN controller is adopted to acquire the global view of the low-orbit satellite network, so that the network control in the logic set can be realized.
Step S102, a time-varying graph model is built based on all satellite nodes, links among the satellite nodes and network service time, wherein the links are data transmission links between two adjacent satellite nodes. In particular, a time-varying graph model may be understood as a graph model that varies over time. Since in a low orbit satellite network, satellite nodes run at high speed in orbit over time, the network topology also changes over time, thereby constructing a time-varying graph model. The graph model is a model structure corresponding to the topological structure of the low-orbit satellite network.
Step S103, calculating the link transmission capacity of each transmission link based on the time-varying graph model and the running state, and carrying out maximum link transmission capacity route searching of each time slot to obtain a data transmission scheme of the low-orbit satellite network, wherein the transmission link is a data transmission link from a source node to a destination node. Specifically, when determining a data transmission path, selecting a maximum capacity path through calculated link transmission capacity, and improving load balancing performance of a network; meanwhile, due to the mobility of the satellite nodes, the network service time is divided into a plurality of time slots, and the network topology of the current time slot is determined in each time slot based on a time-varying graph model, so that the maximum link transmission capacity route finding of each time slot is realized.
According to the network perception data transmission method provided by the embodiment of the invention, the running states and network service time of all satellite nodes in the low-orbit satellite network are acquired, meanwhile, the satellite nodes in the low-orbit satellite network move at high speed along the orbit along the time are considered, so that a time-varying graph model is constructed based on the network service time, and when data is transmitted, the network topology calculation link transmission capacity of each time slot is acquired through the time-varying graph model, and the maximum link transmission capacity route finding is performed. Therefore, the method combines the time-varying graph model determined by the node mobility to determine the data transmission link on the basis of considering the satellite transmission resource, namely the transmission capacity, thereby improving the network load balancing capability and improving the transmission robustness.
In one embodiment, constructing a time-varying graph model based on all satellite nodes, links between satellite nodes, and network service time includes: and constructing a time-varying graph model by taking all satellite nodes as vertexes of the graph model and taking links among the satellite nodes as edges of the vertexes, wherein the vertexes and the edges are functions of network service time. Specifically, if all satellite nodes in the low-orbit satellite network form a set s= { S i Inter-satellite transmission link between two satellites is l ij The link set is set to l= { L ij The network service time is set to T. If { s } i Seen as the vertex of a graph model, { l ij Seen as the edge connecting vertices, the low orbit satellite network can describe its network topology with a time-varying graph model G, and { l } ij And is a function of T, varying with T. Wherein, the time-varying graph model G is expressed as:
G＝(S,L,T)
where T can be considered as a group of time slotsThe sum, i.e. t= { T 1 ,T 2 ,...T k }. At each T k The topology of G is set to remain unchanged. Then both S and L can be regarded as functions of T, as with T k Is varied by a variation of (c) and can be expressed as S (T k )，L(T k ). And further break down the continuous path planning problem into formulating the transmission strategy of the current topology according to each time slot.
According to the network perception data transmission method, the time-varying graph model is built by taking all satellite nodes as the vertexes of the graph model and the transmission links among the satellite nodes as the edges of the vertexes, and meanwhile, the vertexes and the edges are functions of network service time, so that the built time-varying graph model realizes tracking of network topology at different time periods.
In this embodiment, a method for transmitting network awareness data is provided, which may be used by an SDN controller, and fig. 2 is a flowchart of a method for transmitting network awareness data according to an embodiment of the present invention, as shown in fig. 2, where the flowchart includes the following steps:
Step S201, acquiring the running states of all satellite nodes in the low orbit satellite network and the network service time, wherein the network service time comprises a plurality of time slots. Please refer to step S101 in the embodiment shown in fig. 1 in detail, which is not described herein.
Step S202, a time-varying graph model is built based on all satellite nodes, links among the satellite nodes and network service time, wherein the links are data transmission links between two adjacent satellite nodes. Please refer to step S102 in the embodiment shown in fig. 1 in detail, which is not described herein.
Step S203, calculating the link transmission capacity of each transmission link based on the time-varying graph model and the running state, and carrying out the maximum link transmission capacity route searching of each time slot to obtain the data transmission scheme of the low-orbit satellite network, wherein the transmission link is the data transmission link from the source node to the destination node.
Specifically, the step S203 includes:
step S2031, obtaining the low orbit satellite network topology of the current time slot according to the time-varying graph model and the running state. In particular, since the satellite nodes in the low-orbit satellite network move along the orbit at high speed, the positions of the satellite nodes in the low-orbit satellite network at the respective time nodes are different, so that the network topology changes with time, and thus the maximum capacity path selection problem is dynamic in the time dimension. Because the network topology is represented by adopting a time-varying graph model, the maximum capacity path selection problem can be converted into a path finding problem in the time-varying graph model, the network service time is divided into time slots so as to decompose the maximum capacity path selection problem into time-slot sequential calculation in the time dimension, and a continuous solution of the maximum capacity path selection problem in time, namely a data transmission scheme of the low-orbit satellite network, is obtained.
Wherein, in time slot division, the maximum link transmission capacity in each time slot needs to be determined for routing. For the current time slot, the network topology of the current time slot may be determined based on the originally acquired operational state and the constructed time-varying graph model. Specifically, since the time-varying graph model describes the change of the network topology, the network topology corresponding to the current time slot can be obtained by determining the time difference between the start time of the current time slot and the acquired operation state through the originally acquired operation state such as the position of the satellite node and determining the change of the network topology in the time difference in combination with the time-varying graph model. The network topology is unchanged in the current time slot.
Step S2032, calculating the link transmission capacity according to the low orbit satellite network topology of the current time slot, and performing the maximum link transmission capacity route searching of the current time slot. Specifically, in the current time slot, the transmission capacity of each data transmission link is calculated, and the link with the largest capacity is selected for data transmission, so that the maximum capacity path transmission is realized, the link congestion caused by the fact that a plurality of tasks are arranged on the same transmission path is avoided, and the load balance performance of the network is improved.
Step S2033, calculates the duration of the current time slot according to the satellite ephemeris data, and determines the start time of the next time slot. Among them, ephemeris data (ephemeris data) is also called ephemeris. The satellite orbit parameter table is used for indicating the preset position of a certain satellite at regular intervals or the preset position of a certain artificial satellite at regular intervals. The method comprises the steps that the sustainable time of the network topology in the current time slot can be obtained by combining satellite ephemeris data, wherein the ground station can receive data transmitted by satellites in a certain range, the topology structure of the satellite can be regarded as unchanged when the satellite moves in the range, namely the time of the satellite moving in the range is taken as the sustainable time of the current time slot, and the time of the satellite moving in a certain range can be obtained from the satellite ephemeris data; this time is also the duration of the current time slot, from which the start time of the current time slot, i.e. the start time of the next time slot, can be determined.
Step S2034, obtaining the low orbit satellite network topology of the next time slot according to the starting time of the next time slot and the time-varying graph model.
Step S2035, calculating the link transmission capacity according to the topology of the low-orbit satellite network in the next time slot, performing the maximum link transmission capacity route finding in the next time slot, and using the transmission link corresponding to the maximum link transmission capacity of each time slot as the data transmission scheme of the corresponding time slot of the low-orbit satellite network.
Specifically, the maximum link transmission capacity routing process of the next slot and the current slot routing Cheng Leishi are not described herein. After the next time slot is found, the next time slot can be found continuously in the same way, and finally, the finding of all the time slots is completed, so that the data transmission scheme of the low-orbit satellite network is obtained.
According to the transmission method of the network perception data, different time slots are divided, meanwhile, the starting time of each time slot is determined according to satellite ephemeris data, the network topology of each time slot is determined by combining a time-varying graph model, and the maximum link transmission capacity is searched in the different time slots, so that continuous transmission measurement of dynamic network topology calculation is realized, and the transmission robustness is improved.
In some alternative embodiments, step S2022 described above comprises:
step a1, a source node and a destination node corresponding to a transmission link of data transmission in a current time slot are obtained. Specifically, when the maximum link transmission capacity is routed in the current time slot, the data transmission may include data transmission of a plurality of tasks, and source nodes and destination nodes transmitted by different tasks may be different, so path planning needs to be performed for the source node and the destination node corresponding to each task.
And a step a2, calculating the link transmission capacity of two adjacent satellites in the current time slot according to the low-orbit satellite network topology of the current time slot based on the source node and the destination node. Specifically, when path planning is performed on a source node and a destination node corresponding to each task, a first pair of source nodes and destination nodes is selected to perform maximum link transmission capacity path searching, and after the path searching of the first pair is completed, the link transmission capacity is updated, and then the path searching of the maximum link transmission capacity of the next pair is performed.
When the maximum link transmission capacity of the first pair of source nodes and the destination nodes is searched, the link transmission capacities of two adjacent satellites in the current time slot are calculated. The calculation process comprises the following steps: determining the occupied transmission capacity of each satellite node in the current time slot according to the low orbit satellite network topology of the current time slot; determining the available transmission capacity of each satellite node according to the difference between the transmission capacity of each satellite node and the occupied transmission capacity; the smaller value of the available transmission capacity of each satellite node in the two adjacent satellites is taken as the link transmission capacity of the two adjacent satellites.
Specifically, the occupied transmission capacity includes a capacity occupied by a satellite node when transmitting resources for a user according to a transmission request of the user and a capacity occupied by the satellite node when transmitting data to other satellite nodes. The transmission capacity of each satellite node, i.e. the total available transmission capacity of each satellite node, is assumed to be the same. For two adjacent satellite nodes s i Sum s j The available transmission capacity is C i And C j The method comprises the steps of carrying out a first treatment on the surface of the If s i And s j Can establish a transmission link ij Its link transmission capacity C ij Can be expressed as:
C ij ＝min(C i ,C j )
it should be noted that, in a low-orbit satellite network, not all satellite nodes may establish transmission links, and in general, two satellites in the visible range may dynamically establish an inter-satellite link. Therefore, when calculating the link transmission capacity of two adjacent satellites, it is necessary to determine whether or not a transmission link can be established between the two satellites, and when the transmission link can be established, calculate the link transmission capacity.
And a step a3 of determining the link transmission capacity of each transmission link according to the link transmission capacities of two adjacent satellites, and taking the transmission link with the maximum link transmission capacity as a data transmission path. Wherein the maximum link transmission capacity is selected as the maximum capacity path, and the maximum capacity path is selected C by combining the link transmission capacities of two adjacent satellites LSN Can be expressed as:
wherein C is sd Is from source satellite s s To the destination satellite s d Is used for the transmission of the data in the wireless communication system,for slave source satellites s s To the destination satellite s d All transmission links on the path.
Specifically, when the maximum link transmission capacity is routed, in addition to the link transmission capacity, the distance between nodes is also considered, and the larger the distance between nodes is, the larger the delay is, so that it is necessary to select a path having a large link transmission capacity and a small distance between nodes for transmission. Thus, the maximum link transmission capacity route searching specifically comprises the following steps: traversing each node which can establish a link by adopting an MST algorithm from a source node; calculating the link transmission capacity from the source node to the current node according to the link transmission capacities of two adjacent satellites; calculating a first distance between the current node and the destination node and a second distance between any next-hop node and the destination node; selecting a next hop node according to the relation between the first distance and the second distance; and repeating the steps of calculating the transmission capacity of the link, calculating the first distance and the second distance and comparing the first distance and the second distance until the destination node is reached, and obtaining the transmission path from the source node to the destination node.
The specific description of the MST (Minimum Spanning Tree ) algorithm is as follows: dividing all vertexes in the graph into two sets, namely Known and unown, and optionally selecting one vertex to be placed in Known at first, wherein the rest vertexes are positioned in unown, and the algorithm aims to move all vertexes in unown into Known; selecting an edge, wherein one of two vertexes connected with the edge is positioned in Known, the other vertex is positioned in un-nonwn, and the weight of the edge is the smallest in all edges meeting the condition; adding the edge to the minimum spanning tree, and moving the vertex connected with the edge and located in the Unknown set to Known; repeating the two steps until the Unknown set is empty.
The source node is a vertex initially selected by the MST algorithm, then a time-varying graph model or a current network topology is traversed to determine a node capable of establishing a link with the source node, a plurality of alternative nodes are obtained, the link transmission capacity between the source node and the alternative nodes is determined according to the link transmission capacity of two adjacent satellites calculated in the step a2, the link transmission capacity is ordered from large to small, the alternative node corresponding to the maximum link transmission capacity is selected, then whether the distance between the alternative node and the destination node is smaller than the distance between the source node and the destination node is judged, and if the distance between the alternative node and the destination node is smaller, the next hop node is continuously selected; if the distance between the candidate node and the destination node is smaller than the distance between the source node and the destination node, a new candidate node is continuously selected, and if the distance between the direct candidate node and the destination node is larger than the distance between the source node and the destination node, the candidate node corresponding to the second largest link transmission capacity is selected according to the sequence of the link transmission capacities.
After determining an alternative node with the distance between the alternative node and the destination node being smaller than the distance between the source node and the destination node, the alternative node is used as a current node, and the next hop node is continuously selected; similarly, a time-varying graph model or a current network topology is traversed to determine a node capable of establishing a link with a current node, a plurality of next-hop nodes are obtained, then link transmission capacities of the current node and the next-hop nodes are determined to be ordered, then the next-hop nodes are selected according to an ordering result, a second distance between the selected next-hop nodes and a destination node and a first distance between the current node and the destination node are calculated, and when the second distance is smaller than the first distance, the currently selected next-hop nodes are determined. And then taking the next-hop node as the current node, and continuing to select the next-hop node until the destination node is reached.
The distance between the nodes is calculated by the following formula:
wherein x is i 、y i 、z i And x j 、y j 、z j The position coordinates of the two nodes respectively. The comparison of the first distance and the second distance can ensure that the transmission process is always carried out along the direction from the source node to the destination node. In the foregoing, the maximum link transmission capacity routing is performed by taking the first pair of the source node and the destination node as an example, and when the next pair of the source node and the destination node are performed, it is necessary to recalculate the link transmission capacities of the adjacent two satellites, and then perform the maximum link transmission capacity routing by using the MST algorithm according to the available transmission capacity of each link determined by the link transmission capacities of the adjacent two satellites.
In addition, the source node and the destination node are the source satellite and the destination satellite in fig. 3, that is, the ground satellite station uploads data to the source satellite, the source satellite transmits the data to the destination satellite through the link obtained in the maximum link transmission capacity route searching process, and the destination satellite transmits the data to the ground satellite station. Steps a1 to a3 are maximum link transmission capacity routing for the current slot. When the maximum link transmission capacity of the next time slot is searched, the source satellite and the destination satellite which are communicated with the ground satellite station are changed due to the movement of the satellite, namely, the source node and the destination node are changed, and the maximum link transmission capacity is searched in the next time slot according to the new source node and the destination node in the same mode as the current time slot. After the path searching result of the next time slot is obtained, the next time slot is determined according to the ephemeris data, the maximum link transmission capacity path searching is carried out in the same mode as the next time slot, and the like until the prediction of all time slots is completed.
The network perception data transmission method provided by the invention determines the source node and the destination node of data transmission in each time slot when the maximum link transmission capacity is searched in each time slot, and combines the MST algorithm and the link transmission capacity to search the maximum link transmission capacity between each source node and the destination node, thereby realizing the deployment of the transmission link and the network flow scheduling.
As one or more specific application embodiments of the present invention, as shown in fig. 4, the transmission method of network awareness data is implemented by adopting the following flow:
step one, sensing global state of an LEO satellite transmission network;
collecting the running states of all satellite nodes in the LSN (LEO Satellite networks, LEO satellite network) by utilizing the coverage of the high orbit satellites (Geostationary Satellite, GEO) to the global network, including flight positions, transmission requirements, transmission capacity and the like, and carrying out statistical analysis to realize the global perception of the running states of the LSN; a software defined network (Software Defined Networking, SDN) controller is used to obtain a global view of the network, and the STIN realizes global control over LSN data transmission by controlling forwarding separation logic.
Step two: calculating the capacity of an inter-satellite available transmission link;
if a transmission link can be established between two adjacent satellites, determining the currently available transmission capacity of the link based on the current transmission capacities of the two adjacent satellites and the link capacity occupied by the task that has been performing the transmissionAmount of the components. The satellite collects the transmission requests of the users in the covered region in the flight process and distributes transmission resources for the users. Let the total available transmission resources for each satellite be the same and unchanged, denoted C. For any satellite s i It is noted that after allocating transmission resources for the overlay user, the currently available transmission resources are denoted as C i The method comprises the steps of carrying out a first treatment on the surface of the For any satellite s j It is noted that after allocating transmission resources for the overlay user, the currently available transmission resources are denoted as C j If s i And s j Can establish a transmission link ij Its link available transmission link capacity C ij Can be deduced as:
C ij ＝min(C i ,C j )
step three: establishing a maximum capacity path selection problem;
considering the problems that dense LEO satellite nodes in LSN easily cause low transmission capacity utilization rate and unbalanced network load, for each LSN transmission task, based on global state sensing and transmission link capacity calculation, establishing maximum capacity path selection problem solution, and improving LSN transmission resource utilization rate and load balance performance. Calculating the available transmission link capacity C of each link ij Then, the LSN transmission control problem is converted into a maximum capacity path selection problem C LSN Can be expressed as:
wherein C is sd Is from source satellite s s To the destination satellite s d Is used for the transmission of the data in the wireless communication system,for slave source satellites s s To the destination satellite s d All transmission links on the path. The above problem is established to find the best for each taskAnd the high-capacity transmission path is used for avoiding link congestion caused by the fact that a plurality of tasks are arranged on the same transmission path, and improving the load balancing performance of the network.
Step four: establishing a time-varying graph model to decompose the problem;
since the satellite nodes in LSNs orbit at high speed over time, their network topology constantly changes over time, the maximum capacity path selection problem is dynamic in the time dimension. All satellite nodes in LSN are set as { s } i Arbitrary s i And s j The inter-satellite transmission link between them is set as l ij The link set is set to { l ] ij The network service time is set to T. If { s } i Seen as the vertex of a graph model, { l ij Viewed as edges connecting vertices, LSN may describe its network topology using a time-varying graph model G, and { l } ij And is a function of T, varying with T. And (3) converting the maximum capacity path selection problem into a path finding problem in G by establishing a time-varying graph model G, and dividing the T by time slots to decompose the maximum capacity path selection problem into sequential calculation according to time slots in the time dimension so as to obtain a continuous solution of the maximum capacity path selection problem in time. Let all satellite nodes in LSN be s= { S i Arbitrary s i And s j The inter-satellite transmission link between them is set as l ij The link set is set to l= { L ij The network service time is set to T. If { s } i Seen as the vertex of a graph model, { l ij Viewed as edges connecting vertices, LSN may describe its network topology with a time-varying graph model G, expressed as:
G＝(S,L,T)
where T can be considered as the combination of a series of time slots, i.e., t= { T 1 ,T 2 ,...T k }. At each T k The topology of G is set to remain unchanged. Then both S and L can be regarded as functions of T, as with T k Is varied by a variation of (c) and can be expressed as S (T k )，L(T k ). Further problem C LSN May be represented as C LSN (T k ) I.e. breaking up the continuous path planning problem into formulating each time slotTransmission strategy of each time slot.
Step five: determining a transmission path based on the current topology;
and aiming at the current LSN network state information and the time-varying graph model G, calculating the available transmission capacity of each transmission link in the current topology by adopting the step two, and carrying out maximum link transmission capacity route searching based on an MST algorithm to guide the current transmission link deployment and network flow scheduling. In the current topology G (T k ) From source node s s Initially, the MST algorithm is executed, since the MST algorithm is able to traverse every node { s } that may establish a link from the source node i Each s can thus be calculated i And s s Transmission link capacity C between si A ranking of the available transmission link capacities from large to small is obtained. Then each link is determined in order, if the link is selected for transmission, the node of the next hop and the target node s d The distance between the two nodes is smaller than the distance between the current node and the target node, the link is selected as the next-hop transmission link, otherwise, the node of the next link and the target node s are selected d The distance between them is calculated and compared until selected. The judgment aims to ensure that the transmission process is always carried out along the direction from the source node to the destination node. Wherein the distance between nodes is calculated as:
at the calculation of the first pair of source nodes s s With destination node s d After the transmission path of (c) the current topology G (T k ) All available transmission link capacities C ij And to the next pair of source nodes s s With destination node s d And (5) path planning is carried out until the transmission paths of all the transmission tasks are calculated.
Step six: LSN topology updating and subsequent transmission path calculation;
determining the sustainable time of the current network topology according to the satellite ephemeris data to obtain the ending time of the current time slot, and simultaneouslyAlso the start time of the next time slot, and then determining the network topology of the next time slot according to the start time of the next time slot and the time-varying graph model. The maximum capacity path prediction for the next slot is continued based on the start time of the next slot and the network topology. And so on until the data transfer is complete. Wherein the current topology G (T k ) Duration of transmission link inAnd further calculates the duration of the current topology, i.e. the current time slot T k Can be expressed as:
simultaneous pre-time slot T k The end time of (2) is also the next time slot T k+1 Is a start time of (c). After the determined starting time based on the next time slot, the maximum capacity path prediction of the next time slot may be continued based on the fifth start. And so on until the data transfer is complete.
Step seven: making a LSN maximum link transmission capacity path searching scheme;
and selecting a transmission link of each network topology and calculating a maximum capacity path based on each time slot to obtain a continuous LSN transmission link deployment and network traffic scheduling scheme.
The embodiment also provides a device for transmitting network awareness data, which is used for implementing the foregoing embodiments and preferred embodiments, and is not described in detail. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. While the means described in the following embodiments are preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
The present embodiment provides a network-aware data transmission apparatus, as shown in fig. 5, including:
the data acquisition module 501 is configured to acquire an operation state of all satellite nodes in the low-orbit satellite network and a network service time, where the network service time includes a plurality of timeslots.
The model building module 502 is configured to build a time-varying graph model based on all satellite nodes, links between the satellite nodes, and network service time, where the links are data transmission links between two adjacent satellite nodes.
And a path searching module 503, configured to calculate a link transmission capacity of each transmission link based on the time-varying graph model and the running state, and perform a path searching of the maximum link transmission capacity of each time slot, so as to obtain a data transmission scheme of the low-orbit satellite network, where the transmission link is a data transmission link from the source node to the destination node.
In an alternative embodiment, the model building module is specifically configured to: and constructing a time-varying graph model by taking all satellite nodes as vertexes of the graph model and taking links among the satellite nodes as edges of the vertexes, wherein the vertexes and the edges are functions of network service time.
In an alternative embodiment, the routing module includes: the current topology determining unit is used for obtaining the low orbit satellite network topology of the current time slot according to the time-varying graph model and the running state; the current path searching unit is used for calculating the link transmission capacity according to the low-orbit satellite network topology of the current time slot and carrying out the maximum link transmission capacity path searching of the current time slot; a time slot calculating unit for calculating the duration of the current time slot according to the satellite ephemeris data and determining the starting time of the next time slot; the next topology determining unit is used for obtaining the low orbit satellite network topology of the next time slot according to the starting time of the next time slot and the time-varying graph model; and the next path searching unit calculates the link transmission capacity according to the low-orbit satellite network topology of the next time slot, performs the maximum link transmission capacity path searching of the next time slot, and takes the transmission link corresponding to the maximum link transmission capacity of each time slot as the data transmission scheme of the corresponding time slot of the low-orbit satellite network.
In an alternative embodiment, the current routing unit includes: the node acquisition unit is used for acquiring a source node and a destination node corresponding to a transmission link of data transmission in the current time slot; the adjacent capacity calculation unit is used for calculating the link transmission capacity of two adjacent satellites in the current time slot transmission link according to the low-orbit satellite network topology of the current time slot based on the source node and the destination node; and the searching sub-unit is used for determining the link transmission capacity of each transmission link according to the link transmission capacities of two adjacent satellites, and taking the transmission link with the maximum link transmission capacity as a data transmission path.
In an alternative embodiment, the seek subunit is specifically configured to: traversing each node which can establish a link by adopting an MST algorithm from a source node; calculating the link transmission capacity from the source node to the current node according to the link transmission capacities of two adjacent satellites; calculating a first distance between the current node and the destination node and a second distance between any next-hop node and the destination node; selecting a next hop node according to the relation between the first distance and the second distance; and repeating the steps of calculating the transmission capacity of the link, calculating the first distance and the second distance and comparing the first distance and the second distance until the destination node is reached, and obtaining the transmission path from the source node to the destination node.
In an alternative embodiment, the operational state includes the transmission capabilities of each satellite node; the adjacent capacity calculation unit is specifically configured to: determining the occupied transmission capacity of each satellite node in the current time slot according to the low orbit satellite network topology of the current time slot; determining the available transmission capacity of each satellite node according to the difference between the transmission capacity of each satellite node and the occupied transmission capacity; the smaller value of the available transmission capacity of each satellite node in the two adjacent satellites is taken as the link transmission capacity of the two adjacent satellites.
In an alternative embodiment, the data acquisition module is specifically configured to: and acquiring the running states of all satellite nodes in the low-orbit satellite network by adopting the high-orbit satellite.
The network-aware data transmission means in this embodiment are presented in the form of functional units, where the units refer to ASIC circuits, processors and memories executing one or more software or firmware programs, and/or other devices that can provide the above-described functionality.
Further functional descriptions of the above respective modules and units are the same as those of the above corresponding embodiments, and are not repeated here.
The embodiment of the invention also provides computer equipment, which is provided with the network perception data transmission device shown in the figure 5.
Referring to fig. 6, fig. 6 is a schematic structural diagram of a computer device according to an alternative embodiment of the present invention, as shown in fig. 6, the computer device includes: one or more processors 10, memory 20, and interfaces for connecting the various components, including high-speed interfaces and low-speed interfaces. The various components are communicatively coupled to each other using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions executing within the computer device, including instructions stored in or on memory to display graphical information of the GUI on an external input/output device, such as a display device coupled to the interface. In some alternative embodiments, multiple processors and/or multiple buses may be used, if desired, along with multiple memories and multiple memories. Also, multiple computer devices may be connected, each providing a portion of the necessary operations (e.g., as a server array, a set of blade servers, or a multiprocessor system). One processor 10 is illustrated in fig. 6.
The processor 10 may be a central processor, a network processor, or a combination thereof. The processor 10 may further include a hardware chip, among others. The hardware chip may be an application specific integrated circuit, a programmable logic device, or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general-purpose array logic, or any combination thereof.
Wherein the memory 20 stores instructions executable by the at least one processor 10 to cause the at least one processor 10 to perform a method for implementing the embodiments described above.
The memory 20 may include a storage program area that may store an operating system, at least one application program required for functions, and a storage data area; the storage data area may store data created from the use of the computer device of the presentation of a sort of applet landing page, and the like. In addition, the memory 20 may include high-speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid-state storage device. In some alternative embodiments, memory 20 may optionally include memory located remotely from processor 10, which may be connected to the computer device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
Memory 20 may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as flash memory, hard disk, or solid state disk; the memory 20 may also comprise a combination of the above types of memories.
The computer device also includes a communication interface 30 for the computer device to communicate with other devices or communication networks.
The embodiments of the present invention also provide a computer readable storage medium, and the method according to the embodiments of the present invention described above may be implemented in hardware, firmware, or as a computer code which may be recorded on a storage medium, or as original stored in a remote storage medium or a non-transitory machine readable storage medium downloaded through a network and to be stored in a local storage medium, so that the method described herein may be stored on such software process on a storage medium using a general purpose computer, a special purpose processor, or programmable or special purpose hardware. The storage medium can be a magnetic disk, an optical disk, a read-only memory, a random access memory, a flash memory, a hard disk, a solid state disk or the like; further, the storage medium may also comprise a combination of memories of the kind described above. It will be appreciated that a computer, processor, microprocessor controller or programmable hardware includes a storage element that can store or receive software or computer code that, when accessed and executed by the computer, processor or hardware, implements the methods illustrated by the above embodiments.
Although embodiments of the present invention have been described in connection with the accompanying drawings, various modifications and variations may be made by those skilled in the art without departing from the spirit and scope of the invention, and such modifications and variations fall within the scope of the invention as defined by the appended claims.

Claims (10)

1. A method for transmitting network-aware data, the method comprising:
acquiring the running states and network service time of all satellite nodes in a low-orbit satellite network, wherein the network service time comprises a plurality of time slots;
constructing a time-varying graph model based on all satellite nodes, links among the satellite nodes and the network service time, wherein the links are data transmission links between two adjacent satellite nodes;
and calculating the link transmission capacity of each transmission link based on the time-varying graph model and the running state, and carrying out maximum link transmission capacity route searching of each time slot to obtain a data transmission scheme of the low-orbit satellite network, wherein the transmission links are data transmission links from a source node to a destination node.
2. The method of claim 1, wherein constructing a time-varying graph model based on all satellite nodes, links between satellite nodes, and the network service time comprises:
And constructing a time-varying graph model by taking all satellite nodes as vertexes of the graph model and taking links among the satellite nodes as edges of the vertexes, wherein the vertexes and the edges are functions of the network service time.
3. The method of claim 1, wherein calculating a link transmission capacity of each transmission link based on the time-varying map model and the operating state, and performing a maximum link transmission capacity seek for each time slot, results in a data transmission scheme for the low-orbit satellite network, comprising:
acquiring a low-orbit satellite network topology of a current time slot according to the time-varying diagram model and the running state;
calculating the link transmission capacity according to the low orbit satellite network topology of the current time slot, and carrying out the maximum link transmission capacity route searching of the current time slot;
calculating the duration of the current time slot according to the satellite ephemeris data, and determining the starting time of the next time slot;
acquiring the low orbit satellite network topology of the next time slot according to the starting time of the next time slot and the time-varying graph model;
and calculating the link transmission capacity according to the low-orbit satellite network topology of the next time slot, carrying out the maximum link transmission capacity route searching of the next time slot, and taking the transmission link corresponding to the maximum link transmission capacity of each time slot as the data transmission scheme of the corresponding time slot of the low-orbit satellite network.
4. A method according to claim 3, wherein calculating the link transmission capacity based on the low-orbit satellite network topology of the current time slot, and wherein routing the maximum link transmission capacity of the current time slot comprises:
acquiring a source node and a destination node corresponding to a transmission link of data transmission in a current time slot according to a low orbit satellite topology network of the current time slot;
calculating the link transmission capacity of two adjacent satellites in the current time slot transmission link according to the low-orbit satellite network topology of the current time slot based on the source node and the destination node;
and determining the link transmission capacity of each transmission link according to the link transmission capacities of two adjacent satellites, and taking the transmission link with the maximum link transmission capacity as a data transmission path.
5. The method according to claim 4, wherein determining the link transmission capacity of each link based on the link transmission capacities of the adjacent two satellites, and taking the transmission link with the largest link transmission capacity as the data transmission path, comprises:
traversing each node which can establish a link by adopting an MST algorithm from a source node;
calculating the link transmission capacity from the source node to the current node according to the link transmission capacities of the two adjacent satellites;
Calculating a first distance between the current node and the destination node and a second distance between any next-hop node and the destination node;
selecting a next hop node according to the relation between the first distance and the second distance;
and repeating the steps of calculating the transmission capacity of the link, calculating the first distance and the second distance and comparing the first distance and the second distance until the destination node is reached, and obtaining the transmission path from the source node to the destination node.
6. The method of claim 4, wherein the operational state comprises a transmission capability of each satellite node;
calculating the link transmission capacity of two adjacent satellites in the current time slot according to the low orbit satellite network topology of the current time slot, comprising:
determining the occupied transmission capacity of each satellite node in the current time slot according to the low orbit satellite network topology of the current time slot;
determining the available transmission capacity of each satellite node according to the difference between the transmission capacity of each satellite node and the occupied transmission capacity;
the smaller value of the available transmission capacity of each satellite node in the two adjacent satellites is taken as the link transmission capacity of the two adjacent satellites.
7. The method of claim 1, wherein acquiring operational status of all satellite nodes in the low-orbit satellite network comprises: and acquiring the running states of all satellite nodes in the low-orbit satellite network by adopting the high-orbit satellite.
8. A network-aware data transmission apparatus, the apparatus comprising:
the system comprises a data acquisition module, a network service module and a data processing module, wherein the data acquisition module is used for acquiring the running states of all satellite nodes in a low-orbit satellite network and network service time, and the network service time comprises a plurality of time slots;
the model construction module is used for constructing a time-varying graph model based on all satellite nodes, links among the satellite nodes and the network service time, wherein the links are data transmission links between two adjacent satellite nodes;
and the path searching module is used for calculating the link transmission capacity of each transmission link based on the time-varying graph model and the running state, and carrying out maximum link transmission capacity path searching of each time slot to obtain the data transmission scheme of the low-orbit satellite network, wherein the transmission link is a data transmission link from a source node to a destination node.
9. A computer device, comprising:
a memory and a processor, the memory and the processor being communicatively connected to each other, the memory having stored therein computer instructions, the processor executing the computer instructions to perform the network aware data transmission method of any of claims 1 to 7.
10. A computer-readable storage medium, wherein computer instructions for causing a computer to perform the network-aware data transmission method of any one of claims 1 to 7 are stored on the computer-readable storage medium.
CN202310506650.2A 2023-05-06 2023-05-06 Network perception data transmission method and device, computer equipment and storage medium Pending CN116470955A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310506650.2A CN116470955A (en) 2023-05-06 2023-05-06 Network perception data transmission method and device, computer equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310506650.2A CN116470955A (en) 2023-05-06 2023-05-06 Network perception data transmission method and device, computer equipment and storage medium

Publications (1)

Publication Number Publication Date
CN116470955A true CN116470955A (en) 2023-07-21

Family

ID=87184281

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310506650.2A Pending CN116470955A (en) 2023-05-06 2023-05-06 Network perception data transmission method and device, computer equipment and storage medium

Country Status (1)

Country Link
CN (1) CN116470955A (en)

Similar Documents

Publication Publication Date Title
CN109005108B (en) Space network route planning method and system
CN103118439B (en) based on the data fusion method of sensor network node universal middleware
CN110579214B (en) Unmanned aerial vehicle path planning method and device
US11861407B2 (en) Method for managing computing capacities in a network with mobile participants
CN110417588B (en) Aviation dynamic network path planning method based on alliance game
Martinez et al. Scalable design and dimensioning of fog-computing infrastructure to support latency-sensitive IoT applications
CN113141622B (en) Distributed route management method for ultra-large-scale low-orbit satellite constellation
CN105491584A (en) Mobile application specific networks
US9853887B2 (en) Information transfer device, delay tolerant network, information transmission method, and recording medium
Ma et al. Satellite-terrestrial integrated 6G: An ultra-dense LEO networking management architecture
CN114158106A (en) Distributed routing method, device and storage medium for satellite network
Zheng et al. LEO laser microwave hybrid inter-satellite routing strategy based on modified Q-routing algorithm
CN112181665A (en) Task optimization method and device for low-earth-orbit satellite
CN111431950B (en) Task unloading method and device, mobile terminal, fog node and storage medium
CN117111635A (en) Unmanned aerial vehicle cluster management system and control method thereof
CN116470955A (en) Network perception data transmission method and device, computer equipment and storage medium
Say et al. Cooperative path selection framework for effective data gathering in UAV-aided wireless sensor networks
KR101800133B1 (en) Path selection method for relay node in disjoint networks
Zhou et al. Intelligent Multi-Objective Routing for Future Ultra-Dense LEO Satellite Networks
CN117279066A (en) Satellite network routing method and communication device
Senturk et al. Mobile data collection in smart city applications: the impact of precedence-based route planning on data latency
Cao et al. Network-wide task offloading with leo satellites: A computation and transmission fusion approach
Walter et al. Dynamic discovery of ground stations in ring road networks
Cumino et al. Flying Mobile Edge Computing towards 5G and beyond: An Overview on current use cases and challenges
Xu et al. Enabling Streaming Analytics in Satellite Edge Computing via Timely Evaluation of Big Data Queries

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