技术领域Technical field
本发明总的来说涉及星间网络信息传输技术领域。具体而言，本发明涉及一种用于全球组网观测卫星星座的星间网络优化方法。The present invention generally relates to the technical field of inter-satellite network information transmission. Specifically, the present invention relates to an inter-satellite network optimization method for global network observation satellite constellations.
背景技术Background technique
全球组网观测卫星星座一般由多个轨道面组成，每个轨道面均匀分布多颗卫星。所述星座的卫星之间通过星间链路传输信息，所述星间链路是双向链路，可以双向传输信息。每颗卫星拥有四条星间链路，包括两条轨道面内的长期星间链路，其与轨道面内相邻的两颗卫星保持持续的通联；以及两条轨道面间的星间链路，其根据具体的可见关系与东向以及及西向相邻轨道面的卫星根据通联关系依次建立星间链路，在不同时段的星间链路维持时间也有所不同。Global network observation satellite constellations generally consist of multiple orbital planes, with multiple satellites evenly distributed in each orbital plane. The satellites in the constellation transmit information through inter-satellite links. The inter-satellite links are bidirectional links and can transmit information in both directions. Each satellite has four inter-satellite links, including two long-term inter-satellite links in the orbital plane, which maintain continuous communication with the two adjacent satellites in the orbital plane; and an inter-satellite link between the two orbital planes , which establishes inter-satellite links in sequence based on specific visible relationships with satellites in eastward and westward adjacent orbital planes based on communication relationships. The maintenance time of inter-satellite links in different periods is also different.
全球组网观测卫星星座需要在任意时间保证全网任意卫星之间的的信息传输。现有技术中在进行信息传输的过程中通常使用基于单一策略的方法，例如LHP(Least HopsPath最小跳数路径)方法，存在信息传输集中于少数甚至单一的星间链路上造成链路拥塞的问题。The global network observation satellite constellation needs to ensure information transmission between any satellites in the entire network at any time. In the prior art, methods based on a single strategy are usually used in the process of information transmission, such as the LHP (Least HopsPath path) method. There is a problem that information transmission is concentrated on a few or even a single inter-satellite link, causing link congestion. question.
发明内容Contents of the invention
为至少部分解决现有技术中全球组网观测卫星星座在进行信息传输时信息传输集中于少数甚至单一的星间链路上造成的链路拥塞问题，本发明提出一种用于全球组网观测卫星星座的星间网络优化方法，包括：In order to at least partially solve the link congestion problem caused by information transmission being concentrated on a small number or even a single inter-satellite link in the global network observation satellite constellation in the prior art, the present invention proposes a method for global network observation Inter-satellite network optimization methods for satellite constellations include:
构造星间网络，所述星间网络用于表示全球组网观测卫星星座的星间信息传输；Construct an inter-satellite network, which is used to represent the inter-satellite information transmission of the global network observation satellite constellation;
构造星间网络优化问题，所述星间网络优化问题用于优化星间网络时延以及优化星间网络流量负载；以及Constructing an inter-satellite network optimization problem, which is used to optimize inter-satellite network delay and optimize inter-satellite network traffic load; and
基于负载加权的Dijkstra方法求解所述星间网络优化问题。The load-weighted Dijkstra method is used to solve the inter-satellite network optimization problem.
在本发明一个实施例中规定，构造星间网络包括下列步骤：In one embodiment of the present invention, it is specified that constructing an inter-satellite network includes the following steps:
将星间网络的连接关系表示为卫星节点sat以及卫星节点之间的边e；Express the connection relationship of the inter-satellite network as satellite nodes sat and edges e between satellite nodes;
将星间网络的星间链路的连通性表示为星间链路可连通矩阵A＝{aij}，其中aij表示卫星节点sati和satj之间的星间链路连通关系；以及Express the connectivity of the inter-satellite link of the inter-satellite network as the inter-satellite link connectability matrix A={aij }, where aij represents the inter-satellite link connectivity relationship between satellite nodes sati and satj ; and
将卫星之间的信息传输路径表示为所述信息从源卫星节点sato传输至目的卫星节点satd经过的边Path(o，d)，如下式所示：The information transmission path between satellites is expressed as the edge Path(o, d) through which the information is transmitted from the source satellite node sato to the destination satellite node satd , as shown in the following formula:
Path(o，d)＝{e1，e2，...，eT}Path (o, d)={e1 , e2 ,..., eT }
其中，eT表示从源卫星节点sato传输至目的卫星节点satd经过的第T条边。Among them, eT represents the T-th edge transmitted from the source satellite node sato to the destination satellite node satd .
在本发明一个实施例中规定，根据卫星节点sati和sati之间的星间传输距离Lij确定所述卫星节点sati和satj之间的星间链路连通关系aij，表示为下式：In one embodiment of the present invention, it is stipulated that the inter-satellite link connectivity relationshipa ij between the satellite nodes sati and satj is determined based on the inter-satellite transmission distance Lij between the satellite nodes sati and sati , expressed as The following formula:
其中，Lmin，Lmax分别表示星间网络的卫星节点之间的最小星间传输距离和最大星间传输距离。Among them, Lmin and Lmax respectively represent the minimum inter-satellite transmission distance and the maximum inter-satellite transmission distance between satellite nodes of the inter-satellite network.
在本发明一个实施例中规定，通过路径包括函数确定所述边是否包括在路径中，表示为下式：In one embodiment of the present invention, it is provided that the path includes the function Determine whether the edge is included in the path, expressed as:
在本发明一个实施例中规定，最小星间传输距离Lmin根据卫星的观测能力确定；以及In one embodiment of the present invention, it is stipulated that the minimum inter-satellite transmission distance Lmin is determined according to the observation capability of the satellite; and
最大星间传输距离Lmax根据下式计算：The maximum inter-satellite transmission distance Lmax is calculated according to the following formula:
Lmax＝2×(Hs+Re)×sin(θISL/2)Lmax =2×(Hs +Re )×sin(θISL /2)
其中，Hs表示卫星的高度，Re表示地球的半径，θISL表示最大通信地心角表示为θISL。Among them, Hs represents the height of the satellite,Re represents the radius of the earth, and θISL represents the maximum communication geocentric angle expressed as θISL .
在本发明一个实施例中规定，将对于星间网络的时延优化构造为第一优化问题，所述第一优化问题表示为下式：In one embodiment of the present invention, it is stipulated that the delay optimization for the inter-satellite network is constructed as a first optimization problem, and the first optimization problem is expressed as the following formula:
其中，f(delay)表示时延优化目标函数，ws表示第s条信息的传输时延权重，表示第s条信息的传输路径所选择的第k条边以及C表示光速；以及Among them, f(delay) represents the delay optimization objective function, ws represents the transmission delay weight of the sth piece of information, Represents the k-th edge selected for the transmission path of the s-th information and C represents the speed of light; and
将对于星间网络的流量负载优化构造为第二优化问题，所述第二优化问题表示为下式：The traffic load optimization of the inter-satellite network is constructed as a second optimization problem, and the second optimization problem is expressed as the following formula:
其中，f(debit)表示流量优化目标函数，wdebits表示第s条信息的传输流量权重，Debits表示第s条信息的传输流量，表示ek确认是否在传输路径上的判断函数。Among them, f (debit) represents the traffic optimization objective function, wdebits represents the transmission traffic weight of the sth piece of information, and Debits represents the transmission traffic of the sth piece of information. Indicates the judgment function to confirm whether ek is on the transmission path.
在本发明一个实施例中规定，基于负载加权的Dijkstra方法求解所述星间网络优化问题包括下列步骤：In one embodiment of the present invention, it is stipulated that solving the inter-satellite network optimization problem based on the load-weighted Dijkstra method includes the following steps:
确定星间网络的星间链路可连通矩阵；Determine the inter-satellite link connectability matrix of the inter-satellite network;
对待传输信息进行优先级排序；Prioritize information to be transmitted;
确定星间链路的最大负载；以及Determine the maximum load on the inter-satellite link; and
基于Dijkstra方法计算信息的传输路径，包括下列步骤：Calculating the transmission path of information based on the Dijkstra method includes the following steps:
计算传输路径加权矩阵，所述传输路径加权矩阵包括星间链路的Dijkstra权重，其中第一次计算时，根据每条星间链路的传输路径长度，计算其传输时延作为每条星间链路的Dijkstra权重；Calculate the transmission path weighting matrix. The transmission path weighting matrix includes the Dijkstra weight of the inter-satellite link. In the first calculation, according to the transmission path length of each inter-satellite link, the transmission delay is calculated as each inter-satellite link. Dijkstra weight of the link;
对最高优先级的信息进行Dijkstra的最短路径计算，生成Dijkstra最短传输路径；Perform Dijkstra's shortest path calculation on the highest priority information to generate Dijkstra's shortest transmission path;
计算所述Dijkstra最短传输路径上每条星间链路的负载；Calculate the load of each inter-satellite link on the Dijkstra shortest transmission path;
根据所述最大负载计算是否存在星间链路超过最大负载，当存在时排除超过最大负载的星间链路，重新进行Dijkstra计算；当不存在时，根据每条星间链路已经累加的负载生成新的Dijkstra权重，更新传输路径加权矩阵；以及Calculate whether there is an inter-satellite link that exceeds the maximum load based on the maximum load. If there is an inter-satellite link that exceeds the maximum load, exclude the inter-satellite link that exceeds the maximum load and perform the Dijkstra calculation again. If it does not exist, calculate the accumulated load of each inter-satellite link based on the maximum load. Generate new Dijkstra weights and update the transmission path weighting matrix; and
根据优先级从高到低重复上述基于Dijkstra方法计算信息的传输路径的步骤。Repeat the above steps of calculating the transmission path of information based on the Dijkstra method from high to low according to the priority.
在本发明一个实施例中规定，根据待传输信息的任务类型以及数据类型对待传输信息进行优先级排序。In one embodiment of the present invention, it is specified that the information to be transmitted is prioritized according to the task type and data type of the information to be transmitted.
在本发明一个实施例中规定，根据待传输信息的数据量计算每种类型的待传输信息的总和，并且确定星间链路的最大负载，所述最大负载包括2/3带宽或者1/2带宽。In one embodiment of the present invention, it is stipulated that the sum of each type of information to be transmitted is calculated according to the data amount of the information to be transmitted, and the maximum load of the inter-satellite link is determined, and the maximum load includes 2/3 of the bandwidth or 1/2 bandwidth.
本发明至少具有如下有益效果：通过本发明方法对优先级高的信息采取时延较低的传输策略传输，在不超过最大时延要求的情况下，分散高负载的链路流量，低优先级采用较高时延链路传输，实现流量均衡。相比现有技术中基于单一策略的信息传输方法，本发明方法优化了星间链路的平均传输时延，保证了重要信息的高时效发送。并且可以有效地使得单条链路上的流量可以通过多路径传输以实现负载均衡，避免了网络中的链路拥塞，获得了较好的链路均衡的效果。The present invention at least has the following beneficial effects: through the method of the present invention, high-priority information is transmitted using a transmission strategy with low delay, and high-load link traffic is dispersed without exceeding the maximum delay requirement. Use higher-latency link transmission to achieve traffic balance. Compared with the information transmission method based on a single strategy in the prior art, the method of the present invention optimizes the average transmission delay of the inter-satellite link and ensures the timely transmission of important information. And it can effectively enable the traffic on a single link to be transmitted through multiple paths to achieve load balancing, avoid link congestion in the network, and achieve better link balancing effects.
附图说明Description of the drawings
为进一步阐明本发明的各实施例中具有的及其它的优点和特征，将参考附图来呈现本发明的各实施例的更具体的描述。可以理解，这些附图只描绘本发明的典型实施例，因此将不被认为是对其范围的限制。在附图中，为了清楚明了，相同或相应的部件将用相同或类似的标记表示。To further elucidate the advantages and features of various embodiments of the invention, a more specific description of the embodiments of the invention will be presented with reference to the accompanying drawings. It will be understood that the drawings depict only typical embodiments of the invention and are therefore not to be considered limiting of its scope. In the drawings, the same or corresponding parts will be labeled with the same or similar reference numerals, for purposes of clarity and clarity.
图1示出了本发明一个实施例中全球组网观测卫星星座的网络拓扑示意图。Figure 1 shows a schematic network topology diagram of a global network observation satellite constellation in one embodiment of the present invention.
图2示出了本发明一个实施例中基于负载加权的Dijkstra方法求解星间网络优化问题的流程图。Figure 2 shows a flow chart for solving the inter-satellite network optimization problem using the Dijkstra method based on load weighting in one embodiment of the present invention.
图3示出了本发明一个实施例中星间网络的传输时延分布示意图。Figure 3 shows a schematic diagram of the transmission delay distribution of the inter-satellite network in one embodiment of the present invention.
图4示出了本发明一个实施例中与现有技术之间的星间链路负载对比示意图。Figure 4 shows a schematic diagram of the inter-satellite link load comparison between one embodiment of the present invention and the existing technology.
图5示出了本发明一个实施例中计算星间网络的最大星间传输距离的原理示意图。Figure 5 shows a schematic diagram of the principle of calculating the maximum inter-satellite transmission distance of the inter-satellite network in one embodiment of the present invention.
具体实施方式Detailed ways
应当指出，各附图中的各组件可能为了图解说明而被夸大地示出，而不一定是比例正确的。在各附图中，给相同或功能相同的组件配备了相同的附图标记。It should be noted that components in the various figures may be exaggerated for illustration and are not necessarily proportionally correct. In the various figures, identical or functionally identical components are assigned the same reference numerals.
在本发明中，除非特别指出，“布置在…上”、“布置在…上方”以及“布置在…之上”并未排除二者之间存在中间物的情况。此外，“布置在…上或上方”仅仅表示两个部件之间的相对位置关系，而在一定情况下、如在颠倒产品方向后，也可以转换为“布置在…下或下方”，反之亦然。In the present invention, unless otherwise specified, “arranged on,” “arranged on,” and “arranged on” do not exclude the presence of intermediates between the two. In addition, "arranged on or above" only indicates the relative positional relationship between the two components. Under certain circumstances, such as after reversing the product direction, it can also be converted to "arranged on or below", and vice versa. Of course.
在本发明中，各实施例仅仅旨在说明本发明的方案，而不应被理解为限制性的。In the present invention, each embodiment is only intended to illustrate the solution of the present invention and should not be construed as limiting.
在本发明中，除非特别指出，量词“一个”、“一”并未排除多个元素的场景。In the present invention, unless otherwise specified, the quantifiers "a" and "一" do not exclude the scenario of multiple elements.
在此还应当指出，在本发明的实施例中，为清楚、简单起见，可能示出了仅仅一部分部件或组件，但是本领域的普通技术人员能够理解，在本发明的教导下，可根据具体场景需要添加所需的部件或组件。另外，除非另行说明，本发明的不同实施例中的特征可以相互组合。例如，可以用第二实施例中的某特征替换第一实施例中相对应或功能相同或相似的特征，所得到的实施例同样落入本申请的公开范围或记载范围。It should also be noted here that in the embodiments of the present invention, for the sake of clarity and simplicity, only some parts or assemblies may be shown, but those of ordinary skill in the art can understand that under the teachings of the present invention, they may be modified according to specific The scene needs to add the required parts or components. In addition, features of different embodiments of the invention may be combined with each other unless stated otherwise. For example, a certain feature in the second embodiment can be used to replace a corresponding feature in the first embodiment or a feature with the same or similar function, and the resulting embodiment also falls within the disclosure scope or recording scope of the present application.
在此还应当指出，在本发明的范围内，“相同”、“相等”、“等于”等措辞并不意味着二者数值绝对相等，而是允许一定的合理误差，也就是说，所述措辞也涵盖了“基本上相同”、“基本上相等”、“基本上等于”。以此类推，在本发明中，表方向的术语“垂直于”、“平行于”等等同样涵盖了“基本上垂直于”、“基本上平行于”的含义。It should also be noted here that within the scope of the present invention, terms such as "the same", "equal", and "equal to" do not mean that the two values are absolutely equal, but allow a certain reasonable error. That is to say, the The wording also covers "substantially the same", "substantially equal", and "substantially equal to". By analogy, in the present invention, the terms "perpendicular to", "parallel to", etc. indicating directions also include the meanings of "substantially perpendicular to" and "substantially parallel to".
另外，本发明的各方法的步骤的编号并未限定所述方法步骤的执行顺序。除非特别指出，各方法步骤可以以不同顺序执行。In addition, the numbering of the steps of each method of the present invention does not limit the execution order of the method steps. Unless otherwise stated, method steps may be performed in a different order.
下面结合具体实施方式参考附图进一步阐述本发明。The present invention will be further described below in conjunction with specific embodiments and with reference to the accompanying drawings.
首先需要对全球组网观测卫星星座网络进行数学建模。以第一星座为例，如图1所示，所述第一星座包括固定的四个轨道面，所述轨道面倾角相同，升交点赤经在赤道均匀分布，轨道高度相同，轨道周期一致，轨道面内的卫星也采取均匀分布。每个轨道面上均匀分布8颗卫星，将每颗卫星分别编号，其中轨道面1编号包括sat11-sat18，轨道面2编号从sat21-sat28，轨道面3编号从sat31-sat38以及轨道面4编号从sat41-sat48。First, it is necessary to mathematically model the global observation satellite constellation network. Taking the first constellation as an example, as shown in Figure 1, the first constellation includes four fixed orbital planes with the same inclination angle, the right ascension of the ascending node is evenly distributed at the equator, the orbital height is the same, and the orbital period is consistent. The satellites within the orbital plane are also evenly distributed. There are 8 satellites evenly distributed on each orbital plane, and each satellite is numbered separately. Orbital plane 1 is numbered from sat11-sat18, orbital plane 2 is numbered from sat21-sat28, orbital plane 3 is numbered from sat31-sat38, and orbital plane 4 is numbered. From sat41-sat48.
星座网络的连接关系可以表示为G＝{S，E}，其中S＝{sat1，sat2，...，sat32}表示卫星节点，E＝{sati，satj}表示相邻卫星节点之间的边。S＝{sat1，sat2，...，sat32}中，{sat1，sat2，...，sat8}对应轨道面1的卫星sat11-sat18，{sat9，sat10，...，sat16}对应轨道面2的卫星sat21-sat28，{sat17，sat18，...，sat24}对应轨道面3的卫星sat31-sat38，{sat25，sat26，...，sat32}对应轨道面4的卫星sat41-sa48。The connection relationship of the constellation network can be expressed as G={S, E}, where S={sat1 , sat2 ,..., sat32 } represents the satellite node, and E={sati , satj } represents the adjacent satellite Edges between nodes. In S={sat1 , sat2 ,..., sat32 }, {sat1 , sat2 ,..., sat8 } corresponds to the satellites sat11-sat18, {sat9 , sat10 , in orbital plane 1. .., sat16 } corresponds to the satellites sat21-sat28 in orbital plane 2, {sat17 , sat18 ,..., sat24 } corresponds to the satellites sat31-sat38 in orbital plane 3, {sat25 , sat26 ,... , sat32 } corresponding to the satellites sat41-sa48 in orbital plane 4.
卫星之间星间链路的连通性可以表示为卫星节点sati和satj之间的星间链路可连通矩阵A＝{aij}。The connectivity of inter-satellite links between satellites can be expressed as the inter-satellite link connectability matrix A={aij } between satellite nodes sati and satj .
可以根据卫星节点sati和satj之间的星间传输距离Lij确定卫星节点sati和satj之间的星间链路连通关系aij，表示为下式：The inter-satellite link connectivity relationship aij between satellite nodes sati and satj can be determined based on the inter-satellite transmission distance Lij between satellite nodes sati and satj , which is expressed as the following formula:
其中，Lmin，Lmax分别表示星座网络的卫星节点之间的最小星间传输距离以及最大星间传输距离。Among them, Lmin and Lmax respectively represent the minimum inter-satellite transmission distance and the maximum inter-satellite transmission distance between satellite nodes of the constellation network.
最小星间传输距离Lmin受到卫星的卫星天线指向角度的影响，可以根据卫星自身的观测能力设置。The minimum inter-satellite transmission distance Lmin is affected by the pointing angle of the satellite's satellite antenna and can be set according to the satellite's own observation capabilities.
最大星间传输距离Lmax的计算可以如图5所示，将星座网络中相距最远的两颗卫星设置为与地心相距同样的距离，将卫星的高度表示为Hs，将地球的半径表示为Re，将两颗相聚最远卫星之间的最大通信地心角表示为θISL，并且将最大星间传输距离Lmax的计算可以表示为下式：The maximum inter-satellite transmission distance Lmax can be calculated as shown in Figure 5. The two furthest satellites in the constellation network are set to the same distance from the center of the earth. The height of the satellite is expressed as Hs . The radius of the earth is Expressed as Re , the maximum communication geocentric angle between the two farthest satellites is expressed as θISL , and the calculation of the maximum inter-satellite transmission distance Lmax can be expressed as the following formula:
Lmax＝2×(Hs+Re)×sin(θISL/2)Lmax =2×(Hs +Re )×sin(θISL /2)
通过确定各卫星之间的星间链路联通关系，可以将星间链路可连通矩阵A表示为下式：By determining the inter-satellite link connectivity relationship between satellites, the inter-satellite link connectivity matrix A can be expressed as the following formula:
卫星之间的信息传输路径包括所述信息从源卫星节点传输至目的卫星节点需要经过的边，表示为下式：The information transmission path between satellites includes the edges that the information needs to pass through from the source satellite node to the destination satellite node, and is expressed as the following formula:
Path(o，d)＝{e1，e2，...，eT}Path (o, d)={e1 , e2 ,..., eT }
eT表示从源卫星节点传输至目的卫星节点经过的第T条边。eT represents the T-th edge transmitted from the source satellite node to the destination satellite node.
可以通过路径包括函数确定某条边是否包括在路径中，所述路径包括函数可以表示为下式：Functions can be included via path To determine whether an edge is included in a path, the path inclusion function can be expressed as the following formula:
若链路在传输路径中，则取值为1。If the link is in the transmission path, then The value is 1.
为解决现有技术中进行信息传输时的链路拥塞问题，本发明方法提出在信息传输过程中对信息传输路径进行优化，对优先级高的信息采取时延较低的链路传输，在不超过最大时延要求的情况下，分散高负载的链路流量，低优先级采用较高时延链路传输，实现流量均衡。In order to solve the link congestion problem during information transmission in the prior art, the method of the present invention proposes to optimize the information transmission path during the information transmission process, and adopt a link transmission with a lower delay for high-priority information. When the maximum delay requirement is exceeded, high-load link traffic is dispersed, and low-priority links are transmitted using higher delay links to achieve traffic balancing.
可以将信息传输路径的优化目标表示为优化目标函数，所述优化目标函数表示为：The optimization objective of the information transmission path can be expressed as an optimization objective function, and the optimization objective function is expressed as:
第一目标函数：First objective function:
其中，f(delay)表示时延优化目标函数，ws表示第s条信息的传输时延权重，表示第s条信息的传输路径所选择的第k条边以及C表示光速，第一目标函数的优化目标式为时延最小。Among them, f(delay) represents the delay optimization objective function, ws represents the transmission delay weight of the sth piece of information, The k-th edge represents the transmission path of the s-th information and C represents the speed of light. The optimization objective of the first objective function is to minimize the time delay.
以及第二目标函数：And the second objective function:
其中，f(debit)表示流量优化目标函数，wdebits表示第s条信息的传输流量权重，Debits表示第s条信息的传输流量，表示ek确认是否在传输路径上的判断函数。第二目标函数优化的目标是确定链路ek上的最大负载的最小值。Among them, f (debit) represents the traffic optimization objective function, wdebits represents the transmission traffic weight of the sth piece of information, and Debits represents the transmission traffic of the sth piece of information. Indicates the judgment function to confirm whether ek is on the transmission path. The goal of the second objective function optimization is to determine the minimum value of the maximum load on link ek .
如图2所示，可以通过基于负载加权的Dijkstra方法来求解信息传输路径的优化过程，求解过程包括下列步骤：As shown in Figure 2, the optimization process of the information transmission path can be solved through the Dijkstra method based on load weighting. The solution process includes the following steps:
步骤一、根据全球组网观测卫星星座的卫星之间的星间传输距离计算节点之间的连通关系，形成连通矩阵。同步对所有待传输信息根据任务及数据类型进行优先级排序。根据初始每类信息的数据量计算其总和，制定单条链路的最大负载，如2/3带宽或者1/2带宽。Step 1: Calculate the connectivity relationship between nodes based on the inter-satellite transmission distance between satellites in the global network observation satellite constellation, and form a connectivity matrix. Synchronously prioritize all information to be transmitted according to tasks and data types. Calculate the sum based on the initial data volume of each type of information, and set the maximum load of a single link, such as 2/3 bandwidth or 1/2 bandwidth.
步骤二、计算传输路径的加权矩阵，第一次计算时，根据每条链路的传输路径长度，计算其传输时延作为每条链路的权重。Step 2: Calculate the weighting matrix of the transmission path. In the first calculation, according to the transmission path length of each link, calculate its transmission delay as the weight of each link.
步骤三、将最高优先级的信息进行Dijkstra的最短路径计算，生成最短的传输路径。Step 3: Perform Dijkstra's shortest path calculation on the highest priority information to generate the shortest transmission path.
步骤四、计算传输路径上每条链路的负载。Step 4: Calculate the load of each link on the transmission path.
步骤五、根据预期负载，计算是否有链路超过最大负载，如有则排除超过最大负载的链路，重新进行Dijkstra计算。如未超过，则根据每条链路已经累加的负载生成新的加权值，更新传输路径加权矩阵。Step 5: Based on the expected load, calculate whether any link exceeds the maximum load. If so, exclude links that exceed the maximum load and re-calculate Dijkstra. If it does not exceed, a new weighting value is generated based on the accumulated load of each link, and the transmission path weighting matrix is updated.
步骤六、按照优先级依次重复步骤二到步骤五，直到计算结束。Step 6: Repeat steps 2 to 5 in order of priority until the calculation is completed.
本发明方法在信息传输开始是针对传输负载综合进行负载目标的初始化。然后对传输信息进行优先级排序，从高优先级目标开始传输，通过Dijktra方法求解最低时延的路径。路径确定后，计算优先传输的对链路产生的负载，作为权重加入到传输路径中，从而将负载作为代价放入低优先等级的信息路径选择中去，并以期望负载为约束，约束单一路径的最大复杂值。At the beginning of information transmission, the method of the present invention comprehensively initializes the load target for the transmission load. Then the transmission information is prioritized, starting from the high-priority target, and the path with the lowest delay is solved through the Dijktra method. After the path is determined, the load generated by the priority transmission link is calculated and added to the transmission path as a weight, thereby placing the load as a cost in the selection of low-priority information paths, and using the expected load as a constraint to constrain a single path. the maximum complexity value.
在本发明方法的一个实施例中进行仿真分析，输入信息的类型、长度以及优先级，如表1所示：In one embodiment of the method of the present invention, simulation analysis is performed, and the type, length and priority of the input information are entered, as shown in Table 1:
表1Table 1
其中，信息长度与卫星的数量以及目标的数量有关，仿真时需要乘以数量。信息优先级中，数值越高的信息类型的优先级越高。采用全网的信息发送端随机分布，信息接收端设置为最短路径五跳内的节点进行仿真，设置目标数量为55个进行仿真分析。链路的最大传输速率10Mbps。Among them, the information length is related to the number of satellites and targets, and needs to be multiplied by the number during simulation. In the information priority, the information type with higher value has higher priority. The information sending end of the entire network is randomly distributed, the information receiving end is set to the nodes within five hops of the shortest path for simulation, and the target number is set to 55 for simulation analysis. The maximum transmission rate of the link is 10Mbps.
通过本发明方法来求解上述信息的传输时延，求解结果如图3所示。图3中，x轴与y轴的坐标表示卫星的编号，z轴的坐标表示由编号x的卫星到编号y的卫星在T0时刻经过本发明方法优化后的传输最小时延。图中间的对角线是表示卫星到自己的时延，所以取值都为零。由于假设全部链路都是双向链路，在不考虑负载优化的情况下，最后的分布图应该是完全对称的。由于考虑了负载，因此在时延的分布上有一些不同。整体时延经过优化之后，对比LHP方法时延平均优化了约30ms。星座网络中点到点传输时延约100ms，保证了重要信息的高时效发送。The transmission delay of the above information is solved through the method of the present invention, and the solution result is shown in Figure 3. In Figure 3, the coordinates of the x-axis and the y-axis represent the satellite numbers, and the coordinates of the z-axis represent the minimum transmission delay from the satellite numbered x to the satellite numbered y at time T0 after optimization by the method of the present invention. The diagonal line in the middle of the figure represents the delay from the satellite to itself, so the values are all zero. Since all links are assumed to be bidirectional, the final distribution graph should be completely symmetrical without considering load optimization. Since the load is taken into account, there are some differences in the distribution of delays. After the overall delay is optimized, the average delay is optimized by about 30ms compared with the LHP method. The point-to-point transmission delay in the constellation network is about 100ms, ensuring high-time delivery of important information.
如图4所示，将本发明本方法的负载与LHP方法负载进行对比。上方线条表示基于LHP方法在一个拓扑循环周期内单条链路上的负载最大值，可以看到因此基于LHP方法的传输在一些特定传输场景下在单条链路上会产生过大的负载，例如图中在T0时刻，和600s时刻。由于链路最大的传输速率为10Mbps，因此在多个时间片上都造成了部分链路的拥塞。下方线条基于本发明方法，通过负载对传输矩阵加权，实现了链路的均衡。可以看到，首先单条链路的最大传输负载和LHP策略下比较实现了整体下降，在整个仿真的一个周期内，没有任何时刻的单条链路最大负载大于LHP下的最大负载。同时在整个周期内，单条链路的最大负载的变化都比较稳定。因此，本发明方法可以有效地使得单条链路上的流量可以通过多路径传输以实现负载均衡，其避免了网络中的链路拥塞，获得了较好的链路均衡的效果。As shown in Figure 4, the load of the method of the present invention is compared with the load of the LHP method. The upper line represents the maximum load on a single link based on the LHP method within a topology cycle. It can be seen that transmission based on the LHP method will generate excessive load on a single link in some specific transmission scenarios, such as in Figure at T0 time and 600s time. Since the maximum transmission rate of the link is 10Mbps, congestion is caused on some links in multiple time slices. The lower line is based on the method of the present invention, which weights the transmission matrix by load to achieve link balancing. It can be seen that first of all, the maximum transmission load of a single link has decreased overall compared with that under the LHP strategy. During the entire simulation cycle, the maximum load of a single link at no time is greater than the maximum load under LHP. At the same time, the changes in the maximum load of a single link are relatively stable during the entire cycle. Therefore, the method of the present invention can effectively enable the traffic on a single link to be transmitted through multiple paths to achieve load balancing, which avoids link congestion in the network and achieves better link balancing effects.
尽管上文描述了本发明的各实施例，但是，应该理解，它们只是作为示例来呈现的，而不作为限制。对于相关领域的技术人员显而易见的是，可以对其做出各种组合、变型和改变而不背离本发明的精神和范围。因此，此处所公开的本发明的宽度和范围不应被上述所公开的示例性实施例所限制，而应当仅根据所附权利要求书及其等同替换来定义。Although various embodiments of the present invention are described above, it should be understood that they are presented by way of example only and not by way of limitation. It is obvious to those skilled in the relevant art that various combinations, modifications and changes can be made without departing from the spirit and scope of the invention. Accordingly, the breadth and scope of the invention disclosed herein should not be limited by the exemplary embodiments disclosed above, but should be defined solely in accordance with the appended claims and their equivalents.
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311176337.3ACN116963130A (en) | 2021-05-26 | 2021-05-26 | Inter-satellite network for observing satellite constellation in global networking |
| CN202110576858.2ACN113301591B (en) | 2021-05-26 | 2021-05-26 | Inter-satellite network optimization method for global networking observation satellite constellation |
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110576858.2ACN113301591B (en) | 2021-05-26 | 2021-05-26 | Inter-satellite network optimization method for global networking observation satellite constellation |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311176337.3ADivisionCN116963130A (en) | 2021-05-26 | 2021-05-26 | Inter-satellite network for observing satellite constellation in global networking |
| Publication Number | Publication Date |
|---|---|
| CN113301591A CN113301591A (en) | 2021-08-24 |
| CN113301591Btrue CN113301591B (en) | 2023-09-15 |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110576858.2AActiveCN113301591B (en) | 2021-05-26 | 2021-05-26 | Inter-satellite network optimization method for global networking observation satellite constellation |
| CN202311176337.3APendingCN116963130A (en) | 2021-05-26 | 2021-05-26 | Inter-satellite network for observing satellite constellation in global networking |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311176337.3APendingCN116963130A (en) | 2021-05-26 | 2021-05-26 | Inter-satellite network for observing satellite constellation in global networking |
| Country | Link |
|---|---|
| CN (2) | CN113301591B (en) |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN120049940B (en)* | 2025-01-23 | 2025-09-16 | 星辰璇玑(北京)测控技术有限公司 | Intersatellite multipoint transmission and link dynamic optimization method based on Bayesian situational awareness |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105282038A (en)* | 2015-11-04 | 2016-01-27 | 哈尔滨工业大学 | Distributed asterism networking optimization method based on stability analysis and used in mobile satellite network |
| CN107086888A (en)* | 2017-03-02 | 2017-08-22 | 重庆邮电大学 | A two-layer hybrid satellite network optimization design and its coverage performance evaluation method |
| CN107370676A (en)* | 2017-08-03 | 2017-11-21 | 中山大学 | Fusion QoS and load balancing demand a kind of route selection method |
| CN112333109A (en)* | 2020-11-17 | 2021-02-05 | 重庆邮电大学 | Ant colony optimization-based load balancing routing method in low-orbit satellite network |
| CN113422636A (en)* | 2021-06-18 | 2021-09-21 | 北京邮电大学 | On-satellite routing optimization method |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105282038A (en)* | 2015-11-04 | 2016-01-27 | 哈尔滨工业大学 | Distributed asterism networking optimization method based on stability analysis and used in mobile satellite network |
| CN107086888A (en)* | 2017-03-02 | 2017-08-22 | 重庆邮电大学 | A two-layer hybrid satellite network optimization design and its coverage performance evaluation method |
| CN107370676A (en)* | 2017-08-03 | 2017-11-21 | 中山大学 | Fusion QoS and load balancing demand a kind of route selection method |
| CN112333109A (en)* | 2020-11-17 | 2021-02-05 | 重庆邮电大学 | Ant colony optimization-based load balancing routing method in low-orbit satellite network |
| CN113422636A (en)* | 2021-06-18 | 2021-09-21 | 北京邮电大学 | On-satellite routing optimization method |
| Title |
|---|
| Dingde Jiang ; Peng Zhang ; Zhihan Lv ; Houbing Song.Energy-Efficient Multi-Constraint Routing Algorithm With Load Balancing for Smart City Applications.《IEEE Internet of Things Journal》.2016,第1-5页.* |
| 张泰江,李勇军,赵尚弘.基于GEO/LEO双层卫星网络的路由算法优化设计.《电信技术》.2020,第198-205页.* |
| Publication number | Publication date |
|---|---|
| CN113301591A (en) | 2021-08-24 |
| CN116963130A (en) | 2023-10-27 |
| Publication | Publication Date | Title |
|---|---|---|
| CN110493131B (en) | A design method of spatial information network routing strategy under SDN architecture | |
| CN108307435B (en) | A Multitask Routing Method Based on SDSIN | |
| CN113572686A (en) | An adaptive dynamic QoS routing method based on SDN | |
| CN105282038B (en) | For the distributed group of stars group optimization method based on stability analysis in mobile satellite network | |
| CN109586785B (en) | Routing strategy for low-orbit satellite network based on K shortest path algorithm | |
| CN106970645A (en) | Multiple no-manned plane collaboration formation optimal information interaction Topology g eneration method and device | |
| CN105227483A (en) | Based on the low complex degree Load Balance Routing Algorithms of LEO satellite network | |
| CN114268575B (en) | Self-adaptive three-dimensional transmission method and system in space-earth integrated information network | |
| CN113301591B (en) | Inter-satellite network optimization method for global networking observation satellite constellation | |
| CN106452555A (en) | Multi-path optimization algorithm planning method based on medium and low earth orbit satellite network | |
| CN113507314B (en) | Inter-satellite data transmission method | |
| CN118631724A (en) | Efficient data routing and transmission method in heterogeneous satellite networks | |
| Li et al. | Service function chain in small satellite-based software defined satellite networks | |
| CN118157744A (en) | A satellite network multi-path routing method based on link state awareness | |
| CN120224332A (en) | A cross-layer joint optimization method of routing and resources in wireless ad hoc networks based on genetic algorithm | |
| CN110620691B (en) | Physical topology structure generation algorithm of 664-navigation network | |
| CN116318330A (en) | Low orbit satellite network service transmission method and system based on service function chain | |
| Lowe et al. | A delay-tolerant network approach to satellite pickup and delivery scheduling | |
| Yuhui et al. | Service Function Chain Migration in LEO Satellite Networks | |
| CN112434436B (en) | A method and system for inter-satellite link scheduling of Beidou navigation satellite system | |
| CN117614511A (en) | Method for planning ground transmission path of perception-limited giant star seat state data | |
| CN117544978A (en) | Networking topology data transmission delay optimization method and device based on time expansion | |
| Huang et al. | Load balancing strategy and its lookup-table enhancement in deterministic space delay/disruption tolerant networks | |
| CN107493127A (en) | A kind of two benches planing method for considering full-time hop count and passing | |
| CN116455449A (en) | Satellite routing method, device, equipment and storage medium based on multi-objective optimization |
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |