CN116131898A - Low-orbit satellite link frequency hopping communication method and system - Google Patents

Low-orbit satellite link frequency hopping communication method and system Download PDF

Info

Publication number
CN116131898A
CN116131898A CN202210649837.3A CN202210649837A CN116131898A CN 116131898 A CN116131898 A CN 116131898A CN 202210649837 A CN202210649837 A CN 202210649837A CN 116131898 A CN116131898 A CN 116131898A
Authority
CN
China
Prior art keywords
matrix
communication
communication node
frequency hopping
satellite
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
CN202210649837.3A
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.)
Peking University
Original Assignee
Peking University
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 Peking University filed Critical Peking University
Priority to CN202210649837.3A priority Critical patent/CN116131898A/en
Publication of CN116131898A publication Critical patent/CN116131898A/en
Pending legal-status Critical Current

Links

Images

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/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
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H04B1/7136—Arrangements for generation of hop frequencies, e.g. using a bank of frequency sources, using continuous tuning or using a transform
    • 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 discloses a low-orbit satellite link frequency hopping communication method and a system, which relate to the technical field of satellite communication, and firstly determine a communication node A and a communication node B in the satellite communication process; construction of the generator matrix M A And generating matrix M B The method comprises the steps of carrying out a first treatment on the surface of the Communication node a randomly assigns N numbers of N channels to M A The number in each column is the same and the numbers between different columns are different; the communication node B randomly allocates N numbers of N channels to M B N "dummy rows" of (a); generating matrix M after number assignment A And generating matrix M B Spreading according to the row order to obtain a frequency hopping sequence S A And a hopping sequence S B And frequency hopping is performed accordingly. The method constructs the frequency hopping sequence and carries out frequency hopping, can ensure that two communication nodes meet on N different tracks in the limited TTR, does not depend on clock synchronization among the communication nodes, and reduces the probability of collision。

Description

Low-orbit satellite link frequency hopping communication method and system
Technical Field
The invention relates to the technical field of satellite communication, in particular to a low-orbit satellite link frequency hopping communication method and system.
Background
A satellite communication system is a communication system that uses satellites as relay stations for communication with two or more terrestrial radio communication stations. Compared with the traditional ground communication system, the system has the advantages of large coverage, small influence by weather and geographic conditions, high system reliability, large system capacity and the like. Depending on the satellite orbit used, it can be classified into three satellite communication systems of stationary orbit (GEO), medium orbit (MEO) and low orbit (LEO). Among them, the low orbit satellite has the characteristics of small path loss, low transmission delay, low transmitting power and the like because of low orbit height (700-1500 km), so the low orbit satellite also becomes a satellite communication system with the most promising prospect.
The low orbit satellite communication system mainly consists of three parts, namely a satellite, a user terminal and a gateway station. These three parts are connected by a variety of communication links to form various satellite communication networks. Wherein the communication link between satellites is called an inter-satellite link, the communication link between satellites and gateway stations is called a feeder link, and the link between satellites and user terminals is called a user link. The gateway station is used as one of the core components of the low orbit satellite communication system and is responsible for monitoring the working state of the satellite and switching the public telephone network and the satellite communication network. In the working process of the low orbit satellite communication system, when a user requests data interaction, the satellite and the user terminal carry out data transmission through a user link; meanwhile, the satellite can also periodically interact data with the gateway station to complete the transactions of state report, instruction issue and the like.
Currently, related projects of the low orbit satellite communication system mainly include OneWeb systems created by OneWeb corporation, star chain programs created by SpaceX corporation, and the like. The former plan finishes the internet coverage of the local area of the ground by transmitting 650 satellites, and solves the communication demands of individual users and small business clients; the latter plans to implement worldwide internet access services through over 4000 satellites. The main bottleneck faced by the low-orbit satellite communication system at present is the strong competition of low-orbit satellite communication resources. The orbit and the spectrum resource are the preconditions for the normal operation of the communication satellite, and the low orbit satellite has extremely intense competition of the frequency orbit resource due to the limited orbit height and the high concentrated frequency band, so how to efficiently utilize the spectrum resource on the premise of considering the normal communication of the user link and the feed link is a problem to be solved by the technicians in the field.
Disclosure of Invention
In view of the above, the present invention provides a method and a system for low-orbit satellite link frequency hopping communication.
In order to achieve the above object, the present invention provides the following technical solutions:
a low-orbit satellite link frequency hopping communication method comprises the following steps:
determining a pair of communication nodes in the satellite communication process, namely a communication node A and a communication node B;
construction of a generator matrix M for a home communication node A A And a generator matrix M of a home communication node B B The generator matrix M A And generating matrix M B Matrix of N, N is total number of current available channels;
to generate matrix M A And generating matrix M B Performing number allocation to obtain a generator matrix M after the number allocation A And a number-assigned generator matrix M B ；
Generating matrix M after respectively allocating numbers A And a number-assigned generator matrix M B Expanding in line order to obtain a matrix containing N 2 Frequency hopping sequence S of individual elements A And a hopping sequence S B ；
Communication node A and communication node B respectively follow a frequency hopping sequence S A And a hopping sequence S B Frequency hopping is performed.
Optionally, the method is applicable to communications between satellites and gateway stations, and between satellites and user terminals;
when the method is used for communication between a satellite and a gateway station, the communication node is the satellite and the gateway station; when the method is used for communication between a satellite and a user terminal, the communication node is the satellite and the user terminal.
Optionally, the generator matrix M A The method comprises the following steps:
Figure BDA0003687284710000031
generating matrix M B The method comprises the following steps:
Figure BDA0003687284710000032
optionally, the pair generates a matrix M A And generating matrix M B The method for allocating the numbers comprises the following steps:
communication node a randomly assigns N numbers of N channels to M A The number in each column is the same and the numbers between different columns are different;
the communication node B randomly allocates N numbers of N channels to M B N "dummy rows" of (a) which means that they are located at M B Is a single element of the N elements of the different columns of the same.
Optionally, the frequency hopping sequence S A The method comprises the following steps:
Figure BDA0003687284710000033
S A satisfy->
Figure BDA0003687284710000034
The frequency hopping sequence S B The method comprises the following steps:
Figure BDA0003687284710000035
S B satisfy->
Figure BDA0003687284710000036
Wherein a is ij Representing the generator matrix M A Elements of row i and column j, b ij Representing the generator matrix M B The elements of row i and column j.
A low-orbit satellite link frequency hopping communication system, comprising:
the communication node determining module is used for determining a pair of communication nodes in the satellite communication process, namely a communication node A and a communication node B;
a generation matrix construction module for constructing the home communication nodeGenerating matrix M of point A A And a generator matrix M of a home communication node B B The generator matrix M A And generating matrix M B Matrix of N, N is total number of current available channels;
a number allocation module for generating matrix M A And generating matrix M B Performing number allocation to obtain a generator matrix M after the number allocation A And a number-assigned generator matrix M B ；
Matrix expansion module for respectively allocating the numbers to the generated matrix M A And a number-assigned generator matrix M B Expanding in line order to obtain a matrix containing N 2 Frequency hopping sequence S of individual elements A And a hopping sequence S B ；
A frequency hopping execution module for making the communication node A and the communication node B respectively according to the frequency hopping sequence S A And a hopping sequence S B Frequency hopping is performed.
As can be seen from the above technical solutions, in a low-orbit satellite communication system, communication needs to be performed as efficiently as possible in limited spectrum resources between a satellite and a user terminal and between a satellite and a gateway station, so the present invention provides a low-orbit satellite link frequency hopping communication method and system, which has the following advantages:
(1) The satellite, the user terminal and the gateway station all carry out frequency hopping through the frequency hopping sequences generated by the method of the invention, thereby ensuring convergence in a limited TTR;
(2) The invention can ensure that the convergence occurs on N different tracks, thereby reducing the possibility of communication failure;
(3) The invention does not depend on clock synchronization between communication nodes;
(4) The invention can ensure lower collision probability.
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 required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only embodiments of the present invention, and that other drawings can be obtained according to the provided drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of the method steps of the present invention;
FIG. 2 is a schematic diagram of a system module according to the present invention;
fig. 3 is a diagram illustrating a frequency hopping sequence according to embodiment 1;
fig. 4 is a diagram showing a frequency hopping sequence when the clock delay k=2 time slices in embodiment 1;
fig. 5 is a diagram showing a frequency hopping sequence when the clock delay k=1 time slice length in embodiment 2.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Due to timeliness and limitation of spectrum resources, in order to ensure communication quality, an ideal channel access control algorithm should satisfy the following two conditions:
(1) Communication between the satellite and the user terminal and gateway station is possible for a given period of time T.
(2) The satellite and the user or gateway station should communicate on as many different channels as possible, so as to avoid degradation of communication quality caused by communication of multiple communication nodes on the same channel as much as possible.
Therefore, the communication node may use a Channel Hopping (CH) method to perform communication. Assume that the total number of available channels is N, numbered 0,1 … N-1. Meanwhile, time is divided into equal-length time slices (time), and if two communication nodes access the same frequency channel in the same time slice, communication can be performed between the two communication nodes, which we call rendezvous (rendezvous). At the same time, the time of each communication nodeThe clocks may be identical (known as clock synchronization (clock synchronization)) or may differ by an integer number of time slice lengths. The frequency hopping method makes a pair of communication nodes (comprising a satellite and a user terminal, and a satellite and a gateway station) participating in communication respectively adopt a frequency hopping sequence S, S= { a 1 ,a 2 … }, wherein a i E {0,1 … N-1} represents the channel visited by the communication node in the ith time slice, i=1, 2, …. The frequency hopping sequence S may be statically configured, or may be dynamically generated according to actual situations. After determining the frequency hopping sequence for each communication node, the communication node hops according to its frequency hopping sequence. The time that a pair of communication nodes takes from one rendezvous to the next is called TTR (time to rendezvous, in a time slice length), it is apparent that the smaller the TTR, the higher the utilization of the spectrum resources by the communication system. The above-mentioned condition 1 can be converted into: TTR has an upper bound. Meanwhile, if at a certain time t, channel C is accessed t If there are more than 2 communication nodes, signals of a pair of communication nodes that would cause normal communication are disturbed, resulting in degradation or even failure of communication quality, which we call collision (collision). Thus, condition 2 mentioned above can be converted into: the frequency of convergence of all the frequency hopping sequences on the same channel at the same time is ensured to be equal to 1.
In order to meet the two conditions as far as possible, the embodiment of the invention provides a low-orbit satellite link frequency hopping communication method, which is shown in fig. 1.
Step 1, firstly, determining a pair of communication nodes in the satellite communication process, namely a communication node A and a communication node B;
step 2, determining the total number of the channels currently available as N, with the number of 0,1 … N-1, and constructing a generating matrix M of N x N based on the total number of the channels N A And generating matrix M B The following is shown:
Figure BDA0003687284710000061
step 3, generating matrix M A And generating matrix M B And carrying out number allocation.
Communication node a randomly assigns N numbers of N channels to M A The number in each column is the same and the numbers between different columns are different;
the communication node B randomly allocates N numbers of N channels to M B Is different from the row, one "dummy row" means that it is located at M B Is not required to be in the same row. After the allocation is completed, M B Is different for each column of elements and may be the same for each row.
Step 4, the communication node A and the communication node B respectively expand the self generating matrix according to the row sequence to obtain N-containing data 2 Frequency hopping sequence S of individual elements A And S is B . To be used for
Figure BDA0003687284710000062
For example, M A Spreading in line order means S A Satisfy->
Figure BDA0003687284710000063
Step 5, the communication node A and the communication node B respectively follow the frequency hopping sequence S A And a hopping sequence S B Frequency hopping is performed.
In another embodiment, a low-orbit satellite link frequency hopping communication system is disclosed, see fig. 2, comprising:
the communication node determining module is used for determining a pair of communication nodes in the satellite communication process, namely a communication node A and a communication node B;
a generator matrix construction module for constructing a generator matrix M of the home communication node A A And a generator matrix M of a home communication node B B The generator matrix M A And generating matrix M B Matrix of N, N is total number of current available channels;
a number allocation module for generating matrix M A And generating matrix M B Performing number allocation to obtain a generator matrix M after the number allocation A And a number-assigned generator matrix M B ；
Matrix expansion module for respectively allocating the numbers to the generated matrix M A And a number-assigned generator matrix M B Expanding in line order to obtain a matrix containing N 2 Frequency hopping sequence S of individual elements A And a hopping sequence S B ；
A frequency hopping execution module for making the communication node A and the communication node B respectively according to the frequency hopping sequence S A And a hopping sequence S B Frequency hopping is performed.
In a pair of communication nodes including a sender and a receiver, in a specific embodiment, the communication node a may be the sender, and the corresponding communication node B may be the receiver, and if the communication node a is the receiver, the communication node B may be the sender.
Example 1
The following describes an example in which the communication node a is a sender, the communication node B is a receiver, and n=3, and the operation procedure of the above method is shown.
(1) Sender a randomly assigns three numbers {0,1,2} to M A N columns of (C) to obtain M A ：
Figure BDA0003687284710000071
(2) Receiver B randomly assigns three numbers {0,1,2} to M B N "dummy rows" of (1) to obtain M B ：
Figure BDA0003687284710000072
It can be seen that M B The three elements of each column are not identical. { b 11 ,b 22 ,b 13 "pseudo-row" is a row in which three elements are in different columns but not in the same row.
(3) Will M A And M B Spread in line order to obtain hopping sequences S of A and B A And S is B ：
S A ＝{1,2,0,1,2,0,1,2,0}；
S B ＝{1,0,1,2,1,0,0,2,2}；
It can be seen that the two hopping sequences constructed according to the above method are in one period t=n 2 Which must meet on N tracks. In fact, due to M A N elements in each column are the same, and M B N elements within each column are different, thus in M A An element is present on each column of M B The co-located elements have the same value as they do, i.e. a convergence occurs once in the hopping sequence, i.e. ttr=n; and M is A N elements within each row are not identical, and thus are in M A N times the convergence occurs on N columns of (a) must also be on N different tracks. And because of S A And S is B Is all N in length 2 This also ensures that it is at N 2 The convergence may take place N times over N tracks in time. In the above embodiment, S A And S is B The convergence occurs at time slices 0, 5, and 7, respectively. A schematic diagram of this process is shown in FIG. 3 (circle labeled M A And M B Elements of the same value in the same position, with the dotted circle S A And S is equal to B Time at which convergence occurs).
At the same time M A The identical nature of the N elements within each column also ensures that they can still maintain their efficiency in the event of a clock mismatch. When both clocks are delayed by k time slice lengths (here it is assumed that the communication node B clock is delayed by k time slice lengths from a), both hopping sequences will still be in N 2 N convergence occurs over N tracks in time. In the above embodiment, if k=2, the convergence is as shown in fig. 4 (the dotted circle is S A And S is equal to B Time at which convergence occurs).
In fact, in case two communication node clocks are delayed by k time slice lengths, two hopping sequences S A And S is B Can be regarded as a convergence of S in the case of clock synchronization A Frequency hopping sequence obtained after k-bit rotation
Figure BDA0003687284710000082
And S is equal to B Is a function of the interaction conditions of the device. Let k-bit rotation (S, k) of the hopping sequence S with one period T (i.e. containing T elements) be defined as:
rotate(S,k)＝{b j |b j ＝a (j+k)modT ,j∈[0,T-1]}；
as in the case of the above-described embodiments,
Figure BDA0003687284710000081
it is in combination with S B The interaction situation in the case of clock synchronization (starting from time slice 2) is exactly the same = {1,0,1,2,1,0,0,2,2 }. Further, it is easy to see from the execution of the construction algorithm that +.>
Figure BDA0003687284710000097
Can be regarded as a generator matrix +.>
Figure BDA0003687284710000091
And (5) constructing a frequency hopping sequence.
Figure BDA0003687284710000092
While
Figure BDA0003687284710000093
Precisely by M A Is shifted left 2 times. Due to M A N elements within each column of (a) are of the same nature, whether M A How many times to shift left (corresponding to the number k of time slice lengths of the communication nodes a and B clock delays),
Figure BDA0003687284710000094
will all sum up with M B There are N elements of identical position and value, therefore +.>
Figure BDA0003687284710000095
And S is B That is to say, will be at N 2 N convergence occurs over N tracks in time.
Example 2
The method provided by the invention is mainly deployed on earth stations and satellites and is used for realizing the efficient utilization of spectrum resources of a user link and a feeder link. Correspondingly, a frequency hopping frequency generator needs to be added to the device of the existing communication system for generating the frequency hopping sequence. Therefore, in the existing satellite communication process, a construction process of a frequency hopping sequence needs to be added, and the construction process is located after a modulation process, that is, a modulated signal determines a channel for communication according to the frequency hopping sequence, and then a frequency converter performs subsequent steps such as frequency conversion. The specific implementation of this algorithm will be described below by taking the total number of available channels n=4 as an example.
The user link and the feeder link are similar in communication manner, and the present embodiment will be described by taking the user link as an example. Assume at time t that user terminal a requests to communicate with satellite B, a total of four channels may provide communication resources, numbered 0,1,2,3. After the user signal of the user terminal A arrives at the earth station, a baseband processor on the earth station converts the signal into a baseband signal, modulates the baseband signal and sends the baseband signal into a frequency hopping frequency generator. According to the method provided by the invention, the hopping frequency generator randomly distributes the four numbers of {0,1,2,3} to M A N columns of (C) to obtain M A ：
Figure BDA0003687284710000096
Thereby generating a hopping sequence S of the user terminal A A = {2,1,3,0,2,1,3,0,2,1,3,0,2,1,3,0}. Meanwhile, the hopping frequency generator of the on-board processing device randomly allocates {0,1,2,3} four numbers to M B N "dummy rows" of (1) to obtain M B ：
Figure BDA0003687284710000101
Thereby generating a hopping sequence S of satellite B B = {2,3,3,0,1,0,1,2,0,1,2,3,3,2,0,1}. The earth station then sends the generated frequency hopping signal to a frequency converter and transmits it through a power amplifier. At the same time, on-board processing apparatusAnd intercepting a corresponding channel according to the generated frequency hopping signal. Even if the clocks of the user terminal A and the satellite B have delays, the clock can be guaranteed to be in N 2 Guaranteed to meet on 4 different frequency channels within 16 time slices to complete uplink communication as shown in fig. 5 (delay time slice number k=1 in fig. 5). The downlink communication process is similar, and the description of this embodiment is omitted.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other. For the device system disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (6)

1. The low-orbit satellite link frequency hopping communication method is characterized by comprising the following steps of:
determining a pair of communication nodes in the satellite communication process, namely a communication node A and a communication node B;
construction of a generator matrix M for a home communication node A A And a generator matrix M of a home communication node B B The generator matrix M A And generating matrix M B Matrix of N, N is total number of current available channels;
to generate matrix M A And generating matrix M B Performing number allocation to obtain a generator matrix M after the number allocation A And a number-assigned generator matrix M B ；
Generating matrix M after respectively allocating numbers A And a number-assigned generator matrix M B Expanding in line order to obtain a matrix containing N 2 Frequency hopping sequence S of individual elements A And a hopping sequence S B ；
Communication node A and communication node B respectively follow a frequency hopping sequence S A And a hopping sequence S B Frequency hopping is performed.
2. A method of low-orbit satellite link hopping communications according to claim 1, wherein the method is adapted for communication between a satellite and a gateway station, and between a satellite and a user terminal;
when the method is used for communication between a satellite and a gateway station, the communication node is the satellite and the gateway station; when the method is used for communication between a satellite and a user terminal, the communication node is the satellite and the user terminal.
3. The method of claim 1, wherein the generator matrix M A The method comprises the following steps:
Figure FDA0003687284700000011
generating matrix M B The method comprises the following steps:
Figure FDA0003687284700000012
4. a method of low-orbit satellite link frequency hopping communications according to claim 1, wherein said pair of generator matrices M A And generating matrix M B The method for allocating the numbers comprises the following steps:
communication node a randomly assigns N numbers of N channels to M A The number in each column is the same and the numbers between different columns are different;
the communication node B randomly allocates N numbers of N channels to M B N "dummy rows" of (a) which means that they are located at M B Is a single element of the N elements of the different columns of the same.
5. A method of low-orbit satellite link hopping communications according to claim 3, wherein the hopping sequence S A The method comprises the following steps:
Figure FDA0003687284700000021
S A satisfy->
Figure FDA0003687284700000022
The frequency hopping sequence S B The method comprises the following steps:
Figure FDA0003687284700000023
S B satisfy->
Figure FDA0003687284700000024
Wherein a is ij Representing the generator matrix M A Elements of row i and column j, b ij Representing the generator matrix M B The elements of row i and column j.
6. A low-orbit satellite link frequency hopping communication system, comprising:
the communication node determining module is used for determining a pair of communication nodes in the satellite communication process, namely a communication node A and a communication node B;
a generator matrix construction module for constructing a generator matrix M of the home communication node A A And a generator matrix M of a home communication node B B The generator matrix M A And generating matrix M B Matrix of N, N is total number of current available channels;
a number allocation module for generating matrix M A And generating matrix M B The number assignment is performed and the number assignment is performed,obtaining a number-allocated generator matrix M A And a number-assigned generator matrix M B ；
Matrix expansion module for respectively allocating the numbers to the generated matrix M A And a number-assigned generator matrix M B Expanding in line order to obtain a matrix containing N 2 Frequency hopping sequence S of individual elements A And a hopping sequence S B ；
A frequency hopping execution module for making the communication node A and the communication node B respectively according to the frequency hopping sequence S A And a hopping sequence S B Frequency hopping is performed.
CN202210649837.3A 2022-06-10 2022-06-10 Low-orbit satellite link frequency hopping communication method and system Pending CN116131898A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210649837.3A CN116131898A (en) 2022-06-10 2022-06-10 Low-orbit satellite link frequency hopping communication method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210649837.3A CN116131898A (en) 2022-06-10 2022-06-10 Low-orbit satellite link frequency hopping communication method and system

Publications (1)

Publication Number Publication Date
CN116131898A true CN116131898A (en) 2023-05-16

Family

ID=86296048

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210649837.3A Pending CN116131898A (en) 2022-06-10 2022-06-10 Low-orbit satellite link frequency hopping communication method and system

Country Status (1)

Country Link
CN (1) CN116131898A (en)

Similar Documents

Publication Publication Date Title
Bai et al. Multi-satellite relay transmission in 5G: Concepts, techniques, and challenges
CN110289901B (en) Satellite-ground synchronization method for satellite communication system for on-satellite processing beam hopping
Guidotti et al. Architectures and key technical challenges for 5G systems incorporating satellites
Yan et al. The application of power-domain non-orthogonal multiple access in satellite communication networks
Abramson The throughput of packet broadcasting channels
Vázquez et al. Precoding in multibeam satellite communications: Present and future challenges
Kyrgiazos et al. On the gateway diversity for high throughput broadband satellite systems
Tang et al. Resource allocation for LEO beam-hopping satellites in a spectrum sharing scenario
CN101573893B (en) Upstream resource allocation for satellite communications
Guidotti et al. Architectures, standardisation, and procedures for 5G Satellite Communications: A survey
CN101908920B (en) Working method for satellite communication system based on single channel per carrier time division multiple access
Castro et al. Cross-layer packet scheduler design of a multibeam broadband satellite system with adaptive coding and modulation
Abramson Fundamentals of packet multiple access for satellite networks
CA2264161A1 (en) Radio frequency sharing methods for satellite systems
CN113660031B (en) Agile spot beam bidirectional collaborative polling method for satellite signaling
Shaat et al. Integrated terrestrial-satellite wireless backhauling: Resource management and benefits for 5G
US10715247B2 (en) Dynamic receiver
Roumeliotis et al. Dynamic capacity allocation in smart gateway high throughput satellite systems using matching theory
Alegre et al. Heuristic algorithms for flexible resource allocation in beam hopping multi-beam satellite systems
CN113365339A (en) Satellite access method based on reservation application time slot
Soret et al. 5G satellite networks for IoT: Offloading and backhauling
CN116131898A (en) Low-orbit satellite link frequency hopping communication method and system
Kyrgiazos et al. Gateway diversity via flexible resource allocation in a multibeam SS-TDMA system
Kaneko et al. An evaluation of flexible frequency utilization in high throughput satellite communication systems with digital channelizer
WO2022077141A1 (en) Method and apparatus for determining random access response receiving window, device, and medium

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