Frequency Hopping Networking Method Based on TDMA
By introducing frequency hopping mechanism and unified time slot management of master nodes in TDMA networking, the problems of poor redistribution capabilities and synchronization stability of traditional networking are solved, and efficient network resource utilization and multi-service transmission support are achieved.
Patent Information
- Application Number
- CN202111472080.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-12-06
- Publication Date
- 2024-11-19
- Estimated Expiration
- 2041-12-06
AI Technical Summary
The traditional networking method based on TDMA is poor when the number of nodes increases, and the network resource redistribution capability is poor. New network nodes or transmission services with higher priority cannot obtain network bandwidth. The stability and reliability of communication depends on synchronization algorithms, and the system synchronizes the network transmission. Great impact.
Adopt the frequency hopping networking method based on TDMA, by constructing a network communication topology structure and generating a network master node, the master node allocates and manages time slot resources in a unified cycle, and adopts a fixed time slot and dynamic time slot allocation mechanism to ensure efficient utilization of network resources. , and prioritize service needs through relay forwarding and voice slot allocation mechanisms to achieve time synchronization and data forwarding.
It improves the utilization rate of network resources, solves the problem of poor resource redistribution capabilities when the number of nodes increases, ensures that new network-entry nodes and priority services acquire bandwidth, enhances communication stability and anti-interference capabilities, and supports transmission of multiple service types.
Smart Images

Figure CN114268996B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of TDMA-based networking communications, and more specifically, to a TDMA-based frequency hopping networking method. Background Art
[0002] TDMA, a commonly used technology in networking, refers to the use of time frames as time division units, and each time frame is further divided into several time slots. A time slot is the minimum time unit that each network node occupies channel resources, and is also the minimum control unit for network topology management.
[0003] However, the traditional networking method has the following technical problems: 1. When the number of nodes in the network increases, the network resource reallocation ability is poor; 2. Relying on the self-transmission and self-reception method to occupy time slots, when the transmission business volume increases, new nodes entering the network or transmission business nodes with higher priority cannot obtain network bandwidth; 3. The stability and reliability of node communication greatly depends on the synchronization algorithm, and system synchronization has a great impact on network transmission. Summary of the invention
[0004] The purpose of the present invention is to overcome the deficiencies of the prior art and provide a frequency hopping networking method based on TDMA, which solves the technical problems raised in the background technology and improves the utilization rate of network resources while meeting the needs of the entire network nodes.
[0005] The object of the present invention is achieved through the following solutions:
[0006] A frequency hopping networking method based on TDMA, comprising the steps of:
[0007] S1, build the network communication topology structure and generate the network master node through competition;
[0008] S2, the master node uniformly allocates and manages time slot resources in network communication periodically.
[0009] Furthermore, step S2 includes a fixed time slot allocation sub-step: after each user node enters the network, it "assigns a seat" to the fixed time slot according to the local ID number, and when there is a service to be sent, it transmits the message at the corresponding time of the next group of fixed time slots closest to itself; and after the user node enters the network, the local fixed time slot is used to periodically send service information within the time frame.
[0010] Furthermore, step S2 includes a dynamic time slot allocation sub-step: when the relay node has no extra time slots to provide message forwarding for its relay sub-node, the relay node applies to the main node for a dynamic time slot through the service for business forwarding of the messages of its relay sub-node; or, when a certain node has a large-traffic transmission service, it applies to the main node through the service, and after the application is successful, the large-traffic transmission service is sent in the local fixed time slot and dynamic time slot within the next time frame.
[0011] Furthermore, step S2 includes a relay forwarding time slot allocation sub-step: when a relay node provides service forwarding for its relay sub-node, it first ensures that its own message sending time slot is sufficient, and then uses the remaining local sending time slots to forward services for it. If there are no remaining local sending time slots or message transmission is in progress, the relay node applies for a dynamic time slot from the master node.
[0012] Furthermore, step S2 includes a voice time slot allocation sub-step: multiple voice time slots in the time frame design are approximately evenly interspersed in all time slots of the time frame, and multiple user nodes in the network can send voice data in the voice time slots, realizing voice transmission by preemption.
[0013] Furthermore, when the master node allocates dynamic time slots, it considers them in the order of pictures, videos, and relay forwarding, giving priority to meeting the large business transmission needs of users of online nodes. Relay nodes and relay sub-nodes do not have the authority to apply for picture\video services and can only meet the message and voice transmission needs of the two.
[0014] Furthermore, in step S2, a protection time slot is provided between the transmission time slots of different user nodes to offset the transmission delay between the nodes.
[0015] Furthermore, step S2 includes the sub-steps of framing and deframing the user data at the physical layer.
[0016] Furthermore, the master node includes an airborne terminal device and supports adaptive relaying.
[0017] Furthermore, the node network entry competition step is included:
[0018] Step 1: For a node with ID n, n≠1, after power-on, it is designed to default to an isolated node state, send a synchronization packet in the synchronization time slot based on the local clock, and broadcast its own ID and isolated node state information;
[0019] Step 2: During the network building time after power-on, node n listens to information from other nodes; if it hears the broadcast information of the master node or the service frame information of the slave node, it immediately exits the master node competition process and starts to synchronize with the master node; if it can only hear the broadcast information of other isolated nodes, it records the ID of the isolated node within one hop range;
[0020] Step 3: When the network building time is over, compare your own ID with the isolated node ID in the monitoring record. If your own ID is the smallest or no other isolated node ID is detected, enter the master node working mode; if an isolated node ID smaller than the local ID is found in the record, exit the master node competition process and set it to enter the slow scan state, waiting to receive the synchronization information of the master node.
[0021] Furthermore, the relay node accessing the network includes the following steps:
[0022] Step 1: The relay node that synchronizes to the network sends a service frame to the master node at the time period when the local service competition is successful;
[0023] Step 2: The relay sub-node that fails to synchronize with the network maintains the receiving state within the superframe and monitors the service information sent in 1);
[0024] Step 3: The relay subnode completes the rough synchronization of the local time with the network according to the network time synchronization information contained in the service frame, and records the source ID and the master node ID in the network contained in the service frame;
[0025] Step 4: The relay subnode sends a relay access request at the relay subnode service contention time. The destination address of the service frame is the ID of the monitored node, and the networking identity is the relay subnode;
[0026] Step 5: After the relay node receives the relay access request frame, if the local relay capability is available, the destination address is changed to the master node ID, the relay access request frame is forwarded to the master node at the relay forwarding service time, and the relay child node ID is recorded in the local relay child node list;
[0027] Step 6: The master node responds to the network access request in the host service. After the relay node monitors it, it forwards the frame at the relay service response time.
[0028] Step 7: After receiving the network access reply frame, the relay node successfully accesses the network, obtains a fixed user time slot, and records the relay node as a local relay node;
[0029] Step 8: After the node is powered on, there are five states: isolated node, master node, child node, relay node, and relay child node. Each state can be transferred due to changes in network topology and communication conditions.
[0030] Furthermore, a routing step based on a secondary relay is included:
[0031] Step 1: Set that only the master node and relay node provide service forwarding function during service transmission, and the relay node only provides forwarding function for its own relay child nodes;
[0032] Step 2: The master node stores a network table of neighbor nodes that can be reached in one hop. The table is updated in each superframe according to the service information of the slave node. When the master node receives a service transmission packet whose destination ID is not its own, it identifies whether it needs to forward it.
[0033] Step 3: After receiving the service frame, the relay node identifies whether the destination address of the frame is its own relay node ID. If so, it forwards the frame according to the local service transmission situation. If not, it discards the frame.
[0034] Further, in step 8, the conditions for state transition include any one or more of the following:
[0035] Condition a: Node ID = 1;
[0036] Condition b: The host computer is forcibly set to the master node state;
[0037] Condition c: If the master node obtains a response from nearby nodes through competition, it will switch to the master node state;
[0038] Condition d: Able to monitor the master node synchronization frame, complete the coarse and fine synchronization of the local time, and successfully access the network through service competition;
[0039] Condition e: The synchronization header of the master node cannot be received, but the service of the nearby sub-nodes can be monitored, and the relay access to the sub-nodes is successfully applied;
[0040] Condition f: The information of the master node and nearby sub-nodes can be monitored, but the service competition in the superframe is unsuccessful, and the application for relay access to the nearby sub-nodes is successful;
[0041] Condition g: No relay node service can be detected within the superframe, and no other sub-node information can be monitored, which means the node is in an out-of-sync state.
[0042] Condition h: The nearby access nodes refuse to provide relay forwarding, and multiple consecutive applications for relay access fail;
[0043] Condition i: Receive the master node synchronization header and successfully enter the network through service competition;
[0044] Condition j: The master node synchronization information is not monitored for more than one out-of-sync period, and no other slave node services are received within the superframe;
[0045] Condition k: The relay child node stops applying for relay network access requests and service forwarding requests to the local node;
[0046] Condition 1: The relay access request of the node that has not yet joined the network is monitored, and the access response is forwarded to the master node, and the local sending time slot is not full;
[0047] Condition m: The master node synchronization information is not heard for more than one out-of-sync period, but other slave node services are heard within the superframe, and the application for relay access is successful.
[0048] Furthermore, the source node locally records the node ID that can be monitored, and includes the prior information of the current path in the sent time slot frame. By monitoring, it is determined in advance whether the frame service transmission path exceeds 1 hop; the node locally refreshes the prior information according to the neighbor node list in each superframe.
[0049] Furthermore, a time synchronization step is included:
[0050] Step 1: After the node is powered on, it chooses to synchronize with the local time base or wait for matching synchronization according to its master-slave mode and ID number configuration information; the master node uses the time set by the host computer as the base; after the non-master node device is powered on, it monitors the network information, completes the rough synchronization of the local clock according to the master node synchronization, service frame or the master node sending time contained in the slave node service frame in the network, and makes a network access request;
[0051] Step 3: Synchronization maintenance. After the node successfully joins the network, it sends local services periodically within the superframe when the service competition is successful, and exchanges the sending time with the master node for precise synchronization to adjust the synchronization error.
[0052] The beneficial effects of the present invention are:
[0053] The present invention at least solves the problem of poor network resource reallocation capability when the number of nodes in the network increases, the problem of new network nodes or transmission service nodes with higher priority failing to obtain network bandwidth and increasing service time slot collisions when the transmission business volume increases, and the problem of poor stability and reliability of networking communication clock synchronization, thereby improving network resource utilization while meeting the needs of all network nodes.
[0054] The embodiment of the present invention includes time slot resource allocation, time synchronization and data forwarding, network management and routing protocol based on TDMA set control information interaction between nodes, so that when the node status changes in the network, the topology structure can converge quickly, and a maximum of 8 nodes can be supported to enter the network within 5s, and the time slot structure reserves the function of expanding the number of nodes entering the network. The whole system has a certain anti-interference ability, provides voice, video, image and other types of service transmission capabilities for the nodes in the network, and automatically allocates channel resources according to the service priority.
[0055] In the embodiment of the present invention, the node networking gives priority to the airborne terminal equipment as the main node, supports two-level adaptive relay, and increases the communication line of sight to more than 200km through forwarding. The time slot resources are uniformly allocated and managed by the master node, which is convenient for system management and channel exchange, avoids communication collisions in the transceiver channel, and increases system stability. The network node clock is synchronized to the master node to reduce maintenance costs. The system has adaptive capabilities, and can quickly maintain the synchronization accuracy within 100ns according to the node power-on self-synchronization, and obtain time slot allocation, terminal status information and configuration information; when the network node status changes (silence, exit from the network), it can quickly converge to the new network topology within the superframe. The nodes of the entire network are independent of the network topology and support node silence and exit operations. The entire system supports concurrent real-time wireless transmission of services such as voice, video / pictures, and digital messages. Except for the voice signal which is in channel preemption mode, other service transmissions allocate bandwidth resources according to the node service priority. BRIEF DESCRIPTION OF THE DRAWINGS
[0056] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.
[0057] Attached Figure 1 Flowchart for selecting the network access time benchmark after the node is powered on;
[0058] Attached Figure 2 Schematic diagram of the synchronization maintenance process between the master and slave nodes (one RTT time synchronization process);
[0059] Attached Figure 3a A first schematic diagram of the time slot division design in the time frame of the present invention;
[0060] Attached Figure 3b A second schematic diagram for designing the time slot division in the time frame of the present invention;
[0061] Attached Figure 4 It is a structural diagram of the synchronization header composition (synchronization frame + service frame) in the present invention;
[0062] Attached Figure 5 This is the flow chart of relay network access;
[0063] Attached Figure 6 This is the main node routing forwarding flow chart;
[0064] Attached Figure 7 Routing and forwarding flow chart for relay nodes;
[0065] Attached Figure 8 It is the node state transition diagram. DETAILED DESCRIPTION
[0066] All features disclosed in all embodiments in this specification, or steps in all methods or processes implicitly disclosed, except for mutually exclusive features and / or steps, can be combined and / or expanded or replaced in any manner.
[0067] One of the embodiments of the present invention is a frequency hopping networking system based on TDMA, the core of which includes four parts: physical layer waveform, synchronization mode, resource allocation and routing protocol, and the designed channel transmission rate can be 5Mbps. It should be noted that within the technical concept of the present invention, other transmission rates can be designed, and the design channel transmission rate of 5Mbps is used as an example for explanation.
[0068] 1. Technical solution for time slot resource allocation
[0069] In response to technical problem 1, in the design of the present invention, the length of a time frame is 1s, which contains 1000 1ms time slots. Each time frame consists of two parts: a synchronization frame and a service frame. The network bandwidth resources are managed by the master node according to the service time slot allocation protocol. The user's minimum transmission time slot (fixed time slot) is allocated according to the node access situation. Dynamic time slot allocation is performed according to service demand and node and service priority. Link bandwidth allocation is tilted towards video\image, which improves network resource utilization while meeting the needs of all network nodes. The specific time slot division is shown in the attached Figure 3a , Attachment Figure 3b , can simultaneously meet the inter-network message transmission needs of 8 nodes, and can provide one channel of 32K rate coded voice transmission and one channel of video\image transmission. When there are more than 8 node access requirements, the video transmission bit rate can be sacrificed to allocate some dynamic time slots to new access nodes. The time slot allocation scheme is allocated according to the following rules:
[0070] 1) According to the π / 4 DQPSK modulation method and Turbo encoding and decoding method of the physical layer, in order to meet the design requirements of 5Mbps transmission rate and 10% margin for each time slot, the maximum user data sent in each time slot can be up to 627Byte, that is, the physical layer will frame and deframe the user data;
[0071] 2) Before networking, each user node should obtain the device ID number, i.e. the node number, by parameter presetting or parameter distribution. This number is unique in the current networking requirements;
[0072] 3) Two 50ms periodic time slots are designed to ensure that users 1 and 2 have a transmission time slot with an interval of no more than 50ms (see the attached Figure 3a , Attachment Figure 3bThe sending time slots of user 1 are: 21ms, 71ms, 121ms, ... 721ms, 771ms), which can meet the needs of nodes in the network topology that need to send periodic services;
[0073] 4) Voice time slot design: For a 5M communication system, the voice transmission rate is not high and the transmission volume is relatively average. Therefore, the 10 voice time slots in the time frame design are approximately evenly interspersed in the 990 time slots of the time frame to ensure that each voice time slot transmits as much valid data as possible, thereby improving transmission efficiency. Multiple users on the network can send voice data in the voice time slot, and voice transmission is achieved through preemption.
[0074] 5) Fixed time slot allocation design: 5 groups of fixed time slots are designed to provide 8 user nodes with time slots for message transmission services within the network. After each user joins the network, he / she will be assigned to a time slot according to his / her local ID number. When there is a service to be sent, the message will be transmitted at the corresponding time of the next group of fixed time slots closest to him / her. After the node joins the network, it can use the local fixed time slots to periodically send service information within the time frame, reducing the probability of competition and conflict in the service time slots.
[0075] 6) Relay forwarding design: When a relay node provides service forwarding for its relay child nodes, it first ensures that its own message sending time slots are sufficient, and then uses the remaining local sending time slots to forward services for them. If there are no remaining local sending time slots or message transmission is in progress, the relay node must apply for dynamic time slots from the master node;
[0076] 7) Dynamic time slot design: 4 groups of dynamic time slots are designed to support the forwarding needs of relay nodes and the transmission needs of large traffic services such as video and image between nodes. When the relay node has no extra time slots to provide message forwarding for its relay sub-nodes, the relay node applies to the main node for a group of dynamic time slots through the service to forward the messages of its relay sub-nodes; or, when a node has a large traffic transmission service such as video and image, it must apply to the main node through the service. After the application is successful, the video and image services can be sent in the local fixed time slots and 4 groups of dynamic time slots within the next 1 second, dynamically and adaptively expanding the node transmission bandwidth according to user needs;
[0077] 8) When the master node allocates dynamic time slots, it considers the order of pictures, videos, and relay forwarding, giving priority to meeting the large business transmission needs of users on the network nodes. Relay nodes and relay sub-nodes do not have the permission to apply for picture\video services, and can only meet the message and voice transmission needs of the two;
[0078] 9) In order to isolate channels, protection time slots are designed between the transmission time slots of different users to offset the transmission delay between nodes.
[0079] In order to quickly and accurately establish normal communication, the master node periodically sends a synchronization header carrying initial synchronization information during communication, and the slave node completes the search and synchronization of the local time zone. The synchronization header contains two parts: synchronization information and service information. The detailed design is shown in the attached Figure 4 In networking communication, the master node periodically sends synchronization information at the first hop of each second (time frame 0), with a total of four time slots. The service frame contains 15 time slots. The master node's network access response, the slave node and relay node's network access request, and the relay node's network access response forwarding all compete at this stage. After the node enters the network, the network clock synchronization is maintained, the node time slot application, the topology structure adjustment and the routing information update are achieved through the service interaction in the synchronization frame.
[0080] 2. Technical solutions involving routing protocols
[0081] For technical problem 2, based on the above, the technical solution for time slot resource allocation divides the routing protocol in the present invention into node access competition, relay node discovery (see Appendix Figure 5 ), routing based on secondary relay (see attached Figure 6 , 7 ) three parts. Node state transfer is attached Figure 8 .
[0082] The node network entry competition protocol is applicable to the network initialization process after the node is powered on, including:
[0083] 1) A node with ID n (n≠1) defaults to its own isolated node status after power-on. It uses the local clock as the reference and sends a hello synchronization packet in the 1st second synchronization time slot to broadcast its own ID, isolated node status and other information;
[0084] 2) Within the 5-second network building cycle after power-on, node n listens to information from other nodes. If it hears the broadcast information of the master node (synchronization frame of the master node) or the service frame information of the slave node (synchronized node), it immediately exits the master node competition process and starts to synchronize with the master node; if it can only hear the broadcast information of other isolated nodes, it records the ID of the isolated node within its one-hop range;
[0085] 3) When the network building time is over, compare your own ID with the isolated node ID in the monitoring record. If your own ID is the smallest or no other isolated node ID is detected, enter the master node (master node) working mode; if it is found that there is an isolated node ID smaller than the local ID in the record, it will immediately exit the master node competition process, enter the slow scan state, and wait to receive the synchronization information of the master node.
[0086] After the network is established, if the master node is disconnected or exits the network, the master node will recommend the node with the smallest ID in the network as the new master node in the synchronous broadcast to save competition time. If the master node does not receive service information from any node within 15 seconds, the node will exit the master node status.
[0087] After the node is powered on, if it cannot monitor the synchronization information of the master node because the line of sight with the master node exceeds the one-hop range, but it can monitor the service frames sent by other nodes within a superframe, it can perform the relay access operation according to the relay node discovery protocol. In the TDMA network, the sending time of each node is allocated and managed by the master node. Therefore, the main work of the relay node discovery protocol is to constrain the isolated node to monitor the service information of the neighboring one-hop access node, complete the handshake with the relay node and the master node, and finally obtain the behavior of the time slot allocation in the network:
[0088] 1) The relay node that is synchronized to the network sends service frames to the master node periodically when the local service competition is successful;
[0089] 2) The relay node that fails to synchronize with the network maintains the receiving state within the superframe and monitors the service information sent in 1);
[0090] 3) The relay node completes the rough synchronization of the local time with the network according to the network time synchronization information contained in the service frame, and records the source ID (relay node ID) and the master node ID in the network contained in the service frame;
[0091] 4) The relay node sends a relay access request at the relay node service contention time. The destination address of the service frame is the ID of the monitored node B, and the networking identity is the relay node;
[0092] 5) After the relay node receives the relay access request frame, if the local relay capability is available, it changes the destination address to the master node ID, forwards the relay access request frame to the master node at the relay forwarding service time, and records the relay child node ID in the local relay child node list;
[0093] 6) The master node responds to the network access request in the host service. After the relay node monitors it, it forwards the frame at the relay service response time.
[0094] 7) After receiving the network access reply frame, the relay node successfully accesses the network, obtains a fixed user time slot, and records the relay node as a local relay node.
[0095] 8) After the node is powered on, there are five states: isolated node, master node, child node, relay node, and relay child node. Each state changes due to changes in network topology, communication conditions, etc., as shown in the attached Figure 8 As shown, the specific rules and conditions for its transfer are as follows:
[0096] a. Node ID = 1;
[0097] b. The host computer is forcibly set to the master node status;
[0098] c. Obtain responses from nearby nodes through master node competition;
[0099] d. Able to monitor the master node synchronization frame, complete the coarse and fine synchronization of local time, and successfully access the network through service competition;
[0100] e. The synchronization header of the master node cannot be received, but the service of the nearby sub-nodes can be monitored, and the relay access to the sub-nodes can be successfully applied to them;
[0101] f. The information of the master node and nearby sub-nodes can be monitored, but the service competition in the superframe is unsuccessful, and the relay access to the nearby sub-nodes is applied for and succeeded;
[0102] g. No relay node service can be detected within the superframe, and no other sub-node information can be heard, and the network is in a state of out-of-sync;
[0103] h. The nearby access nodes refuse to provide relay forwarding, and the relay access application fails three times in a row;
[0104] i. Receive the master node synchronization header and successfully enter the network through service competition;
[0105] j. The master node synchronization information is not monitored for more than one out-of-sync period, and no other slave node services are received within the superframe;
[0106] k. The relay subnode stops applying for relay network access requests and service forwarding requests locally;
[0107] l. Monitor the relay access request of the node that has not joined the network, forward it to the master node to obtain the access response, and the local sending time slot is not occupied;
[0108] m. If the master node synchronization information is not heard for more than one out-of-sync period, but other slave node services are heard within the superframe, the application for relay access to the network is successful.
[0109] The routing protocol based on two-level relay is used to solve the information transmission path decision and link convergence problems during network information interaction. This protocol stipulates that only the main node and relay node provide service forwarding function during service transmission, and the relay node only provides forwarding for its own relay child nodes, which simplifies the algorithm and avoids the generation of loop routing.
[0110] The master node stores a network table of neighbor nodes that can be reached in one hop. The table is updated in each superframe according to the service information of the slave node. When the master node receives a service transmission packet whose destination ID is not its own, it needs to identify whether it needs to forward it. The process is as shown in the attached figure. Figure 6After receiving the service frame, the relay node will identify whether the destination address of the frame is its own relay node ID. If so, it will forward the frame according to the local service transmission situation (giving priority to sending local services). If not, it will discard the frame. The specific process is as shown in the attached Figure 7 .
[0111] In addition to the above rules, the main support of the routing protocol based on the secondary relay is that the source node records the node ID that can be monitored locally, and the prior information of the current path must be included in the sent time slot frame, that is, through monitoring, it is judged in advance whether the service transmission path of the frame exceeds 1 hop. The node should refresh the prior information according to the neighbor node list in each superframe to reduce the impact on the load balancing of the current path.
[0112] 3. Technical solutions for time synchronization design
[0113] In view of technical problem 3, based on the above-mentioned technical solution of time slot resource allocation, the TDMA time synchronization protocol adopted in the present invention realizes an active synchronization method. With the assistance of an external clock (upper computer software timing), through the synchronization frame and service frame interaction information between the master and slave nodes, the clocks of all radio stations can quickly approach the same clock source (master node), solve the same frequency interference, ensure the staggered transmission design of network nodes, and ensure the normal operation of the entire network communication system.
[0114] The time synchronization protocol includes three processes: sending hello synchronization packets when powered on, silent monitoring, coarse synchronization (synchronization frame matching) and synchronization maintenance (RTT time synchronization). After the node is powered on, it chooses to synchronize with the local time base or wait for matching synchronization according to its own master-slave mode, ID number and other configuration information. The process is as follows Figure 1 The master node uses the time set by the host computer as the benchmark. After the non-master node device is powered on, it monitors the network information, completes the rough synchronization of the local clock according to the master node synchronization, service frame or the master node sending time contained in the slave node service frame in the network, and makes a network access request. After the node successfully enters the network, it sends the local service periodically within the 5-second superframe at the time of successful service competition, exchanges the sending time with the master node for fine synchronization, and realizes the adjustment of synchronization error. The synchronization maintenance process is as shown in the attached figure. Figure 2 .
[0115] 4. About the physical layer waveform
[0116] The physical layer waveform in the embodiment of the present invention can be implemented by using π / 4 DQPSK modulation and turbo coding and decoding technology to improve channel receiving sensitivity and anti-interference performance.
[0117] Embodiment 1: A frequency hopping networking method based on TDMA, comprising the steps of:
[0118] S1, build the network communication topology structure and generate the network master node through competition;
[0119] S2, the master node uniformly allocates and manages the time slot resources in the networking communication.
[0120] Embodiment 2: Based on Embodiment 1, step S2 includes a fixed time slot allocation sub-step: after each user node joins the network, it "assigns a seat" to the fixed time slot according to the local ID number, and when there is a service to be sent, it transmits the message at the corresponding time of the next group of fixed time slots closest to itself; and after the user node joins the network, it uses the local fixed time slot to periodically send service information within the time frame.
[0121] Example 3: Based on Example 1, step S2 includes a dynamic time slot allocation sub-step: when the relay node has no extra time slots to provide message forwarding for its relay sub-nodes, the relay node applies to the main node for a dynamic time slot through the service for forwarding services for its relay sub-node messages; or, when a node has a large-traffic transmission service, it applies to the main node through the service, and after the application is successful, the large-traffic transmission service is sent in the local fixed time slot and dynamic time slot within the next time frame.
[0122] Example 4: Based on Example 1, step S2 includes a relay forwarding time slot allocation sub-step: when a relay node provides service forwarding for its relay sub-node, it first ensures that its own message sending time slot is sufficient, and then uses the remaining local sending time slots to forward services for it. If there are no remaining local sending time slots or message transmission is in progress, the relay node applies for a dynamic time slot from the master node.
[0123] Embodiment 5: Based on Embodiment 1, step S2 includes a voice time slot allocation sub-step: multiple voice time slots in the time frame design are approximately evenly interspersed in all time slots of the time frame, and multiple user nodes in the network can send voice data in the voice time slots, thereby realizing voice transmission by preemption.
[0124] Example 6: Based on Example 3, when the master node allocates dynamic time slots, it considers them in the order of pictures, videos, and relay forwarding, giving priority to meeting the large business transmission needs of users of online nodes. Relay nodes and relay sub-nodes do not have the authority to apply for picture\video services and can only meet the message and voice transmission needs of the two.
[0125] Embodiment 7: Based on Embodiment 1, in step S2, a protection time slot is provided between transmission time slots of different user nodes to offset the transmission delay between nodes.
[0126] Embodiment 8: Based on Embodiment 1, step S2 includes sub-steps: framing and deframing user data at the physical layer.
[0127] Embodiment 9: Based on Embodiment 1, the master node includes an airborne terminal device and supports adaptive relaying.
[0128] Embodiment 10: Based on any one of Embodiments 1 to 9, including a node network entry competition step:
[0129] Step 1: For a node with ID n, n≠1, after power-on, it is designed to default to an isolated node state, send a synchronization packet in the synchronization time slot based on the local clock, and broadcast its own ID and isolated node state information;
[0130] Step 2: During the network building time after power-on, node n listens to information from other nodes; if it hears the broadcast information of the master node or the service frame information of the slave node, it immediately exits the master node competition process and starts to synchronize with the master node; if it can only hear the broadcast information of other isolated nodes, it records the ID of the isolated node within one hop range;
[0131] Step 3: When the network building time is over, compare your own ID with the isolated node ID in the monitoring record. If your own ID is the smallest or no other isolated node ID is detected, enter the master node working mode; if an isolated node ID smaller than the local ID is found in the record, exit the master node competition process and set it to enter the slow scan state, waiting to receive the synchronization information of the master node.
[0132] Embodiment 11: Based on any one of Embodiments 1 to 9, the embodiment 11 includes the following steps of relay node accessing the network:
[0133] Step 1: The relay node that synchronizes to the network sends a service frame to the master node at the time period when the local service competition is successful;
[0134] Step 2: The relay node that fails to synchronize with the network maintains a receiving state within the superframe and monitors the service information sent in 1);
[0135] Step 3: The relay subnode completes the rough synchronization of the local time with the network according to the network time synchronization information contained in the service frame, and records the source ID and the master node ID in the network contained in the service frame;
[0136] Step 4: The relay subnode sends a relay access request at the relay subnode service contention time. The destination address of the service frame is the ID of the monitored node, and the networking identity is the relay subnode;
[0137] Step 5: After the relay node receives the relay access request frame, if the local relay capability is available, the destination address is changed to the master node ID, the relay access request frame is forwarded to the master node at the relay forwarding service time, and the relay child node ID is recorded in the local relay child node list;
[0138] Step 6: The master node responds to the network access request in the host service. After the relay node monitors it, it forwards the frame at the relay service response time.
[0139] Step 7: After receiving the network access reply frame, the relay node successfully accesses the network, obtains a fixed user time slot, and records the relay node as a local relay node;
[0140] Step 8: After the node is powered on, there are five states: isolated node, master node, child node, relay node, and relay child node. Each state can be transferred due to changes in network topology and communication conditions.
[0141] Embodiment 12: Based on any one of Embodiments 1 to 9, including a routing step based on a secondary relay:
[0142] Step 1: Set that only the master node and relay node provide service forwarding function during service transmission, and the relay node only provides forwarding function for its own relay child nodes;
[0143] Step 2: The master node stores a network table of neighbor nodes that can be reached in one hop. The table is updated in each superframe according to the service information of the slave node. When the master node receives a service transmission packet whose destination ID is not its own, it identifies whether it needs to forward it.
[0144] Step 3: After receiving the service frame, the relay node identifies whether the destination address of the frame is its own relay node ID. If so, it forwards the frame according to the local service transmission situation. If not, it discards the frame.
[0145] Embodiment 13: Based on Embodiment 11, in step 8, the conditions for state transition include any one or more of the following:
[0146] Condition a: Node ID = 1;
[0147] Condition b: The host computer is forcibly set to the master node state;
[0148] Condition c: If the master node obtains a response from nearby nodes through competition, it will switch to the master node state;
[0149] Condition d: Able to monitor the master node synchronization frame, complete the coarse and fine synchronization of the local time, and successfully access the network through service competition;
[0150] Condition e: The synchronization header of the master node cannot be received, but the service of the nearby sub-nodes can be monitored, and the relay access to the sub-nodes is successfully applied;
[0151] Condition f: The information of the master node and nearby sub-nodes can be monitored, but the service competition in the superframe is unsuccessful, and the application for relay access to the nearby sub-nodes is successful;
[0152] Condition g: No relay node service can be detected within the superframe, and no other sub-node information can be monitored, which means the node is in an out-of-sync state.
[0153] Condition h: The nearby access nodes refuse to provide relay forwarding, and multiple consecutive applications for relay access fail;
[0154] Condition i: Receive the master node synchronization header and successfully enter the network through service competition;
[0155] Condition j: The master node synchronization information is not monitored for more than one out-of-sync period, and no other slave node services are received within the superframe;
[0156] Condition k: The relay child node stops applying for relay network access requests and service forwarding requests to the local node;
[0157] Condition 1: The relay access request of the node that has not yet joined the network is monitored, and the access response is forwarded to the master node, and the local sending time slot is not full;
[0158] Condition m: The master node synchronization information is not heard for more than one out-of-sync period, but other slave node services are heard within the superframe, and the application for relay access is successful.
[0159] Example 14: Based on Example 12, the source node locally records the node ID that can be monitored, includes the prior information of the current path in the sent time slot frame, and determines in advance through monitoring whether the frame service transmission path exceeds 1 hop; the node locally refreshes the prior information according to the neighbor node list in each superframe.
[0160] Embodiment 15: Based on any one of Embodiments 1 to 9, including a time synchronization step:
[0161] Step 1: After the node is powered on, it chooses to synchronize with the local time base or wait for matching synchronization according to its master-slave mode and ID number configuration information; the master node uses the time set by the host computer as the base; after the non-master node device is powered on, it monitors the network information, completes the rough synchronization of the local clock according to the master node synchronization, service frame or the master node sending time contained in the slave node service frame in the network, and makes a network access request;
[0162] Step 3: Synchronization maintenance. After the node successfully joins the network, it sends local services periodically within the superframe when the service competition is successful, and exchanges the sending time with the master node for precise synchronization to adjust the synchronization error.
[0163] In addition to the above examples, those skilled in the art may obtain other embodiments based on the above disclosure or by using the knowledge or technology in the relevant field to make changes. The features of each embodiment may be interchangeable or replaced. The changes and modifications made by those skilled in the art do not depart from the spirit and scope of the present invention and should be within the scope of protection of the claims attached to the present invention.
Claims
1. A frequency hopping networking method based on TDMA, characterized in that: Includes steps: S1, build the network communication topology structure and generate the network master node through competition; S2, the master node uniformly allocates and manages time slot resources in network communication periodically; Step S2 includes a fixed time slot allocation sub-step: after each user node enters the network, it "assigns a seat" to a fixed time slot according to its local ID number, and when there is a service to be sent, it transmits a message at the corresponding time of the next group of fixed time slots closest to itself; and after the user node enters the network, it uses the local fixed time slot to periodically send service information within the time frame; Step S2 includes a dynamic time slot allocation sub-step: when the relay node has no extra time slots to provide message forwarding for its relay sub-node, the relay node applies to the master node for a dynamic time slot through the service for business forwarding of messages for its relay sub-node; or, when a certain node has a large-volume transmission service, it applies to the master node through the service, and after the application is successful, sends the large-volume transmission service in the local fixed time slot and the dynamic time slot in the next time frame; Step S2 includes a relay forwarding timeslot allocation sub-step: when the relay node provides service forwarding for its relay child node, it first ensures that its own message sending timeslot is sufficient, and then uses the remaining local sending timeslots to forward services for it. If there are no remaining local sending timeslots or message transmission is in progress, the relay node applies for a dynamic timeslot from the master node; Step S2 includes a voice time slot allocation sub-step: multiple voice time slots in the time frame design are approximately evenly interspersed in all time slots of the time frame, and multiple user nodes in the network can send voice data in the voice time slot, and voice transmission is achieved by preemption; When the master node allocates dynamic time slots, it considers the order of pictures, videos, and relay forwarding, giving priority to meeting the large business transmission needs of users of online nodes. Relay nodes and relay sub-nodes do not have the permission to apply for picture\video services, and can only meet the message and voice transmission needs of the two. Including node network competition steps: Step 1: For a node with ID n, n≠1, after power-on, it is designed to default to an isolated node state, send a synchronization packet in the synchronization time slot based on the local clock, and broadcast its own ID and isolated node state information; Step 2: During the network building time after power-on, node n listens to information from other nodes; if it hears the broadcast information of the master node or the service frame information of the slave node, it immediately exits the master node competition process and starts to synchronize with the master node; if it can only hear the broadcast information of other isolated nodes, it records the ID of the isolated node within one hop range; Step 3: When the network building time is over, compare your own ID with the isolated node ID in the monitoring record. If your own ID is the smallest or no other isolated node ID is detected, enter the master node working mode; if it is found that there is an isolated node ID smaller than the local ID in the record, exit the master node competition process and set it to enter the slow scan state, waiting to receive the synchronization information of the master node; It also includes the steps for relay node access to the network: Step 1: The relay node that synchronizes to the network sends a service frame to the master node at the time period when the local service competition is successful; Step 2: The relay sub-node that fails to synchronize with the network maintains the receiving state within the superframe and monitors the service information sent in 1); Step 3: The relay subnode completes the rough synchronization of the local time with the network according to the network time synchronization information contained in the service frame, and records the source ID and the master node ID in the network contained in the service frame; Step 4: The relay subnode sends a relay access request at the relay subnode service contention time. The destination address of the service frame is the ID of the monitored node, and the networking identity is the relay subnode; Step 5: After the relay node receives the relay access request frame, if the local relay capability is available, the destination address is changed to the master node ID, the relay access request frame is forwarded to the master node at the relay forwarding service time, and the relay child node ID is recorded in the local relay child node list; Step 6: The master node responds to the network access request in the host service. After the relay node monitors it, it forwards the frame at the relay service response time. Step 7: After receiving the network access reply frame, the relay node successfully accesses the network, obtains a fixed user time slot, and records the relay node as a local relay node; Step 8: After the node is powered on, there are five states: isolated node, master node, child node, relay node, and relay child node. Each state can be transferred due to changes in network topology and communication conditions.
2. The TDMA-based frequency hopping networking method according to claim 1, characterized in that: In step S2, a protection time slot is provided between the transmission time slots of different user nodes to offset the transmission delay between the nodes.
3. The TDMA-based frequency hopping networking method according to claim 1, characterized in that: Step S2 includes the sub-steps of framing and deframing the user data at the physical layer.
4. The TDMA-based frequency hopping networking method according to claim 1, characterized in that: The master node includes an airborne terminal device and supports adaptive relaying.
5. The TDMA-based frequency hopping networking method according to any one of claims 1 to 4, characterized in that: Including the routing steps based on secondary relays: Step 1: Set that only the master node and relay node provide service forwarding function during service transmission, and the relay node only provides forwarding function for its own relay child nodes; Step 2: The master node stores a network table of neighbor nodes that can be reached in one hop. The table is updated in each superframe according to the service information of the slave node. When the master node receives a service transmission packet whose destination ID is not its own, it identifies whether it needs to forward it. Step 3: After receiving the service frame, the relay node identifies whether the destination address of the frame is its own relay node ID. If so, it forwards the frame according to the local service transmission situation. If not, it discards the frame.
6. The TDMA-based frequency hopping networking method according to claim 1, characterized in that: In step 8, the conditions for state transition include any one or more of the following: Condition a: Node ID = 1; Condition b: The host computer is forcibly set to the master node state; Condition c: If the master node obtains a response from nearby nodes through competition, it will switch to the master node state; Condition d: Able to monitor the master node synchronization frame, complete the coarse and fine synchronization of the local time, and successfully access the network through service competition; Condition e: The synchronization header of the master node cannot be received, but the service of the nearby sub-nodes can be monitored, and the relay access to the sub-nodes is successfully applied; Condition f: The information of the master node and nearby sub-nodes can be monitored, but the service competition in the superframe is unsuccessful, and the application for relay access to the nearby sub-nodes is successful; Condition g: No relay node service can be detected within the superframe, and no other sub-node information can be monitored, which means the node is in an out-of-sync state. Condition h: The nearby access nodes refuse to provide relay forwarding, and multiple consecutive applications for relay access fail; Condition i: Receive the master node synchronization header and successfully enter the network through service competition; Condition j: The master node synchronization information is not monitored for more than one out-of-sync period, and no other slave node services are received within the superframe; Condition k: The relay child node stops applying for relay network access requests and service forwarding requests to the local node; Condition 1: The relay access request of the node that has not yet joined the network is monitored, and the access response is forwarded to the master node, and the local sending time slot is not full; Condition m: The master node synchronization information is not heard for more than one out-of-sync period, but other slave node services are heard within the superframe, and the application for relay access is successful.
7. The TDMA-based frequency hopping networking method according to claim 5, characterized in that: The source node records the node ID that can be monitored locally, and includes the prior information of the current path in the sent time slot frame. Through monitoring, it is determined in advance whether the transmission path of the frame service exceeds 1 hop; The node locally refreshes the prior information based on the neighbor node list in each superframe.
8. The TDMA-based frequency hopping networking method according to any one of claims 1 to 4, characterized in that: Including time synchronization steps: Step 1: After the node is powered on, it chooses to synchronize with the local time base or wait for matching synchronization according to its master-slave mode and ID number configuration information; the master node uses the time set by the host computer as the base; after the non-master node device is powered on, it monitors the network information, completes the rough synchronization of the local clock according to the master node synchronization, service frame or the master node sending time contained in the slave node service frame in the network, and makes a network access request; Step 2: Synchronization maintenance. After the node successfully joins the network, it sends local services periodically within the superframe when the service competition is successful, and exchanges the sending time with the master node for precise synchronization to adjust the synchronization error.
