CN119450725A - Distributed time division multiple access time slot allocation method, electronic equipment, medium and system - Google Patents
Distributed time division multiple access time slot allocation method, electronic equipment, medium and system Download PDFInfo
- Publication number
- CN119450725A CN119450725A CN202411599202.2A CN202411599202A CN119450725A CN 119450725 A CN119450725 A CN 119450725A CN 202411599202 A CN202411599202 A CN 202411599202A CN 119450725 A CN119450725 A CN 119450725A
- Authority
- CN
- China
- Prior art keywords
- node
- transmitting
- time slot
- receiving
- sequentially
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
-
- Y—GENERAL 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE 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/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a distributed time division multiple access time slot distribution method, electronic equipment, media and a system, wherein the method sequentially numbers all nodes, endows each node with unique ID, and forms two inverted isosceles triangular arrays according to a certain rule by constructing a node mapping relation of 'transmitting node number- > receiving node number', so that fairness of a distributed time division multiple access network can be ensured, any two nodes in the network have equal communication opportunities, each time slot is internally provided with only one transceiving communication pair, each transceiving communication pair in the two inverted isosceles triangular arrays is arranged at a corresponding time slot position according to an arrangement rule, any node in a time slot table can be ensured not to be in a transmitting state in two continuous time slots, and therefore continuous transmitting time length of wireless communication equipment is reduced, and heating of the communication equipment is relieved. The technical scheme of the invention is applied to solve the technical problem of serious heating caused by long continuous emission time of communication equipment in the prior art.
Description
Technical Field
The present invention relates to the field of data link technologies, and in particular, to a distributed tdma timeslot allocation method, electronic device, medium, and system.
Background
In a mobile ad hoc network of a distributed time division multiple access system, data interaction between nodes is realized by means of wireless communication devices. The distributed time slot allocation algorithm of time division multiple access not only considers fairness of access opportunities among nodes, but also considers actual heating situation of communication equipment, heating is related to macroscopic communication duty ratio and microscopic continuous emission duration, and the microscopic continuous emission duration is reduced as much as possible under the condition that macroscopic communication duty ratio is the same, and meanwhile, the wireless communication equipment can always work in a more comfortable temperature range by combining an advanced cooling technology. The time slot allocation method provided by the invention is mainly used for reducing the continuous transmission time length of the wireless communication equipment.
Disclosure of Invention
The invention provides a distributed time division multiple access time slot allocation method, electronic equipment, media and a system, which can solve the technical problem of serious heating caused by long continuous transmitting time of communication equipment in the prior art.
According to an aspect of the present invention, there is provided a distributed time division multiple access time slot allocation method, the method comprising:
s1, sequentially numbering all nodes, wherein each node is a transmitting node and a receiving node;
s2, constructing a node mapping relation of 'transmitting node number- > receiving node number', wherein if the transmitting node number is i, the corresponding receiving node number starts from i+1 to the end of the maximum node number, the value of the node number i is added to the maximum node number minus 1 from 1, N-i node mapping relations obtained each time are independently arranged from left to right to form an i-th row, and a first inverted isosceles triangular matrix is formed, wherein N is the total number of all nodes;
s3, exchanging the number of the transmitting node and the number of the receiving node of each node mapping relation in the first inverted isosceles triangular matrix to be used as a new node mapping relation of 'transmitting node number- > receiving node number', and forming a second inverted isosceles triangular matrix;
S4, for the first inverted isosceles triangular matrix, starting from 1- > N ', finishing along oblique lines to (N-1) - > N', sequentially obtaining N-1 node mapping relations, starting from 1- > (N-1) ", finishing along oblique lines to (N-2) - > (N-1)", sequentially obtaining N-2 node mapping relations, and sequentially analogizing to 1- >2", thus obtaining a node mapping relation;
S5, for a second inverted isosceles triangular matrix, starting from 'N- > 1', ending along a horizontal straight line to '2- > 1', sequentially obtaining N-1 node mapping relations, starting from 'N- > 2', ending along a horizontal straight line to '3- > 2', sequentially obtaining N-2 node mapping relations, and sequentially analogizing to 'N- > (N-1)' to obtain a node mapping relation;
and S6, sequentially occupying a time slot by the receiving-transmitting node pair in each node mapping relation obtained in the S4 and the S5 according to the sequence, and obtaining a continuous time slot arrangement sequence.
According to another aspect of the present invention there is provided an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the steps of the method for distributed time division multiple access slot allocation as set out in the foregoing.
According to a further aspect of the present invention there is provided a computer readable storage medium storing a computer program which when executed by a processor performs the steps of the distributed time division multiple access time slot allocation method of the present invention as set out above.
According to still another aspect of the present invention, there is provided a distributed time division multiple access slot allocation system, the system including a node numbering module, a transceiver node design module, and a slot arrangement rule design module;
the node numbering module is used for sequentially numbering all the nodes, and each node is not only a transmitting node but also a receiving node;
The receiving and transmitting node design module is used for constructing a node mapping relation of 'transmitting node number- > receiving node number', wherein if the transmitting node number is i, the corresponding receiving node number starts from i+1 to the maximum node number is ended, the value of the node number i is added to the maximum node number minus 1 from 1, N-i node mapping relations obtained each time are independently arranged into an i-th row from left to right to form a first inverted isosceles triangular matrix, N is the total number of all nodes, and the transmitting node number and the receiving node number of each node mapping relation in the first inverted isosceles triangular matrix are exchanged to form a new node mapping relation of 'transmitting node number- > receiving node number', so as to form a second inverted isosceles triangular matrix;
The time slot arrangement rule design module is used for sequentially obtaining N-1 node mapping relations from '1- > N', starting from '1- > (N-1) > (N) >, starting from' 1- > (N-1) >, ending from '1- > (N-1) >, sequentially obtaining N-2 node mapping relations, and analogizing to' 1- > -2) >, obtaining a node mapping relation, sequentially obtaining N-1 node mapping relations from 'N- > -1', starting from 'N- >, ending from' 2- > -1 ', sequentially obtaining N-2 node mapping relations from' N- > -2 ', ending from' N- > -2 ', sequentially obtaining a node mapping relation, sequentially analogizing to' N- > (N-1) >, and sequentially occupying one time slot for each obtained transceiver node pair in the node mapping relation, and obtaining a continuous time slot arrangement sequence.
The invention provides a distributed time division multiple access time slot distribution method, electronic equipment, media and a system, wherein the distributed time division multiple access time slot distribution method sequentially numbers all nodes, endows each node with unique ID, forms two inverted isosceles triangular arrays according to a certain rule by constructing a node mapping relation of 'transmitting node number- > receiving node number', can ensure fairness of a distributed time division multiple access network, has equal communication opportunities for any two nodes in the network, has one transmitting and receiving communication pair in each time slot, can realize discretization of node transmitting time slots by arranging each transmitting and receiving communication pair in the two inverted isosceles triangular arrays at corresponding time slot positions according to an arrangement rule, ensures that any node in the time slot table can not be in a transmitting state in two continuous time slots, and compresses node continuous transmitting time to single time slot length on the premise of ensuring distributed time division multiple access fairness, thereby reducing continuous transmitting time length of wireless communication equipment and relieving heating caused by continuous transmitting of the communication equipment.
Drawings
The accompanying drawings, which are included to provide a further understanding of embodiments of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention. It is evident that the drawings in the following description are only some embodiments of the present invention and that other drawings may be obtained from these drawings without inventive effort for a person of ordinary skill in the art.
Fig. 1 (a) is a schematic diagram of a first inverted isosceles triangle in a distributed time division multiple access timeslot allocation method according to an embodiment of the present invention;
Fig. 1 (b) is a schematic diagram of a second inverted isosceles triangle in a distributed time division multiple access timeslot allocation method according to an embodiment of the present invention;
Fig. 2 (a) shows a schematic diagram of the time slot allocation according to fig. 1 (a);
fig. 2 (b) shows a schematic diagram of the time slot allocation according to fig. 1 (b);
Fig. 3 (a) shows one of five-node slot allocation schematics provided in accordance with a specific embodiment of the present invention;
FIG. 3 (b) shows a second schematic diagram of five-node slot allocation provided in accordance with an embodiment of the present invention;
fig. 4 is a schematic diagram of a five-node timeslot arrangement result according to an embodiment of the present invention.
Detailed Description
It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be combined with each other. The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. The following description of at least one exemplary embodiment is merely exemplary in nature and is in no way intended to limit the application, its application, or uses. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of exemplary embodiments according to the present application. As used herein, the singular is also intended to include the plural unless the context clearly indicates otherwise, and furthermore, it is to be understood that the terms "comprises" and/or "comprising" when used in this specification are taken to specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof.
The relative arrangement of the components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless it is specifically stated otherwise. Meanwhile, it should be understood that the sizes of the respective parts shown in the drawings are not drawn in actual scale for convenience of description. Techniques, methods, and apparatus known to one of ordinary skill in the relevant art may not be discussed in detail, but should be considered part of the specification where appropriate. In all examples shown and discussed herein, any specific values should be construed as merely illustrative, and not a limitation. Thus, other examples of the exemplary embodiments may have different values. It should be noted that like reference numerals and letters refer to like items in the following figures, and thus once an item is defined in one figure, no further discussion thereof is necessary in subsequent figures.
As shown in fig. 1 (a), 1 (b), 2 (a), and 2 (b), according to an embodiment of the present invention, there is provided a distributed tdma time slot allocation method, which includes:
s1, sequentially numbering all nodes, wherein each node is a transmitting node and a receiving node;
s2, constructing a node mapping relation of 'transmitting node number- > receiving node number', wherein if the transmitting node number is i, the corresponding receiving node number starts from i+1 to the end of the maximum node number, the value of the node number i is added to the maximum node number minus 1 from 1, N-i node mapping relations obtained each time are independently arranged from left to right to form an i-th row, and a first inverted isosceles triangular matrix is formed, wherein N is the total number of all nodes;
s3, exchanging the number of the transmitting node and the number of the receiving node of each node mapping relation in the first inverted isosceles triangular matrix to be used as a new node mapping relation of 'transmitting node number- > receiving node number', and forming a second inverted isosceles triangular matrix;
S4, for the first inverted isosceles triangular matrix, starting from 1- > N ', finishing along oblique lines to (N-1) - > N', sequentially obtaining N-1 node mapping relations, starting from 1- > (N-1) ", finishing along oblique lines to (N-2) - > (N-1)", sequentially obtaining N-2 node mapping relations, and sequentially analogizing to 1- >2", thus obtaining a node mapping relation;
S5, for a second inverted isosceles triangular matrix, starting from 'N- > 1', ending along a horizontal straight line to '2- > 1', sequentially obtaining N-1 node mapping relations, starting from 'N- > 2', ending along a horizontal straight line to '3- > 2', sequentially obtaining N-2 node mapping relations, and sequentially analogizing to 'N- > (N-1)' to obtain a node mapping relation;
and S6, sequentially occupying a time slot by the receiving-transmitting node pair in each node mapping relation obtained in the S4 and the S5 according to the sequence, and obtaining a continuous time slot arrangement sequence.
By means of the configuration mode, the distributed time division multiple access time slot allocation method is provided, all nodes are numbered sequentially, unique IDs are given to the nodes, two inverted isosceles triangular arrays are formed according to a certain rule by constructing a node mapping relation of a transmitting node number and a receiving node number, fairness of a distributed time division multiple access network can be guaranteed, any two nodes in the network have equal communication opportunities, each time slot is provided with only one transceiving communication pair, the transmitting time slots of the nodes can be discretized by arranging the transceiving communication pairs in the corresponding time slot positions according to an arrangement rule, any node in the time slot table is guaranteed not to be in a transmitting state in two continuous time slots, continuous transmitting time of the nodes is compressed to a single time slot length on the premise of guaranteeing distributed time division multiple access fairness, and accordingly continuous transmitting time length of wireless communication equipment is shortened, and heating caused by continuous transmitting of the communication equipment is relieved. Compared with the prior art, the technical scheme of the invention can solve the technical problem of serious heating caused by long continuous transmitting time of communication equipment in the prior art.
In the above embodiment, all the nodes are numbered sequentially in order to avoid collision in multiple access, so the numbers of the respective nodes have mutual exclusivity and uniqueness, which are unique identifiers of each node, that is, node numbers, that is, node IDs, and each node has a unique node ID. The specific steps for carrying out the design of the receiving and transmitting node based on the node ID are as follows:
a) Discharging a first row of a first inverted isosceles triangle:
1) The node with the node ID of 1 is used as a transmitting node, the node with the node ID of 2 is used as a receiving node, and a 1 st transceiving communication pair of 1-2 is formed;
2) The node with the node ID of 1 is used as a transmitting node, the node with the node ID of 3 is used as a receiving node, and a2 nd transceiving communication pair of 1-3 is formed;
3) And so on until the node with the node ID of 1 is used as a transmitting node, and the node with the node ID of N is used as a receiving node, so as to form an N-1 transceiver communication pair;
4) The 1 st to the (N-1) th transceiver communication pairs are arranged in 1 row from left to right as the first row of the first inverted isosceles triangle array.
B) Discharging a second row of the first inverted isosceles triangle:
1) The node with the node ID of 2 is used as a transmitting node, the node with the node ID of 3 is used as a receiving node, and the 1 st transceiving communication pair of 2-3 is formed;
2) The node with the node ID of 2 is used as a transmitting node, the node with the receiving ID of 4 is used as a receiving node, and a2 nd transceiving communication pair of 2-4 is formed;
3) And so on until the node with the node ID of 2 is used as a transmitting node, and the node with the node ID of N is used as a receiving node to form an N-2 transceiver communication pair;
4) And arranging the 1 st to N-2 th transceiving communication pairs into 1 row from left to right as a second row of the first inverted isosceles triangle array, wherein the 1 st transceiving communication pair of the second row is positioned between the 1 st transceiving communication pair of the first row and the 2 nd transceiving communication pair of the first row so as to ensure that the final configuration is an inverted isosceles triangle.
C) And so on, the last row of the first inverted isosceles triangle is discharged:
The last row has only one receiving and transmitting communication pair, the node ID of the transmitting node is N-1, and the node ID of the receiving node is N.
D) Discharging the first row of the second inverted isosceles triangle:
1) The node with the node ID of 2 is used as a transmitting node, the node with the node ID of 1 is used as a receiving node, and a1 st transceiving communication pair is formed;
2) The node with the node ID of 3 is used as a transmitting node, the node with the node ID of 1 is used as a receiving node, and a2 nd transceiving communication pair is formed;
3) And analogically, until the node with the node ID of N is used as a transmitting node, the node with the node ID of 1 is used as a receiving node, and the N-1 th transceiving communication pair is formed;
4) The 1 st to the (N-1) th transceiver communication pairs are arranged in 1 row from left to right as the first row of the second inverted isosceles triangle array.
E) Discharging a second row of a second inverted isosceles triangle:
1) The node with the node ID of 3 is used as a transmitting node, the node with the node ID of 2 is used as a receiving node, and the 1 st transceiver communication pair is formed;
2) The node with the node ID of 4 is used as a transmitting node, the node with the node ID of 2 is used as a receiving node, and a2 nd transceiving communication pair is formed;
3) And analogically, until the node with the node ID of N is used as a transmitting node, the node with the node ID of 2 is used as a receiving node, and the N-2 th transceiving communication pair is formed;
4) The 1 st to the N-2 th transceiver communication pairs are arranged in1 row from left to right as the second row of the second inverted isosceles triangle array.
F) And so on, discharging the last row of the second inverted isosceles triangle array:
The last row has only one receiving and transmitting communication pair, the node ID of the transmitting node is N, and the node ID of the receiving node is N-1.
The first inverted isosceles triangular matrix formed by arranging the transmitting and receiving nodes of the N-node network is shown in fig. 1 (a), the second inverted isosceles triangular matrix formed by arranging the transmitting and receiving nodes of each transmitting and receiving communication pair in the first inverted isosceles triangular matrix is shown in fig. 1 (b), and the steps d) to f) are implemented by actually exchanging the transmitting node ID and the receiving node ID of each transmitting and receiving communication pair in the first inverted isosceles triangular matrix, that is, the node originally used for transmitting is changed into the node used for receiving, the node originally used for receiving is changed into the node used for transmitting, and the positions of the transmitting and receiving communication pairs in the triangular matrix are unchanged, so that the second inverted isosceles triangular matrix is obtained.
Based on the above embodiment, the multiple access is completed for the tdma network according to the slot table, and the slot table allocation process is to arrange all the transceiver communication pairs in the 2 inverted isosceles triangular arrays into the slot table according to a certain rule, and the rule of slot arrangement determines which slot the node completes information transmission and which slot completes information reception. In the embodiment of the invention, the time slot arrangement rule is specifically as follows:
a) The right oblique line of the first inverted isosceles triangle array is discharged into a slot table:
1) The first transceiving communication pair of the right oblique line of the first inverted isosceles triangle array is the last transceiving communication pair of the first line of the first inverted isosceles triangle array, the sending node ID is 1, and the receiving node ID is N;
2) The second transceiving communication pair of the right oblique line of the first inverted isosceles triangle array is the last transceiving communication pair of the second line of the first inverted isosceles triangle array, the sending node ID is 2, and the receiving node ID is N;
3) And so on, the last transceiving communication pair of the right oblique line of the first inverted isosceles triangle array is the last transceiving communication pair of the first inverted isosceles triangle array, the ID of a transmitting node is N-1, and the ID of a receiving node is N;
4) And (3) arranging the 1 st transceiving communication pair of the right oblique line into the 1 st time slot of the time slot table, arranging the 2 nd transceiving communication pair of the right oblique line into the 2 nd time slot of the time slot table, and so on until the last transceiving communication pair of the right oblique line is arranged into the time slot table.
B) The first inverted isosceles triangle matrix right two oblique lines are discharged into a slot table:
1) The first transceiving communication pair of the right two oblique lines of the first inverted isosceles triangular array is the penultimate transceiving communication pair of the first row of the first inverted isosceles triangular array, the sending node is 1, and the receiving node is N-1;
2) The second transceiving communication pair of the right two oblique lines of the first inverted isosceles triangle array is the penultimate transceiving communication pair of the second line of the first inverted isosceles triangle array, the sending node is 2, and the receiving node is N-1;
3) And so on, the last transceiving communication pair of the right two oblique lines of the isosceles triangle is the first transceiving communication pair of the penultimate row of the first inverted isosceles triangle, the ID of a transmitting node is N-2, and the ID of a receiving node is N-1;
4) And then the last transceiving communication pair of the right oblique line is arranged in the time slot table in sequence.
C) And by analogy, the first inverted isosceles triangular matrix is arranged into a slot table.
D) Arranging a second inverted isosceles triangle into a slot table:
1) According to the order from right to left, the receiving and transmitting communication pairs of the first row of the second inverted isosceles triangular array are discharged into a time slot table;
2) Arranging the transceiving communication pairs of the second row of the second inverted isosceles triangle array into a slot table according to the order from right to left;
3) And by analogy, the receiving and transmitting communication pairs of the last row of the second inverted isosceles triangular array are discharged into a slot table.
E) The slot allocation ends.
The time slot arrangement process for the first inverted isosceles triangle is shown in fig. 2 (a), and the time slot arrangement process for the second inverted isosceles triangle is shown in fig. 2 (b).
For further understanding of the present invention, the time slot allocation method of the present invention will be described in detail below with reference to fig. 3 and 4 by taking a 5-node network as an example.
5 Nodes are networked for communication, and the node ID (number) is 1 to 5. The procedure described above was followed to form 2 isosceles triangles as shown in fig. 3. For the first isosceles triangle, the transmitting and receiving communication pairs on the right 1 oblique line to the right 4 oblique line are sequentially arranged in a time slot table, as shown in a first row of the time slot table in fig. 4, and for the second isosceles triangle, the transmitting and receiving communication pairs on the 1 st row to the 4 th row are sequentially arranged in the time slot table according to the right-to-left order, as shown in a second row of the time slot table in fig. 4, and the finally formed time slot table is shown in fig. 4. As can be seen from fig. 4, according to the time slot allocation scheme formed by this method, any two nodes have time slots for communication, and the continuous transmission duration of any node is the time slot length, that is, no node has the condition that two time slots continuously transmit.
According to another aspect of the present invention there is provided an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the steps of the method for distributed time division multiple access slot allocation as set out in the foregoing.
According to a further aspect of the present invention there is provided a computer readable storage medium storing a computer program which when executed by a processor performs the steps of the distributed time division multiple access time slot allocation method of the present invention as set out above.
According to still another aspect of the present invention, there is provided a distributed time division multiple access slot allocation system, the system including a node numbering module, a transceiver node design module, and a slot arrangement rule design module;
the node numbering module is used for sequentially numbering all the nodes, and each node is not only a transmitting node but also a receiving node;
The receiving and transmitting node design module is used for constructing a node mapping relation of 'transmitting node number- > receiving node number', wherein if the transmitting node number is i, the corresponding receiving node number starts from i+1 to the maximum node number is ended, the value of the node number i is added to the maximum node number minus 1 from 1, N-i node mapping relations obtained each time are independently arranged into an i-th row from left to right to form a first inverted isosceles triangular matrix, N is the total number of all nodes, and the transmitting node number and the receiving node number of each node mapping relation in the first inverted isosceles triangular matrix are exchanged to form a new node mapping relation of 'transmitting node number- > receiving node number', so as to form a second inverted isosceles triangular matrix;
The time slot arrangement rule design module is used for sequentially obtaining N-1 node mapping relations from '1- > N', starting from '1- > (N-1) > (N) >, starting from' 1- > (N-1) >, ending from '1- > (N-1) >, sequentially obtaining N-2 node mapping relations, and analogizing to' 1- > -2) >, obtaining a node mapping relation, sequentially obtaining N-1 node mapping relations from 'N- > -1', starting from 'N- >, ending from' 2- > -1 ', sequentially obtaining N-2 node mapping relations from' N- > -2 ', ending from' N- > -2 ', sequentially obtaining a node mapping relation, sequentially analogizing to' N- > (N-1) >, and sequentially occupying one time slot for each obtained transceiver node pair in the node mapping relation, and obtaining a continuous time slot arrangement sequence.
In summary, the invention provides a distributed time division multiple access time slot allocation method, electronic equipment, a medium and a system, wherein the method sequentially numbers all nodes, endows each node with unique ID, forms two inverted isosceles triangular arrays according to a certain rule by constructing a node mapping relation of 'transmitting node number- > receiving node number', can ensure fairness of a distributed time division multiple access network, has equal communication opportunities for any two nodes in the network, has one transmitting and receiving communication pair in each time slot, can realize discretization of node transmitting time slots by arranging each transmitting and receiving communication pair in the two inverted isosceles triangular arrays at corresponding time slot positions according to an arrangement rule, ensures that any node in the time slot table is not in a transmitting state in two continuous time slots, and compresses node continuous transmitting time to a single time slot length on the premise of ensuring distributed time division multiple access fairness, thereby reducing continuous transmitting time length of wireless communication equipment and relieving heating caused by continuous transmitting. Compared with the prior art, the technical scheme of the invention can solve the technical problem of serious heating caused by long continuous transmitting time of communication equipment in the prior art.
Spatially relative terms, such as "above," "upper" and "upper surface," "above" and the like, may be used herein for ease of description to describe one device or feature's spatial relationship to another device or feature as illustrated in the figures. It will be understood that the spatially relative terms are intended to encompass different orientations in use or operation in addition to the orientation depicted in the figures. For example, if the device in the figures is turned over, elements described as "above" or "over" other devices or structures would then be oriented "below" or "beneath" the other devices or structures. Thus, the process is carried out, the exemplary term "above" may be included. Upper and lower. Two orientations below. The device may also be positioned in other different ways (rotated 90 degrees or at other orientations) and the spatially relative descriptors used herein interpreted accordingly.
In addition, the terms "first", "second", etc. are used to define the components, and are only for convenience of distinguishing the corresponding components, and the terms have no special meaning unless otherwise stated, and therefore should not be construed as limiting the scope of the present invention.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (4)
1. A method for distributed time division multiple access slot allocation, the method comprising:
s1, sequentially numbering all nodes, wherein each node is a transmitting node and a receiving node;
s2, constructing a node mapping relation of 'transmitting node number- > receiving node number', wherein if the transmitting node number is i, the corresponding receiving node number starts from i+1 to the end of the maximum node number, the value of the node number i is added to the maximum node number minus 1 from 1, N-i node mapping relations obtained each time are independently arranged from left to right to form an i-th row, and a first inverted isosceles triangular matrix is formed, wherein N is the total number of all nodes;
S3, exchanging the number of the transmitting node and the number of the receiving node of each node mapping relation in the first inverted isosceles triangular matrix to be used as a new node mapping relation of 'transmitting node number- > receiving node number', and forming a second inverted isosceles triangular matrix;
S4, for the first inverted isosceles triangular matrix, starting from 1-N, finishing along oblique lines to (N-1) - > N), sequentially obtaining N-1 node mapping relations, starting from 1-N (N-1), finishing along oblique lines to (N-2) - > N-1), sequentially obtaining N-2 node mapping relations, and sequentially analogizing to 1-2 to obtain a node mapping relation;
S5, for the second inverted isosceles triangular matrix, starting from 'N- > 1', ending along a horizontal straight line to '2- > 1', sequentially obtaining N-1 node mapping relations, starting from 'N- > 2', ending along a horizontal straight line to '3- > 2', sequentially obtaining N-2 node mapping relations, and sequentially analogizing to 'N- > (N-1)' to obtain a node mapping relation;
and S6, sequentially occupying a time slot by the receiving-transmitting node pair in each node mapping relation obtained in the S4 and the S5 according to the sequence, and obtaining a continuous time slot arrangement sequence.
2. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the distributed time division multiple access time slot allocation method of claim 1 when the program is executed by the processor.
3. A computer readable storage medium storing a computer program, which when executed by a processor implements the steps of the distributed time division multiple access time slot allocation method of claim 1.
4. The distributed time division multiple access time slot distribution system is characterized by comprising a node numbering module, a receiving-transmitting node design module and a time slot arrangement rule design module;
the node numbering module is used for sequentially numbering all the nodes, and each node is not only a transmitting node but also a receiving node;
The receiving and transmitting node design module is used for constructing a node mapping relation of 'transmitting node number- > receiving node number', wherein if the transmitting node number is i, the corresponding receiving node number starts from i+1 to the maximum node number is ended, the value of the node number i is added to the maximum node number minus 1 from 1, N-i node mapping relations obtained each time are independently arranged into an i-th row from left to right to form a first inverted isosceles triangular matrix, N is the total number of all nodes, and the transmitting node number and the receiving node number of each node mapping relation in the first inverted isosceles triangular matrix are exchanged to form a new node mapping relation of 'transmitting node number- > receiving node number', so as to form a second inverted isosceles triangular matrix;
The time slot arrangement rule design module is used for sequentially obtaining N-1 node mapping relations from '1- > N', starting from '1- > N', ending along oblique lines to '(N-1) - > N', sequentially obtaining N-2 node mapping relations from '1- > (N-1)' starting from '1- > (N-1)' ending along oblique lines to '(N-2) - > (N-1)', sequentially obtaining a node mapping relation from '1- > 2'), sequentially obtaining N-1 node mapping relations from 'N- > 1' starting from 'N- > 1' ending along horizontal lines to '2- > 1', sequentially obtaining N-2 node mapping relations from 'N- > 2', sequentially analogizing to 'N- > (N-1)' ending along horizontal lines, sequentially obtaining a time slot sequence by sequentially occupying each pair of receiving and transmitting nodes in each obtained node mapping relation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202411599202.2A CN119450725B (en) | 2024-11-11 | 2024-11-11 | Distributed Time Division Multiple Access (TDMA) slot allocation methods, electronic devices, media and systems |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202411599202.2A CN119450725B (en) | 2024-11-11 | 2024-11-11 | Distributed Time Division Multiple Access (TDMA) slot allocation methods, electronic devices, media and systems |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN119450725A true CN119450725A (en) | 2025-02-14 |
| CN119450725B CN119450725B (en) | 2025-11-18 |
Family
ID=94505400
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202411599202.2A Active CN119450725B (en) | 2024-11-11 | 2024-11-11 | Distributed Time Division Multiple Access (TDMA) slot allocation methods, electronic devices, media and systems |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN119450725B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002028020A2 (en) * | 2000-09-29 | 2002-04-04 | The Regents Of The University Of California | Ad hoc network accessing using distributed election of a shared transmission schedule |
| US7782831B1 (en) * | 2005-09-16 | 2010-08-24 | Rockwell Collins, Inc. | System and method for dynamically defining a TDMA management cycle for a wireless network |
| CN106211197A (en) * | 2016-06-23 | 2016-12-07 | 石家庄铁道大学 | A construction method of space division multiplexing time division multiple access model for sea-air directional ad hoc network |
| CN109219144A (en) * | 2018-11-09 | 2019-01-15 | 北京通广龙电子科技有限公司 | The method of Wireless Ad-hoc Network distributed resource allocation |
-
2024
- 2024-11-11 CN CN202411599202.2A patent/CN119450725B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2002028020A2 (en) * | 2000-09-29 | 2002-04-04 | The Regents Of The University Of California | Ad hoc network accessing using distributed election of a shared transmission schedule |
| US7782831B1 (en) * | 2005-09-16 | 2010-08-24 | Rockwell Collins, Inc. | System and method for dynamically defining a TDMA management cycle for a wireless network |
| CN106211197A (en) * | 2016-06-23 | 2016-12-07 | 石家庄铁道大学 | A construction method of space division multiplexing time division multiple access model for sea-air directional ad hoc network |
| CN109219144A (en) * | 2018-11-09 | 2019-01-15 | 北京通广龙电子科技有限公司 | The method of Wireless Ad-hoc Network distributed resource allocation |
Non-Patent Citations (1)
| Title |
|---|
| 郭强: ""基于分布式时分多址接入的无线网络时隙调配方法"", 电脑知识与技术, vol. 19, no. 4, 23 March 2023 (2023-03-23) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN119450725B (en) | 2025-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP5107691B2 (en) | Frame dynamic scheduling procedure with subchannel identifier permutation | |
| EP1942618B1 (en) | Distributed determination of dynamic frame sizes in a network | |
| CN108076467B (en) | Generalized perception model and distributed Q learning access method under limitation of frequency spectrum resources | |
| Liu et al. | Neighbor discovery algorithms in directional antenna based synchronous and asynchronous wireless ad hoc networks | |
| CN105359605B (en) | System and method for autonomous resource block allocation scheme based on greedy algorithm for cellular networks with ad hoc relay terminals | |
| CN101582824A (en) | Node number automatic distribution method for controlling secondary node equipment of local area network bus | |
| CN102422691B (en) | Beacon for a star network, sensor nodes in a star network, method for initializing a gateway in a star network and method for operating a star network | |
| Chou et al. | Slot allocation strategies for TDMA protocols in multihop packet radio networks | |
| CN102281640A (en) | Channel resource allocation method based on time division multiplexing | |
| Lien et al. | Anchored desynchronization | |
| CN119450725B (en) | Distributed Time Division Multiple Access (TDMA) slot allocation methods, electronic devices, media and systems | |
| Shi et al. | Transmission Scheduling of Periodic Real‐Time Traffic in IEEE 802.15. 4e TSCH‐Based Industrial Mesh Networks | |
| Wang et al. | Contention resolution mechanisms for multi-channel cognitive radio ad hoc networks | |
| US9414381B2 (en) | Data aggregation method and network architecture for robust real-time wireless industrial communication | |
| CN103582136B (en) | The method efficiently distributing channel in using multi channel wireless sensor network | |
| Lam et al. | Optimal algorithms for all-to-all personalized communication on rings and two dimensional tori | |
| Khan | Self-forming multiple sub-nets based protocol for tactical networks consisting of SDRs | |
| CN108093483B (en) | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system | |
| CN101902381A (en) | Method for assigning data telegrams to time slots in a wireless data bus system with hidden users | |
| Francomme et al. | Beacon Synchronization For GTS Collision Avoidance In An IEEE802. 15.4 Meshed Network | |
| Cao et al. | Multi‐slot reservation‐based multi‐channel MAC protocol for dense wireless ad‐hoc networks | |
| Qin et al. | On throughput maximization for a multi-hop MIMO network | |
| CN108174447A (en) | A kind of mobile communication system | |
| KR20150115215A (en) | Dynamic slot rendezvous method for ad-hoc network using multi-channel | |
| CN104159312B (en) | Distribute the method and system of wireless channel |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |