CN115767731A - Dynamic time slot networking method, device, equipment and storage medium - Google Patents

Dynamic time slot networking method, device, equipment and storage medium Download PDF

Info

Publication number
CN115767731A
CN115767731A CN202111012925.4A CN202111012925A CN115767731A CN 115767731 A CN115767731 A CN 115767731A CN 202111012925 A CN202111012925 A CN 202111012925A CN 115767731 A CN115767731 A CN 115767731A
Authority
CN
China
Prior art keywords
node
time slot
data transmission
time frame
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111012925.4A
Other languages
Chinese (zh)
Inventor
杨猛
顾超珣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
BAIC Motor Co Ltd
Original Assignee
BAIC Motor Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by BAIC Motor Co Ltd filed Critical BAIC Motor Co Ltd
Priority to CN202111012925.4A priority Critical patent/CN115767731A/en
Publication of CN115767731A publication Critical patent/CN115767731A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The application provides a dynamic time slot networking method, a dynamic time slot networking device, a dynamic time slot networking equipment and a dynamic time slot networking storage medium, and relates to the technical field of wireless communication. Under the condition of no central node, the nodes can be dynamically time-slot networked. The method comprises the following steps: the method comprises the steps that in any data transmission period, a first allocation time slot corresponding to a current node is carried out, and when data to be transmitted of the current node is larger than a preset threshold value, the current node determines a sending time slot according to the size of the data to be transmitted; the current node is any node in a preset communication network; the current node broadcasts the sending time slot to an idle node; when any node in the idle nodes determines that the sending time slot contains the corresponding second allocation time slot, updating the second allocation time slot to a time slot after the last time slot in the sending time slot; and the current node utilizes the sending time slot to carry out data transmission.

Description

Dynamic time slot networking method, device, equipment and storage medium
Technical Field
The present application relates to the field of wireless communications technologies, and in particular, to a dynamic timeslot networking method, apparatus, device, and storage medium.
Background
The TNDA (time Division multiple Access) based time slot networking technology is a technology in which a specific time period is divided into a plurality of time slots, the plurality of time slots are respectively allocated to a plurality of nodes, and the plurality of nodes accessing the network share channel communication based on the occupied time slots. In the related field, a centralized TDNA technology is usually adopted for networking, so as to obtain a centralized master-slave network. Whether the network is based on fixed time slot networking or dynamic time slot networking, the obtained centralized master-slave network communication quality and the network robustness depend on the performance of the central node.
For a centralized master-slave network obtained based on fixed time slot networking, as the number of nodes in the network increases, the data transmission requirements of the nodes increase, and the fixed time slot time division multiple access technology cannot flexibly change functions according to node services, so that the time period in the network is prolonged and time slots are wasted, the transmission rate of a data link transmission layer is reduced, and the network performance is affected. The central node is failed, that is, the whole network collapses, which easily causes the loss that the message cannot be transmitted in time and the data damage in some important scenes such as rescue, actual combat exercises and the like.
For a centralized master-slave network obtained based on dynamic time slot networking, in the prior art, time slots are dynamically allocated to nodes based on a complex algorithm mechanism, however, in practical network application, the complex algorithm mechanism has high requirements on equipment performance and cost, and the efficiency of time slot allocation depends on the performance of a central node.
Disclosure of Invention
The embodiment of the application provides a dynamic time slot networking method, a dynamic time slot networking device, a dynamic time slot networking equipment and a dynamic time slot networking storage medium, wherein the dynamic time slot networking can be performed on nodes under the condition that no central node exists, and the effect of flexibly allocating time slots for the nodes according to node services is achieved.
A first aspect of an embodiment of the present application provides a dynamic timeslot networking method, where the method includes:
the method comprises the steps that a first allocation time slot corresponding to a current node is carried out in any data transmission period, and when data to be transmitted of the current node is larger than a preset threshold value, the current node determines a sending time slot according to the size of the data to be transmitted; wherein the transmission slot is at least one slot adjacent to the first allocated slot; the current node is any node in a preset communication network;
the current node broadcasts the sending time slot to an idle node; the idle node is at least one node which does not perform data transmission in the preset communication network;
when any node in the idle nodes determines that the sending time slot contains the corresponding second allocation time slot, updating the second allocation time slot to a time slot after the last time slot in the sending time slot;
and the current node utilizes the sending time slot to carry out data transmission.
Optionally, the method further comprises:
before any data transmission period starts, carrying out local clock alignment on a node receiving a reference time frame according to the reference time frame to obtain a feedback time frame, and returning the feedback time frame to the node broadcasting the reference time frame to determine that the node receiving the reference time frame is a first online node; wherein the reference time frame is a local time of a node having a node number of a highest level in the preset communication network;
when a first allocation time slot corresponding to a current node is carried out in any data transmission period and data to be transmitted of the current node is larger than a preset threshold value, the current node determines a sending time slot according to the size of the data to be transmitted, and the method comprises the following steps:
and when the data to be transmitted of the current first online node is larger than a preset threshold value, the current first online node determines a sending time slot according to the size of the data to be transmitted.
Optionally, the method further comprises:
before any data transmission period begins, when the local node number of a node which does not receive a reference time frame is the node number of the highest level, the local time is used as the reference time frame to be broadcast to other nodes in the preset communication network;
when a feedback time frame returned by other nodes in the preset communication network is received, determining a node which does not receive the reference time frame as a second online node; the feedback time frame is obtained by performing clock alignment on other nodes in the preset communication network according to the reference time frame;
the method for determining the sending time slot of the current node comprises the following steps that in any data transmission period, a first allocation time slot corresponding to the current node is carried out, and when the data to be transmitted of the current node is larger than a preset threshold value, the current node determines the sending time slot according to the size of the data to be transmitted, and the method comprises the following steps:
and when the data to be transmitted of the current second online node is larger than a preset threshold value, the current second online node determines a sending time slot according to the size of the data to be transmitted.
Optionally, the method further comprises:
carrying out data transmission by utilizing a first allocation time slot when a first allocation time slot corresponding to a current node is carried out in any data transmission period and local data to be transmitted of the current node is less than or equal to a preset threshold value;
when any data transmission period is carried out to a first allocation time slot corresponding to the current node and the local data to be transmitted of the current node is zero, switching the data transmission period to the next time slot of the first allocation time slot.
Optionally, before an arbitrary data transmission period reaches a first allocated time slot corresponding to the current node, the method further includes:
before the first data transmission period starts, according to the priority level of the node number corresponding to each node, performing initial time slot reservation on each node to obtain an initial allocation time slot corresponding to each node;
when detecting that the data to be transmitted of the target node corresponding to the target initial allocation time slot is larger than the preset threshold value for the first time in any data transmission period, the target node adjusts the initial allocation time slots corresponding to other nodes on the basis of the target initial allocation time slot according to the size of the data to be transmitted.
Optionally, the method further comprises:
before the first data transmission period begins, setting frequency hopping frequency points for each node in the preset communication network;
the method for aligning local clocks of the nodes receiving the reference time frame according to the reference time frame to obtain a feedback time frame, and returning the feedback time frame to the nodes broadcasting the reference time frame so as to determine that the nodes receiving the reference time frame are first online nodes comprises the following steps:
and the node receiving the reference time frame performs local clock alignment according to the reference time frame to obtain a feedback time frame, and returns the feedback time frame to the node broadcasting the reference time frame through the frequency hopping point, so as to determine that the node receiving the reference time frame is the first online node.
Optionally, the method further comprises:
before the first data transmission period begins, setting frequency hopping frequency points for each node in the preset communication network;
when the local node number is the node number of the highest level, the node which does not receive the reference time frame broadcasts the local time as the reference time frame to other nodes in the preset communication network, and the method comprises the following steps:
and when the local node number is the highest node number, the node which does not receive the reference time frame broadcasts local time as the reference time frame to other nodes and new nodes in the preset communication network through the frequency hopping point, so that the new node is accessed to the preset communication network according to the reference time frame.
A second aspect of the embodiments of the present application provides a dynamic timeslot networking device, where the device includes:
the determining module is used for determining a sending time slot according to the size of the data to be transmitted by the current node when a first allocation time slot corresponding to the current node is carried out in any data transmission period and the data to be transmitted of the current node is larger than a preset threshold; wherein the transmission slot is at least one slot adjacent to the first allocated slot; the current node is any node in a preset communication network;
a first broadcasting module, configured to enable the current node to broadcast the transmission timeslot to an idle node; the idle node is at least one node which does not perform data transmission in the preset communication network;
an updating module, configured to update a second allocation timeslot to a timeslot after a last timeslot in the transmission timeslots when any node in the idle nodes determines that the transmission timeslots include the corresponding second allocation timeslot;
and the transmission module is used for enabling the current node to utilize the sending time slot to carry out data transmission.
Optionally, the apparatus further comprises:
a receiving module, configured to, before a start of any data transmission cycle, align local clocks of nodes that receive a reference time frame according to the reference time frame to obtain a feedback time frame, and return the feedback time frame to a node that broadcasts the reference time frame, so as to determine that the node that receives the reference time frame is a first online node; wherein the reference time frame is a local time of a node having a node number of a highest level in the preset communication network;
the determining module comprises:
the first determining submodule is used for performing a first allocation time slot corresponding to a current first online node in any data transmission period, and enabling the current first online node to determine a sending time slot according to the size of the data to be transmitted when the data to be transmitted of the current first online node is larger than a preset threshold value.
Optionally, the apparatus further comprises:
a second broadcasting module, configured to broadcast, before a start of an arbitrary data transmission cycle, a local time as a reference time frame to other nodes in the preset communication network when a node that does not receive the reference time frame has a local node number of a highest level;
a returning module, configured to, when receiving a feedback time frame returned by another node in the preset communication network, determine that a node that does not receive the reference time frame is a second online node; the feedback time frame is obtained by performing clock alignment on other nodes in the preset communication network according to the reference time frame;
the determining module comprises:
and the second determining submodule is used for determining a sending time slot according to the size of the data to be transmitted by the current second online node when the first distribution time slot corresponding to the current second online node is carried out in any data transmission period and the data to be transmitted of the current second online node is larger than a preset threshold value.
Optionally, the apparatus further comprises:
the transmission module is used for transmitting data to a first allocation time slot corresponding to a current node in any data transmission period and utilizing the first allocation time slot when the local data to be transmitted of the current node is less than or equal to a preset threshold value;
and the switching module is used for switching the data transmission period to the next time slot of the first allocation time slot when any data transmission period is carried out to the first allocation time slot corresponding to the current node and the local data to be transmitted of the current node is zero.
Optionally, the apparatus further comprises:
the reservation module is used for reserving an initial time slot for each node according to the priority level of the node number corresponding to each node before the first data transmission period begins to obtain an initial distribution time slot corresponding to each node;
and the adjusting module is used for adjusting the initial allocation time slots corresponding to the other nodes on the basis of the target initial allocation time slot according to the size of the data to be transmitted when the target node corresponding to the target initial allocation time slot is detected to have the data to be transmitted larger than the preset threshold value for the first time in any data transmission period.
Optionally, the apparatus further comprises:
a first setting module, configured to set a frequency hopping point for each node in the preset communication network before a first data transmission cycle starts;
the receiving module includes:
and the receiving submodule is used for aligning the local clock of the node receiving the reference time frame according to the reference time frame to obtain a feedback time frame, and returning the feedback time frame to the node broadcasting the reference time frame through the frequency hopping point so as to determine that the node receiving the reference time frame is the first online node.
Optionally, the apparatus further comprises:
the second setting module is used for setting frequency hopping frequency points for each node in the preset communication network before the first data transmission period begins;
the second broadcasting module includes:
and the broadcasting submodule is used for broadcasting the local time serving as the reference time frame to other nodes and new nodes in the preset communication network through the frequency hopping frequency point when the local node number of the node which does not receive the reference time frame is the highest-level node number so that the new node is accessed to the preset communication network according to the reference time frame.
A third aspect of embodiments of the present application provides a readable storage medium, on which a computer program is stored, which, when executed by a processor, implements the steps in the method according to the first aspect of the present application.
A fourth aspect of the embodiments of the present application provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the steps of the method according to the first aspect of the present application.
According to the priority of the node number, setting an initial reservation time slot for each node in a preset communication network, in each data transmission period, according to the initial reservation time slot of the node, starting time slot reservation for a target node corresponding to a first time slot used for transmitting data, according to the size of local data to be transmitted of the target node, determining whether the target node needs to reserve more time slots to transmit the data to be transmitted, specifically determining whether the target node needs to reserve a transmission time slot, under the condition that the target node needs to reserve the transmission time slot, broadcasting a reservation frame to all nodes which do not perform data transmission by the target node, performing time slot deferral when the corresponding time slot of the node which does not perform data transmission is included in the transmission time slot, and updating a second distribution time slot corresponding to the node. After the target node sends the completion data by using the sending time slot, the data transmission period continues to transmit the data of the next node, and the specific transmission period transmits the data of the node corresponding to the first time slot after the sending time slot of the target node. All nodes in the preset communication network complete the purpose of dynamically allocating time slots to each node according to data requirements in a time slot reservation and time slot concession mode, and dynamic time slot allocation is carried out according to the data length of each node under the condition that no central node exists, so that the nodes in the network can effectively allocate the time slots according to different transmission data lengths while communication collision is avoided, and frequency points are allocated. Because no central node is arranged, the embodiment of the application changes the dependence of the traditional networking mode on the master-slave mode and the defect of low channel utilization rate. The performance requirements of high channel utilization rate, high speed, high survivability and wide application scenes are met.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the description of the embodiments of the present application will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive exercise.
Fig. 1 is a flowchart of dynamic timeslot networking performed in an embodiment of the present application;
FIG. 2 is a diagram of an initial assigned time slot for a plurality of nodes in an example of the present application;
FIG. 3 is a schematic diagram of time synchronization among nodes in an example of the present application;
FIG. 4 is a schematic diagram of time synchronization among nodes in another example of the present application;
FIG. 5 is an exemplary diagram illustrating a timing structure of nodes after time alignment is completed according to one embodiment of the present disclosure;
fig. 6 is a flowchart illustrating steps of a dynamic timeslot networking method according to an embodiment of the present application;
FIG. 7 is a timing diagram of a data transmission cycle in an example of the present application;
fig. 8 is a schematic diagram of a dynamic timeslot networking apparatus according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Fig. 1 is a flowchart of dynamic timeslot networking according to an embodiment of the present application, and as shown in fig. 1, the present application initially configures all nodes in a preset communication network, where the preset communication network may be a wireless communication network, a satellite communication network, or the like. The functions of a plurality of nodes included in the preset communication network in the network are the same, and a central node for managing other nodes does not exist. The nodes may be stations, mobile terminals, relay stations, etc. The initial configuration of all nodes comprises: 1. setting frequency hopping patterns of nodes, and presetting the same frequency hopping patterns of all nodes in a communication network so as to ensure that different nodes are at the same frequency point at any time; 2. and setting the node number according to the actual requirements of the plurality of nodes in the application.
In one example of the present application, each vehicle in the fleet is configured with a station, passes through an unmanned desert area, sets a node number ID1 for station 1 set on a leading vehicle, sets a node number ID2 for station 2 on a second vehicle next to the leading vehicle, and so on, sets node numbers ID1 to ID10 for stations respectively located on 10 vehicles in the fleet.
With continued reference to fig. 1, after the initial configuration is completed, initial synchronization is performed on all nodes in the predetermined communication network. The TDNA technique generally divides a time axis into a plurality of cyclic data transmission periods, each of which is divided into a plurality of time slots, and allocates the plurality of time slots to different nodes, respectively, so that the plurality of nodes share a channel communication based on the time slots occupied by the respective nodes. And after finishing the data transmission in the current data transmission period, all the nodes enter the next data transmission period. The method for initially synchronizing all nodes in the preset communication network comprises the following steps:
before the first data transmission period starts, according to the priority level of the node number corresponding to each node, performing initial time slot reservation on each node to obtain an initial allocation time slot corresponding to each node;
in an example of the present application, a time slot 2 is allocated to a node whose node number is ID1, a time slot 3 is allocated to a node whose node number is ID2, a time slot 4 is allocated to a node whose node number is ID3, and so on, a time slot N +1 is allocated to a node whose node number is IDN. Referring to fig. 2, fig. 2 is a diagram illustrating an initial allocation timeslot structure of a plurality of nodes in an example of the present application, where the initial allocation timeslot is the highest priority of the node in timeslot 1 to transmit data.
Before the first data transmission cycle begins, each node is allocated with an initial allocation time slot, the initial allocation time slot is an initial basis for time slot allocation of the mth data transmission cycle, in other words, for any data transmission cycle, the time slot corresponding to the first node performing time slot allocation must be the initial time slot of the node, the first node performing time slot allocation is started, time slots are allocated to each node in sequence through time slot reservation, and the second node performing time slot allocation is started, and the allocation time slots corresponding to the nodes may be updated allocation time slots.
When detecting that the data to be transmitted of the target node corresponding to the target initial allocation time slot is larger than the preset threshold value for the first time in any data transmission period, the target node adjusts the initial allocation time slots corresponding to other nodes on the basis of the target initial allocation time slot according to the size of the data to be transmitted.
Exemplarily, assuming that the third data transmission cycle is carried out, it is detected for the first time that the time slot 1 is the target initial allocation time slot of the node ID1, and according to the size of the data to be transmitted of the node ID1, it is determined whether the node ID1 needs to reserve the time slot 2 and the time slot 3 after the time slot 1, and under the condition that the time slot 2 and the time slot 3 after the time slot 1 do not need to be reserved, the node ID1 is directly enabled to utilize the time slot 1 for data transmission; when slot 2 and slot 3 following slot 1 need to be reserved, the node ID2 and node ID3 slots corresponding to slot 2 and slot 3 are retired. Because the node ID1 is the target node detected for the first time in the third data transmission cycle, and the target node is the node that performs slot reservation in the first data transmission cycle, on the basis of the initial allocation slot of the target node, it is determined whether it is necessary to update the allocation slot corresponding to the next node of the target node from its initial allocation slot to: the sum of the initially allocated time slot and the time slot reserved by the node ID1, that is, whether to update the time slot 2 corresponding to the node ID2 to the time slot 4 corresponding to the node ID2, and whether to update the time slot 3 corresponding to the node ID3 to the time slot 5 corresponding to the node ID 3.
After the reservation of the initial time slot allocated to each node is completed, time alignment is started to be carried out on the nodes in the preset communication network, namely, a time synchronization stage in the initial synchronization is carried out, and whether each node is on line or not is determined in a mode that a plurality of nodes carry out time synchronization.
When any data transmission period starts, each node carries out time synchronization in the first time slot of the any data transmission period, and a service synchronization stage is executed, so that each node in the any data transmission period is ensured to be online.
The time synchronization of each node performed before the start of the first data transmission period belongs to an initial synchronization stage, and the time synchronization of each node performed in the 1 st time slot of any data transmission period from the 1 st data transmission period to the M-th data transmission period belongs to a service synchronization stage.
When any data transmission period in a preset communication network starts, the nodes are divided into nodes for sending reference time frames and nodes for receiving the reference time frames, the nodes for sending the reference time frames are the nodes with the highest priority level of the node number in the current nodes, and the time of other nodes is adjusted by taking the time of the nodes with the highest priority level of the node number in the current nodes as a reference, so that the time of all the nodes is synchronized.
For a node transmitting a reference time frame, the method for determining its presence is as follows:
before any data transmission period begins, when the local node number is the node number of the highest level, the node which does not receive the reference time frame broadcasts the local time as the reference time frame to other nodes in the preset communication network. When a feedback time frame returned by other nodes in the preset communication network is received, determining a node which does not receive the reference time frame as a second online node; and the feedback time frame is obtained by performing clock alignment on other nodes in the preset communication network according to the reference time frame. Validating the second online node means: confirming that the node transmitting the reference timeframe is online.
According to an example of the application, time alignment of each node is completed in a mode of updating a virtual master node. As shown in fig. 3, fig. 3 is a schematic diagram of time synchronization performed by each node in an example of the present application, and as shown in fig. 3, the virtual master node 1 uses a local time as a reference time frame and sends the reference time frame to the virtual slave nodes 1 to N, and the virtual slave nodes 1 to N adjust their respective local times according to the reference time frame, so as to ensure time synchronization of each node in the preset communication network. And after the virtual slave node 1 to the virtual slave node N finish clock alignment, obtaining a feedback time frame, and sending the feedback time frame to the virtual master node to ensure that the virtual master node is online. In this example, the virtual master node is a node with a node number ID1, specifically, when the first data transmission cycle starts, the node ID1 determines that the node ID1 does not receive a reference time frame transmitted by other nodes, and becomes the virtual master node 1 when determining that the node number of the node ID1 is the highest-level node number among the node numbers of all the current nodes, and after receiving the time frame transmitted by the node ID1, the other nodes determine that an existing virtual master node exists, and automatically defer to become the virtual slave nodes 1 to N. The virtual slave node 1 to the virtual slave node N are the node ID2 to the node IDN +1.
Fig. 4 is a schematic diagram of time synchronization performed by each node in another example of the present application, as shown in fig. 4 and fig. 1, in another example of the present application, a node ID1 is disconnected, a contention period starts, and none of nodes ID2 to node ID N +1 can receive a reference time frame transmitted by the node ID1, at this time, the node ID2 determines that it does not receive a reference time frame transmitted by another node, and becomes a virtual master node when it determines that its node number is the highest-level node number among the node numbers of all the current nodes, and after receiving the time frame transmitted by the node ID2, another node determines that there is an existing virtual master node, and automatically resignates to become a virtual slave node 2 to a virtual slave node N. The virtual slave node 2 to the virtual slave node N are the node ID3 to the node IDN +1, thereby completing the contention period.
For a node receiving a reference time frame, the method of determining its presence is as follows:
before any data transmission period starts, carrying out local clock alignment on a node receiving a reference time frame according to the reference time frame to obtain a feedback time frame, and returning the feedback time frame to the node broadcasting the reference time frame to determine that the node receiving the reference time frame is a first online node; wherein the reference time frame is a local time of a node having a node number of a highest level in the preset communication network. Determining the first online node refers to determining that the node that received the reference time frame is online.
With continued reference to fig. 3, after the virtual slave node 1 to the virtual slave node N return the feedback time frame to the virtual master node, each determines that it is online.
And before the beginning of the first data transmission period, setting frequency hopping frequency points for each node in the preset communication network. The frequency hopping frequency points set before the first data transmission period are used when any subsequent data transmission period begins, so that in the initial synchronization stage or the duty synchronization stage, namely in the first time slot of any data transmission period, each node sends a reference time frame through the frequency hopping frequency points or sends a feedback time frame through the frequency hopping frequency points, and each node sends and receives data by using the same frequency point in the first time slot, thereby ensuring the completion of time alignment.
Fig. 5 is a timing structure diagram of each node after time alignment is completed according to an example of the present application. As shown in fig. 5, before the first data transmission period, different timeslots corresponding to nodes 1 to 10 in the communication network are preset, and the frequency points of the nodes 1 to 10 are all frequency hopping frequency points f 1 . In the first data transmission period 1, the node 1 is used as an original virtual main node, and in the time slot 1 of the data transmission period 1, a frequency hopping frequency point f is adopted 1 Broadcasting a reference time frame for service synchronization, wherein an original virtual main node is a virtual main node determined for the first time, and frequency hopping frequency points f are adopted by nodes 2 to 10 in a time slot 1 of a data transmission period 1 1 Feeding back feedback time frames to node 1, e.g. using frequency hopping frequency point f as virtual slave node 1 by node 2 1 The feedback time frame is fed back to the node 1. And in the time slot 2 of the data transmission cycle 1, the node 1, as the original virtual master node, serves as the first current node for data transmission, and starts to perform the step of data transmission.
The method for aligning local clocks of the nodes receiving the reference time frame according to the reference time frame to obtain a feedback time frame, and returning the feedback time frame to the nodes broadcasting the reference time frame so as to determine that the nodes receiving the reference time frame are first online nodes comprises the following steps: and the node receiving the reference time frame performs local clock alignment according to the reference time frame to obtain a feedback time frame, and returns the feedback time frame to the node broadcasting the reference time frame through the frequency hopping point, so as to determine that the node receiving the reference time frame is the first online node.
And in the service synchronization stage at the beginning of any data transmission period, the late network access of a new node is also carried out. When the previous data transmission period is carried out, the new node is always kept at the frequency hopping point, when the data transmission of all the nodes is finished in the previous data transmission period, the data transmission period of the time is carried out, after the new node receives a reference time frame sent by the node with the highest priority level of the node number, the clock alignment is carried out according to the reference time frame to obtain a feedback time frame, and after the feedback time frame is sent to the node with the highest priority level of the node number, the late network entry of the new node is completed.
When the local node number is the node number of the highest level, the node which does not receive the reference time frame broadcasts the local time as the reference time frame to other nodes in the preset communication network, and the method comprises the following steps: and when the local node number is the highest node number, the node which does not receive the reference time frame broadcasts local time as the reference time frame to other nodes and new nodes in the preset communication network through the frequency hopping point, so that the new node is accessed to the preset communication network according to the reference time frame.
And after the synchronization of all the nodes is completed in the first time slot of each data transmission period and the on-line specific nodes are determined, sequentially executing the data transmission task of each node from the first time slot of each data transmission period, and dynamically networking the time slots of each node, so that the time slots are allocated to each node according to the size of the data to be transmitted of the node in sequence. Fig. 6 is a flowchart of steps of a dynamic timeslot networking method according to an embodiment of the present application, and as shown in fig. 6, the steps are as follows:
step S61: the method comprises the steps that a first allocation time slot corresponding to a current node is carried out in any data transmission period, and when data to be transmitted of the current node is larger than a preset threshold value, the current node determines a sending time slot according to the size of the data to be transmitted; wherein the transmission slot is at least one slot adjacent to the first allocated slot; the current node is any node in a preset communication network.
The preset threshold is determined according to the performance of the node radio frequency chip and the network bandwidth, and is usually the maximum number of bytes that can be transmitted in one time slot.
Because the initial configuration time slot of the node is determined, the time slot reservation is sequentially carried out on each node according to the sequence of the initial configuration time slot of the node in any data transmission period.
In another embodiment of the present application, the current node is a node on line in the data transmission period of this time, and the on-line node in the data transmission period of this time is determined according to the method for determining that each node in the preset communication network is on line, which is provided in other embodiments of the present application.
When a first allocation time slot corresponding to a current node is carried out in any data transmission period and data to be transmitted of the current node is larger than a preset threshold value, the current node determines a sending time slot according to the size of the data to be transmitted, and the method comprises the following steps:
and when the data to be transmitted of the current first online node is larger than a preset threshold value, the current first online node determines a sending time slot according to the size of the data to be transmitted.
When a first allocation time slot corresponding to a current node is carried out in any data transmission period and data to be transmitted of the current node is larger than a preset threshold value, the current node determines a sending time slot according to the size of the data to be transmitted, and the method comprises the following steps:
and when the data to be transmitted of the current second online node is larger than a preset threshold value, the current second online node determines a sending time slot according to the size of the data to be transmitted.
Fig. 7 is a timing structure diagram of a data transmission cycle in an example of the present application, and as shown in fig. 7, in an example of the present application, after a slot 1 completes service synchronization of the data transmission cycle, an original virtual master node, that is, a reservation slot of a node ID1 is performed first, and a reservation slot (slot 2) of the node ID1 in fig. 7 is a first allocation slot of the node ID1, and since the node ID1 is a target node detected for the first time, the reservation slot (slot 2) of the node ID1 is also an initial allocation slot of the node ID 1.
The node ID1 judges that local data to be transmitted is larger than a preset threshold value, the node ID1 determines that the data to be transmitted can complete data transmission only by two time slots according to the size of the data to be transmitted, and therefore the node ID1 determines the time slot 3 as a sending time slot, and the time slot 2 and the time slot 3 are used for jointly transmitting the data to be transmitted.
Step S62: the current node broadcasts the sending time slot to an idle node; wherein the idle node is at least one node which does not perform data transmission in the preset communication network.
With continued reference to fig. 7, in the above example, node ID1 transmits the reservation frame to the node originally corresponding to slot 3, that is, node ID1 transmits the reservation frame to node ID2, and also node ID1 transmits the reservation frame to virtual slave node 1, since the data transmission cycle has not yet been performed to the initial reservation slot originally corresponding to node ID2, node ID2 is an idle node. Node ID1 sends a reservation frame to node ID3, node ID4, node ID5, etc. that originally correspond to slot 4. Node ID3 is virtual slave node 2, node ID4 is virtual slave node 3, and node ID5 is virtual slave node 4.
Step S63: and updating the second allocation time slot to a time slot after the last time slot in the transmission time slot when any node in the idle nodes determines that the transmission time slot contains the corresponding second allocation time slot.
Continuing with fig. 7, in the above example, node ID2 detects that the locally corresponding slot is slot 3, performs slot deferral as with slot 3 sent by node ID1, updates the originally corresponding initial reserved slot to slot 4, and postpones the reserved slot corresponding to its own node. In this example, since node ID2 has not yet performed the out-of-slot deferral, the second allocated slot for node ID2 is the initial reserved slot that node ID2 obtained from its node number. After the forward delay of the node ID2, the subsequent second allocation slots are all slots updated at least once and are no longer the initial reservation slots.
Accordingly, the node ID3 and the node ID4 following the node ID2 are also sequentially delayed according to the received transmission time slot. The node ID3 and node ID4 sequential method refers to the node 2 sequential method, and is not described in detail in this embodiment.
Step S64: and the current node utilizes the sending time slot to carry out data transmission.
Continuing to refer to fig. 7, in the above example, after the node ID1 completes data transmission by using the time slot 2 and the time slot 3, a data transmission cycle performs data transmission of a node corresponding to a next time slot, that is, the data transmission cycle performs data transmission of a node corresponding to the time slot 4, the node ID2 corresponding to the time slot 4 continues to follow up a relationship between the size of local data to be transmitted of the node ID2 and a preset threshold, the node ID2 determines that 3 time slots are required for data transmission, so that the node ID2 determines that transmission time slots are the time slot 5 and the time slot 6, and the node ID2 transmits the local data to be transmitted by using the time slot 4, the time slot 5 and the time slot 6. And the node ID2 sends the reservation frame to a node ID3 originally corresponding to the time slot 5 and a node ID4 originally corresponding to the time slot 6, and the node ID3 and the node ID4 determine that the second allocated time slot is the same as one time slot in the sending time slot of the node ID2, perform time slot concession and update the original second allocated time slot to a time slot 7 and a time slot 8.
Another embodiment of the present application provides that the method for dynamically allocating a time slot to a node in a dynamic time slot networking process further includes:
carrying out data transmission by utilizing a first allocation time slot when a first allocation time slot corresponding to a current node is carried out in any data transmission period and local data to be transmitted of the current node is less than or equal to a preset threshold value;
when any data transmission period is carried out to a first allocation time slot corresponding to the current node and the local data to be transmitted of the current node is zero, switching the data transmission period to the next time slot of the first allocation time slot.
Dynamic slot allocation of nodes also requires dynamic switching of slots to be performed.
Continuing to refer to fig. 7, the local data to be transmitted of the original virtual master node is 0, that is, the local data to be transmitted of the node ID1 is 0, the local data to be transmitted of the virtual slave node 1 is 0, that is, the local data to be transmitted of the node ID2 is 0, the node ID1 directly switches the time slot 2 to the time slot 3, so that the data transmission cycle starts to perform time slot allocation and data transmission of the node ID2 corresponding to the time slot 3; the node ID2 directly switches the time slot 3 to the time slot 4, so that a data transmission cycle starts to perform time slot allocation and data transmission of the node ID3 corresponding to the time slot 4, the node ID3 reserves the time slot 5 and the time slot 6, namely the node ID2 reserves the time slot 5 and the time slot 6, the time slot 5 and the time slot 6 are used as sending time slots, and the node ID3 and the time slot 4, the time slot 5 and the time slot 6 are used for jointly transmitting local data to be transmitted.
According to the method and the device, an initial reservation time slot is set for each node in a preset communication network according to the priority of node numbers, in each data transmission period, time slot reservation is started to be carried out on a target node corresponding to a first time slot used for transmitting data according to the initial reservation time slot of the node, whether the target node needs to reserve more time slots to transmit the data to be transmitted is determined according to the size of the local data to be transmitted of the target node, specifically, whether the target node needs to reserve a transmission time slot is determined, under the condition that the target node needs to reserve the transmission time slot, the target node broadcasts a reservation frame to all nodes which do not carry out data transmission, and when the time slot corresponding to the node which does not carry out data transmission is contained in the transmission time slot, time slot evacuation is carried out, and the second allocation time slot corresponding to the node is updated. After the target node sends the completion data by using the sending time slot, the data transmission period continues to transmit the data of the next node, and the specific transmission period transmits the data of the node corresponding to the first time slot after the sending time slot of the target node. All nodes in the preset communication network complete the purpose of dynamically allocating time slots to each node according to data requirements in a time slot reservation and time slot concession mode, and dynamic time slot allocation is carried out according to the data length of each node under the condition that no central node exists, so that the nodes in the network can effectively allocate the time slots according to different transmission data lengths while communication collision is avoided, and frequency points are allocated. Because no central node is arranged, the embodiment of the application changes the dependence of the traditional networking mode on the master-slave mode and the defect of low channel utilization rate. The performance requirements of high channel utilization rate, high speed, high survivability and wide application scenes are met.
Based on the same inventive concept, the embodiment of the application provides a dynamic time slot networking device. Fig. 8 is a schematic diagram of a dynamic timeslot networking apparatus according to an embodiment of the present application. As shown in fig. 8, the apparatus includes:
a determining module 81, configured to perform a first allocation time slot corresponding to a current node in any data transmission period, and when data to be transmitted of the current node is greater than a preset threshold, enable the current node to determine a sending time slot according to the size of the data to be transmitted; wherein the transmission slot is at least one slot adjacent to the first allocated slot; the current node is any node in a preset communication network;
a first broadcasting module 82, configured to enable the current node to broadcast the transmission timeslot to an idle node; the idle node is at least one node which does not perform data transmission in the preset communication network;
an updating module 83, configured to update a second allocation timeslot to a timeslot after a last timeslot in the transmission timeslots when any node in the idle nodes determines that the transmission timeslots include the corresponding second allocation timeslot;
a transmission module 84, configured to enable the current node to perform data transmission by using the sending timeslot.
Optionally, the apparatus further comprises:
a receiving module, configured to, before a start of any data transmission cycle, perform local clock alignment on a node that receives a reference time frame according to the reference time frame to obtain a feedback time frame, and return the feedback time frame to a node that broadcasts the reference time frame, so as to determine that the node that receives the reference time frame is a first online node; wherein the reference time frame is a local time of a node having a node number of a highest level in the preset communication network;
the determining module comprises:
the first determining submodule is used for performing a first allocation time slot corresponding to a current first online node in any data transmission period, and enabling the current first online node to determine a sending time slot according to the size of the data to be transmitted when the data to be transmitted of the current first online node is larger than a preset threshold value.
Optionally, the apparatus further comprises:
a second broadcasting module, configured to broadcast, before a start of an arbitrary data transmission cycle, a local time as a reference time frame to other nodes in the preset communication network when a local node number of a node that does not receive the reference time frame is a node number of a highest level;
the return module is used for determining a node which does not receive the reference time frame as a second online node when receiving a feedback time frame returned by other nodes in the preset communication network; the feedback time frame is obtained by performing clock alignment on other nodes in the preset communication network according to the reference time frame;
the determining module comprises:
and the second determining submodule is used for determining a sending time slot according to the size of the data to be transmitted by the current second online node when the first distribution time slot corresponding to the current second online node is carried out in any data transmission period and the data to be transmitted of the current second online node is larger than a preset threshold value.
Optionally, the apparatus further comprises:
the transmission module is used for transmitting data to a first allocation time slot corresponding to a current node in any data transmission period and utilizing the first allocation time slot when the local data to be transmitted of the current node is less than or equal to a preset threshold value;
and the switching module is used for switching the data transmission period to the next time slot of the first allocation time slot when any data transmission period is carried out to the first allocation time slot corresponding to the current node and the local data to be transmitted of the current node is zero.
Optionally, the apparatus further comprises:
the reservation module is used for reserving an initial time slot for each node according to the priority level of the node number corresponding to each node before the first data transmission period begins to obtain an initial distribution time slot corresponding to each node;
and the adjusting module is used for adjusting the initial allocation time slots corresponding to the other nodes on the basis of the target initial allocation time slot according to the size of the data to be transmitted when the target node corresponding to the target initial allocation time slot is detected to have the data to be transmitted larger than the preset threshold value for the first time in any data transmission period.
Optionally, the apparatus further comprises:
a first setting module, configured to set a frequency hopping point for each node in the preset communication network before a first data transmission cycle starts;
the receiving module includes:
and the receiving submodule is used for aligning the local clock of the node receiving the reference time frame according to the reference time frame to obtain a feedback time frame, and returning the feedback time frame to the node broadcasting the reference time frame through the frequency hopping point so as to determine that the node receiving the reference time frame is the first online node.
Optionally, the apparatus further comprises:
the second setting module is used for setting frequency hopping frequency points for each node in the preset communication network before the first data transmission period begins;
the second broadcasting module includes:
and the broadcasting submodule is used for broadcasting the local time serving as the reference time frame to other nodes and new nodes in the preset communication network through the frequency hopping frequency point when the local node number of the node which does not receive the reference time frame is the highest-level node number so that the new node is accessed to the preset communication network according to the reference time frame.
Based on the same inventive concept, another embodiment of the present application provides a readable storage medium, on which a computer program is stored, which when executed by a processor implements the steps in the dynamic timeslot networking method according to any of the above embodiments of the present application.
Based on the same inventive concept, another embodiment of the present application provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the electronic device implements the steps in the dynamic timeslot networking method according to any of the above embodiments of the present application.
For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.
The embodiments in the present specification are described in a progressive or descriptive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
As will be appreciated by one of skill in the art, embodiments of the present application may be provided as a method, apparatus, or computer program product. Accordingly, embodiments of the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-RON, optical storage, and the like) having computer-usable program code embodied therein.
Embodiments of the present application are described with reference to flowchart illustrations and/or block diagrams of methods, apparatus, and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present application have been described, additional variations and modifications of these embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including the preferred embodiment and all such alterations and modifications as fall within the true scope of the embodiments of the application.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising a … …" does not exclude the presence of another identical element in a process, method, article, or terminal apparatus that comprises the element.
The method, the apparatus, the device and the storage medium for dynamic timeslot networking provided by the present application are introduced in detail above, and the description of the above embodiments is only used to help understand the method and the core idea of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Claims (10)

1. A method for dynamic timeslot networking, the method comprising:
the method comprises the steps that a first allocation time slot corresponding to a current node is carried out in any data transmission period, and when data to be transmitted of the current node is larger than a preset threshold value, the current node determines a sending time slot according to the size of the data to be transmitted; wherein the transmission slot is at least one slot adjacent to the first allocated slot; the current node is any node in a preset communication network;
the current node broadcasts the sending time slot to an idle node; the idle node is at least one node which does not perform data transmission in the preset communication network;
when any node in the idle nodes determines that the sending time slot contains the corresponding second allocation time slot, updating the second allocation time slot to a time slot after the last time slot in the sending time slot;
and the current node utilizes the sending time slot to carry out data transmission.
2. The method of claim 1, further comprising:
before any data transmission period starts, carrying out local clock alignment on a node receiving a reference time frame according to the reference time frame to obtain a feedback time frame, and returning the feedback time frame to the node broadcasting the reference time frame to determine that the node receiving the reference time frame is a first online node; wherein the reference time frame is a local time of a node having a node number of a highest level in the preset communication network;
when a first allocation time slot corresponding to a current node is carried out in any data transmission period and data to be transmitted of the current node is larger than a preset threshold value, the current node determines a sending time slot according to the size of the data to be transmitted, and the method comprises the following steps:
and when the data to be transmitted of the current first online node is larger than a preset threshold value, the current first online node determines a sending time slot according to the size of the data to be transmitted.
3. The method of claim 1, further comprising:
before any data transmission period begins, when the local node number of a node which does not receive a reference time frame is the node number of the highest level, the local time is used as the reference time frame to be broadcast to other nodes in the preset communication network;
when a feedback time frame returned by other nodes in the preset communication network is received, determining a node which does not receive the reference time frame as a second online node; the feedback time frame is obtained by performing clock alignment on other nodes in the preset communication network according to the reference time frame;
when a first allocation time slot corresponding to a current node is carried out in any data transmission period and data to be transmitted of the current node is larger than a preset threshold value, the current node determines a sending time slot according to the size of the data to be transmitted, and the method comprises the following steps:
and when the current data to be transmitted of the second online node is larger than a preset threshold value, the current second online node determines a sending time slot according to the size of the data to be transmitted.
4. The method of claim 1, further comprising:
carrying out data transmission by utilizing a first allocation time slot when a first allocation time slot corresponding to a current node is carried out in any data transmission period and local data to be transmitted of the current node is less than or equal to a preset threshold value;
when any data transmission period is carried out to a first allocation time slot corresponding to the current node and the local data to be transmitted of the current node is zero, switching the data transmission period to the next time slot of the first allocation time slot.
5. The method of claim 1, wherein before any data transmission period proceeds to the first allocated time slot corresponding to the current node, the method further comprises:
before the first data transmission period starts, according to the priority level of the node number corresponding to each node, performing initial time slot reservation on each node to obtain an initial allocation time slot corresponding to each node;
when detecting that the data to be transmitted of the target node corresponding to the target initial allocation time slot is larger than the preset threshold value for the first time in any data transmission period, the target node adjusts the initial allocation time slots corresponding to other nodes on the basis of the target initial allocation time slot according to the size of the data to be transmitted.
6. The method of claim 2, further comprising:
before the first data transmission period begins, setting frequency hopping frequency points for each node in the preset communication network;
the method for aligning local clocks of the nodes receiving the reference time frame according to the reference time frame to obtain a feedback time frame, and returning the feedback time frame to the nodes broadcasting the reference time frame so as to determine that the nodes receiving the reference time frame are first online nodes comprises the following steps:
and the node receiving the reference time frame performs local clock alignment according to the reference time frame to obtain a feedback time frame, and returns the feedback time frame to the node broadcasting the reference time frame through the frequency hopping point, so as to determine that the node receiving the reference time frame is the first online node.
7. The method of claim 3, further comprising:
before the first data transmission period begins, setting frequency hopping frequency points for each node in the preset communication network;
when the local node number is the node number of the highest level, the node which does not receive the reference time frame broadcasts the local time as the reference time frame to other nodes in the preset communication network, and the method comprises the following steps:
and when the local node number is the highest node number, the node which does not receive the reference time frame broadcasts local time as the reference time frame to other nodes and new nodes in the preset communication network through the frequency hopping point, so that the new node is accessed to the preset communication network according to the reference time frame.
8. A dynamic time slot networking apparatus, the apparatus comprising:
the determining module is used for determining a sending time slot according to the size of the data to be transmitted by the current node when a first allocation time slot corresponding to the current node is carried out in any data transmission period and the data to be transmitted of the current node is larger than a preset threshold value; wherein the transmission slot is at least one slot adjacent to the first allocated slot; the current node is any node in a preset communication network;
a first broadcasting module, configured to enable the current node to broadcast the transmission timeslot to an idle node; the idle node is at least one node which does not perform data transmission in the preset communication network;
an updating module, configured to update a second allocation timeslot to a timeslot after a last timeslot in the transmission timeslots when any node in the idle nodes determines that the transmission timeslots include the corresponding second allocation timeslot;
and the transmission module is used for enabling the current node to utilize the sending time slot to carry out data transmission.
9. A readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor when executed implements the steps of the method according to any of claims 1-7.
CN202111012925.4A 2021-08-31 2021-08-31 Dynamic time slot networking method, device, equipment and storage medium Pending CN115767731A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111012925.4A CN115767731A (en) 2021-08-31 2021-08-31 Dynamic time slot networking method, device, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111012925.4A CN115767731A (en) 2021-08-31 2021-08-31 Dynamic time slot networking method, device, equipment and storage medium

Publications (1)

Publication Number Publication Date
CN115767731A true CN115767731A (en) 2023-03-07

Family

ID=85331930

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111012925.4A Pending CN115767731A (en) 2021-08-31 2021-08-31 Dynamic time slot networking method, device, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN115767731A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117792559A (en) * 2024-02-28 2024-03-29 深圳市瑞天激光有限公司 Data transmission method, device and system based on time slot allocation

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117792559A (en) * 2024-02-28 2024-03-29 深圳市瑞天激光有限公司 Data transmission method, device and system based on time slot allocation
CN117792559B (en) * 2024-02-28 2024-05-28 深圳市瑞天激光有限公司 Data transmission method, device and system based on time slot allocation

Similar Documents

Publication Publication Date Title
CN101977385B (en) DSAM (Dynamic Slot-time Allocation Method) of scale-extensible single-jump ad hoc network supporting QoS (Quality of Service)
CN108809356B (en) Method for realizing frequency hopping networking based on TDMA technology
US8873587B2 (en) Communication method using time-division multiplexing
CN111107622B (en) Time synchronization system and method of self-adaptive networking based on ultra-wideband wireless communication
CN105119632A (en) Multi-frequency hopping pattern based communication method applicable to mobile ad hoc network
MXPA97006243A (en) System and method for access to a distribution of time dinam
KR20180058662A (en) Method for collision avoidance in synchronized wireless communication system
CN111836312B (en) Resource reservation method and equipment based on competition
CN110034942B (en) Networking communication control method and system based on half-duplex radio station
CN115767731A (en) Dynamic time slot networking method, device, equipment and storage medium
EP0419593B1 (en) Time division multiplexer/demultiplexer with deterministic time slot assignment
CN114448549A (en) Ad hoc network dynamic TDMA control time slot allocation method based on adjacent node information
CN111836370A (en) Resource reservation method and equipment based on competition
CN109429347B (en) Time slot allocation method and device
JPH1093607A (en) Communication system
CN108551690A (en) A kind of radio equipment access method, device and terminal device
EP1048153B1 (en) System for establishing a transmission sequence for plural terminals in a wireless network
CN104159309A (en) Resource allocation optimization method and resource allocation optimization device
GB2449423A (en) Wireless frame structure candidates with varying slot allocation selected according to up/downlink loads with adaptive synchronisation field
US8792463B2 (en) Method for managing a distribution of bandwidth in a communications network, corresponding storage means and slave node
JP2000324535A (en) Frame synchronizing device in mobile communication system
CN108471640B (en) Dynamic and static mixed time slot allocation method and system
KR101976719B1 (en) Apparatus for Frequency Hopping Communication for Network Interference Avoidance
CN111586880A (en) Dynamic hybrid access method and system suitable for TDMA
CN101384080B (en) Network accessing method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination