A self-organizing time slot uniform allocation method

Abstract

The present invention belongs to a self-organizing method for uniform time slot allocation in the field of communication technology, including a wireless TDMA access system. The wireless TDMA access system mainly consists of a master node and slave nodes with the ability of duplex operation, and the radio frequency transmission parameters of the master node are consistent with the radio frequency reception parameters of the slave nodes. The time frame length, the number of time slots, the guard interval, the time slot allocation situation, and the radio frequency reception parameters of the master node in the wireless TDMA access system are specified by the master node. The present invention can achieve dynamic and uniform division of the occupied time slots within the allowable range of system capacity. When the number of time slots occupied by a single node exceeds one, the time slots occupied by this node can be evenly divided within one time frame, reducing the message delay and improving the real-time performance of data transmission in the TDMA system.

Description

Technical Field

[0001] The present invention relates to the field of communication technologies, and particularly to a method for self-organizing and evenly allocating time slots. Background Art

[0002] The traditional TDMA time slot allocation method is fixed allocation, which requires planning the use of time slots before use. It lacks flexibility and is difficult to make temporary adjustments according to actual needs. When facing slave nodes in some dynamic networks with requirements for data transmission delay and hoping that the data transmission intervals are as even as possible, the traditional TDMA time slot allocation method cannot make effective adjustments and responses in a timely manner. Summary of the Invention

[0003] The purpose of the present invention is to provide a method for self-organizing and evenly allocating time slots to solve the above problems.

[0004] The present invention achieves the above purpose through the following technical solutions:

[0005] A method for self-organizing and evenly allocating time slots, including a wireless TDMA access system. The wireless TDMA access system includes a master node and slave nodes with duplex working capabilities, and the radio frequency parameters transmitted by the master node are the same as the radio frequency parameters received by the slave nodes; the time frame length, the number of time slots, the guard interval, the time slot allocation situation, and the radio frequency parameters received by the master node of the wireless TDMA access system are specified by the master node;

[0006] The method includes:

[0007] Step 1: After the master node receives the time slot allocation request frames from each slave node, according to the number of time slots applied for by each slave node, arrange the starting transmission positions of the slave nodes within a time frame. Those with more applied time slots are arranged in the front, and obtain the starting transmission time slot position array of the slave nodes and the array of the number of applied time slots and the remaining number of time slots of the slave nodes: start[m] (m = 1, 2,..., n), length[m] (m = 1, 2,..., n, n + 1; length[n + 1] is the number of idle time slots), and update the information in the broadcast frame for broadcasting;

[0008] Step 2: After each slave node receives the second broadcast frame, it obtains the number of nodes in the network nodecount and the number of occupied time slots and the number of idle time slots of each slave node length[m] (m = 0, 1,..., n, n + 1), and determines whether there are any idle time slots, that is, whether length[n + 1] is greater than zero. If so, then a = 1; if not, then a = 0. Compare the number of occupied time slots of this slave node with the number of idle time slots. If the number of occupied time slots of this slave node is less than the number of idle time slots, then the starting position of the transmission of this node in the time frame is shifted back by one time slot; and based on this, the data of the first time slot in this time frame is transmitted. The starting time slot position of this slave node in the time frame is start[i]. Finally, length[m] is sorted from largest to smallest to obtain length[M] (M = 0, 1,..., N, N + 1);

[0009] Step 3: According to the number of time slots length[i] applied by this slave node, perform length[i] - 1 times of cyclic transmission. The transmission interval is wait[j] (j = 1, 2,..., length[i] - 1). The cyclic waiting interval is determined by the number of time slots applied by each slave node and the number of idle time slots. The initial waiting time is wait[1] = nodecount + a; in each cycle, length[M] is decremented by one in turn, and then length[M] is judged in turn. If length[M] = 0 and M < start[i] or length[M] < 0, then wait[j] is decremented by one.

[0010] A master-slave node duplex communication method includes:

[0011] S1: The master node sends a first broadcast frame with a period of one time frame length to the slave nodes;

[0012] S2: The slave node receives the first broadcast frame, sets the transmission radio frequency parameters after reading the content of the first broadcast frame, generates an access request frame, and sends the access request frame to the master node in the idle time slot;

[0013] S3: The master node receives the access request frame, allocates the initial time slots of the slave nodes according to the above self-organizing time slot uniform allocation method, updates the time slot allocation scheme to the first broadcast frame to generate a second broadcast frame, and sends the second broadcast frame to the slave nodes;

[0014] S4: The slave node receives the second broadcast frame, generates a time slot transmission strategy according to the number of nodes and the number of occupied time slots declared in the second broadcast frame, and sends data to the master node according to the starting time slot allocated to itself;

[0015] S5: After the master node receives the data, it uses the network exit algorithm to determine that after the slave node exits the network, it re - allocates time slots, updates the time slot allocation scheme into the second broadcast frame to generate the third broadcast frame, and broadcasts the third broadcast frame.

[0016] Furthermore, the information included in the broadcast frame are: the receiving radio frequency configuration information of the master node, the time frame length, the number of time slots within the time frame, the number of free time slots, the number of nodes in the network, the node IDs in the network, and the time slot information occupied by the nodes in the network.

[0017] Furthermore, the information included in the network access application frame are: the ID of the node applying for network access, and the number of time slots that the node applying for network access needs to occupy.

[0018] The beneficial effects are as follows:

[0019] It can dynamically and evenly divide the occupied time slots within the allowable range of the system capacity. When the number of time slots occupied by a single node exceeds one, the time slots occupied by this node can be evenly divided within one time frame, reducing the message delay and improving the real - time performance of data transmission in the TDMA system.

[0020] The additional technical features and their advantages of the present invention will be more clearly described in the following description content, or can be understood through the specific practice of the present invention. Description of the Drawings

[0021] The drawings are used to provide a further understanding of the present invention, and constitute a part of the specification. Together with the following specific implementation manners, they are used to explain the present invention, but do not constitute a limitation to the present invention. In the drawings:

[0022] Figure 1 is a comparison diagram of time slot allocation between the present invention and the prior art;

[0023] Figure 2 is a flowchart of the time slot allocation scheme of the present invention. Detailed Description of the Invention

[0024] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all of the embodiments.

[0025] As Figure 1-2 shown, a self - organizing time slot uniform allocation method includes a wireless TDMA access system. The wireless TDMA access system mainly consists of a master node and slave nodes with duplex working capabilities, and the transmitting radio frequency parameters of the master node are the same as the receiving radio frequency parameters of the slave nodes; the time frame length, the number of time slots, the guard interval, the time slot allocation situation, and the receiving radio frequency parameters of the master node of the wireless TDMA access system are specified by the master node;

[0026] The method includes:

[0027] Step 1: After the master node receives the time slot allocation request frames from each slave node, according to the number of time slots applied for by each slave node, it arranges the transmission start positions of each slave node within a time frame. Those with more applied time slots are arranged in the front, obtaining the array of the start transmission time slots of the slave nodes and the array of the number of applied time slots and the remaining time slots of the slave nodes: start[m] (m = 1, 2,..., n), length[m] (m = 1, 2,..., n, n + 1; length[n + 1] is the number of idle time slots), and updates the information in the broadcast frame for broadcasting;

[0028] Step 2: After each slave node receives the second broadcast frame, it obtains the number of nodes in the network nodecount and the number of time slots occupied by each slave node and the number of idle time slots length[m] (m = 0, 1,..., n, n + 1), and judges whether there are idle time slots, that is, whether length[n + 1] is greater than zero. If so, then a = 1; if not, then a = 0. Compare the number of time slots occupied by this slave node with the number of idle time slots. If the number of time slots occupied by this slave node is less than the number of idle time slots, then the transmission start position of this node within the time frame is shifted backward by one time slot; and based on this, it transmits the data of the first time slot within the time frame. The transmission start time slot position of this slave node within the time frame is start[i], and finally, length[m] is sorted from large to small to obtain length[M] (M = 0, 1,..., N, N + 1);

[0029] Step 3: According to the number of time slots length[i] applied for by this slave node, perform length[i] - 1 times of cyclic transmission. The transmission interval is wait[j] (j = 1, 2,..., length[i] - 1). The cyclic waiting interval is determined by the number of time slots applied for by each slave node and the number of idle time slots. The initial waiting time is wait[1] = nodecount + a; within each cycle, length[M] is decreased by one in turn, and then length[M] is judged in turn. If length[M] = 0 and M < start[i] or length[M] < 0, then wait[j] is decreased by one;

[0030] Such a setting can achieve dynamic and uniform division of the occupied time slots within the allowable range of the system capacity. When the number of time slots occupied by a single node exceeds one, the time slots occupied by this node can be evenly divided within a time frame, reducing the delay of message transmission and improving the real-time performance of data transmission in the TDMA system.

[0031] A master-slave node duplex communication method includes:

[0032] S1: The master node sends a first broadcast frame with a cycle length of one time frame to the slave nodes;

[0033] S2: Receive the first broadcast frame from the slave node. After reading the content of the first broadcast frame, set the transmission radio frequency parameters, generate an access request frame, and send the access request frame to the master node in the idle time slot.

[0034] S3: The master node receives the access request frame, allocates the initial time slot of the slave node according to the above self-organizing time slot uniform distribution method, updates the time slot allocation scheme to the first broadcast frame to generate a second broadcast frame, and sends the second broadcast frame to the slave node.

[0035] S4: The slave node receives the second broadcast frame, generates a time slot transmission strategy according to the number of nodes and the number of occupied time slots declared in the second broadcast frame, and sends data to the master node according to the starting time slot assigned to itself.

[0036] S5: After receiving the data, the master node judges whether the slave node has withdrawn from the network through the network withdrawal algorithm, re-performs time slot allocation, updates the time slot allocation scheme to the second broadcast frame to generate a third broadcast frame, and broadcasts the third broadcast frame.

[0037] Among them, the information included in the broadcast frame are: the receiving radio frequency configuration information of the master node, the time frame length, the number of time slots in the time frame, the number of idle time slots, the number of nodes in the network, the node IDs in the network, and the time slot information occupied by the nodes in the network.

[0038] The time slot allocation scheme refers to the network resource situation before and after the update of the two broadcast frames, mainly including the number of slave nodes in the network, the number of time slots occupied by each slave node, and the initial transmission time slot of each slave node.

[0039] The information included in the access request frame are: the ID of the node applying for access and the number of time slots required by the node applying for access. Such a setting can achieve dynamic and uniform division of the occupied time slots within the allowable range of the system capacity. When the number of time slots occupied by a single node exceeds one, the time slots occupied by this node can be evenly divided within a time frame, reducing the delay of message sending and improving the real-time performance of data transmission in the TDMA system.

[0040] The above shows and describes the basic principle, main features and advantages of the present invention. Those skilled in the art should understand that the present invention is not limited by the above embodiments. What is described in the above embodiments and the specification only illustrates the principle of the present invention. Without departing from the spirit and scope of the present invention, the present invention will have various changes and improvements, and these changes and improvements all fall within the scope of the present invention claimed. The scope of protection claimed by the present invention is defined by the appended claims and their equivalents.

Claims

1. A self-organizing time slot uniform allocation method, characterized in that It includes a wireless TDMA access system, which consists of a master node and slave nodes with duplex working ability, and the RF transmission parameters of the master node are the same as the RF reception parameters of the slave nodes; the time frame length, number of time slots, guard interval, time slot allocation, and RF reception parameters of the master node of the wireless TDMA access system are specified by the master node; The method includes: Step 1: After the master node receives the time slot allocation request frames from each slave node, according to the number of time slots applied for by each slave node, arrange their transmission start positions within one time frame, with those applying for more time slots ranked in the front, to obtain the array of the start time slots of the slave nodes and the arrays of the number of time slots applied for by the slave nodes and the remaining number of time slots: start[m] (m = 1, 2,..., n), length[m] (m = 1, 2,..., n, n + 1; length[n + 1] is the number of idle time slots), and update the information in the broadcast frame for broadcasting; Step 2: After each slave node receives the second broadcast frame, obtain the number of nodes in the network nodecount and the number of time slots occupied by each slave node and the number of idle time slots length[m] (m = 0, 1,..., n, n + 1), and determine whether there are idle time slots, that is, whether length[n + 1] is greater than zero. If so, then a = 1; if not, then a = 0; compare the number of time slots occupied by this slave node with the number of idle time slots. If the number of time slots occupied by this slave node is less than the number of idle time slots, then the transmission start position of this node within the time frame is shifted back by one time slot; and based on this, send the data of the first time slot within the time frame. The transmission start time slot position of this slave node within the time frame is start[i], and finally, sort length[m] from largest to smallest to obtain length[M] (M = 0, 1,..., N, N + 1); Step 3: Perform length[i] - 1 times of cyclic transmission according to the number of time slots length[i] applied for by this slave node. The transmission interval is wait[j] (j = 1, 2,..., length[i] - 1). The cyclic waiting interval is determined by the number of time slots applied for by each slave node and the number of idle time slots. The initial waiting time is wait[1] = nodecount + a; within each cycle, length[M] is decreased by one in turn, and then length[M] is judged in turn. If length[M] = 0 and M < start[i] or length[M] < 0, then wait[j] is decreased by one.

2. The master-slave node duplex communication method of the self-organizing time slot uniform distribution method according to claim 1, characterized in that: It includes: S1: The master node sends a first broadcast frame with a cycle of one time frame length to the slave nodes; S2: The slave nodes receive the first broadcast frame, set the RF transmission parameters after reading the content of the first broadcast frame, generate an access application frame, and send the access application frame to the master node in the idle time slots; S3: The master node receives the access application frame, allocates the initial time slots of the slave nodes according to the self-organizing time slot uniform allocation method, updates the time slot allocation scheme into the first broadcast frame to generate a second broadcast frame, and sends the second broadcast frame to the slave nodes; S4: Receive the second broadcast frame from the node, generate a time slot transmission strategy according to the number of nodes declared in the second broadcast frame and the number of occupied time slots, and send data to the master node according to the starting time slot allocated to itself; S5: After the master node receives the data, through the network exit algorithm, determine that after the slave node exits the network, re-allocate time slots, update the time slot allocation scheme to the second broadcast frame to generate a third broadcast frame, and broadcast the third broadcast frame.

3. The master-slave node duplex communication method according to claim 2, wherein: The information included in the broadcast frame are: the receiving radio frequency configuration information of the master node, the time frame length, the number of time slots within the time frame, the number of free time slots, the number of nodes in the network, the node IDs of the nodes in the network, and the time slot information occupied by the nodes in the network.

4. The master-slave node duplex communication method according to claim 2, characterized in that: The information included in the network access application frame are: the ID of the node applying for network access, the number of time slots required by the node applying for network access.

Images