CN104767559A - Routing method of distributed type constellation network temporary networking scene - Google Patents

Routing method of distributed type constellation network temporary networking scene Download PDF

Info

Publication number
CN104767559A
CN104767559A CN 201510160684 CN201510160684A CN104767559A CN 104767559 A CN104767559 A CN 104767559A CN 201510160684 CN201510160684 CN 201510160684 CN 201510160684 A CN201510160684 A CN 201510160684A CN 104767559 A CN104767559 A CN 104767559A
Authority
CN
Grant status
Application
Patent type
Prior art keywords
cluster
satellite
node
clustering
head
Prior art date
Application number
CN 201510160684
Other languages
Chinese (zh)
Other versions
CN104767559B (en )
Inventor
孙玉娥
黄河
孙晨杰
杨季文
李凡长
Original Assignee
苏州大学
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

Links

Abstract

The invention provides a routing method of a distributed type constellation network temporary networking scene. The routing method includes the step of generating clusters and initiating a network, the step of transmitting data packets, and the step of adding new constellations or retreating, wherein the step of generating the clusters and initiating the network includes the substep of selecting cluster heads and generating a routing list, and the step of transmitting the data packets includes the substep of transmitting data packets in the clusters and transmitting data packets between the clusters. It can be ensured that the task can be smoothly and efficiently executed.

Description

-种分布式星群网络临时组网场景下的路由方法 - A distributed routing method in the constellation network temporary networking scene

技术领域 FIELD

[0001] 本发明设及一种分布式星群网络临时组网场景下的路由方法,属于卫星通信领域。 [0001] The present invention is provided and a distributed network routing method of the constellation temporary networking scenarios, the field of communications satellites.

背景技术 Background technique

[0002] 现有的分布式星群网络路由算法研究大都是针对单一卫星星座系统所设计的,它们利用卫星网络对地球的完全覆盖性W及卫星节点运行轨迹的可预测性设计QoS(Quality ofservice)保证的数据传输机制,W实现最小的传输时延等优化目标。 [0002] The conventional distributed network routing algorithm for large constellation for a single satellite constellation systems are designed that utilize satellite network coverage and W fully trajectory earth satellite nodes predictable design QoS (Quality ofservice ) to ensure the data transfer mechanism, W and the like to achieve the minimum transmission delay optimization goal. 每个卫星星座系统往往在卫星发射之前就经过了精屯、的布置,从而使得每颗卫星在任意时刻都能保持一定的链路数量,进而保证网络的连通性。 Each satellite constellation systems often prior to satellite launch after a fine Tun, arranged so that each satellite can at any time to maintain a certain number of links, thereby ensuring network connectivity. 特别是在多层卫星星座系统中(GE0/ME0/LE0),该些精屯、设计的卫星星座可W保证LEO层(低轨层)卫星在任意时刻总能够被至少一颗ME0层(中轨层)卫星覆盖,同时ME0层卫星也至少被一颗GE0层(高轨层,或地球同步)卫星覆盖。 In particular, the multilayer system satellite constellation (GE0 / ME0 / LE0), the plurality of fine village, W may be designed to ensure that the satellite constellation (LEO layer) layer of LEO satellites at any time can always be at least one layer ME0 (in rail layer) satellite coverage, while also ME0 layer at least one satellite GE0 layer (high-level track, or geostationary) satellite coverage. 在该类卫星网络中,任意两颗卫星节点间在任意时刻都存在至少一条通路。 In such a satellite network, the nodes between any two satellites are present at least one path at any time. 即使网络中有部分节点出现数据拥塞或失效,一般也不会影响到网络的连通性,因此很难出现信息孤岛的情况。 Even if some nodes in a network data congestion or failure occurs, it does not reduce the network connectivity, the information is difficult to occur a case island. 除此之外,固定卫星星座系统中的卫星节点和它们的运行轨道是固定不变的, 该就使得可W较为容易地求出卫星节点间链路的变化状态,并根据历史传输数据拟合出链路的期望延迟曲线,最终求出卫星节点对之间的最优路由表。 In addition, the fixed satellite system satellite constellation nodes and their orbits are fixed, so that it can be relatively easily obtained W changes state between the nodes the satellite link, and the transmission data fitting historical the desired link delay profile, to finally determine the optimal routing table between the satellite nodes pair.

[0003] 然而,在实际卫星系统运行过程中,当出现紧急事件或一些特殊需求时,可能需要在多个不同星座系统间的卫星相互协作共同完成一些监控和数据传输任务。 [0003] However, during the actual operation of the satellite system, when an emergency or special needs, you might need different satellite constellations across multiple systems cooperate together to complete a number of monitoring and data transfer tasks. 在该种情况下,来自不同星座间的各种不同类型的卫星会组成一个临时的卫星网络。 In this case, the satellite from a variety of different types between different constellations of satellites will form a temporary network. 由于该种卫星网络是在紧急情况下临时组建的,所W隶属于不同星座系统下的卫星节点间存在较大的异构性。 Since this kind of network is a satellite in temporary formation of an emergency, under the presence of the W heterogeneity between large satellite nodes under different constellation system. 与此同时,在该种情况下,由于临时组网构建的分布式星群网络中的卫星节点来自于不同的星座系统,且卫星间的相对位置关系和轨道并不是经过精确的组网计算得到的,因此很难保证在任意时刻分布式星群网络的连通性,极易出现信息孤岛的情况。 Meanwhile, in this case, due to the distributed network temporary network constructed constellation of satellite nodes from different constellation system, and the relative positional relationship between the orbit and the satellites are not precisely obtained networking calculated , it is difficult to ensure the communication of the constellation at any time distributed network, the information island prone. 此时,网络中的节点只有在相遇时才能建立直接链路,该就使得网络具有较为明显的延迟容忍特性。 In this case, nodes in the network can be established only when the encounter a direct link, which makes the network has obvious delay tolerant characteristics. 在之前所设计的分布式星群网络路由算法中并没有考虑出现信息孤岛的情况,主要是针对单一卫星星座系统所设计的,因此无法直接应用到该种不同星座卫星间临时组网的情况。 In the constellation of distributed network routing algorithm previously designed and did not consider the case of the emergence of islands of information, mainly for single satellite constellation system design and therefore it can not be directly applied to the case of temporary networking between the different satellite constellations.

发明内容 SUMMARY

[0004] 为了解决上述实际系统中存在的问题,本发明旨在设计一种W分布式星群网络中临时组网场景下可靠数据传输为核屯、目标,针对临时网络存在的间断联通,网络不稳定等特点,设计一种与之相适应的端到端的数据传输方法。 [0004] In order to solve the above problems in a practical system, the present invention aims to design a network W distributed constellation reliable data transmission core network a temporary village scene, target, for the presence of discontinuity Unicom temporary network, the network instability characteristics, end adapted to design a method of data transmission thereto.

[0005] 本发明提出一种分布式星群网络临时组网场景下的路由方法,其特征在于,包含W下步骤;(1)分簇生成及网络初始化;当有紧急事件发生需要临时组网时,参与该紧急事件的组织机构推选出一个管理者,每个组织机构将自己所管理的星座系统中参与临时组网的卫星信息发送给该管理者,该管理者在收到所有组织机构发送来的参与临时组网的卫星信息之后,将属于同一组织机构的卫星看作是一个分簇;推选出的管理者所绑定的地面网关根据参与临时组网的卫星的运行轨迹为每个分簇选出簇头,分簇之间的信息传输由簇头来完成;计算出每个分簇的簇头并生成路由表,管理者将每个分簇的簇头和路由表信息分发给各个星座的地面网关,非管理者的地面网关在收到该些信息之后,在管理者选出的簇头中再选出一个用于分簇内通信的总簇头节点,总簇 [0005] The present invention provides a routing method in a distributed network temporary networking scenarios constellation, wherein W comprises the steps of; (a) generating cluster and network initialization; and when there is need for temporary emergency network when, organizations involved in the emergency elected a manager, each organization will send a constellation systems they manage to participate in a temporary network of satellite information to the manager, the manager of receipt of all organizations after the satellite information to participate in temporary networking, belonging to the same organization is seen as a satellite cluster; elected managers are bound to participate in the ground gateway based on the running track temporary network of satellites for each division elected cluster head cluster, transmission of information between the cluster is done by the cluster head; calculated for each cluster head and the cluster generates a routing table, the cluster head manager and routing table information for each cluster is distributed to constellation gateway ground, the ground non-gateway manager after receiving the plurality of information in the key re-elected cluster head is selected for a total cluster head node within the cluster communication, total clusters 头节点计算分簇内所有卫星到各个簇头、W及各个簇头到所有卫星之间的最优传输路径;(2)数据包传输过程;分簇内的数据包传输;当地面控制中屯、有报文发送给一颗或多颗卫星节点时,首先判断是否可W跟所述卫星直接通信,若存在直接链路,则将报文直接发送给所述卫星;否则,任意找到一颗当前与自身存在直接链路的卫星作为入口卫星,将报文发送给该入口卫星;入口卫星收到报文之后,将其转发给与自身跳数最少的一个簇头节点,然后该簇头节点查找路由表,将报文转发给分簇内的目的节点;当收集卫星节点监测到的信息时,分簇内的各个卫星将自身收集的信息发送到所在分簇的总簇头节点,总簇头节点将收到的数据包进行信息融合,将融合后的信息生成一个新的数据包发送给地面控制中屯、;分簇间的数据包传输:当第一分簇的地面控 Head node points is calculated for all satellites to each cluster head in the cluster, W, and each cluster heads to the optimum transmission path between all satellites; (2) a data packet transmission; data packet transmission within a cluster; local control plane Tun , there are packets sent to one or more satellites node first determines whether W direct communication with the satellite, if the direct link exists, the packets will be sent directly to the satellite; otherwise, an arbitrary found current satellite itself as there is a direct link entry satellites, and sends the packet to the inlet satellite; a satellite packet is received after the access, it is forwarded to the least number of hops own cluster head node, and the cluster-head node searching the routing table, forwards the packet to the destination node in the cluster; when collecting the satellite node monitoring information to the divided respective satellites cluster transmit information it collects to the total cluster head node where the cluster, the total cluster head node the received packet information fusion, generating a new information packet transmitted to the ground control fusion village,; packet transfer between the cluster: when the first ground control clustering 中屯、跟第二分簇的地面控制中屯、进行通信时,首先第一分簇的地面控制中屯、需要找到自己所在分簇内与自身有直接链路的一颗卫星作为入口卫星,然后由该入口卫星按照所维护的分簇内路由表找到自己的负责分簇的簇头节点之间的最优路径,并将数据包转发到该簇头节点;第一分簇中负责分簇的簇头节点收到数据包后,将其转发给第二分簇中负责分簇的簇头,由该簇头查找到本分簇的出口卫星节点,将其转发给该出口卫星节点,并最终由该出口卫星节点将其转发给第二分簇的地面控制中屯、;(3)新的星座加入或退出;当星座内有节点加入或退出时,该星座的地面网关重新计算受影响的部分路由表或重新选举簇头;当有新的星座加入或已有的星座退出时,通知管理者,并由管理者的地面网关选举出簇头并计算分簇间的路由表。 In the village, with the ground control in the second cluster of Tuen, while communicating, the first cluster of the first ground control in Tuen need to find where their points in the cluster itself has a direct satellite link as a satellite entry, the inlet is then found by a satellite cluster according to the routing tables maintained by the optimal path between cluster head node is responsible for its own cluster, and forward the packet to the cluster-head node; a first cluster responsible clustering after the cluster head node receives a packet, it will forward it to the second cluster responsible for clustering of cluster head, cluster head to find the exit from this sub-satellite node cluster, forward it to the export of satellite node, and the final exit from the satellite nodes forward it to a second cluster in the ground control village,; (3) a new join or leave a constellation; when nodes join or quit the constellation, which the gateway ground recalculated affected the part of the routing table or re-election of cluster head; when there is a new or existing constellation constellation join quit, inform managers, managers of the ground by the gateway elected cluster head and compute sub routing table between the clusters.

[0006] 进一步地,所述的一种分布式星群网络临时组网场景下的路由方法,其特征在于, 簇头选举时,首先假定临时网络中的分簇一共有k个,输入临时分簇中的k个分簇,初步设定为两个分簇之间只能进行直接通信;S101步骤,遍历整个分簇集合,遍历到当前分簇时记为i;S102步骤,对于S101中的每一个分簇i,再一次遍历整个分簇,遍历到当前分簇时记为j,使得分簇之间两两进行运算;S103步骤,初始化两卫星存在直接链路的时间长度了"1。1= 0,两卫星等待相遇的时间为Tdeiw=°°间〇4步骤,首先对于分簇i,从GE0层节点到LEO层节点的顺序开始遍历,记为Si,i;S105步骤,对于分簇i中的每一个节点S1,遍历分簇j中的每一个节点,记为Sj,i;S106步骤,如果S1和S1之间存在直接链路的且链路时间长度大于当前的Tm"就执行S107,否则,执行S108 ;S107步骤,将S1,1和SW之间的直接链 [0006] Further, in the routing method according to a distributed network temporary networking scenarios constellation, wherein, when the cluster head election, first assume that the temporary network clustering a total of k, input facultative a cluster of cluster k, is initially set to direct communication between only two cluster; step S101, through the entire cluster set, the current traversing i is referred to as clustering; step S102, S101 for the each cluster i, again through the entire cluster, cluster traverse to the chronograph currently j, such that between the two cluster computes two; step S103, the length of time the presence of a direct link initialization two satellites "1. 1 = 0, two satellites meet waiting time between Tdeiw = °° 〇4 step, for the first cluster i, the order from the layer node GE0 LEO layer traversing node, referred to as Si, i; S105 step, for points each cluster node S1 i, traversing each cluster node j is denoted as Sj, i; S106 step, the link and the length of time if there is a direct link between S1 and S1 is greater than the current Tm "on performing S107, otherwise performs S108; S107 step, the direct link between SW and S1,1 存在的时间长度赋值给Tm";将S1记为分簇i对分簇j通信的簇头,将Sj, 1记为分簇j对分簇i通信的簇头;S108步骤,如果Si, 1和Sj, 1之间不存在直接链路,且它们相遇的等待时间小于当前的Tddw;则执行S109,否则,不执行赋值间09步骤,将当前时刻开始S1,1和Sj,i之间相遇的等待时间赋值给Tddw;将S1,1记为分簇i对分簇j通信的簇头,将SW记为分簇j对分簇i通信的簇头。 The length of time occurring assigned to Tm "; S1 is referred to as a cluster i cluster head of the cluster j communication will Sj, 1 referred to as a cluster j cluster head of the cluster i communication; S108 step, if Si, 1 and Sj, there is no direct link between 1, and they meet latency less than the current TDDW; S109 is performed, otherwise step 09 is not performed between the assignment, the current time and the start S1,1 encounter between Sj, i the waiting time assigned to TDDW; S1,1 be referred to as a cluster of cluster head i j cluster communication, referred to as the SW cluster head of the cluster j i cluster communication.

[0007] 进一步地,所述的一种分布式星群网络临时组网场景下的路由方法,其特征在于, 路由表生成时,假定临时网络中的分簇一共有k个,输入临时分簇中的k个分簇;但不在限制两个分簇之间只能进行直接通信;S201步骤,遍历整个分簇集合,遍历到当前分簇时记为i;S202步骤,对于S201中的每一个分簇i,再一次遍历整个分簇,遍历到当前分簇时记为j,使得分簇之间两两进行运算;S203步骤,如果簇头Cw和CW直接存在直接链路,则执行S204,否则,执行S205 ;S204步骤,Cy和CW直接通信;S205步骤,遍历整个分簇集,遍历到当前分簇时记为1 ;S206步骤,对于分簇1,如果簇头。 [0007] Further, in the routing method according to a distributed network temporary networking scenarios constellation, wherein, when generating the routing table, assuming a temporary network clustering a total of k, enter the temporary clustering the k-th cluster; but not between the two limits direct communication only cluster; step S201, through the entire cluster set, the current traversing i is referred to as clustering; steps S202, S201, for each of the clustering i, again through the entire cluster, cluster traverse to the chronograph currently j, such that between twenty-two calculates cluster; step S203, and if the cluster head CW Cw direct direct link exists, S204 is executed, otherwise, S205; S204 step, Cy and CW direct communication; step S205, through the entire sub-clusters, referred to as the current traversing the cluster 1; step S206, a clustering for, if the cluster head. ,1和Ci,i,Cw和CU之间存在直接链路,则执行S207,否则,继续遍历分簇集;S207步骤,删除簇头Cy和C由星座1簇头进行数据中转,并生成路由表,继续遍历。 There is a direct link between 1 and Ci, i, Cw, and the CU, S207 is executed, otherwise, continue to traverse clustered points; Step S207, the cluster head Cy and delete data transfer by the constellation C 1 cluster head, and generate routes table, continue to traverse.

[0008] 进一步地,所述的一种分布式星群网络临时组网场景下的路由方法,其特征在于, 卫星节点与其他分簇的地面控制中屯、之间通信时,首先该卫星节点将数据包发送到所在分簇负责的簇头节点,然后该簇头节点通过分簇间的链路将其转发给目的分簇的簇头节点, 然后由目的分簇的簇头节点找到所在分簇的出口卫星节点,并将数据包转发给该出口卫星节点,最终由该出口卫星节点将其转发给目的分簇的簇头节点。 [0008] Further, in the routing method according to a distributed network temporary networking scenarios constellation, characterized in that, with other satellite nodes clustered in Tun ground control, the communication between the first satellite nodes the packet is sent to the cluster where the cluster-head node is responsible, then the cluster head node through a link between the cluster head node forwards it to the destination cluster, and by the destination cluster head node of the cluster to find points where cluster outlet satellite nodes, and forwards the packet to the outlet of the satellite node, the final exit from the satellite node forwards to a destination cluster head node of the cluster.

附图说明 BRIEF DESCRIPTION

[0009] 图1为分簇间簇头选举流程图。 [0009] FIG. 1 is a cluster head election between clustering flowchart.

[0010] 图2为寻找中转簇头及路由表生成流程图。 [0010] Figure 2 is the cluster head and looking transit routing table generating flowchart.

[0011] 图3分簇内数据报文转发示意图。 [0011] FIG 3 minutes cluster data packet forwarding FIG.

具体实施方式 detailed description

[0012] 本发明的目的是将针对临时组网形成的分布式星群网络,设计与之相对应的路由机制,从而使得该些卫星所组成的临时网络能够正常运行,成功应对紧急的任务需求。 [0012] The object of the present invention is a distributed network constellation for forming a temporary network is designed routing mechanism corresponding thereto, such that the plurality of satellites consisting temporary network to work properly, needs to successfully deal with urgent task . 分布式星群网络中的卫星节点可能隶属于不同的星座系统(即节点存在广泛的异构性),由于某些临时的原因共同组成一个临时的网络W共同完成同一监测和数据传输任务。 Distributed satellite constellation network nodes may belong to different constellation system (ie, there is a wide range of heterogeneous nodes), due to some temporary reason together form a temporary network W together to complete the same task of monitoring and data transmission. 对于一个S层的LE0/ME0/GE0层卫星网络系统,假定网络中的节点来自k个不同的星座,星座系统的集合用a|i= 1,2,...,k}来表示,假设每个星座为了维护自身正常的业务需求,仅会贡献出部分卫星参与到紧急事件的临时组网中。 For LE0 / ME0 / GE0 layer satellite network system S layer, assuming k nodes in the network from different constellations, with constellation system set a | i = 1,2, ..., k} be represented, it is assumed each constellation in order to maintain their normal business needs, will contribute only part of the satellite network to participate in the temporary emergency event. 该样,定义星座系统i中用来临时组网的卫星有*纖frilwfe= {^4,15 2, -化'-2''…^片-、'心G/'iG峨G,.化'}。 The samples, I used the temporary networking system satellite constellation defined * fiber frilwfe = {^ 4,15 2, - of '-2' '... ^ sheet -' heart G / 'iG of Bauer G ,. '}. 其中,又主.,,、也和分别是星座i中贡献出的LEO层卫星、ME0层卫星和GE0层卫星的数量。 Wherein and the master. ,,, respectively, and also the number of the contribution i constellation LEO satellites layer, layer ME0 satellites and satellite GE0 layer. 临时构建的分布式星群网络中的所有卫星节点具有双重身份,一方面需要继续完全原有星座中的数据传输任务;而另一方面需要执行临时网络中的额外任务。 All satellite constellation nodes of a distributed network in a temporary building has a dual identity, on the one hand the need to continue the data transfer tasks completely original constellation; on the other hand need to perform additional tasks temporary network. 由于临时组网一般是为了应对紧急事件,所W临时网络中的数据传输及监测任务应享有比卫星隶属星座任务更高的优先级(良P;pri〇rity(〇dginaltask)priority(temporary task)),W保证任务能被顺利、高效地执行。 Usually due to a temporary network in order to respond to emergencies, data transmission and monitoring tasks W temporary network should enjoy higher than the satellite constellation under the priority of the task (Liang P; pri〇rity (〇dginaltask) priority (temporary task) ), W to ensure that the task can be smoothly and efficiently executed.

[0013] 本发明提出的针对临时组网络形成的分布式星群网络的路由机制,包含W下步骤: [0013] The routing mechanism for distributed network temporary group constellation network formed by the present invention, W comprises the steps of:

[0014](1)分簇生成及网络初始化:假设参与临时组网的不同星座系统分属不同的组织机构。 [0014] (a) generating cluster and network initialization: assuming different constellations involved in temporary networking systems belong to different organizations. 当有紧急事件发生需要临时组网时,参与该紧急事件的组织首先推选出一个管理者(manager),然后每个组织将自己所管理的星座系统中参与临时组网的卫星信息发送给该管理者。 When there is an emergency need for temporary networks, organizations involved in the emergency first elected a manager (manager), then each organization will sign systems they manage to participate in a temporary network of satellite information sent to the management By. 该管理者在收到所有其他组织发送来的参与临时组网的卫星信息之后,将属于同一组织者的卫星看作是一个分簇。 The managers after receiving satellite information sent to all other organizations involved in temporary networking, belonging to the same satellite as an organizer of clustering. 为了使不同星座间的卫星也可W相互通信,推选出的管理者所绑定的地面网关将根据参与临时组网的卫星的运行轨迹为每个分簇选出簇头,分簇之间的信息传输由簇头来完成。 In order to make different satellite constellations between W may communicate with each other, the manager elected bound ground gateway for each selected cluster head cluster according to the trajectory of the satellites involved in the temporary network, clustering between information transfer is complete by the cluster head. 由于一个簇头并不一定适合与所有的分簇进行通信,所w管理者是为每对分簇选出一对相互通信的簇头,同一分簇内与不同分簇进行通信的簇头可能并不相同。 Since one cluster head is not necessarily suitable for communication, all the managers and w are selected cluster head cluster communicate with each other as one pair for each cluster, clustering within the same cluster head communication may be different clustering It is not the same.

[0015] ①簇头选举(两个分簇之间只能进行直接通信);(参照图1)首先假定临时网络中的分簇一共有k个,输入临时分簇中的k个分簇,初步设定为两个分簇之间只能进行直接通信; [0015] ① cluster head election (between two cluster only direct communication); (see FIG. 1) is first assumed that a temporary network clustering a total of k, enter the temporary cluster clustering of k, It is initially set at between two cluster can communicate directly;

[0016]S101步骤,遍历整个分簇集合(遍历到当前分簇时记为i); [0016] S101 step, through the entire cluster set (when traversed in the current clustering note is I);

[0017]S102步骤,对于S101中的每一个分簇i,再一次遍历整个分簇(遍历到当前分簇时记为j),使得分簇之间两两进行运算; [0017] S102 step S101, for each cluster i, again through the entire cluster (referred to as the current traversing clustering when j), so that between twenty-two calculates cluster;

[0018]S103步骤,初始化两卫星存在直接链路的时间长度Tm"= 0,两卫星等待相遇的时间为Tdelay=°° ; The length of time there is a direct link [0018] S103 step, initializing two satellite Tm "= 0, two satellite °° waiting time is met Tdelay =;

[0019]S104步骤,首先对于分簇i,从GEO层节点到LEO层节点的顺序开始遍历,记为Si, iS [0019] S104 step, for the first cluster i, traversing the layer node to sequentially LEO GEO tier nodes, referred to as Si, iS

[0020] S105步骤,对于分簇i中的每一个节点Si, 1,遍历分簇j中的每一个节点,记为Sj, [0020] S105 step, for each node Si in cluster i, 1, a traverse each cluster node j is denoted as Sj,

[0021]S106步骤,如果Si, 1和SJ, 1之间存在直接链路的且链路时间长度大于当前的T 就执行S107,否则,执行S108; [0021] S106 step, if Si, 1, and SJ, the link between a time and a length greater than the current of the direct link T S107 is executed, otherwise, performing S108;

[00过S107步骤,将Si,1和SW之间的直接链路存在的时间长度赋值给Tmax;将S1,1记为分簇i对分簇j通信的簇头,将Sy记为分簇j对分簇i通信的簇头; [00 through the step S107, the length of time a direct link between the assignment of Si, 1 to Tmax of the presence and SW; S1,1 referred to as the cluster of cluster i j communication cluster head, the cluster referred to as Sy j i cluster head of the cluster communication;

[002引S108步骤,如果Si,i和Sj,之间不存在直接链路,且它们相遇的等待时间小于当前的Tddw;则执行S109,否则,不执行赋值; [002 cited step S108, if Si, i and Sj, a direct link between absence, and they meet latency less than the current TDDW; S109 is performed, otherwise, the assignment is not performed;

[0024] Sl〇9步骤,将当前时刻开始Si, 1和Sj.J之间相遇的等待时间赋值给Tdelay;将S1 记为分簇i对分簇j通信的簇头,将Sj,i记为分簇j对分簇i通信的簇头; [0024] Sl〇9 step, the current time start Si, meet the latency between 1 and Sj.J assigned to Tdelay; S1 will be referred to as a cluster of cluster head i j cluster communication will Sj, i remember j is the cluster head of the cluster i cluster communication;

[0025] 简而言之;遍历整个分簇集合,分簇之间两两进行运算,首先从CEO层节点开始遍化分别在两个分簇中找到一个节点,使的它们的直接链路的时间长度最大;如果两个分簇之间任意一对节点之间都不存在直接链路,则找到两个节点,使他们从当前时刻开始到相遇有直接链路的时间最短;该两个节点便分别是该两个分簇相对于对方的簇头。 [0025] Briefly; traversing the entire cluster set, between pairwise clustering operation, first level node starts over from the CEO of a node are found in the two sub-clusters, making their direct link the maximum length of time; if not a direct link between any pair of nodes between the two sub-clusters, find the two nodes, so that they encounter from the current time to the start time of the shortest direct link; of the two nodes they are the two clustering with respect to the other cluster head. 因为分簇之间没两两之间都会有一对簇头,所W-个分簇可能有多个簇头。 Because no clustering between each two will be a pair of cluster head, the W- a cluster may have multiple cluster head.

[0026] ②路由表生成(考虑两个分簇的簇头之间没有直接链路);(参照图2)仍然假定临时网络中的分簇一共有k个,输入临时分簇中的k个分簇;但不在限制两个分簇之间只能进行直接通信; [0026] ② generates a routing table (considering there is no direct link between the cluster head two clustering); (see FIG. 2) is still assumed clustered ad hoc network in a total of k, enter the temporary clustering of k clustering; but not restricted only direct communication between the two cluster;

[0027]S201步骤,遍历整个分簇集合(遍历到当前分簇时记为i); [0027] S201 step, through the entire cluster set (when traversed in the current clustering note is I);

[0028]S202步骤,对于S201中的每一个分簇i,再一次遍历整个分簇(遍历到当前分簇时记为j),使得分簇之间两两进行运算; [0028] S202 step S201 for each of the cluster i, again through the entire cluster (referred to as the current traversing clustering when j), so that between twenty-two calculates cluster;

[002引S203步骤,如果簇头Cy和CW直接存在直接链路,则执行S204 ;否则,执行S205 ; [002 cited step S203, and if the cluster head Cy CW direct direct link exists, S204 is executed; otherwise, performing S205;

[0030]S2〇4步骤,Cw和CW直接通信; [0030] Step S2〇4, Cw and CW direct communication;

[0031]S205步骤,遍历整个分簇集(遍历到当前分簇时记为1);, [0031] S205 step, through the entire sub-cluster (referred to as the current traversing clustering 1:00) ;,

[0032]S206步骤,对于分簇1,如果簇头。 [0032] S206 step for clustering 1, if the cluster head. ,1和C1,1,Cj,1和C1, J之间存在直接链路,则执行S207;否则,继续遍历分簇集; There is a direct link between 1 and C1,1, Cj, 1 and C1, J, S207 is executed; otherwise, continue to traverse points clustered;

[0033] S207步骤,删除簇头Cw和Cy;由星座1簇头进行数据中转,并生成路由表;继续遍历。 [0033] S207 step, Cy and Cw remove cluster head; a data transfer from the cluster head constellation, and generates a routing table; continue traversing.

[0034] 简而言之;如果两个分簇的簇头之间不存在直接链路则遍历所有其他分簇,查看是否存在一个分簇与该两个分簇之间存在直接链路,如果存在该样的分簇,则生成路由表。 [0034] Briefly; if the cluster head does not exist between the two sub-clusters is a direct link to traverse all the other cluster, to see if there exists a direct link between the two cluster clustering and, if the presence of this kind of clustering, routing table is generated. 在计算出每个分簇的簇头和路由表之后,管理者将该些信息分发给各个星座的地面网关。 After calculating the routing table for each cluster head and the cluster, the management information is distributed to some constellation gateway ground. 非管理者的地面网关在收到该些信息之后,在管理者选出的簇头中再选出一个用于分簇内通信的簇头节点,将其称之为总簇头节点。 Non-terrestrial gateway manager after receiving the plurality of information management in the selected cluster head in a cluster head node then selected for the cluster communication, it is referred to the total cluster head node. 然后,总簇头节点将计算分簇内所有卫星到各个簇头、W及各个簇头到所有卫星之间的最优传输路径。 Then, the calculated total cluster head node for all satellites to each cluster head, W, and each cluster within the cluster heads to the optimum transmission path between all satellites. 最优传输路径的计算方式可W采用迪杰斯特拉算法(最短传输路径)计算得到。 Calculated optimal transmission path using Dijkstra's algorithm can be W (minimum transmission path) is calculated.

[00巧](2)数据包传输过程: [Qiao 00] (2) packet transmission:

[0036] ①分簇内的数据包传输:当地面控制中屯、有报文需要发送给一颗或多颗卫星节点时,首先判断是否可W跟所述卫星直接通信。 [0036] ① divided packet transmission in the cluster: when the ground control Tun, there are packets to be transmitted to one or more satellites node first determines whether W direct communication with the satellite. 若存在直接链路,则将报文直接发送给所述卫星;否则,任意找到一颗当前与自身存在直接链路的卫星作为入口卫星,将报文发送给该入口卫星。 If a direct link exists, the packet is sent directly to the satellite; otherwise, any currently find a link with the satellite itself as a direct entry satellites, and sends the packet to the inlet satellite. 入口卫星的选择也是尽可能地选择簇头节点或高轨卫星,W减少分簇内路由的跳数。 Inlet satellite cluster head node selection is selected orbiting satellites or high as possible, W reduce the number of cluster hops within the route. 入口卫星收到报文之后,将其转发给与自身跳数最少的一个簇头节点,然后该簇头节点查找路由表,将报文转发给分簇内的目的节点。 Satellite packet is received after the access, it is forwarded to the least number of hops itself a cluster head node, and the cluster head node searches the routing table and forwards the packet to the destination node within the cluster. 在监测类的任务中,卫星节点会定期地将监测到的信息发送给地面控制中屯、。 In the monitoring task class, the satellite node periodically transmits the monitored information to control ground Tun. 该个过程一般被称为信息收集过程。 This process is generally referred to as an information gathering process. 当需要收集卫星节点监测到的信息时,分簇内的各个卫星首先将自身收集的信息发送到所在分簇的总簇头节点,然后总簇头节点将收到的数据包进行信息融合,W减少总数据包的大小。 When the information needs to be collected to monitor the satellite nodes, each satellite in the first cluster transmits the information it collects to the total cluster where the cluster-head node, and then the total cluster head node the received packet information fusion, W reducing the overall size of the packet. 最后,总簇头节点将融合后的信息生成一个新的数据包发送给地面控制中屯、。 Finally, the total cluster head node will generate a new message packet transmitted to the ground control Tun, after fusion.

[0037] ②分簇间的数据包传输;当分簇a的地面控制中屯、需要跟分簇b的地面控制中屯、 进行通信时,首先分簇a的地面控制中屯、需要找到自己所在分簇内与自身有直接链路的一颗卫星作为入口卫星,然后由该入口卫星按照所维护的分簇内路由表找到自己的负责分簇的簇头节点之间的最优路径,并将数据包转发到该簇头节点。 [0037] Data packets transmitted between ② cluster; when cluster a ground control Tun, needs to be controlled with the ground cluster b of Tun, communication, first clustering a ground control Tun, need to find where their clustering of the satellite itself has a direct satellite link as the entry, then find the optimal path between cluster head node is responsible for its own cluster clustered according to the routing table maintained by that entry satellite, and forward the packet to the cluster head. 分簇a中负责分簇的簇头节点收到数据包后,将其转发给分簇b中负责分簇的簇头,最后由该簇头查找到本分簇的出口卫星节点,将其转发给该出口卫星节点,并最终由该出口卫星节点将其转发给分簇b的地面控制中屯、。 After the cluster head responsible for the clustering node receives a data packet in a cluster, and forwarded to the cluster b of the cluster head responsible for clustering, and finally locate the head of the cluster node to the egress sub-satellite cluster, forwards satellite nodes to the outlet, the outlet and ultimately from the satellite node and forwarded to the cluster b of the ground control village. 卫星节点与其他分簇的地面控制中屯、之间的通信与上述的过程类似。 Satellite cluster node other ground control Tun, similar communication between the above-described process. 首先该卫星节点将数据包发送到所在分簇负责的簇头节点,然后该簇头节点通过分簇间的链路将其转发给目的分簇的簇头节点,然后由目的分簇的簇头节点找到所在分簇的出口卫星节点,并将数据包转发给该出口卫星节点,最终由该出口卫星节点将其转发给目的分簇的簇头节点。 The first satellite node sends the data packet to the cluster head responsible for cluster location, and the cluster head node through a link between the cluster head node forwards it to the destination cluster, and a cluster of cluster head object where the cluster node finds an outlet satellite nodes, and forwards the data packet to the outlet satellite node, the final exit from the satellite node forwards to a destination cluster head node of the cluster.

[0038] (3)新的星座加入或退出:当星座内有节点加入或退出时,该星座的地面网关需要重新计算受影响的部分路由表或重新选举簇头(新的簇头的选举仍采用图1和图2算法进行)。 [0038] (3) a new constellation join or quit: When nodes join or quit within the constellation, which ground gateways need to recalculate the affected part of the routing table or re-election of cluster head (the new cluster head election still 1 and FIG using algorithm 2). 该种拓扑变化一般可W在分簇内解决,不需要通知其他的分簇。 This kind of topology changes generally resolved within W clustering, without notice to the other sub-clusters. 即无需像传统网络那样需要重新计算整个网络的路由表,只要计算新加入的卫星到网络中所有其他卫星节点之间的最优传输途径即可。 That is, without like a traditional network as the need to recalculate the entire routing table of the network, as long as new entrants to calculate the optimum satellite transmission path between network nodes to all other satellites. 但当有新的星座加入或已有的星座退出时,需要通知管理者,并由管理者的地面网关选举出簇头并计算分簇间的路由表。 But when there is a new constellation or join an existing constellation exit, you need to inform managers, managers of the ground by the gateway elected cluster head and compute sub routing table between the clusters.

[0039] W上所述仅是本发明的具体实施方式,应当指出,对于本技术领域的普通技术人员来说,在不脱离本发明原理的前提下,还可W做出若干改进和润饰,该些改进和润饰也应视为本发明的保护范围。 [0039] W on only specific embodiments of the present invention, it should be noted that those of ordinary skill in the art who, without departing from the principles of the invention, may make various improvements and modifications W, the plurality of improvements and modifications should also be regarded as the protection scope of the present invention.

Claims (4)

  1. 1. 一种分布式星群网络临时组网场景下的路由方法,其特征在于,包含以下步骤: (1) 分簇生成及网络初始化; 当有紧急事件发生需要临时组网时,参与该紧急事件的组织机构推选出一个管理者, 每个组织机构将自己所管理的星座系统中参与临时组网的卫星信息发送给该管理者,该管理者在收到所有组织机构发送来的参与临时组网的卫星信息之后,将属于同一组织机构的卫星看作是一个分簇;推选出的管理者所绑定的地面网关根据参与临时组网的卫星的运行轨迹为每个分簇选出簇头,分簇之间的信息传输由簇头来完成; 计算出每个分簇的簇头并生成路由表,管理者将每个分簇的簇头和路由表信息分发给各个星座的地面网关,非管理者的地面网关在收到这些信息之后,在管理者选出的簇头中再选出一个用于分簇内通信的总簇头节点,总簇头节点计 1. A routing method in a distributed network temporary networking scenarios constellation, characterized in that it comprises the following steps: (1) generating a clustering and network initialization; when there is an emergency need to temporarily networking, to participate in the emergency organization of events to elect a manager, each organization will send a constellation systems they manage to participate in a temporary network of satellite information to the manager, the manager sent to participate in the receipt of all organizations interim group after the satellite information network, belonging to the same organization is seen as a satellite cluster; elected managers bound ground gateway based on the trajectory of the satellite involved in the temporary network for each cluster elected cluster head , transmission of information between the clustering performed by cluster head; calculated for each cluster head and the cluster generates a routing table, the administrator of each cluster head and the cluster routing table information distributed to the gateway ground constellation, non-terrestrial gateway manager after receiving the information, in the key re-elected cluster head is selected for a total cluster head node within the cluster communication, the total gauge cluster head node 分簇内所有卫星到各个簇头、 以及各个簇头到所有卫星之间的最优传输路径; (2) 数据包传输过程; 分簇内的数据包传输:当地面控制中心有报文发送给一颗或多颗卫星节点时,首先判断是否可以跟所述卫星直接通信,若存在直接链路,则将报文直接发送给所述卫星;否则, 任意找到一颗当前与自身存在直接链路的卫星作为入口卫星,将报文发送给该入口卫星; 入口卫星收到报文之后,将其转发给与自身跳数最少的一个簇头节点,然后该簇头节点查找路由表,将报文转发给分簇内的目的节点;当收集卫星节点监测到的信息时,分簇内的各个卫星将自身收集的信息发送到所在分簇的总簇头节点,总簇头节点将收到的数据包进行信息融合,将融合后的信息生成一个新的数据包发送给地面控制中心; 分簇间的数据包传输:当第一分簇的地面控制中心 Clustering all the satellites to each cluster heads, each cluster head and the optimal transmission path between all satellites; (2) a data packet transmission; data packet transmission within a cluster: the ground is the control packet to the center when one or more satellite node first determines whether direct communication with the satellite, if the direct link exists, the packets will be sent directly to the satellite; otherwise, any current itself find a direct link exists satellite, as the satellite entry, the packet is sent to the inlet satellite; a satellite packet is received after the access, it is forwarded to the least number of hops own cluster head node, and the cluster-head node routing table lookup, the packet forwarded to the destination node in the cluster; when collecting monitoring information to the satellite nodes, each satellite in the clustering transmit information it collects to the total cluster head node is located in the cluster, the cluster head node will receive the total data fusion information packet, the information generating a new data packet to the ground control center after the fusion; data packet transfer between the cluster: when a ground control center of the first sub-cluster 第二分簇的地面控制中心进行通信时,首先第一分簇的地面控制中心需要找到自己所在分簇内与自身有直接链路的一颗卫星作为入口卫星,然后由该入口卫星按照所维护的分簇内路由表找到自己的负责分簇的簇头节点之间的最优路径,并将数据包转发到该簇头节点;第一分簇中负责分簇的簇头节点收到数据包后,将其转发给第二分簇中负责分簇的簇头,由该簇头查找到本分簇的出口卫星节点,将其转发给该出口卫星节点,并最终由该出口卫星节点将其转发给第二分簇的地面控制中心; (3) 新的星座加入或退出; 当星座内有节点加入或退出时,该星座的地面网关重新计算受影响的部分路由表或重新选举簇头;当有新的星座加入或已有的星座退出时,通知管理者,并由管理者的地面网关选举出簇头并计算分簇间的路由表。 Ground control center when the second sub-cluster communication, first of all the ground control center of the first cluster where their points needs to be found and the cluster itself has a direct satellite link to satellite as an inlet, and then follow the satellite is maintained by the inlet the optimal path between the cluster is responsible for its own routing table to find a cluster head node, and forwards the packet to the cluster-head node; a first cluster in the cluster head responsible for the clustering node receives a data packet after, it is responsible for forwarding to the second sub-cluster clustering cluster head, cluster head to find the exit from this sub-satellite node cluster, forward it to the export of satellite node, and ultimately by the export of its satellite nodes forwarded to the second cluster of ground control centers; (3) a new join or leave a constellation; when nodes join or quit the constellation, which the gateway ground recalculate the affected part of the routing table or the re-elected cluster head; when a new constellation or join an existing exit sign, notice the manager, the manager of the ground by the gateway elected cluster head and compute sub routing table between the clusters.
  2. 2. 如权利要求1所述的一种分布式星群网络临时组网场景下的路由方法,其特征在于,簇头选举时,首先假定临时网络中的分簇一共有k个,输入临时分簇中的k个分簇,初步设定为两个分簇之间只能进行直接通信; SlOl步骤,遍历整个分簇集合,遍历到当前分簇时记为i; S102步骤,对于SlOl中的每一个分簇i,再一次遍历整个分簇,遍历到当前分簇时记为j,使得分簇之间两两进行运算; S103步骤,初始化两卫星存在直接链路的时间长度Tmax= 0,两卫星等待相遇的时间为T, , =OO. ••delay , S104步骤,首先对于分簇i,从GEO层节点到LEO层节点的顺序开始遍历,记为Si,1; S105步骤,对于分簇i中的每一个节点S^1,遍历分簇j中的每一个节点,记为Sj,1; S106步骤,如果Si,i和Si之间存在直接链路的且链路时间长度大于当前的Tmax就执行S107,否则,执行S108 ; S107步骤,将Si,i和S&i之 2. A method as claimed in a distributed routing network temporary networking scenario constellation according to claim 1 facultative input, wherein, when the cluster head election, first assume that the temporary network clustering a total of k, a cluster of cluster k, is initially set to direct communication between only two cluster; the SLOL step of traversing the entire cluster set, the current traversing i is referred to as clustering; step S102, in respect to the SLOL each cluster i, again through the entire cluster, referred to as the current traversing j, between two such two cluster when the clustering operation performed; step S103, the length of time the presence of the initialization two satellite direct link Tmax = 0, two satellite wait time is met T,, = OO •• delay, S104 step, for the first cluster i, the order from the GEO tier nodes traversing LEO tier node, referred to as Si, 1;. S105 step, for points each cluster node i S ^ 1, each cluster traverse a node j is denoted as Sj, 1; S106 step, the link and the length of time if there is a direct link between the Si, and Si is greater than the current i Tmax of S107 is executed, otherwise, S108; S107 step, Si, i, and the S & i 的直接链路存在的时间长度赋值给Tmax;设置Tdelay=O; 将Sia记为分簇i对分簇j通信的簇头,将SM记为分簇j对分簇i通信的簇头; S108步骤,如果Si,i和Si之间不存在直接链路,且它们相遇的等待时间小于当前的Tdelay;则执行S109,否则,不执行赋值; S109步骤,将当前时刻开始Si,i和Si之间相遇的等待时间赋值给Tdelay;将Si,i记为分簇i对分簇j通信的簇头,将Sy记为分簇j对分簇i通信的簇头。 A direct link exists to the length of time Tmax of assignment; provided Tdelay = O; Sia be referred to as a cluster of cluster head i j cluster communication, referred to as the SM cluster head of the cluster j i clustering communication; S108 step, if not present among Si, Si I, and a direct link, and they meet less than the current waiting time Tdelay; S109 is performed, otherwise, not perform the assignment; step S109, the current time will begin Si, of Si, and I the encounter between the waiting time assigned to Tdelay; to Si, referred to as a cluster i i j cluster head of the cluster communication, Sy will be referred to as a cluster head of the cluster j i cluster communication.
  3. 3. 如权利要求1所述的一种分布式星群网络临时组网场景下的路由方法,其特征在于,路由表生成时,假定临时网络中的分簇一共有k个,输入临时分簇中的k个分簇;但不在限制两个分簇之间只能进行直接通信; S201步骤,遍历整个分簇集合,遍历到当前分簇时记为i; S202步骤,对于S201中的每一个分簇i,再一次遍历整个分簇,遍历到当前分簇时记为j,使得分簇之间两两进行运算; 3203步骤,如果簇头(:^.和(^1直接存在直接链路,则执行3204,否则,执行3205; S2〇4步骤,Ci,」和CW直接通信; S205步骤,遍历整个分簇集,遍历到当前分簇时记为1 ; S206步骤,对于分簇1,如果簇头Ci,^ Cj,^C1,」之间存在直接链路,则执行S207, 否则,继续遍历分簇集; S207步骤,删除簇头Ci,」和Cm;由星座1簇头进行数据中转,并生成路由表,继续遍历。 3. The routing method of claim 1 in a distributed network temporary networking scenarios constellation claim, wherein, when generating the routing table, assuming a temporary network clustering a total of k, enter the temporary clustering the k-th cluster; but not between the two limits direct communication only cluster; step S201, through the entire cluster set, the current traversing i is referred to as clustering; steps S202, S201, for each of the clustering i, again through the entire cluster, referred to as the current traversing j, such twenty-two calculates time between the cluster clustering; step 3203, if the cluster head (: and ^ (^ 1 a direct direct link. , 3204 is executed, otherwise, 3205; S2〇4 step, Ci, "CW and direct communication; S205 step, through the entire sub-cluster, traverse to the current record is 1 clustering; S206 step for clustering 1, If the cluster head Ci, there is a direct link between ^ Cj, ^ C1, "is performed S207, otherwise, continue to traverse sub-cluster; S207 steps to remove the cluster head Ci," and Cm; data constellation 1 by the cluster head transit, and generates a routing table, continue to traverse.
  4. 4. 如权利要求1所述的一种分布式星群网络临时组网场景下的路由方法,其特征在于,卫星节点与其他分簇的地面控制中心之间通信时,首先该卫星节点将数据包发送到所在分簇负责的簇头节点,然后该簇头节点通过分簇间的链路将其转发给目的分簇的簇头节点,然后由目的分簇的簇头节点找到所在分簇的出口卫星节点,并将数据包转发给该出口卫星节点,最终由该出口卫星节点将其转发给目的分簇的簇头节点。 4. The routing method in a distributed network temporary networking scenario constellation according to claim 1, wherein the communication between the satellite and the other cluster nodes ground control center, the first satellite node data packets to the cluster where the cluster-head node is responsible, then the cluster head node through a link between the cluster head node forwards it to the destination cluster, and the cluster head node where the object of the clustering to find clustering outlet satellite nodes, and forwards the packet to the outlet of the satellite node, the final exit from the satellite node forwards to a destination cluster head node of the cluster.
CN 201510160684 2015-04-07 2015-04-07 A method in a distributed routing network temporary networking scenario constellation CN104767559B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201510160684 CN104767559B (en) 2015-04-07 2015-04-07 A method in a distributed routing network temporary networking scenario constellation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201510160684 CN104767559B (en) 2015-04-07 2015-04-07 A method in a distributed routing network temporary networking scenario constellation

Publications (2)

Publication Number Publication Date
CN104767559A true true CN104767559A (en) 2015-07-08
CN104767559B CN104767559B (en) 2017-10-24

Family

ID=53649205

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201510160684 CN104767559B (en) 2015-04-07 2015-04-07 A method in a distributed routing network temporary networking scenario constellation

Country Status (1)

Country Link
CN (1) CN104767559B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
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

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1635482A2 (en) * 2004-09-08 2006-03-15 Alcatel Alsthom Compagnie Generale D'electricite Rural broadband hybrid satellite/terrestrial network architecture
US20080175155A1 (en) * 2007-01-24 2008-07-24 Viasat, Inc. Configurable delay limit for error control communications
CN101299713A (en) * 2008-03-21 2008-11-05 哈尔滨工业大学深圳研究生院 Method for setting multilayer satellite network system route
CN101459946A (en) * 2008-12-12 2009-06-17 南京邮电大学 Satellite network reliable routing method based on virtual nodes
JP2014075790A (en) * 2012-10-02 2014-04-24 Boeing Co Method and apparatus for routing ip packets in multi-beam satellite networks
CN104467945A (en) * 2013-09-16 2015-03-25 中国人民解放军总参谋部第六十一研究所 Virtual bus-based distributed asterism network resource management method
CN104485988A (en) * 2014-09-18 2015-04-01 北京邮电大学 Distributed satellite group node selection method based on energy efficiency

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1635482A2 (en) * 2004-09-08 2006-03-15 Alcatel Alsthom Compagnie Generale D'electricite Rural broadband hybrid satellite/terrestrial network architecture
US20080175155A1 (en) * 2007-01-24 2008-07-24 Viasat, Inc. Configurable delay limit for error control communications
CN101299713A (en) * 2008-03-21 2008-11-05 哈尔滨工业大学深圳研究生院 Method for setting multilayer satellite network system route
CN101459946A (en) * 2008-12-12 2009-06-17 南京邮电大学 Satellite network reliable routing method based on virtual nodes
JP2014075790A (en) * 2012-10-02 2014-04-24 Boeing Co Method and apparatus for routing ip packets in multi-beam satellite networks
CN104467945A (en) * 2013-09-16 2015-03-25 中国人民解放军总参谋部第六十一研究所 Virtual bus-based distributed asterism network resource management method
CN104485988A (en) * 2014-09-18 2015-04-01 北京邮电大学 Distributed satellite group node selection method based on energy efficiency

Cited By (1)

* Cited by examiner, † Cited by third party
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

Also Published As

Publication number Publication date Type
CN104767559B (en) 2017-10-24 grant

Similar Documents

Publication Publication Date Title
Chen et al. A survey of routing protocols that support QoS in mobile ad hoc networks
US6058116A (en) Interconnected trunk cluster arrangement
US8717875B2 (en) Condensed core-energy-efficient architecture for WAN IP backbones
US7283465B2 (en) Hierarchical virtual private LAN service protection scheme
US6604146B1 (en) Efficient internet service implementation for mesh satellite networks using centralized router server for distribution of destination tables
US20060120279A1 (en) Node redundancy method, interface card, interface device, node device, and packet ring network system
US5848055A (en) Bandwidth correlation means for paths in connection-oriented packet switching networks
US7974223B2 (en) Virtual private LAN service over ring networks
US20120110393A1 (en) Method and apparatus providing failover for a point to point tunnel for wireless local area network split-plane environments
US20060215544A1 (en) Packet repeater
US6195349B1 (en) Scalable logical LAN
US20060178150A1 (en) Method of transmitting data with minimum energy consumption in a wireless sensor network
US20080222447A1 (en) Prevention of frame duplication in interconnected ring networks
US7177946B1 (en) Optimal sync for rapid spanning tree protocol
US20150207724A1 (en) Dynamic control channel establishment for software-defined networks having centralized control
US7460492B2 (en) Spanning tree loop guard
CN1710869A (en) Method for realizing connected reinforced main-apparatus protection in automatic exchange optical network
US9036474B2 (en) Communication available transport network bandwidth to L2 ethernet nodes
WO2002006918A2 (en) A method, system, and product for preventing data loss and forwarding loops when conducting a scheduled change to the topology of a link-state routing protocol network
CN1533108A (en) Method for realizing dynamic gateway load sharing and backup
US20060209877A1 (en) Communication system, communication card, and communication method
CN1897567A (en) Method for improving transmission reliability in virtual exchange system
CN1722705A (en) Method for controlling communication transmission path in stacked equipment domain
CN101068139A (en) Media gateway upper connection link main spare protecting method
CN101710877A (en) Method, device and system for processing traffic flow based on pseudowire

Legal Events

Date Code Title Description
C06 Publication
EXSB Decision made by sipo to initiate substantive examination
GR01