Method, device, equipment and storage medium for generating frequency hopping sequence

Abstract

The present application provides a method for generating a frequency hopping sequence, which is applied to a self-organizing network. The method includes: a first device node receives first frequency hopping information broadcast by a second device node, where the first device node is a node of the first self-organizing network and the second device node is a node of the second self-organizing network; the first device node calculates a first frequency hopping sequence based on the first frequency hopping information, where the first frequency hopping sequence is a frequency hopping sequence used by the second self-organizing network; when it is determined based on the first frequency hopping sequence and the second frequency hopping sequence that the first self-organizing network and the second self-organizing network have a target time period, the first device node calculates a third frequency hopping sequence based on the first frequency hopping information; the target time period is a time period in which the first self-organizing network and the second self-organizing network use the same channel, and the second frequency hopping sequence is the frequency hopping sequence used by the first self-organizing network; and the first device node updates the second frequency hopping sequence to the third frequency hopping sequence.

Description

Technical Field

[0001] The present application relates to the field of data transmission, and in particular to a method, apparatus, device, and computer-readable storage medium for generating a frequency hopping sequence. Background Art

[0002] With the rapid development of the wireless communications industry in recent years, wireless spectrum has become an increasingly valuable resource. Numerous studies have shown that some unlicensed frequency bands (such as those used for industrial, scientific, and medical purposes) and licensed frequency bands for mobile communications are overcrowded, while a large number of other licensed frequency bands are often idle. This leads to irrational spectrum resource utilization. To address this issue, researchers have proposed dynamic spectrum management (DSM). This approach improves spectrum resource utilization by matching spectrum resources with spectrum demand. Cognitive radio is a key technology in DSM. Through cognitive radio technology, secondary users (or unlicensed users) can understand their spectrum environment through spectrum sensing and identify spectrum holes (i.e., frequency bands temporarily unused by primary or licensed users). Through learning and understanding, secondary users can adaptively adjust their internal communication mechanisms and change specific wireless operating parameters in real time to adapt to the external wireless environment. This allows secondary users to improve their own system performance without interfering with primary users, thereby increasing spectrum utilization.

[0003] Cognitive Radio Ad Hoc Networks (CRNs) are a key application area of ​​cognitive radio technology. They are used in radio ad hoc networks, such as IoT (Internet of Things) vehicle networks and wireless sensor networks, improving system performance from a spectrum perspective. The operation of a CRN generally consists of the initial networking process and the subsequent data transmission process. During the initial networking process, each node first discovers the network and obtains information about neighboring nodes through node rendezvous, thereby establishing link connections and topology. Unlike traditional radio ad hoc networks, the networking process of CRNs must consider the availability of spectrum resources in both time and space, which increases system complexity. In the temporal dimension, the channel availability at a secondary user's location may vary depending on the primary user's activity time. In the spatial dimension, the channels available to secondary users at different locations may vary due to the spatial location of the primary and secondary users, transmission distance, and channel usage. This variability in spectrum resource availability is known as spectrum resource heterogeneity, and it poses significant challenges to the networking process of CRNs. In a cognitive radio self-organizing network, before secondary user nodes establish a network for data communication, the nodes need to converge. For cognitive nodes that want to communicate with each other, they need to exchange control information on the available channels they share to establish a link.

[0004] However, due to the heterogeneity of spectrum resources, the available channels for a given node may vary, and the available channels between adjacent nodes may also differ. Furthermore, since cognitive radio ad hoc networks lack centralized control from a central node, this convergence process must be completed in a distributed manner, further increasing its implementation difficulty. Therefore, how to avoid frequency overlap between different wireless ad hoc networks has become a growing concern for technical personnel. Summary of the Invention

[0005] The embodiment of the present application provides a method for generating a frequency hopping sequence, which solves the problem of spectrum interference caused by multiple self-organizing networks using channels with the same frequency band.

[0006] In a first aspect, an embodiment of the present application provides a method for generating a frequency hopping sequence, which is applied to a self-organizing network, the method comprising: a first device node receives first frequency hopping information broadcast by a second device node, the first device node being a node of the first self-organizing network, and the second device node being a node of the second self-organizing network; the first device node calculates a first frequency hopping sequence based on the first frequency hopping information, and the first frequency hopping sequence is a frequency hopping sequence used by the second self-organizing network; when it is determined based on the first frequency hopping sequence and the second frequency hopping sequence that there is a target time period between the first self-organizing network and the second self-organizing network, the first device node calculates a third frequency hopping sequence based on the first frequency hopping information; the target time period is a time period in which the first self-organizing network and the second self-organizing network use the same channel, and the second frequency hopping sequence is the frequency hopping sequence used by the first self-organizing network; the first device node updates the second frequency hopping sequence to the third frequency hopping sequence.

[0007] In an embodiment of the present application, a first device node of a first self-organizing network receives frequency hopping information sent by a second device node of a second self-organizing network. The first device node calculates a frequency hopping sequence of the second self-organizing network based on the frequency hopping information, and determines whether the first self-organizing network and the second self-organizing network use the same channel for receiving / sending data and other services in the same time period based on the frequency hopping sequence of the second self-organizing network. In the case where the first self-organizing network and the second self-organizing network use the same channel for receiving / sending data and other services in the same time period, the first device node adjusts the frequency hopping sequence of the first self-organizing network so that the first self-organizing network and the second self-organizing network use different channels in the same time period, thereby avoiding the problem of spectrum interference between the first self-organizing network and the second self-organizing network during operation.

[0008] In combination with the first aspect, in a possible implementation manner, the first frequency hopping information includes an identification number ClusterID, a time slice number SliceID, and a time unit number FrameID of the second self-organizing network.

[0009] In combination with the first aspect, in one possible implementation, the first frequency hopping sequence includes M time unit numbers FrameID, each FrameID corresponds to a service channel number and a time slice number SliceID, and the third frequency hopping sequence is calculated based on the first frequency hopping information, including: calculating the target channel number corresponding to each FrameID according to the FrameID in the first frequency hopping sequence, to obtain the third frequency hopping sequence.

[0010] In combination with the first aspect, in one possible implementation, the target channel number corresponding to each FrameID is calculated according to the FrameID in the first frequency hopping information, including: calculating the target parameter Temp according to the FrameID; calculating the target channel number based on Temp, the target channel number satisfies formula (1), and formula (1) is: PhyCh = (Temp + LogChOffset * M' + ClusterOffset) mod N; wherein PhyCh is the target channel number, LogChOffset is a parameter that is numerically equal to the logical channel number of the first self-organizing network, N is the number of service channels, ClusterOffset satisfies formula (2), and formula (2) is: ClusterOffset = ClusterIDModM'; wherein ClusterID is the identifier of the second self-organizing network, M' is the first variable, and M' satisfies formula (3), and formula (3) is: in, Indicates rounding down.

[0011] In combination with the first aspect, in one possible implementation, the target parameter Temp is calculated according to the FrameID, specifically including: calculating the first parameter T1 according to the FrameID, T1 satisfies formula (4), and formula (4) is as follows: T1 = FrameIDAddClusterID x-1：0 ; Among them, ClusterID x-1：1 To select the x-1th bit to the 0th bit of the identifier of the second self-organizing network, x is the number of bits of FrameID, and Add is an addition operation; T1 is permuted by formula (5) to obtain the second parameter T2, formula (5) is: T2 = Permute (T1, Controlword_1); wherein Controlword_1 is the control word.

[0012] In combination with the first aspect, in one possible implementation, before performing a permutation operation on T1 using formula (5) to obtain the second parameter T2, the method further includes: calculating Controlword_1 according to formula (6), where formula (6) is: Controlword_1 = (SliceID + FrameID + ClusterID) mod 1024; wherein SliceID is the time slice number corresponding to FrameID.

[0013] In a second aspect, an embodiment of the present application provides a device for generating a frequency hopping sequence, including:

[0014] a receiving unit, configured to receive the first frequency hopping information broadcast by the second device node;

[0015] A first calculation unit, configured to calculate a first frequency hopping sequence based on the first frequency hopping information;

[0016] a second calculating unit, configured to calculate a third frequency hopping sequence according to the first frequency hopping information when it is determined based on the first frequency hopping sequence and the second frequency hopping sequence that the first self-organizing network and the second self-organizing network exist in a target time period;

[0017] An updating unit is configured to update the second frequency hopping sequence to a third frequency hopping sequence.

[0018] With reference to the second aspect, in one possible implementation, calculating a third frequency hopping sequence according to the first frequency hopping sequence includes:

[0019] According to the FrameID in the first frequency hopping sequence, the target channel number corresponding to each FrameID is calculated to obtain the third frequency hopping sequence.

[0020] In combination with the second aspect, in one possible implementation method, according to the FrameID in the first frequency hopping sequence, the target channel number corresponding to each FrameID is calculated, including: calculating the target parameter Temp according to the FrameID; calculating the target channel number based on Temp, the target channel number satisfies formula (1), and formula (1) is: PhyCh = (Temp + LogChOffset * M' + ClusterOffset) mod N; wherein PhyCh is the target channel number, LogChOffset is a parameter that is numerically equal to the logical channel number of the first self-organizing network, N is the number of service channels, ClusterOffset satisfies formula (2), and formula (2) is: ClusterOffset = ClusterIDModM'; wherein ClusterID is the identifier of the second self-organizing network, M' is the first variable, M' satisfies formula (3), and the formula (3) is: in, Indicates rounding down.

[0021] In conjunction with the second aspect, in one possible implementation, the target parameter Temp is calculated based on the FrameID, specifically including: calculating a first parameter T1 based on the FrameID, T1 satisfies formula (4), which is as follows: T1 = FrameIDAddClusterID x-1：0 ; Among them, ClusterID x-1：0To select the x-1th bit to the 0th bit of the identifier of the second self-organizing network, x is the number of bits of FrameID, and Add is the addition operation; T1 is permuted by formula (5) to obtain the second parameter T2, formula (5) is: T2 = Permute (T1, Controlword_1) where Controlword_1 is the control word.

[0022] In combination with the second aspect, in one possible implementation, before performing a permutation operation on T1 using formula (5) to obtain the second parameter T2, the method further includes: calculating Controlword_1 according to formula (6), where formula (6) is: Controlword_1 = (SliceID + FrameID + ClusterID) mod 1024; wherein SliceID is the time slice number corresponding to FrameID.

[0023] In a third aspect, an embodiment of the present application provides a device for generating a frequency hopping sequence, the device comprising: one or more processors and a memory; the memory is coupled to the one or more processors, the memory is used to store computer program code, the computer program code comprises computer instructions, the one or more processors call the computer instructions to enable the electronic device to execute the method as described in the first aspect or any possible implementation method of the first aspect.

[0024] In a fourth aspect, an embodiment of the present application provides a chip system, which is applied to an electronic device, and the chip system includes one or more processors, which are used to call computer instructions to enable the electronic device to execute the method described in the first aspect or any possible implementation method of the first aspect.

[0025] In a fifth aspect, an embodiment of the present application provides a computer program product comprising instructions, which, when run on an electronic device, enables the electronic device to execute the method described in the first aspect or any possible implementation of the first aspect.

[0026] In a sixth aspect, an embodiment of the present application provides a computer-readable storage medium comprising instructions, which, when executed on an electronic device, enables the electronic device to execute the method described in the first aspect or any possible implementation of the first aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 This is a schematic diagram of the structure of an Ad Hoc network provided in an embodiment of the present application;

[0028] Figure 2A is a schematic diagram of a wireless self-organizing network provided by an embodiment of the present application;

[0029] Figure 2B is another set of wireless self-organizing network schematic diagrams provided in an embodiment of the present application;

[0030] Figure 2C is another set of wireless self-organizing network schematic diagrams provided in an embodiment of the present application;

[0031] Figure 3 This is an example diagram of a frequency hopping sequence provided in an embodiment of the present application;

[0032] Figure 4 This is a schematic diagram of frequency hopping for data transmission by nodes in a self-organizing network provided by an embodiment of the present application;

[0033] Figure 5 This is a flow chart of a frequency hopping method provided in an embodiment of the present application;

[0034] Figure 6 This is a bit replacement flow chart provided in an embodiment of the present application;

[0035] Figure 7 This is an example diagram of a permutation operation of a permutation function provided in an embodiment of the present application;

[0036] Figure 8 This is a schematic structural diagram of a device for generating a frequency hopping sequence provided in an embodiment of the present application;

[0037] Figure 9 This is a structural diagram of a frequency hopping sequence generation device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0038] The technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Mentioning "embodiment" in this article means that the specific features, structures or characteristics described in conjunction with the embodiment can be included in at least one embodiment of the present embodiment application. The appearance of this phrase in various positions in the specification does not necessarily mean the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It can be understood explicitly and implicitly by those skilled in the art that the embodiments described herein can be combined with other embodiments. Based on the embodiments in this application, all other embodiments obtained by those of ordinary skill in the art without making creative work are within the scope of protection of this application.

[0039] In the specification, claims, and accompanying drawings of this application, the terms "first," "second," "third," and the like are used to distinguish different objects and are not used to describe a particular order. Furthermore, the terms "including," "comprising," "having," and any variations thereof are intended to cover non-exclusive inclusions. For example, a list of steps or elements may be included, or alternatively, steps or elements not listed may be included, or other steps or elements may be included that are inherent to the process, method, product, or apparatus.

[0040] Only part relevant to the present application is shown in the accompanying drawings, not all of it. Before discussing exemplary embodiments in more detail, it should be mentioned that some exemplary embodiments are described as processing or methods depicted as flow charts. Although flow charts describe various operations (or steps) as sequential processing, many operations therein can be implemented in parallel, concurrently or simultaneously. In addition, the order of various operations can be rearranged. When its operation is completed, the processing can be terminated, but can also have additional steps not included in the accompanying drawings. The processing can correspond to methods, functions, procedures, subroutines, subprograms, etc.

[0041] As used in this specification, the terms "component," "module," "system," "unit," and the like are used to refer to computer-related entities, hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a unit can be, but is not limited to, a process running on a processor, a processor, an object, an executable file, an execution thread, a program, and / or distributed between two or more computers. In addition, these units can be executed from various computer-readable media having various data structures stored thereon. Units can communicate, for example, through local and / or remote processes based on signals having one or more data packets (e.g., data from a second unit interacting with another unit in a local system, a distributed system, and / or a network. For example, the Internet interacts with other systems via signals).

[0042] Frequency hopping communication, a branch of spread spectrum communication, boasts strong anti-interference capabilities. Frequency hopping communication involves synchronous frequency changes between the transmitter and receiver, with the carrier frequency constantly hopping. Both parties must use the same frequency hopping sequence. This sequence can include the numbers of multiple traffic channels, allowing both parties to transmit and receive data using the corresponding traffic channels during frequency hopping.

[0043] Wireless ad hoc networks (Cognitive Radio Ad Hoc Networks, Ad Hoc) are decentralized, multi-hop, temporary autonomous systems formed by a group of devices with both terminal and routing functions via wireless links. Their purpose is to transmit information flows that meet certain quality of service requirements through dynamic routing and mobility management technologies. Wireless ad hoc networks are a new type of network that does not require any infrastructure support. Nodes self-organize to form a multi-hop wireless network. During communication, if the source and destination nodes are not within direct communication range, communication can be achieved through the use of intermediate nodes as relays. When an intermediate node helps other nodes relay, it first receives the packet sent by the previous node. Then, it forwards the packet to the next node to achieve relay.

[0044] In an Ad Hoc, nodes can communicate with each other through an air interface protocol, and each node uses the same frequency hopping sequence when sending and receiving data. Figure 1 This is a schematic diagram of the structure of an Ad Hoc network provided in an embodiment of the present application. The Ad Hoc network includes four nodes, namely node 1, node 2, node 3, and node 4. These four nodes correspond to four devices, which can be base stations or terminal devices, or other devices for sending and receiving data, which are not limited in this embodiment of the present application.

[0045] Among them, the base station described in the embodiment of the present application is a device that connects the terminal to the wireless network, including but not limited to: evolved Node B (eNB), radio network controller (RNC), Node B (NB), base station controller (BSC), base transceiver station (BTS), home base station (for example, home evolved nodeB, or home node B, HNB), baseband unit (BBU), base station (g nodeB, gNB), transmission point (TRP), transmitting point (TP), mobile switching center, etc. In addition, it can also include WiFi access point (AP), etc.

[0046] The terminal device described in the embodiment of the present application can be a device with wireless transceiver function that can be deployed on land, including indoors or outdoors, handheld, wearable or vehicle-mounted; it can also be deployed on the water surface (such as ships, etc.); it can also be deployed in the air (such as airplanes, balloons and satellites, etc.). The terminal device can be a mobile phone (Mobile Phone), Internet of Things (IoT) terminal device, tablet computer (Pad), computer with wireless transceiver function, virtual reality (Virtual Reality, VR) terminal device, augmented reality (Augmented Reality, AR) terminal device, wireless terminal in industrial control (Industrial Control), wireless terminal in self-driving (Self Driving), wireless terminal in remote medical (Remote Medical), wireless terminal in smart grid (Smart grid), wireless terminal in transportation safety (Transportation Safety), wireless terminal in smart city (Smart City), wireless terminal in smart home (Smart Home), etc. The embodiment of the present application does not limit the application scenario. The terminal device may also be sometimes referred to as user equipment (UE), access terminal equipment, UE unit, UE station, mobile station, mobile station, remote station, remote terminal equipment, mobile device, UE terminal equipment, terminal equipment, wireless communication equipment, UE agent or UE device, etc. The terminal device may also include a relay node, that is, any device that can communicate data with a base station can be used as the terminal device in the embodiments of the present application. For the sake of convenience of description, UE may be used for introduction.

[0047] The construction of an Ad Hoc is a gradual process. An Ad Hoc can be constructed by merging multiple independent Ad Hoc networks, adding nodes, or combining the two methods. This embodiment of the present application does not limit this. The construction of an Ad Hoc by merging multiple independent Ad Hoc networks is used as an example for explanation.

[0048] like Figure 2A As shown in Figure 1, there are three independent Ad Hoc networks, namely network 1, network 2 and network 3. Network 1 includes nodes 1, 2 and 3, network 2 includes nodes 4, 5 and 6, and network 3 includes nodes 7, 8 and 9. Network 1 and network 2 can be merged to obtain the following: Figure 2BThe self-organizing network 1 shown in FIG. 1 includes nodes 1, 2, 3, 4, 5, and 6. At this time, the nodes in the self-organizing network 1 can communicate through the air interface protocol. Then, the self-organizing network 1 and the network 3 can be merged to obtain the following Figure 2C The self-organizing network 2 shown in FIG. 2 is the final constructed Ad Hoc network. Figure 2C As shown, ad hoc network 2 includes nodes 1, 2, 3, 4, ..., 8, and 9. Each node in ad hoc network 2 can communicate using an air interface protocol. Within the same ad hoc network, each node uses the same frequency hopping sequence when transmitting and receiving data, meaning both the transmitter and receiver change the carrier frequency synchronously.

[0049] It should be understood that the frequency hopping described in the embodiments of the present application refers to the carrier frequency hopping within a wide frequency band according to a certain sequence, which can also be called a frequency hopping sequence. The frequency hopping sequence can include channel numbers. The channel numbers can be rewritten by the transmitting or receiving device after determining a preset number of available channels and arranging the available channels in descending or ascending order based on their frequency. For example, the transmitting or receiving device may obtain available channels with a center frequency of 2.41 GHz, a center frequency of 2.42 GHz, and a center frequency of 2.43 GHz. In this case, the channel with a center frequency of 2.41 GHz is numbered 1, the channel with a center frequency of 2.42 GHz is numbered 2, and the channel with a center frequency of 2.43 GHz is numbered 3. Alternatively, the channel with a center frequency of 2.43 GHz is numbered 1, the channel with a center frequency of 2.42 GHz is numbered 2, and the channel with a center frequency of 2.41 GHz is numbered 3. The channel numbering method is described in the embodiments of the present application for illustrative purposes only and should not limit the scope of protection of the embodiments of the present application.

[0050] The channels described in the embodiments of this application are service channels, and a time unit is the time interval between the start times of two channels in frequency hopping communication. In other words, a time unit is the time interval between two adjacent channels in frequency hopping communication. Optionally, the time unit can also be the time interval between the end times of two adjacent channels in frequency hopping communication. Each time unit is numbered FrameID. Figure 3An example diagram of a frequency hopping sequence provided in an embodiment of the present application assumes that the number of service channels is 38, the number of time units is 64, and the channel numbers are 0, 1, ..., 9, 10, ..., 19, 20, ..., 36, 37. If the frequency hopping sequence of the self-organizing network is {6, 5, 13, 4, 22, 20, 25, 9, 0, 7, 27, 3, 26, 11, 18, 12, 2, 23, 34, 1, 31, 36, 32, 24, 10, 15, 19, 33, 16, 28, 17, 21, 8, 30, 14, 29, 37, 35}. The number X in the frequency hopping sequence represents the channel number. Figure 3 As shown, in the first time unit, the service channel numbered 6 is selected to receive / send data, in the second time unit, the service channel numbered 23 is selected to receive / send data, and in the third time unit, the service channel numbered 13 is selected to receive / send data. Similarly, in the 63rd time unit, the service channel numbered 3 is selected to receive / send data, and in the 38th time unit, the service channel numbered 64 is selected to receive / send data.

[0051] The self-organizing network can use the length of a hopping sequence as the length of a hopping cycle. For example, Figure 3 In the frequency hopping sequence shown, the length of each time unit is T, so the length of each frequency hopping cycle is 63*T. The length of the frequency hopping cycle can also be greater than the length of the frequency hopping sequence, or it can be less than the length of the frequency hopping sequence. The embodiment of the present application takes the length of a frequency hopping cycle being the same as the length of a frequency hopping sequence as an example for explanation. Assuming that the 1st to 64th time units are all within a frequency hopping cycle, after the node in the self-organizing network selects the service channel corresponding to the 64th time unit to receive / transmit data, at the starting time point of the next frequency hopping cycle, the node will select the service channel corresponding to the 1st time unit to receive / transmit data.

[0052] In addition, the self-organizing network can divide a period of time (for example, a day) into multiple time slices Slices. The length of each time slice Slice can be the same as a frequency hopping cycle, and each Slice corresponds to a number SliceID. In a Slice, each time unit corresponds to a number FrameID. Therefore, the specific time can be determined by SliceID and FrameID. The embodiment of the present application takes the example that the length of a single Slice is the same as the length of a frequency hopping cycle. Assume that a day (0:00 to 24:00) is divided into 96 Slices, and the length of each Slice is 15 minutes. Then, the SliceID corresponding to 00:00:00 to 00:14:59 is 0, the SliceID corresponding to 00:15:00 to 00:29:59 is 1, and so on. The SliceID corresponding to 23:45:00 to 23:59:59 is 23. The next day, 00:00:00 to 00:14:59 corresponds to SliceID 0, and so on. Assuming a time period consists of 15 time units, FrameID 0 corresponds to 00:00:00 to 00:00:59, 1 corresponds to 00:01:00 to 00:01:59, and so on. FrameID 14 corresponds to 00:13:00 to 00:13:59, 0 corresponds to FrameID 0, and so on. Therefore, knowing both SliceID and FrameID allows us to determine the specific time. For example, if SliceID = 4 and FrameID = 14, we know the corresponding time is 01:14:00 to 01:14:59.

[0053] In the process of building a self-organizing network, there may be problems with multiple independent networks. Figure 2A-2C In this embodiment, during the construction of Network 2, three independent networks exist: Network 1, Network 2, and Network 3. Different networks may use different frequency hopping sequences. This can cause nodes in different networks to transmit and receive data using the same frequency traffic channel during the same time period, leading to spectrum interference. This can prevent receiving nodes from receiving data during this time period.

[0054] Figure 4 For the above Figure 2A In the figure, from time t1 to time t5, node 1 sends data to node 2 and node 4 sends data to node 5. Figure 4As shown in the figure, assume that the hopping sequence of node 1 includes 64 time units and 38 service channel numbers, and the hopping sequence is {0, 31, 37, 6, ..., 18, 32}. Assume that the hopping sequence of node 2 includes 64 time units and 38 service channel time units, and the hopping sequence is {4, 31, 35, 6, ..., 25, 7}. Figure 4 It can be seen that from time t1 to time t2, node 1 uses service channel 0 to send data to node 2. From time t2 to time t3, it uses service channel 31 to send data to node 2. From time t3 to time t4, it uses service channel 37 to send data to node 2. From time t4 to time t5, it uses service channel 6 to send data to node 2. From time t1 to time t2, it uses service channel 4 to send data to node 5. From time t2 to time t3, it uses service channel 31 to send data to node 5. From time t3 to time t4, it uses service channel 35 to send data to node 5. From time t4 to time t5, it uses service channel 6 to send data to node 5. From time t2 to time t3, node 1 and node 4 use the same channel. From time t4 to time t5, node 1 and node 4 use the same channel. Therefore, during the two time periods from t2 to t3 and from t4 to t5, spectrum interference may occur, resulting in node 2 being unable to receive data sent by node 3 and node 5 being unable to receive data sent by node 4.

[0055] In order to solve the problem of spectrum interference caused by multiple self-organizing networks using the same channel to receive / transmit data in the same time period. An embodiment of the present application provides a frequency hopping method, which includes: a first device node of a first self-organizing network receives frequency hopping information sent by a second device node of a second self-organizing network. The first device node calculates the frequency hopping sequence of the second self-organizing network based on the frequency hopping information, and determines whether the first self-organizing network and the second self-organizing network use the same channel to receive / transmit data and other services in the same time period based on the frequency hopping sequence of the second self-organizing network. In the case that the first self-organizing network and the second self-organizing network use the same channel to receive / transmit data and other services in the same time period, the first device node adjusts the frequency hopping sequence of the first self-organizing network so that the first self-organizing network and the second self-organizing network use different channels in the same time period, thereby avoiding the problem of spectrum interference between the first self-organizing network and the second self-organizing network during operation.

[0056] Based on the above description, combined with Figure 5 , the specific process of a frequency hopping method provided in the embodiment of the present application is exemplarily described. Figure 5 , Figure 5This is a flow chart of a frequency hopping method provided in an embodiment of the present application. The specific process is as follows:

[0057] Step S501: a first device node receives first frequency hopping information broadcasted by a second device node.

[0058] Specifically, the first device node may be a master node of a first ad hoc network, and the second device node may be a master node of a second ad hoc network. A master node in an ad hoc network may broadcast messages such as frequency hopping information to other ad hoc networks, and may also receive broadcast messages sent by master nodes of other ad hoc networks. Furthermore, a master node in an ad hoc network may also modify the frequency hopping sequence of the ad hoc network and implement the modified frequency hopping sequence in the ad hoc network, thereby changing the carrier frequency of each node in the ad hoc network when performing frequency hopping communication.

[0059] Exemplarily, the first self-organizing network can be the above Figure 2A In network 1, the first device node can be the above Figure 2A The second self-organizing network can be the node 1 in Figure 2A In network 2, the second device node can be the above Figure 2A Node 4 in the first frequency hopping information includes the identity of the second self-organizing network ClusterID and the timestamp Timstamp of the second self-organizing network. The Timestamp includes SliceID and FrameID. For the description of SliceID and FrameID, please refer to the above Figure 3 The relevant descriptions about SliceID and FrameID in the embodiments will not be repeated in the embodiments of this application.

[0060] Step S502: The first device node calculates and obtains a first frequency hopping sequence of the second self-organizing network based on the first frequency hopping information.

[0061] Specifically, as mentioned above Figure 3 As described in the embodiment, the specific time can be determined using the SliceID and FrameID. Since there is a delay in the second device node broadcasting the first frequency hopping information, the first device node can use the SliceID and FrameID to determine the specific time when the second device node broadcasts the first frequency hopping information, thereby accurately knowing the specific time when the first frequency hopping information is transmitted. This embodiment of the present application uses the time when the first frequency hopping information is transmitted as the first time as an example for explanation.

[0062] The first device node can determine the frequency hopping sequence of the second self-organizing network based on the permutation function, the input sequence of the permutation function and the control word (Controlword). Among them, the input sequence of the permutation function is determined by FrameID, the number of service channels and ClusterID. The input sequence of the permutation function is the same as the length of FrameID. The embodiment of the present application is described by taking the length of FrameID as 6 bits (bit), the length of ClusterID as 8 bits and the length of SliceID as 11 bits as an example. The input sequence (u0, u1, u2, u3, u4, u5) with a length of 6 bits is subjected to bit permutation operation under the control of Controlword, and finally outputs an output sequence (v0, v1, v2, v3, v4, v5) with a length of 6. Among them, the control word can be calculated according to formula (1), and formula (1) is as follows:

[0063] Controlword=SliceID x-1:0 +2 x-1 *ClusterID (1)

[0064] Among them, SliceID x-1:0 The x-1th to 0th bits of SliceID, where x is the number of bits in FrameID.

[0065] The output sequence (v0, v1, v2, v3, v4, v5) can be converted to a decimal number v, v = 32v5 + 16v4 + 8v3 + 4v2 + 2v1 + v0. The permutation function consists of a series of permutation operations, each of which is controlled by each bit of the Controlword. If the value of the bit is 1, the permutation operation is performed, and if it is 0, it does not. The control of each bit can be as follows Figure 6 As shown, when C k =0, v a =u a , v b =u b When C k =1, v a =u b , v b =u a .

[0066] Next, combine Figure 7 The permutation operation of the permutation function is described exemplarily. Figure 7As shown, (u0, u1, u2, u3, u4, u5) is the input sequence of the permutation function, u0 represents the lowest bit, that is, bit 0. u5 represents the highest bit, that is, bit 5. C0 to C8 represent the 9-bit Controlword, C0 is the lowest bit and C8 is the highest bit. v0 to v5 represent the output sequence of the permutation function, v0 is the lowest bit and v5 is the highest bit. The first step is controlled by C0. When C0=0, no permutation operation is performed. When C0=1, the values ​​of u0 and u1 are permuted. The second step is controlled by C1. When C1=0, no permutation operation is performed. When C1=1, the values ​​of u2 and u3 are permuted. The third step is controlled by C2. When C2=0, no permutation operation is performed. When C2=1, the values ​​of u4 and u5 are permuted. Step 4 is controlled by C3. When C3=0, no permutation operation is performed. When C3=1, the values ​​of u0 and u3 are permuted. Step 5 is controlled by C4. When C4=0, no permutation operation is performed. When C4=1, the values ​​of u1 and u4 are permuted. Step 6 is controlled by C5. When C5=0, no permutation operation is performed. When C5=1, the values ​​of u2 and u5 are permuted. Step 7 is controlled by C6. When C6=0, no permutation operation is performed. When C6=1, the values ​​of u0 and u2 are permuted. Step 8 is controlled by C7. When C7=0, no permutation operation is performed. When C7=1, the values ​​of u1 and u4 are permuted. Step 9 is controlled by C8. When C8=0, no permutation operation is performed. When C8=1, the values ​​of u3 and u5 are permuted. The decimal value v = 32v5 + 16v4 + 8v3 + 4v2 + 2v1 + v0 corresponding to the sequence finally output is the service channel number. For example, when the number of channels is 38, it corresponds to numbers 0 to 37.

[0067] In other words, the first device node can calculate the channel number corresponding to the FrameID and SliceID of the second self-organizing network using the following formula (2), thereby obtaining the sequence of service channel numbers of the second self-organizing network within a single frequency hopping cycle. This sequence is the frequency hopping sequence of the second self-organizing network. Formula (2) is as follows:

[0068] Y=Permute(X,P) (2)

[0069] Where Y is the number of the service channel, Permute(X, P) is a permutation function that permutes X according to P, X is the input sequence of the Permute function, and P is the Controlword. X can satisfy the following formula (3), which is as follows:

[0070] X=mod(b(FrameIDXorClusterID x-1:0 )+SliceID,N) (3)

[0071] Among them, mod() is the remainder function, b() is the input sequence, Xor is the exclusive OR operator, ClusterID x-1:0 =(a, b) = (a, b) / (b) = (a, b) / (b) / ( ...b) / (a, b) /

[0072] Through the above method, after receiving the first frequency hopping information, the first device node can calculate the number of the service channel used by the second self-organizing network in frequency hopping communication at the first moment based on the FrameID, ClusterID, and SliceID in the first frequency hopping information. Then, the channel numbers corresponding to M-1 FrameIDs can be continuously calculated to obtain the frequency hopping sequence of the second self-organizing network within a single frequency hopping cycle. Here, M is the number of time units in the second self-organizing network within a single frequency hopping cycle. For example, assuming that the number of time units in a single frequency hopping cycle is 64, the value range of FrameID is 0-63. If the FrameID in the frequency hopping information received by the first device node is 50, then the service channel corresponding to FrameID=50 is the service channel used by the second self-organizing network during frequency hopping communication at the first moment. Then, the first device node can update the FrameID according to FrameID=FrameID+1 and use the updated FrameID to calculate the corresponding service channel number. Since the value range of FrameID is 0-63, after calculating the number of the service channel corresponding to FrameID=63. At this time, the first device node needs to set the FrameID to 0 and update the SliceID according to the formula SliceID = SliceID + 1 (assuming that SliceID is not the maximum value at this time) to calculate the number of the service channel corresponding to the updated FrameID, until the numbers of M service channels are calculated to obtain a sequence of service channel numbers. This sequence is the frequency hopping sequence of the second self-organizing network.

[0073] Step S503: If it is determined according to the first frequency hopping sequence and the second frequency hopping sequence that there is a period in which the first ad hoc network and the second ad hoc network use the same channel, the first device node calculates a third frequency hopping sequence according to the first frequency hopping sequence.

[0074] Specifically, the second frequency hopping sequence is the frequency hopping sequence currently used by the first ad hoc network, and the first frequency hopping sequence is the set of service channel numbers of the first ad hoc network within a single frequency hopping cycle. The aforementioned same carrier frequency period is the time period during which frequency hopping communications between nodes within the first and second ad hoc networks utilize the same channel. During this period, the first and second ad hoc networks utilize the same carrier frequency, which is reflected in the frequency hopping sequence as the first and second ad hoc networks using channels with the same channel number for communication services during this period. This may result in spectrum interference between the first and second ad hoc networks. To prevent spectrum interference between the first and second ad hoc networks, the first device node can adjust the frequency hopping sequence of the first ad hoc network to prevent the first and second networks from using the same channel during the same period. This means that nodes within the first and second ad hoc networks use the same carrier frequency during frequency hopping communications, which could cause spectrum interference between the first and second ad hoc networks.

[0075] The first device node can calculate the third frequency hopping sequence based on the first frequency hopping information. The following is an exemplary description of the process of the first device node calculating the third frequency hopping sequence based on the first frequency hopping information. The first device node can obtain the first parameter using formula (4), which is as follows:

[0076] T1=FrameIDAddClusterID x-1：0 (4)

[0077] Among them, T1 is the first parameter, FrameID and ClusterID are binary numbers, ClusterID x-1：0 Indicates taking the x-1th bit to the 0th bit of ClusterID, where x is the number of bits of FrameID and Add is a binary "add" operation. This embodiment of the application takes FrameID as 6 bits and ClusterID as 11 bits as an example for explanation. Assuming FrameID = 011011, ClusterID = 01110001110, then ClusterID x-1：0 =001110, add 011011 and 001110 to get T1=101001.

[0078] It should be understood that the number of bits in T1 should be consistent with FrameID. x-1：0When performing an Add operation on a binary number and there is a carry in the highest bit, only the lower 6 bits of the binary number are retained as T1. For example, 100001Add100001=1000010. 1000010 is a 7-bit binary number. Since T1 is required to be a 6-bit binary number, only the lower 6 bits of 1000010 are retained as T1, that is, T1=000010.

[0079] After calculating T1, T1 is replaced by the replacement function Permute() to obtain the second parameter T2, that is: T2 = Permute(T1, Controlword_1). Among them, T1 is the input sequence of Permute, T2 is the output sequence of Permute(), and Controlword_1 is the control word. Figure 7 In the implementation, Permute() replaces T1 with the control word Controlword_1. The calculation method of Controlword_1 can refer to formula (5), which is as follows:

[0080] Controlword_1=(SliceID+FrameID+ClusterID)mod 1024 (5)

[0081] It should be understood that after the first device node updates the FrameID and / or SliceID, it will update the Controlword according to the above formula (5). The process of the first device node replacing T1 with T2 through Permute() can refer to the above Figure 7 The permutation operation of the permutation function is exemplarily described in the embodiment and will not be repeated here.

[0082] After calculating T2, the first device node can calculate the channel number PhyCh of the target channel according to formula (6). Formula (5) is as follows:

[0083] PhyCh=(Temp+LogChOffset*M′+ClusterOffset)modN (6)

[0084] Wherein, LogChOffset is a parameter having a value equal to the channel ID (LogicID) of the logical channel of the first self-organizing network, mod is a modulo function, N is the number of service channels, and ClusterOffset can be obtained by formula (7), which is as follows:

[0085] ClusterOffset=ClusterIDModM′ (7)

[0086] ClusterID is the identifier of the second self-organizing network. Indicates rounding down. Temp can be obtained by formula (8), which is as follows:

[0087] Temp=(T2+ClusterID L-x+1：L )modN (8)

[0088] Among them, ClusTerID L-x+1：L = is the L-x+1th bit to the Lth bit in the ClusterID of the second self-organizing network, where L is the most significant bit of the ClusterID. For example, if ClusterID = 10011100, then L = 7. Starting from the 0th bit of ClusterID, the values ​​of the 0th bit to the 7th bit (most significant bit) of ClusterID are 0, 0, 1, 1, 1, 0, 0, 1 respectively; therefore, ClusterID L-x+1：L To take the high 6 bits of 10011100, ClusterID L-x+1：L =100111.

[0089] Using formulas (4) to (7), the first device node can calculate the target channel number PhyCh. The first device node can continuously calculate M1 PhyChs based on the FrameID and SliceID of the second self-organizing network updated in step S502 to obtain a PhyCh sequence, which is the third frequency hopping sequence. M1 is the number of time units in a single frequency hopping cycle of the second self-organizing network.

[0090] Optionally, before the first device node calculates the third frequency hopping sequence based on the first frequency hopping information, the first device node may determine whether to calculate the third frequency hopping sequence based on a pre-set negotiation mechanism. In one possible implementation, the first device node may determine whether it meets the conditions for calculating the third frequency hopping sequence by whether K%3 is 0. Here, K is the number of nodes in the first self-organizing network, and % is a remainder operator. When it is determined that the first self-organizing network and the second self-organizing network have the same carrier frequency period based on the frequency hopping sequence of the second self-organizing network, and when K%3, the first device node calculates the third frequency hopping sequence. Otherwise, the first device node does not calculate the third frequency hopping sequence, and the second self-organizing network calculates the frequency hopping sequence based on the frequency hopping information broadcast by the first device node.

[0091] In one possible implementation, the first device node may also determine whether it meets the conditions for calculating the third frequency hopping sequence by determining the relative number of nodes in the first self-organizing network and the second self-organizing network. If the number of nodes in the first self-organizing network is less than the number of nodes in the second network, and if the first self-organizing network and the second self-organizing network have the same carrier frequency period, as determined by the frequency hopping sequence of the second self-organizing network, the first device node calculates the third frequency hopping sequence.

[0092] The embodiment of the present application is described by taking an example where the first device node determines that it meets the conditions for calculating the third frequency hopping sequence based on a pre-set negotiation mechanism.

[0093] Step S504: the first device node updates the second frequency hopping sequence to a third frequency hopping sequence.

[0094] Specifically, after calculating the third frequency hopping sequence, the first device node updates the frequency hopping sequence of the first self-organizing network to the third frequency hopping sequence after an interval of M1*T*M, where M1 is a positive integer, T is the length of a single time unit, and M is the number of time units in a frequency hopping cycle.

[0095] In an embodiment of the present application, a first device node of a first self-organizing network receives frequency hopping information sent by a second device node of a second self-organizing network. The first device node calculates a frequency hopping sequence of the second self-organizing network based on the frequency hopping information, and determines whether the first self-organizing network and the second self-organizing network use the same channel for receiving / sending data and other services in the same time period based on the frequency hopping sequence of the second self-organizing network. In the case where the first self-organizing network and the second self-organizing network use the same channel for receiving / sending data and other services in the same time period, the first device node adjusts the frequency hopping sequence of the first self-organizing network so that the first self-organizing network and the second self-organizing network use different channels in the same time period, thereby avoiding the problem of spectrum interference between the first self-organizing network and the second self-organizing network during operation.

[0096] The above describes in detail the method of the embodiment of the present application. The following provides the relevant devices, equipment, computer-readable storage media, computer programs and chip systems of the embodiment.

[0097] See Figure 8 , Figure 8 1 is a schematic structural diagram of a frequency hopping sequence generation device provided in an embodiment of the present application. The frequency hopping sequence generation device 80 may include a receiving unit 801, a first calculation unit 802, a second calculation unit 803, and an updating unit 804. The detailed description of each unit is as follows:

[0098] A receiving unit 801 is configured to receive first frequency hopping information broadcast by a second device node;

[0099] A first calculation unit 802 is configured to calculate a first frequency hopping sequence based on the first frequency hopping information;

[0100] The second calculation unit 803 is configured to calculate a third frequency hopping sequence according to the first frequency hopping information when it is determined based on the first frequency hopping sequence and the second frequency hopping sequence that the first self-organizing network and the second self-organizing network exist in a target time period;

[0101] The updating unit 804 is configured to update the second frequency hopping sequence to a third frequency hopping sequence.

[0102] In one possible implementation, calculating the third frequency hopping sequence according to the first frequency hopping sequence includes:

[0103] According to the FrameID in the first frequency hopping sequence, the target channel number corresponding to each FrameID is calculated to obtain the third frequency hopping sequence.

[0104] In one possible implementation, the target channel number corresponding to each FrameID is calculated according to the FrameID in the first frequency hopping sequence, including: calculating a target parameter Temp according to the FrameID; calculating the target channel number based on Temp, the target channel number satisfies formula (1), and formula (1) is: PhyCh = (Temp + LogChOffset * M' + ClusterOffset) mod N; wherein PhyCh is the target channel number, LogChOffset is a parameter that is numerically equal to the logical channel number of the first self-organizing network, N is the number of service channels, ClusterOffset satisfies formula (2), and formula (2) is: ClusterOffset = ClusterIDModM'; wherein ClusterID is an identifier of the second self-organizing network, M' is a first variable, and M' satisfies formula (3), and formula (3) is: in, Indicates rounding down.

[0105] In one possible implementation, the target parameter Temp is calculated based on the FrameID, specifically including: calculating a first parameter T1 based on the FrameID, where T1 satisfies formula (4), which is as follows: T1 = FrameIDAddClusterID x-1：0 ; Among them, ClusterID x-1：0To select the x-1th bit to the 0th bit of the identifier of the second self-organizing network, x is the number of bits of FrameID, and Add is the addition operation; T1 is permuted by formula (5) to obtain the second parameter T2, formula (5) is: T2 = Permute (T1, Controlword_1) where Controlword_1 is the control word.

[0106] In one possible implementation, before performing a permutation operation on T1 using formula (5) to obtain the second parameter T2, the method further includes: calculating Controlword_1 according to formula (6), where formula (6) is: Controlword_1 = (SliceID + FrameID + ClusterID) mod 1024; wherein SliceID is the time slice number corresponding to FrameID.

[0107] See Figure 9 , Figure 9 is a schematic structural diagram of a frequency hopping sequence generation device provided in an embodiment of the present application. The frequency hopping sequence generation device 90 may include a memory 901 and a processor 902. A detailed description of each unit is as follows:

[0108] The memory 901 is used to store program codes.

[0109] The processor 902 is configured to call the program code stored in the memory to execute the following steps:

[0110] Receive first frequency hopping information broadcast by a second device node, where the second device node is a node of a second self-organizing network; calculate a first frequency hopping sequence based on the first frequency hopping information, where the first frequency hopping sequence is a frequency hopping sequence used by the second self-organizing network; when it is determined based on the first frequency hopping sequence and the second frequency hopping sequence that there is a target time period between the first self-organizing network and the second self-organizing network, calculate a third frequency hopping sequence based on the first frequency hopping information; the target time period is a time period in which the first self-organizing network and the second self-organizing network use the same channel, and the second frequency hopping sequence is the frequency hopping sequence used by the first self-organizing network; and update the second frequency hopping sequence to the third frequency hopping sequence.

[0111] In a possible implementation, the processor 902 calculates the third frequency hopping sequence based on the first frequency hopping information, including: calculating the target channel number corresponding to each FrameID according to the FrameID in the first frequency hopping sequence to obtain the third frequency hopping sequence.

[0112] In one possible implementation, the processor 902 calculates the target channel number corresponding to each FrameID according to the FrameID in the first frequency hopping information, including: calculating the target parameter Temp according to the FrameID; calculating the target channel number based on Temp, the target channel number satisfies formula (1), and formula (1) is: PhyCh = (Temp + LogChOffset * M' + ClusterOffset) mod N; wherein PhyCh is the target channel number, LogChOffset is a parameter that is numerically equal to the logical channel number of the first self-organizing network, N is the number of service channels, ClusterOffset satisfies formula (2), and formula (2) is: ClusterOffset = ClusterIDModM'; wherein ClusterID is the identifier of the second self-organizing network, M' is the first variable, and M' satisfies formula (3), and formula (3) is: in, Indicates rounding down.

[0113] In one possible implementation, the processor 902 calculates the target parameter Temp according to the FrameID, specifically including: calculating the first parameter T1 according to the FrameID, T1 satisfies formula (4), and formula (4) is as follows: T1 = FrameIDAddClusteriD x-1：0 Among them, ClusteriD x-1：0 To select the x-1th bit to the 0th bit of the identifier of the second self-organizing network, x is the number of bits of FrameID, and Add is an addition operation; T1 is permuted by formula (5) to obtain the second parameter T2, formula (5) is: T2 = Permute (T1, Controlword_1); wherein Controlword_1 is the control word.

[0114] In one possible implementation, before the processor 902 performs a permutation operation on T1 using formula (5) to obtain the second parameter T2, the processor further includes: calculating Controlword_1 according to formula (6), where formula (6) is: Controlword_1 = (SliceID + FrameID + ClusterID) mod 1024; wherein SliceID is the time slice number corresponding to FrameID.

[0115] In the above embodiments, all or part of the embodiments may be implemented by software, hardware, firmware, or any combination thereof. When implemented using software, all or part of the embodiments may be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described herein are generated. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via a wired (e.g., coaxial cable, optical fiber, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) method. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated therein. The available medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive).

[0116] Those skilled in the art will appreciate that all or part of the processes in the above-described method embodiments can be implemented by a computer program instructing the relevant hardware. The program can be stored in a computer-readable storage medium. When executed, the program can include the processes in the above-described method embodiments. The aforementioned storage medium includes various media capable of storing program code, such as ROM or random access memory (RAM), magnetic disks, or optical disks.

[0117] In short, the above description is only an embodiment of the technical solution of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent replacements, improvements, etc. made based on the disclosure of the present invention should be included in the scope of protection of the present invention.

Claims

1. A method for generating a frequency hopping sequence, characterized in that: Applied to a self-organizing network, the method includes: A first device node receives first frequency hopping information broadcast by a second device node, where the first device node is a node of a first self-organizing network and the second device node is a node of a second self-organizing network; The first device node calculates a first frequency hopping sequence based on the first frequency hopping information, where the first frequency hopping sequence is a frequency hopping sequence used by the second self-organizing network; When it is determined based on the first frequency hopping sequence and the second frequency hopping sequence that the first self-organizing network and the second self-organizing network have a target period, the first device node calculates a third frequency hopping sequence according to the first frequency hopping information; the target period is a period during which the first self-organizing network and the second self-organizing network use the same channel, and the second frequency hopping sequence is a frequency hopping sequence used by the first self-organizing network; The first device node updates the second frequency hopping sequence to the third frequency hopping sequence.

2. The method according to claim 1, wherein The first frequency hopping information includes the identification number ClusterID, the time slice number SliceID, and the time unit number FrameID of the second self-organizing network.

3. The method according to claim 2, wherein The first frequency hopping sequence includes M time unit numbers FrameID, each FrameID corresponds to a service channel number and a time slice number SliceID, and the first device node calculates a third frequency hopping sequence according to the first frequency hopping information, including: According to the FrameID in the first frequency hopping information, the target channel number corresponding to each FrameID is calculated to obtain the third frequency hopping sequence.

4. The method according to claim 3, characterized in that: The calculating, according to the FrameID in the first frequency hopping information, a target channel number corresponding to each FrameID includes: Calculate the target parameter Temp according to the FrameID; The target channel number is calculated based on the Temp, and the target channel number satisfies formula (1), which is: PhyCh=(Temp+LogChOffset*M′+ClusterOffset)mod N Wherein, the PhyCh is the target channel number, the LogChOffset is a parameter that is numerically equal to the first self-organizing network logical channel number, the N is the number of service channels, and the ClusterOffset satisfies formula (2), which is: ClusterOffset=ClusterID ModM′; Wherein, the ClusterID is the identifier of the second self-organizing network, the M′ is the first variable, and the M′ satisfies formula (3), which is: Among them, the Indicates rounding down.

5. The method according to claim 4, wherein The target parameter Temp is calculated according to the FrameID, specifically including: The first parameter T1 is calculated according to the FrameID, and the T1 satisfies formula (4), which is as follows: T1=FrameID Add ClusterID x-1：0 ; Among them, the ClusterID x-1：0 Selecting the x-1th bit to the 0th bit of the identifier of the second self-organizing network, where x is the number of bits of the FrameID and Add is an addition operation; The T1 is permuted by formula (5) to obtain the second parameter T2. The formula (5) is: T2=Permute(T1,Controlword_1); Wherein, the Controlword_1 is a control word.

6. The method according to claim 5, wherein Before performing a substitution operation on T1 through formula (5) to obtain the second parameter T2, the method further includes: The Controlword_1 is calculated according to formula (6), which is: Controlword_1=(SliceID+FrameID+ClusterID)mod 1024; The SliceID is the time slice number corresponding to the FrameID.

7. The method according to any one of claims 1 to 6, wherein: The first device node is a node with R equal to 0; wherein R=K%3.

8. The method according to any one of claims 1 to 6, wherein: The first device node is a node of the first self-organizing network, and the number of nodes in the first self-organizing network is less than the number of nodes in the second self-organizing network.

9. A device for generating a frequency hopping sequence, characterized in that: Applied to the first device node, including: a receiving unit, configured to receive first frequency hopping information broadcast by a second device node; the first device node is a node of a first self-organizing network, and the second device node is a node of a second self-organizing network; a first calculating unit, configured to calculate a first frequency hopping sequence based on the first frequency hopping information; the first frequency hopping sequence being a frequency hopping sequence used by the second self-organizing network; a second calculating unit, configured to calculate a third frequency hopping sequence according to the first frequency hopping information when it is determined based on the first frequency hopping sequence and the second frequency hopping sequence that the first self-organizing network and the second self-organizing network exist in a target time period; the second frequency hopping sequence being a frequency hopping sequence used by the first self-organizing network; An updating unit is configured to update the second frequency hopping sequence to the third frequency hopping sequence.

10. The apparatus according to claim 9, wherein calculating the third frequency hopping sequence according to the first frequency hopping information comprises: According to the FrameID in the first frequency hopping information, the target channel number corresponding to each FrameID is calculated to obtain the third frequency hopping sequence.

11. The device according to claim 10, characterized in that The calculating, according to the FrameID in the first frequency hopping information, a target channel number corresponding to each FrameID includes: Calculate the target parameter Temp according to the FrameID; The target channel number is calculated based on the Temp, and the target channel number satisfies formula (1), which is: PhyCh=(Temp+LogChOffset*M′+ClusterOffset)mod N; Wherein, the PhyCh is the target channel number, the LogChOffset is a parameter that is numerically equal to the first self-organizing network logical channel number, the N is the number of service channels, and the ClusterOffset satisfies formula (2), which is: ClusterOffset=ClusterID ModM′; Wherein, the ClusterID is the identifier of the second self-organizing network, the M′ is the first variable, and the M′ satisfies formula (3), which is: Among them, the Indicates rounding down.

12. The device according to claim 11, wherein The target parameter Temp is calculated according to the FrameID, specifically including: The first parameter T1 is calculated according to the FrameID, and the T1 satisfies formula (4), which is as follows: T1=FrameID Add ClusterID x-1：0 Among them, the ClusterID x-1：0 Selecting the x-1th bit to the 0th bit of the identifier of the second self-organizing network, where x is the number of bits of the FrameID and Add is an addition operation; The T1 is permuted by formula (5) to obtain the second parameter T2. The formula (5) is: T2=Permute(T1,Controlword_1) Wherein, the Controlword_1 is a control word.

13. The device according to claim 12, wherein Before performing a substitution operation on T1 through formula (5) to obtain the second parameter T2, the method further includes: The Controlword_1 is calculated according to formula (6), which is: Controlword_1=(SliceID+FrameID+ClusterID)mod 1024 The SliceID is the time slice number corresponding to the FrameID.

14. A device for generating a frequency hopping sequence, characterized in that: include: Memory, processor; wherein: The memory is used to store a computer program, wherein the computer program includes program instructions; The processor is configured to call the program instructions so that the generating device executes the method according to any one of claims 1 to 8.

15. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 9 is implemented.

Images