A dynamic time slot allocation voice communication method and system based on hop count adaptation

Abstract

This invention relates to a dynamic timeslot allocation voice communication method and system based on hop count adaptation. It only requires parsing the target address in the packet header and making forwarding decisions based on the current timeslot number. It eliminates the need to parse a hop count counter, add local node information, maintain any routing table, or record forwarding history. The target node calculates the actual hop count from the source node to itself based on the global timeslot number when it receives the probe packet. Each node broadcasts the included call requests within the signaling period and listens to all network requests to count the total number of active users and the maximum hop count in each request, determining a unified maximum hop count for the current frame across the entire network. In the dynamic mapping phase, each node independently executes the timeslot allocation algorithm based on M, calculates the total number of timeslots required for the current frame, and divides the timeslots into several groups according to a preset node identifier priority rule. Each group contains several consecutive timeslots with inherent hop count meaning. The adaptive forwarding phase follows.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, specifically to a dynamic time slot allocation voice communication method and system based on hop number adaptation. Background Technology

[0002] Taking modern emergency rescue, field operations, and military operations as examples, the communication environment is often highly uncertain. Due to geographical limitations or changes in communication distance, centralized infrastructure such as base stations may experience coverage difficulties or malfunctions. In such situations, walkie-talkies based on wireless ad hoc network technology become core equipment for ensuring lifeline communication. To achieve orderly communication within limited spectrum resources, Time Division Multiple Access (TDMA) protocols, due to their deterministic latency characteristics and efficient resource utilization, have become the mainstream channel access scheme and are applied to multi-hop wireless communication systems.

[0003] Time Division Multiple Access (TDMA) is a commonly used channel access technology. Existing technologies (such as CN107864412B) achieve long-distance communication for narrowband intercom terminals by configuring dedicated forwarding nodes. The main characteristics of this type of scheme include: constructing multiple network groups, each configured with one forwarding node; the forwarding node needs to perform deep parsing of the received data, maintain routing tables and link quality tables, add its own node information, and then continue forwarding; the node needs to select the next-hop node based on the routing table.

[0004] However, in existing technological implementations, especially in narrowband voice communication scenarios involving multi-hop relays, the following bottlenecks still urgently need to be addressed:

[0005] The forwarding nodes bear a heavy processing burden. Each forwarding node needs to maintain complex routing tables and link quality tables, and perform deep parsing of received data, including parsing complete node information, comparing node numbers, adding its own node information, updating the channel quality table, and selecting the next-hop node. The packet header has high overhead. Existing solutions typically include multiple fields in the packet header, such as a hop count counter, path list, and node record, increasing transmission overhead. It relies on routing table maintenance. Existing solutions require nodes to maintain dynamic routing tables. When the network topology changes, the routing table needs to be updated and converged, which may cause communication interruptions during convergence. Time slot resource utilization is inefficient. Existing solutions use a static binding method between time slots and frequency points, which cannot dynamically adjust time slot allocation based on the number of users and communication distance. Therefore, in multi-hop voice communication, how to achieve dynamic optimization of time slot resources, simplified processing of forwarding nodes, and minimization of packet headers is a problem that urgently needs to be solved. Summary of the Invention

[0006] In view of the above-mentioned problems existing in the prior art, the present invention provides a dynamic time slot allocation voice communication method and system based on hop number adaptation.

[0007] The technical solution adopted by this application to solve its technical problem is: a dynamic time slot allocation voice communication method based on hop count adaptation, including the following steps: Hop count detection phase: The initiating node sends a probe packet containing the target address in the common signaling time slot. Each relay node in the network forwards the packet at the physical layer of the next adjacent time slot according to the "receive and forward" principle. The target node calculates the actual hop count from the source node to itself based on the global time slot sequence number when it receives the probe packet and a preset time slot offset. ; Network-wide negotiation phase: Each node broadcasts information containing [the relevant information] during the signaling period. The system receives call requests and listens for network requests to count the total number of currently active users. And the maximum number of hops in each request, to determine the network-wide maximum number of hops for the current frame. Dynamic mapping phase: Each node is based on M and M independently execute the time slot allocation algorithm to calculate the total number of time slots required for the current frame. And according to the preset node identifier priority rules, Each time slot is divided into Each time slot group contains [number] time slots. A series of consecutive time slots with inherent hop count meaning; Adaptive forwarding phase: After receiving a voice data packet, the relay node extracts the current global time slot sequence number. Calculate its relative hop number within its respective time slot group. ,like Less than Then in the first Forced forwarding is performed in each time slot; otherwise, forwarding is terminated.

[0008] Preferably, the header field of the probe packet consists only of the source address and the destination address, and does not contain a hop count counter, path list, or sequence number; when forwarding the probe packet, the relay node does not modify or parse the data packet content.

[0009] Preferably, the target node determines the actual number of hops. The calculation logic is as follows: ,in The time slot number of the received probe packet. This is the starting timeslot number of the transmission period for this probe packet.

[0010] Preferably, the network-wide negotiation phase employs a distributed consensus mechanism, whereby the consensus is determined by the statistics of each node. or If there is a discrepancy, the negotiation process will be restarted in the next signaling cycle until all nodes achieve configuration alignment at the start of the current frame.

[0011] Preferably, the time slot arrangement rule within the time slot group is as follows: The first... Each user time slot group occupies a time slot range of: Among them, the first time slot in the group is occupied by the initiator, and the second to third time slots are occupied by the initiator. Each time slot is occupied sequentially by each hop relay node on the communication link.

[0012] Preferably, the adaptive forwarding phase is stateless forwarding, where relay nodes do not record forwarding history or routing table entries, but only calculate the current timeslot number in real time. and The logical relationship determines the forwarding action.

[0013] Preferably, a topology monitoring step is also included: nodes detect changes in neighboring nodes through periodic presence messages; when a node has not received a presence message from a certain node for an extended period, or when a new node initiates a PTT call request, the network-wide negotiation phase is re-executed to update the network. , and .

[0014] Preferably, the transmission of the voice data packets within the time slot group adopts a transparent forwarding mode, that is, after receiving the data packet, the relay node does not change the source address and destination address in the data packet header, and directly retransmits it in the next time slot at the physical layer.

[0015] The technical solution adopted by this application to solve its technical problem is: a dynamic time slot allocation voice communication system based on hop count adaptation, comprising: a probe and feedback module: used to send simplified probe packets in signaling time slots, and the target node provides feedback on the required hop count through a closed-loop timing relationship; a distributed negotiation center: used to independently count the concurrent call demand of the entire network and dynamically determine the boundary parameters of the current network bandwidth resource pool. and Time slot mapping calculation unit: used to perform... Logical division to establish a three-dimensional mapping table of "user-time slot-hop count"; Stateless physical forwarding engine: used to achieve low-latency, routing-free relay forwarding based on timing triggers during the voice communication phase.

[0016] The beneficial effects of this invention are: In the dynamic time slot allocation voice communication method and system based on hop count adaptation, relay nodes only need to parse the target address in the packet header and make forwarding decisions based on the current time slot number. There is no need to parse the hop count counter, add local node information, maintain any routing table, or record forwarding history.

[0017] The packet header contains only two fields: source address and destination address. To minimize transmission overhead, nodes do not maintain any state information and make forwarding decisions entirely based on the current timeslot sequence number and pre-allocated timeslot configuration. The joining or leaving of any node does not affect other nodes.

[0018] By using N=M×H dynamic time slot allocation, the fixed time slot resource pool can flexibly adapt to various scenarios such as multi-user short-range communication and few-user long-range communication, improving spectrum utilization. The system supports seamless switching between different communication modes and achieves a dynamic balance between capacity and distance with a fixed total number of time slots.

[0019] Stateless forwarding eliminates single points of failure and routing convergence problems, the number of nodes can change dynamically, and the network size can be expanded arbitrarily. Attached Figure Description

[0020] Figure 1 This is a flowchart of the dynamic time slot allocation process of the present invention;

[0021] Figure 2 This is a timing diagram of the forwarding decision based on time slot number according to the present invention;

[0022] Figure 3 This is a flowchart of the automatic packet hop count discovery process of the present invention;

[0023] Figure 4 This is a flowchart of the distributed negotiation process of the present invention. Detailed Implementation

[0024] The technical solutions of the embodiments of the present invention will be described below with reference to the accompanying drawings:

[0025] In this invention, the first time slot on the time axis is defined as the first hop, the second time slot as the second hop, and so on, with the Hth time slot being defined as the Hth hop accordingly.

[0026] The data packet header structure involved in this invention is designed to contain only two core fields: a source address, used to identify the node initiating the communication; and a destination address, used to identify the node ultimately receiving the communication. Specifically, this data packet header does not contain any other fields such as hop count counters, remaining hops, path information, or sequence numbers. This design allows forwarding nodes to process data packets without needing to parse any information other than the destination address.

[0027] When a node needs to communicate with a target node but does not yet know the required hop count, it sends a probe packet in a signaling time slot. The header of this probe packet also contains only the source and destination addresses, with the same format as a voice packet, but explicitly identified as a probe type. All nodes in the network follow a "receive and forward" principle when processing probe packets. Upon receiving a probe packet, any node that parses it and finds that the destination address is not itself will forward the probe packet in the next adjacent time slot, with the packet content remaining completely unchanged during forwarding. The probe packet propagates in this manner throughout the network, increasing the hop count by 1 with each forwarding node until it reaches the target node. Upon receiving the probe packet, the target node parses it to confirm that the destination address is itself and simultaneously records the current time slot number at the time of receipt. Since time slots are pre-allocated, the target node can accurately know the time slot group to which the current time slot belongs and the specific hop count position within that time slot group, thereby determining the actual hop count from the source node to itself, denoted as H_discovered. Subsequently, the target node generates a response packet. The header of this response packet contains the source address, the destination address, and the number of hops discovered, H_discovered. The target node sends this response packet in the signaling time slot, and the response packet is returned to the source node using the same forwarding mechanism as the probe packet. After receiving the response packet, the source node can parse it to obtain the H_discovered value, which is the actual number of hops required to reach the target node.

[0028] The specific implementation steps are detailed below:

[0029] Step 101: After the node is powered on, it enters the listening state and periodically broadcasts presence messages in the public signaling time slot. These presence messages only contain the identification information of this node.

[0030] Step 102: While broadcasting its own presence message, the node also listens for presence messages sent by other nodes and records a list of node identifiers present in the network. The purpose of this step is solely to ensure that nodes are aware of each other's existence; it does not involve establishing routing tables or recording link quality information.

[0031] Step 201: When a node needs to communicate with a target node but does not know the required number of hops, the initiating node sends a probe packet in the signaling time slot. The header of this probe packet only contains the source address and the target address, uses the same format as the voice packet, but is identified as a probe type.

[0032] Step 202: Upon receiving a probe packet, any node in the network will parse the packet header and extract the target address. If the target address is the same as the node's identifier, proceed to step 203; if the target address is different from the node's identifier, proceed to step 204.

[0033] Step 203: After receiving the probe packet, the target node records the current timeslot number at the time of receipt. Since the timeslot is pre-allocated, the target node can clearly identify which user group the current timeslot belongs to and which hop within that user group it is, thereby determining the actual number of hops H_discovered from the source node to this node. After determining H_discovered, proceed to step 205.

[0034] Step 204: After receiving a probe packet, if the relay node finds that the target address is not itself, it immediately forwards the probe packet in the next adjacent time slot, and the content of the data packet remains completely unchanged. After forwarding, it returns to step 202 to continue processing any other probe packets that may be received.

[0035] Step 205: The target node generates a response packet, the header of which contains the source address, the destination address, and the number of hops discovered, H_discovered. The target node then sends this response packet in a signaling time slot.

[0036] Step 206: The response packet propagates through the network using the same forwarding mechanism as the probe packet, eventually reaching the initiating node. The initiating node parses the response packet to obtain the H_discovered value, which is the actual number of hops required to reach the target node.

[0037] Step 301: Nodes with call requirements broadcast a call request message in the signaling time slot. The message contains the source address, destination address, and the required number of hops H (the value of H is determined by H_discovered obtained in step 206).

[0038] Step 302: All nodes listen to signaling time slots to collect call requests across the entire network. Each node counts the number M of users currently needing to communicate, i.e., the number of unique call requests received.

[0039] Step 303: Each node determines the maximum number of hops H_max across the entire network based on the maximum number of hops among all collected call requests.

[0040] Step 304: Each node independently calculates the total number of time slots N based on the statistically obtained number of users M and the maximum number of hops H_max. The calculation formula is N = M × H_max.

[0041] Step 305: All nodes, following the same preset rules, divide the calculated N time slots into M consecutive time slot groups. Each time slot group contains H_max consecutive time slots, and these time slot groups are then assigned to the M users sequentially. The preset rules can be based on the order of node identifiers, the order of request times, etc.

[0042] Step 306: The time slots within each time slot group have a natural hop count meaning: the first time slot in the group is defined as the first hop and is used by the initiating end; the second time slot is defined as the second hop and is used by the first relay node; and so on, the H_max time slot is defined as the H_max hop and is used by the last relay node or the target node.

[0043] Step 307: All nodes automatically switch to the new time slot configuration at the start of the next frame. Since all nodes use the same allocation rules and the same input parameters (number of users M and maximum number of hops H_max), a consistent time slot allocation scheme can be achieved automatically without the central node issuing unified instructions.

[0044] Step 401: When a user presses the PTT (Push-to-Talk) button to initiate a call, the terminal node collects voice data and encapsulates the voice data into a data packet. The header of this data packet contains only two fields: source address and destination address.

[0045] Step 402: When the time slot allocated to it arrives, the initiating end sends out the data packet. The time slot used by the initiating end is the first time slot of its time slot group.

[0046] Step 501: After receiving a data packet in any time slot, any node in the network will parse the packet header and extract the destination address.

[0047] Step 502: If the extracted target address is the same as the identifier of this node, then this node will receive the data as the target node, decode and play it, and will no longer forward the data packets. The forwarding process ends here.

[0048] Step 503: If the extracted target address is different from the identifier of this node, then this node acts as a potential relay node and obtains the sequence number S of the current timeslot. Since the timeslots are pre-allocated, each node knows which user group the current timeslot belongs to and which hop it is in that user group. Assume that the current timeslot S is the k-th hop of a certain user group, where 1 ≤ k ≤ H_max.

[0049] Step 504: Determine if k is less than H_max. If k < H_max, it means there are still several hops to go before forwarding, and the node needs to forward the data packet in the next adjacent time slot, then proceed to step 505. If k = H_max, it means this is the last hop, and the node will no longer forward the data packet and will discard it, ending the forwarding process.

[0050] Step 505: The node immediately forwards the received data packet in the next adjacent time slot (i.e., the time slot of the (k+1)th hop). During forwarding, the content of the data packet remains completely unchanged, and its header still retains the original source and destination addresses. After forwarding is complete, return to step 501 to continue processing any subsequent data packets that may be received.

[0051] Step 601: After the target node receives a data packet in a certain time slot, it finds that the target address is its own node through parsing. At this time, regardless of which hop it is, it will receive the data packet.

[0052] Step 602: The target node sends the received voice data into the audio buffer for decoding and playback.

[0053] Step 603: If a response is required, the target node can act as a new initiator and begin the probe and communication process from step 201.

[0054] Step 701: The node continuously listens to the signaling time slots to monitor the presence messages of other nodes. When a node does not receive a presence message from a certain node within a preset time period, it determines that the node has left the network.

[0055] Step 702: When a node detects a change in the network topology or needs to initiate a new call, it will re-execute the probe and negotiation process starting from step 201.

[0056] Step 703: All nodes re-execute steps 301 to 307 to update the number of users M, the maximum number of hops H_max, and the time slot allocation scheme.

[0057] Step 704: All nodes switch to the new time slot configuration at the start of the next frame to achieve dynamic adaptation of the system.

[0058] This method supports dynamic adjustment within the same wireless frequency band. The value enables seamless switching between multi-user short-range concurrent communication mode and single-user ultra-long-distance multi-hop relay mode.

[0059] Example 1: 6-person 1-hop mode (direct communication)

[0060] In this embodiment, there are 6 nodes in the network, namely A, B, C, D, E, and F. When node A needs to communicate with node C, it executes steps 201 to 206 to send a probe packet, thereby obtaining the required hop count H=1. Subsequently, node A broadcasts a call request in the signaling time slot, which includes the information H=1. At the same time, nodes B, D, E, and F may also have call needs and broadcast their own call requests. All nodes execute steps 302 to 307, and the number of users M=6 and the maximum hop count H_max=1 are calculated, so the total number of time slots N=6. According to the order of node identification, these 6 time slots are allocated as follows: time slot 1 is allocated to node A, time slot 2 is allocated to node B, time slot 3 is allocated to node C, time slot 4 is allocated to node D, time slot 5 is allocated to node E, and time slot 6 is allocated to node F.

[0061] During communication, node A sends a data packet in time slot 1, with the destination address being node C. Node C receives the data packet in time slot 1. Since the destination address is itself, it receives and plays the data packet. Other nodes, upon receiving the data packet in time slot 1, discover that the destination address is not themselves and determine that the current time slot is the first hop, which equals H_max=1. Therefore, they do not forward the data packet.

[0062] Example 2: 3-person 2-hop mode (one relay)

[0063] In this embodiment, there are also 6 nodes in the network. After negotiation, it is determined that the number of users M is equal to 3 (i.e., nodes D, E, and F have call requirements), and the maximum number of hops H_max is equal to 2. Therefore, the total number of time slots N is equal to M × H_max = 3 × 2 = 6. According to the node identification order D, E, and F, these 6 time slots are divided into 3 consecutive groups of time slots: time slots 1-2 are assigned to node D, time slots 3-4 are assigned to node E, and time slots 5-6 are assigned to node F. For the time slot group of node D, time slot 1 is defined as the first hop, and time slot 2 is defined as the second hop.

[0064] When node D wants to call node A, node D sends a data packet in the first hop of its time slot group, i.e., time slot 1. The source address in the packet header is D, and the destination address is A. All nodes in the network are in the receiving state during time slot 1.

[0065] Node C receives the data packet in time slot 1 and, through parsing, discovers that the destination address A is not itself. Node C further determines that the current time slot sequence number is 1, belonging to the time slot group of node D, and is the first hop of that group (k=1). Since k=1 < H_max=2, node C needs to forward the data packet in the next time slot, i.e., time slot 2.

[0066] Node C immediately forwards the data packet in time slot 2, and the packet content remains unchanged. Node A receives the data packet in time slot 2, parses it, and finds that the destination address is itself, so it receives and plays the data packet. Other nodes, after receiving the data packet in time slot 2, find that the destination address is not themselves, and determine that the current time slot number is 2, belonging to node D's time slot group, and is the second hop in that group (k=2). Since k=H_max, they do not forward the data packet.

[0067] Example 3: Multi-user hybrid scenario

[0068] Suppose that in this network scenario, two users are talking simultaneously: User D calls User A (requiring 2 hops), and User E calls User B (requiring 2 hops). After negotiation, the number of users M = 2, and the maximum number of hops H_max = 2. Therefore, the total number of time slots N = M × H_max = 2 × 2 = 4. The time slot allocation scheme is as follows: time slots 1-2 are allocated to User D, and time slots 3-4 are allocated to User E.

[0069] In time slot 1: User D sends a data packet destined for User A. Node C receives the data packet and determines that time slot 1 is the first hop (k=1) of the time slot group where User D is located. Since k=1 < 2, it prepares to forward the packet in time slot 2.

[0070] In time slot 2: Node C forwards user D's data packet; simultaneously, assuming node F (assuming it is in user E's time slot group) may also receive the data packet in time slot 2, but since time slot 2 is the second hop of user D's time slot group and is unrelated to user E's time slot group, node F will discard or ignore the data packet after judgment. User A receives the data packet in time slot 2 and performs reception processing.

[0071] In time slot 3: User E sends a data packet destined for User B. Node F receives the data packet and determines that time slot 3 is the first hop (k=1) of the time slot group where User E is located. Since k=1 < 2, it prepares to forward the packet in time slot 4.

[0072] In time slot 4: Node F forwards user E's data packet; user B receives the data packet in time slot 4 and performs reception processing.

[0073] Through the above mechanism, the communication processes of the two users are completely independent and will not interfere with each other. All nodes can automatically distinguish which user's hop a time slot belongs to based solely on the time slot sequence number.

[0074] Example 4: Dynamically switching from 3 people doing 2 jumps to 1 person doing 6 jumps

[0075] In the initial state, nodes D, E, and F are communicating in the network, using a 3-person 2-hop mode. The time slots are allocated as follows: time slots 1-2 are allocated to D, time slots 3-4 are allocated to E, and time slots 5-6 are allocated to F.

[0076] When the network topology changes, for example, nodes D, E, and F leave the network, and a new node X joins and needs to communicate over a long distance with node Y, node X executes steps 201 to 206 to send a probe packet. This probe packet is forwarded by nodes A, B, C, D, and E before reaching node Y. Node Y determines the hop count to be 6 based on the timeslot sequence number when it receives the probe packet and returns this information to node X via a response packet. Node X thus learns that the required hop count H = 6 is needed to reach node Y.

[0077] Subsequently, node X broadcasts a call request in the signaling time slot, which includes the information H=6. Other nodes detect that nodes D, E, and F have left the network, so they calculate that the number of users M=1, the maximum number of hops H_max=6, and the total number of time slots N= M×H_max=1×6=6. Therefore, all 6 time slots (time slots 1-6) are allocated to node X.

[0078] Node X sends a data packet in its first hop slot (slot 1) to Node Y. Node A receives this packet in slot 1, determines it's in the first hop and the number of hops is less than 6, and forwards it in slot 2. Node B receives the packet in slot 2, determines it's in the second hop and the number of hops is less than 6, and forwards it in slot 3. Nodes C, D, and E follow the same logic. Finally, Node Y receives the packet in slot 6 and plays it.

[0079] Through the above process, the system dynamically switches from supporting 3 pairs of medium-distance communication to supporting 1 pair of ultra-long-distance communication, while the total number of time slots remains unchanged at 6, achieving a dynamic balance between communication capacity and communication distance.

[0080] The above embodiments are merely some, not all, of the embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.

Claims

1. A dynamic time slot allocation voice communication method based on hop number adaptation, characterized in that, Includes the following steps: Hop Count Probing Phase: The initiating node sends a probe packet containing the target address in the common signaling time slot. Each relay node in the network forwards the packet at the physical layer in the next adjacent time slot according to the "receive and forward immediately" principle. The target node calculates the actual hop count from the source node to itself based on the global time slot sequence number when it receives the probe packet and a preset time slot offset. ; Network-wide negotiation phase: Each node broadcasts information containing [the relevant information] during the signaling period. The system receives call requests and listens for network requests to count the total number of currently active users. And the maximum number of hops in each request, to determine the network-wide maximum number of hops for the current frame. Dynamic mapping phase: Each node is based on M and M independently execute the time slot allocation algorithm to calculate the total number of time slots required for the current frame. And according to the preset node identifier priority rules, Each time slot is divided into Each time slot group contains [number] time slots. A continuous time slot with a natural hop count meaning; Adaptive forwarding phase: After receiving a voice data packet, the relay node extracts the current global timeslot sequence number. Calculate its relative hop number within its respective time slot group. ,like Less than Then in the first Forced forwarding is performed in each time slot; otherwise, forwarding is terminated.

2. The dynamic time slot allocation voice communication method based on hop number adaptation according to claim 1, characterized in that: The header field of the probe packet consists only of the source address and the destination address, and does not contain a hop count counter, path list, or sequence number; when forwarding the probe packet, the relay node does not modify or parse the packet content.

3. The dynamic time slot allocation voice communication method based on hop number adaptation according to claim 1, characterized in that: The target node determines the actual number of hops. The calculation logic is as follows: ,in The time slot number of the received probe packet. This is the starting timeslot number of the transmission period for this probe packet.

4. The dynamic time slot allocation voice communication method based on hop number adaptation according to claim 1, characterized in that: The network-wide negotiation phase employs a distributed consensus mechanism, if the statistics obtained by each node... or If there is a discrepancy, the negotiation process will be restarted in the next signaling cycle until all nodes achieve configuration alignment at the start of the current frame.

5. The dynamic time slot allocation voice communication method based on hop number adaptation according to claim 1, characterized in that: The time slot arrangement rule within the time slot group is as follows: The first... Each user time slot group occupies a time slot range of... Among them, the first time slot in the group is occupied by the initiator, and the second to third time slots are occupied by the initiator. Each time slot is occupied sequentially by each hop relay node on the communication link.

6. The dynamic time slot allocation voice communication method based on hop number adaptation according to claim 1, characterized in that: The adaptive forwarding phase is stateless forwarding; relay nodes do not record forwarding history or routing table entries, but only calculate the current timeslot number in real time. and The logical relationship determines the forwarding action.

7. The dynamic time slot allocation voice communication method based on hop number adaptation according to claim 1, characterized in that: It also includes a topology monitoring step: nodes detect changes in neighboring nodes through periodic presence messages; when a node has not received a presence message from a certain node for an extended period, or when a new node initiates a PTT call request, it triggers a re-execution of the network-wide negotiation phase to update the topology. , and .

8. The dynamic time slot allocation voice communication method based on hop number adaptation according to claim 1, characterized in that: The transmission of the voice data packets within the time slot group adopts a transparent forwarding mode, that is, after receiving the data packet, the relay node does not change the source address and destination address in the data packet header, and directly retransmits it in the next time slot at the physical layer.

9. A dynamic time slot allocation voice communication system based on hop count adaptation, characterized in that, include: The probe and feedback module is used to send simplified probe packets in signaling time slots, and the target node provides feedback on the required hop count through a closed-loop timing relationship. The distributed negotiation center is used to independently calculate the concurrent call demand across the entire network and dynamically determine the boundary parameters of the current network bandwidth resource pool. and ; Time slot mapping calculation unit: used to perform Logical partitioning to establish a three-dimensional mapping table of "user-time slot-hop count"; Stateless physical forwarding engine: used to achieve low-latency, routing-free relay forwarding based on timing triggers during the voice communication phase.

Images