CN108024367B - Method, device, equipment and storage medium for dynamically allocating time slot - Google Patents
Method, device, equipment and storage medium for dynamically allocating time slot Download PDFInfo
- Publication number
- CN108024367B CN108024367B CN201711251662.6A CN201711251662A CN108024367B CN 108024367 B CN108024367 B CN 108024367B CN 201711251662 A CN201711251662 A CN 201711251662A CN 108024367 B CN108024367 B CN 108024367B
- Authority
- CN
- China
- Prior art keywords
- time slot
- time
- node
- request
- identifiers
- 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.)
- Active
Links
Images
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention discloses a method, a device, equipment and a storage medium for dynamically allocating time slots. Wherein, the method comprises the following steps: broadcasting a time slot request to at least one adjacent node, wherein the time slot request comprises a set of time slot identifiers to be applied; acquiring a time slot response fed back by the at least one adjacent node, wherein the time slot response comprises a time slot identifier which is not conflicted with a time slot maintained by the adjacent node in the set of the time slot identifiers to be applied; and determining the intersection of the non-conflicting time slots in the time slot response of the at least one adjacent node to obtain a set of the time slot identifiers to be allocated. According to the technical scheme of the embodiment of the invention, the intersection of the non-conflict time slots is directly determined by acquiring the time slot identification which is not in conflict with the time slots maintained by the adjacent nodes, the dynamic allocation of the request node to the time slots is realized, and the application time slots are broadcasted to the adjacent nodes once without being broadcasted again to the second hop adjacent nodes, so that the information interaction speed between the nodes is accelerated, and the time slot allocation period is shortened.
Description
Technical Field
The present invention relates to the field of wireless communications, and in particular, to a method, an apparatus, a device, and a storage medium for dynamically allocating timeslots.
Background
The Ad Hoc network in the wireless communication network is a distributed control, infrastructure-free mobile network, which is composed of a group of mobile nodes with wireless communication transceiver devices, and is a multi-hop temporary centerless network without special central nodes to perform time slot allocation. Among them, a Mobile Ad-Hoc Network (MANET) refers specifically to an Ad-Hoc Network in which nodes have mobility, and when the MANET Network performs Time Division Multiple Access (TDMA) Access, the prior art generally uses a uniform Time Slot allocation Protocol (united dynamic distributed multi-channel TDMA Slot allocation Protocol, USAP) to allocate the node Time slots.
The USAP protocol is a distributed TDMA time slot allocation protocol in a mobile multi-hop broadcast packet wireless network that allows nodes to select one or more time slots from unallocated time slots, passing allocation information to a two-hop range by declaring and acknowledging slot allocations between neighboring nodes. The method exchanges time slot allocation information by each node monitoring the network control packets of neighboring nodes and sending its own network control packet.
In the time slot allocation method, the network control packet of each node can only be sent through a specific broadcast time slot, the sending chance is less, when each node applies for the time slot, the network control packet needs to be broadcast once by all the nodes, the time slot allocation time is long, and the adjacent nodes of the applied time slot need to broadcast the applied time slot to the second hop adjacent nodes again to synchronize the time slot allocation condition, so that the time slot application period is further prolonged.
Disclosure of Invention
The embodiment of the invention provides a method, a device, equipment and a storage medium for dynamically allocating time slots, which are used for realizing dynamic allocation of network time slots, accelerating information interaction speed among nodes, shortening time slot allocation period and solving the technical problem of long time slot application period in the prior art.
In a first aspect, an embodiment of the present invention provides a method for dynamically allocating timeslots, where the method includes:
broadcasting a time slot request to at least one adjacent node, wherein the time slot request comprises a set of time slot identifiers to be applied;
acquiring a time slot response fed back by the at least one adjacent node, wherein the time slot response comprises a time slot identifier which is not conflicted with a time slot maintained by the adjacent node in the set of the time slot identifiers to be applied;
and determining the intersection of the non-conflicting time slots in the time slot response of the at least one adjacent node to obtain a set of the time slot identifiers to be allocated.
In a second aspect, an embodiment of the present invention provides an apparatus for dynamically allocating timeslots, where the apparatus includes:
a time slot request broadcasting module, configured to broadcast a time slot request to at least one neighboring node, where the time slot request includes a set of to-be-applied time slot identifiers;
a time slot response obtaining module, configured to obtain a time slot response fed back by the at least one neighboring node, where the time slot response includes a time slot identifier that is not in conflict with a time slot maintained by the neighboring node in the set of the to-be-applied time slot identifier;
and the allocation time slot determining module is used for determining the intersection of the non-conflicted time slots in the time slot response of the at least one adjacent node to obtain a set of the time slot identifiers to be allocated.
In a third aspect, an embodiment of the present invention provides an apparatus, where the apparatus includes:
one or more processors;
storage means for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the method for dynamically allocating timeslots of any of the embodiments of the present invention.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method for dynamically allocating timeslots according to any embodiment of the present invention.
According to the method, the device, the equipment and the storage medium for dynamically allocating the time slot, provided by the embodiment of the invention, the intersection of the non-conflict time slots is directly determined by acquiring the time slot identifier which is not in conflict with the time slots maintained by the adjacent nodes, the dynamic allocation of the request node to the time slot is realized, and the application time slot is broadcasted to the adjacent nodes once without being broadcasted to the second hop adjacent nodes again, so that the information interaction speed between the nodes is accelerated, and the time slot allocation period is shortened.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments made with reference to the following drawings:
fig. 1 is a flowchart of a method for dynamically allocating timeslots according to an embodiment of the present invention;
fig. 2 is a flowchart of a timeslot timer method according to an embodiment of the present invention;
fig. 3 is a flowchart of a method for dynamically allocating timeslots according to a second embodiment of the present invention;
fig. 4 is a flowchart illustrating optimization according to the number of timeslots and the time frame period in the method according to the second embodiment of the present invention;
fig. 5 is a schematic diagram of timeslot allocation of a node a in a time frame period according to a third embodiment of the present invention;
fig. 6 is a schematic diagram of a network topology structure of each node according to a third embodiment of the present invention;
fig. 7 is a schematic structural diagram of an apparatus for dynamically allocating timeslots according to a fourth embodiment of the present invention;
fig. 8 is a schematic structural diagram of an apparatus according to a fifth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
Example one
Fig. 1 is a flowchart of a method for dynamically allocating timeslots according to an embodiment of the present invention, which is applicable to a situation where a node performs timeslot dynamic allocation in any TDMA access manner. The method for dynamically allocating time slots provided in this embodiment may be implemented by a device for dynamically allocating time slots, where the device may be implemented in a software and/or hardware manner, and is integrated into a device for implementing the method, and the device for implementing the method in this embodiment may be any service terminal that needs to dynamically allocate time slots when transmitting service data, such as a mobile phone, a tablet computer, and an exchange. Specifically, referring to fig. 1, the method specifically includes the following steps:
s110, broadcasting a time slot request to at least one adjacent node, wherein the time slot request comprises a set of the time slot identifiers to be applied.
Specifically, the requesting node judges whether time slots need to be allocated or not in each superframe period according to the self traffic and the number of occupied time slots, if the traffic is excessive and the number of occupied time slots is small, the transmission efficiency is reduced when transmitting service data to the adjacent node, and the number of occupied time slots needs to be increased by applying for the time slots; if the traffic is too small and the number of occupied time slots is large, the time slots are wasted, and the time slots need to be released for other nodes to use. Further, when the time slot needs to be allocated, in order to prevent the allocated time slot from colliding with the time slot occupied by the node within the two-hop range when the service data is transmitted to the adjacent node, a time slot request needs to be broadcast to the adjacent node, where the adjacent node is a node capable of directly performing service data transmission with the requesting node, and may be one or more nodes.
Further, the timeslot request includes a set of timeslot identifiers to be applied, and in the prior art, the network control information of the requesting node and the timeslot identifiers to be applied form a network control packet together to exchange timeslot allocation information, and the network control packet can only be sent through a specific broadcast timeslot, and the broadcast timeslot has a one-thousandth chance for network control, resulting in less sending opportunities, and the requesting node applies for the timeslot and needs all nodes to broadcast the network control packet once, so that the application period is lengthened. Specifically, the time slot request may be broadcast to the neighboring node through a service time slot occupied by any one of the requesting nodes, or a small number of fixed service time slots may be pre-allocated in all time slot resources as reserved time slots, and broadcast to the neighboring node through the reserved time slots, where the reserved time slots may also send other service data to the neighboring node when time slot allocation is not needed. Further, the timeslot identifiers in the set of timeslot identifiers to be applied in the timeslot request should be dispersed as uniformly as possible, so that the service data transmission is accurate and stable, and specifically, the timeslot identifiers may be timeslot numbers to be applied. Further, the time slot request may further include the number of the time slot identifiers to be applied, so as to provide a basis for subsequently determining whether the time slot request in each superframe period is overtime.
Further, when the requesting node judges that the time slot allocation is needed according to the self traffic and the occupied time slot number, optionally, the number of the time slots to be applied and the uniformly dispersed time slot numbers are obtained according to the traffic and the occupied time slot number, a set of the time slot identifications to be applied is determined, the set is put into the time slot request, and preferably, the time slot request is broadcasted to all the adjacent nodes through the occupied service time slot.
S120, obtaining the time slot response fed back by at least one adjacent node, wherein the time slot response comprises the time slot identifier which is not conflicted with the time slot maintained by the adjacent node in the set of the time slot identifier to be applied.
Specifically, in order to determine whether a time slot to be applied included in a time slot request broadcast by a requesting node is occupied by other nodes within a two-hop range, thereby causing a conflict when transmitting service data, it is necessary for an adjacent node to determine all time slot identifiers included in the time slot request after receiving the time slot request broadcast by the requesting node. Further, each node has a time slot to be maintained, and the time slot is stored in a time slot record table of the node, specifically, in the prior art, the time slot record table only records the time slot occupied by the node itself, and it is necessary to obtain the time slot occupied by the second hop neighbor node, and it is also necessary to send re-feedback by broadcasting. Specifically, the time slots maintained by the neighboring nodes include time slots occupied by the neighboring nodes themselves and time slots occupied by other nodes adjacent to the neighboring nodes.
Further, in order to determine a timeslot identifier which is not in conflict with timeslots maintained by adjacent nodes in the set of the timeslot identifiers to be applied, the adjacent nodes compare the timeslot identifiers in the set of the timeslot identifiers to be applied with the timeslots maintained by the adjacent nodes to determine whether a conflict occurs, and feed back a timeslot response, wherein the timeslot response includes the timeslot identifier which is not in conflict with the timeslots maintained by the adjacent nodes in the set of the timeslot identifiers to be applied.
Further, the adjacent nodes receive the time slot request broadcasted by the request node, acquire a set of the to-be-applied time slot identifier contained in the time slot request, optionally, judge whether all time slots in the set of the to-be-applied time slot identifier conflict with the recorded time slots by inquiring the recorded time slots in a time slot recording table maintained by the adjacent nodes, if no conflict occurs, it is indicated that other nodes in a two-hop range do not occupy the time slot, put the set of the to-be-applied time slot identifier into a time slot response, optionally, feed back to the request node through the occupied service time slot; if conflict occurs, it indicates that other nodes in the two-hop range occupy the time slot and the requesting node cannot apply for the time slot, the time slot is deleted from the set of the to-be-applied time slot identifiers until all the time slots with conflict occur are deleted from the set of to-be-applied time slot identifiers, the rest sets of to-be-applied time slot identifiers are put into the time slot response, and optionally, the time slot is fed back to the requesting node through the occupied service time slot.
S130, determining the intersection of the non-conflicted time slots in the time slot response of at least one adjacent node to obtain a set of the time slot identifiers to be allocated.
Specifically, the number of the neighboring nodes of the requesting node may be one or more, and when there is only one neighboring node, the time slot identifier that does not conflict with the time slot maintained by the neighboring node in the set of the to-be-applied time slot identifier included in the time slot response fed back by the neighboring node is used as the set of the to-be-allocated time slot identifier; when there are multiple adjacent nodes, the request node may obtain the time slot responses fed back by the multiple adjacent nodes, and select the intersection of the non-conflicting time slots included in all the obtained time slot responses as the set of the final time slot identifier of the application, that is, the set of the time slot identifiers to be allocated.
According to the technical scheme provided by the embodiment, the intersection of the non-conflict time slots is directly determined by acquiring the time slot identifier which is not in conflict with the time slots maintained by the adjacent nodes, the dynamic allocation of the request node to the time slots is realized, the application time slot is broadcasted to the adjacent nodes once, the second hop of the application time slot is not needed to be broadcasted again, the information interaction speed between the nodes is accelerated, and the time slot allocation period is shortened.
On the basis of the above technical solution, whether to apply for or release a time slot is determined according to the traffic volume of the requesting node itself and the number of occupied time slots, where the above technical solution is a method for applying for a request for a time slot, and this embodiment further adds a method for releasing a time slot, as shown in fig. 2, the method includes:
s210, broadcasting a time slot release request to at least one adjacent node, wherein the time slot release request comprises a set of time slot identifiers to be released.
Specifically, when the traffic of the requesting node is too small and the number of occupied time slots is large, time slot waste is caused, and the time slot needs to be released for other nodes to use. The same as the step S110 provided in the above technical solution, the requesting node broadcasts a time slot release request to the neighboring node through the occupied service time slot, where the time slot release request includes a set of identifiers of time slots to be released.
S220, obtaining a time slot release response fed back by at least one adjacent node, wherein the time slot release response comprises a time slot identifier which is not conflicted with the time slot maintained by the adjacent node in the set of the time slot identifiers to be released.
Specifically, the neighboring node receives a time slot release request broadcasted by the requesting node, and obtains a set of identifiers of time slots to be released, which are included in the time slot release request. The same as the step S120 provided in the above technical solution, optionally, by querying the recorded time slots in the time slot recording table maintained by the node, it is determined whether all time slots in the set of time slot identifiers to be released conflict with the recorded time slots, for example, it is determined whether all time slots in the set of time slot identifiers to be released are time slots occupied by the request node in the time slot recording table, if so, no conflict occurs, the set of time slot identifiers to be released is put into a time slot response, optionally, the set of time slot identifiers to be released is fed back to the request node through the occupied service time slot; if the time slot is not the time slot occupied by the request node, a conflict occurs, which indicates that the time slot is occupied by other nodes in a two-hop range and cannot be released by the request node, the time slot is deleted from the set of the time slot identifiers to be released, the request node is prevented from releasing the time slots occupied by other nodes by mistake, until all the time slots with the conflict are deleted from the set of the time slot identifiers to be released, the rest set of the time slot identifiers to be released is put into a time slot response, and optionally, the time slot response is fed back to the request node through the occupied service time slot.
S230, determining the intersection of the non-conflicting time slots in the time slot release response of at least one adjacent node to obtain a set of release time slot identifiers.
Specifically, the number of the neighboring nodes of the requesting node may be one or more, and when there is only one neighboring node, the time slot identifier that does not conflict with the time slot maintained by the neighboring node in the set of time slot identifiers to be released included in the time slot response fed back by the neighboring node is taken as the set of released time slot identifiers; when there are multiple adjacent nodes, the requesting node may obtain the timeslot responses fed back by the multiple adjacent nodes, and, as in the step S130 of providing the above technical solution, selects the intersection of the non-conflicting timeslots included in all the obtained timeslot responses as the set of the final timeslot identifier released this time, that is, the set of the released timeslot identifiers.
In the actual implementation process, whether the time slot needs to be applied or released is determined according to the traffic volume of the requesting node and the number of occupied time slots, and steps S210, S220, and S230 have the same positions as steps S110, S120, and S130, respectively.
Example two
Fig. 3 is a flowchart of a method for dynamically allocating timeslots according to a second embodiment of the present invention. The embodiment of the invention is optimized on the basis of the embodiment. Referring to fig. 3, the method of the present embodiment specifically includes:
s310, obtaining the information of the reserved time slot of the node, wherein the reserved time slot is used for sending a time slot request or sending service data.
Specifically, in order to achieve convenience and rapidness in inter-node broadcast slot request and feedback slot response, in each superframe period, optionally, each node in the MANET network has a broadcast slot for transmitting a network control packet, and allocates a small number of fixed service slots as reserved slots in all slot resources in one superframe period, for example, one eighth of all slot resources are allocated as reserved slots in one superframe period, and specifically, the reserved slots are used for transmitting slot requests and can also be used for transmitting other service data when no slot is allocated. Further, the reserved time slots may be equally allocated to all network access nodes according to a fixed policy, for example, if there are 32 time slots and 4 network access nodes A, B, C, D in a superframe period, the time slot No. 1 is used as a broadcast time slot, and the time slots No. 2 to 5 are respectively reserved time slots which are equally allocated to four nodes A, B, C, D. For example, if there are 64 time slots in one superframe period, 4 network access nodes A, B, C, D, and 8 reserved time slots are allocated in total, then the time slot 1 is used as a broadcast time slot, the time slots 2 and 3 are reserved time slots allocated to node a, the time slots 4 and 5 are reserved time slots allocated to node B, the time slots 6 and 7 are reserved time slots allocated to node C, and the time slots 8 and 9 are reserved time slots allocated to node D.
Further, when the requesting node judges that time slot allocation is needed according to the self traffic and the number of occupied time slots, the requesting node firstly acquires the information of the reserved time slots of the self node to broadcast the time slot request to the adjacent nodes.
S320, broadcasting a time slot request to at least one adjacent node, wherein the time slot request comprises a set of the time slot identifiers to be applied.
S330, obtaining the time slot response fed back by at least one adjacent node, wherein the time slot response comprises the time slot identifier which is not conflicted with the time slot maintained by the adjacent node in the set of the time slot identifier to be applied.
S340, determining the intersection of the non-conflicted time slots in the time slot response of at least one adjacent node to obtain a set of the time slot identifiers to be allocated.
S350, broadcasting a set of the time slot identifiers to be allocated to at least one adjacent node through the reserved time slot.
Specifically, after the set of the time slot identifier to be allocated is obtained, in order to synchronize the time slot allocation information of each node, the requesting node not only records the set of the time slot identifier to be allocated into the time slot recording table maintained by the requesting node, but also needs to broadcast the set of the time slot identifier to be allocated to the adjacent node through the reserved time slot, and records the set of the time slot identifier to be allocated into the time slot recording table of the adjacent node, so as to synchronize the time slot allocation information for querying and using the subsequent time slot to be allocated. Namely, the set of the time slot identifier to be allocated is put into the time slot confirmation, and the time slot confirmation is broadcasted to the adjacent nodes through the reserved time slot, so that the adjacent nodes synchronize the time slot allocation information.
According to the technical scheme provided by the embodiment, the intersection of the non-conflict time slots is directly determined by acquiring the time slot identifier which is not in conflict with the time slots maintained by the adjacent nodes, the dynamic allocation of the request node to the time slots is realized, the application time slot is broadcasted to the adjacent nodes once, the second hop of the application time slot is not required to be broadcasted again, the information interaction speed between the nodes is accelerated, the time slot allocation period is shortened, the reserved time slot is used for sending and receiving the time slot request and the time slot response, the information interaction speed between the nodes is further accelerated, and the time slot allocation period is shortened.
On the basis of the above technical solution, the method is further optimized according to the number of timeslots and the time frame period, as shown in fig. 4, after a set of to-be-allocated timeslot identifiers is obtained, the method further includes the following steps:
s410, in a preset time range, if the number of first time slots in the set of the time slot identifications to be allocated is less than the number of second time slots in the set of the time slot identifications to be applied, broadcasting time slot requests to at least one adjacent node continuously according to the difference value of the number of the first time slots and the number of the second time slots until the sum of the number of third time slots and the number of the first time slots in the set of the new time slot identifications to be allocated is equal to the number of the second time slots.
Specifically, in this embodiment, the preset time range is a superframe period, and includes a plurality of multiframes. When the MAC layer of the data link layer carries out time slot allocation, the set of the time slot identifications to be applied and the set of the time slot identifications to be allocated can also comprise the number of the time slot identifications, if the number of the second time slots of the time slot identifications to be applied which are needed is determined according to the self traffic of the request node and the number of the occupied time slots, the service data can be transmitted more effectively only if the first time slot number of the set of the time slot identifications to be allocated, which is determined in the time slot response after collision judgment, reaches the second time slot number.
Further, the service statistics of the MAC layer is a continuous cycle process, if the number of first time slots in the set of the to-be-allocated time slot identifier is less than the number of second time slots in the set of the to-be-applied time slot identifier, which indicates that the occupied time slot amount corresponding to the self service volume is not reached, the service data transmission efficiency is reduced, at this time, the difference between the number of first time slots and the number of second time slots is calculated, a next time slot request period is entered, a time slot request is continuously broadcast to at least one adjacent node according to the difference until the sum of the obtained number of third time slots in the set of the to-be-allocated time slot identifier and the number of first time slots in the set of the to-be-allocated time slot identifier is equal to the number of second time slots in the set of the to-be-applied time slot identifier, at this time, it indicates that the occupied time slot amount corresponding to the self service.
And S420, if the sum of the third time slot number and the first time slot number is less than the second time slot number in the set of the to-be-applied time slot identifier when the preset time range is exceeded, regarding the time slot request in the preset time range as timeout, and retransmitting the time slot request in the next preset time range.
Specifically, the preset time range is a superframe period, the time slot request, the time slot response and the time slot confirmation need to be completed in the superframe period, if the preset time range is exceeded, that is, when the current superframe period is ended, the sum of the third time slot number and the first time slot number is smaller than the second time slot number in the set of the time slot identifier to be applied, it is indicated that the time slot application is not completed in the current superframe period, the time slot request in the current superframe period is regarded as timeout, and when the next superframe period starts, the time slot request is retransmitted, and the time slot application including the time slot request, the time slot response and the time slot confirmation is performed.
EXAMPLE III
Fig. 5 is a schematic diagram of timeslot allocation of a node a in a time frame period according to a third embodiment of the present invention. The third embodiment of the invention is a preferable example provided on the basis of the above embodiments. Fig. 6 is a schematic diagram of a network topology of each node, which includes A, B, C, D four nodes in a superframe period, where node B and node C are neighbors of node a, and node D is another neighbor of node B.
The flow of node a allocating time slots in one superframe period is exemplarily described as follows:
as shown in fig. 5, there are 32 slots in a superframe period, the slot number 1 is used as the network control packet broadcast slot of the node a, and the slots 2 to 5 are respectively reserved slots allocated to four nodes A, B, C, D for sending slot requests (slot release) or receiving slot responses or sending other traffic data. And if the node A does not successfully apply for the rest time slots, the rest time slots are used for receiving the service data of other nodes.
In a certain period of time, the number of service requests of the application layer of the node A is increased, and the MAC layer counts that an additional 4 time slots need to be applied: 6. 10, 14, 18.
Node a puts slots 6, 10, 14, 18 into the set of pending slot identities contained in the slot request and broadcasts to node B and node C via reserved slot No. 2.
After receiving the broadcasted time slot request, the node B and the node C check the respective maintained time slot recording tables, the node C finds no conflict, puts the four time slots 6, 10, 14 and 18 to be applied into time slot response, and feeds back the time slot response to the node A through the reserved time slot No. 4; the node B finds that the 18 th time slot is occupied by the node D in the maintained time slot record table, conflicts occur, the time slot 18 is deleted from the set of the identification of the time slot to be applied, the rest time slots 6, 10 and 14 in the set of the identification of the time slot to be applied are put into time slot response, and the time slot response is fed back to the node A through the 3 rd reserved time slot.
After obtaining the time slot responses fed back by the node B and the node C, the node A determines the intersection of the non-conflicting time slots in the time slot responses fed back by the node B and the node C to obtain a set of time slot identifiers to be allocated, namely time slots 6, 10 and 14, allocates the time slots 6, 10 and 14 to the node A, and then puts the set of the time slot identifiers to be allocated into time slot confirmation to broadcast the set of the time slot identifiers to the node B and the node C through the number 2 reserved time slot.
And the node B and the node C receive the time slot confirmation, and record the time slots in the set of the time slot identification to be allocated into the time slot recording tables of the node B and the node C for synchronizing the time slot allocation information for inquiring and using the subsequent allocated time slots.
According to the technical scheme provided by the embodiment, the intersection of the non-conflict time slots is directly determined by acquiring the time slot identifier which is not in conflict with the time slots maintained by the adjacent nodes, the dynamic allocation of the request node to the time slots is realized, the application time slot is broadcasted to the adjacent nodes once, the second hop of the application time slot is not required to be broadcasted again, the information interaction speed between the nodes is accelerated, the time slot allocation period is shortened, the reserved time slot is used for sending and receiving the time slot request and the time slot response, the information interaction speed between the nodes is further accelerated, and the time slot allocation period is shortened.
Example four
Fig. 7 is a schematic structural diagram of an apparatus for dynamically allocating timeslots according to a fourth embodiment of the present invention, as shown in fig. 7, the apparatus includes:
a timeslot request broadcasting module 501, configured to broadcast a timeslot request to at least one neighboring node, where the timeslot request includes a set of timeslot identifiers to be applied.
A timeslot response obtaining module 502, configured to obtain a timeslot response fed back by at least one neighboring node, where the timeslot response includes a timeslot identifier that is not in conflict with a timeslot maintained by the neighboring node in a set of timeslot identifiers to be applied.
An allocated time slot determining module 503, configured to determine an intersection of non-conflicting time slots in the time slot response of at least one adjacent node, to obtain a set of to-be-allocated time slot identifiers.
According to the technical scheme provided by the embodiment, the intersection of the non-conflict time slots is directly determined by acquiring the time slot identifier which is not in conflict with the time slots maintained by the adjacent nodes, the dynamic allocation of the request node to the time slots is realized, the application time slot is broadcasted to the adjacent nodes once, the second hop of the application time slot is not needed to be broadcasted again, the information interaction speed between the nodes is accelerated, and the time slot allocation period is shortened.
Further, the above apparatus may further include: a request broadcasting continuing module 504, configured to, after the set of the to-be-allocated timeslot identifiers is obtained, within a preset time range, if the number of first timeslots in the set of the to-be-allocated timeslot identifiers is smaller than the number of second timeslots in the set of the to-be-applied timeslot identifiers, continue broadcasting the timeslot request to the at least one neighboring node according to a difference between the number of first timeslots and the number of second timeslots until a sum of the number of third timeslots in the obtained set of new to-be-allocated timeslot identifiers and the number of first timeslots in the set of the to-be-allocated timeslot identifiers is equal to the number of second timeslots in the set of the to-be-applied timeslot identifiers.
Further, the above apparatus may further include: and a request timeout module 505, configured to, if the sum of the third time slot number and the first time slot number is smaller than the second time slot number in the set of the to-be-applied time slot identifier when the preset time range is exceeded, regard the time slot request in the preset time range as timeout, and resend the time slot request in a next preset time range.
Further, the above apparatus may further include: a release request broadcasting module 506, configured to broadcast a timeslot release request to at least one neighboring node, where the timeslot release request includes a set of to-be-released timeslot identifiers.
Further, the above apparatus may further include: a release response obtaining module 507, configured to obtain a timeslot release response fed back by at least one neighboring node, where the timeslot release response includes a timeslot identifier that is not in conflict with a timeslot maintained by the neighboring node in a set of timeslot identifiers to be released.
Further, the above apparatus may further include: a release timeslot determining module 508, configured to determine an intersection of non-conflicting timeslots in the timeslot release response of at least one neighboring node, to obtain a set of release timeslot identifiers.
Further, the above apparatus may further include: a reserved time slot obtaining module 509, configured to obtain information of a reserved time slot of a node itself before broadcasting a time slot request to at least one neighboring node, where the reserved time slot is used to send a time slot request or send service data.
Further, the above apparatus may further include: an allocation timeslot broadcasting module 510, configured to broadcast a set of identifiers of timeslots to be allocated to at least one neighboring node through a reserved timeslot after obtaining the set of identifiers of timeslots to be allocated.
The device for dynamically allocating time slots provided by this embodiment is suitable for the method for dynamically allocating time slots provided by any of the above embodiments, and has corresponding functions and beneficial effects.
EXAMPLE five
Fig. 8 is a schematic structural diagram of an apparatus according to a fifth embodiment of the present invention. As shown in fig. 8, the apparatus comprises a processor 60, a storage means 61 and a communication means 62; the number of processors 60 in the device may be one or more, and one processor 60 is taken as an example in fig. 8; the processor 60, the storage means 61 and the communication means 62 of the device may be connected by a bus or other means, as exemplified by the bus connection in fig. 8.
The storage device 61 is a computer-readable storage medium, and can be used for storing software programs, computer-executable programs, and modules, such as modules corresponding to the method for dynamically allocating timeslots in the embodiment of the present invention (for example, the timeslot request broadcasting module 501, the timeslot response acquiring module 502, and the allocated timeslot determining module 503 in the device for dynamically allocating timeslots). The processor 60 executes various functional applications of the device and data processing by executing software programs, instructions and modules stored in the storage device 61, that is, implements the above-described method of dynamically allocating time slots.
The storage device 61 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal, and the like. Further, the storage device 61 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some examples, the storage 61 may further include memory located remotely from the processor 60, which may be connected to the device over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The communication device 62 may be used to implement a network connection or a mobile data connection.
The playing device provided by this embodiment may be configured to execute the method for dynamically allocating timeslots provided by any of the above embodiments, and has corresponding functions and advantages.
EXAMPLE six
An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, can implement the method for dynamically allocating timeslots in any of the above embodiments. The method specifically comprises the following steps:
broadcasting a time slot request to at least one adjacent node, wherein the time slot request comprises a set of time slot identifiers to be applied;
acquiring a time slot response fed back by at least one adjacent node, wherein the time slot response comprises a time slot identifier which is not conflicted with a time slot maintained by the adjacent node in a set of time slot identifiers to be applied;
and determining the intersection of the non-conflicting time slots in the time slot response of at least one adjacent node to obtain a set of the time slot identifiers to be allocated.
Of course, the storage medium containing the computer-executable instructions provided by the embodiments of the present invention is not limited to the method operations described above, and may also perform related operations in the method for dynamically allocating timeslots provided by any embodiments of the present invention.
From the above description of the embodiments, it is obvious for those skilled in the art that the present invention can be implemented by software and necessary general hardware, and certainly, can also be implemented by hardware, but the former is a better embodiment in many cases. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as a floppy disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a FLASH Memory (FLASH), a hard disk or an optical disk of a computer, and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device) to execute the methods according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method for dynamically allocating timeslots, comprising:
broadcasting a time slot request to at least one adjacent node, wherein the time slot request comprises a set of time slot identifications to be applied, network control information of a requesting node does not exist, and the time slot identifications in the set of time slot identifications to be applied are uniformly dispersed;
acquiring a time slot response fed back by the at least one adjacent node, wherein the time slot response comprises a time slot identifier which is not conflicted with a time slot maintained by the adjacent node in the set of the time slot identifiers to be applied;
and determining the intersection of the non-conflicting time slots in the time slot response of the at least one adjacent node to obtain a set of the time slot identifiers to be allocated.
2. The method of claim 1, wherein after obtaining the set of identifiers of timeslots to be allocated, the method further comprises:
within a preset time range, if the number of first time slots in the set of the time slot identifiers to be allocated is less than the number of second time slots in the set of the time slot identifiers to be applied, broadcasting a time slot request to at least one adjacent node continuously according to the difference value of the number of the first time slots and the number of the second time slots until the sum of the number of third time slots in the set of the new time slot identifiers to be allocated and the number of the first time slots is equal to the number of the second time slots;
and if the sum of the third time slot number and the first time slot number is smaller than the second time slot number in the set of the to-be-applied time slot identifier when the time slot is beyond the preset time range, regarding the time slot request in the preset time range as timeout, and retransmitting the time slot request in the next preset time range.
3. The method of claim 1, further comprising:
broadcasting a time slot release request to at least one adjacent node, wherein the time slot release request comprises a set of time slot identifiers to be released;
acquiring a time slot release response fed back by the at least one adjacent node, wherein the time slot release response comprises a time slot identifier which is not conflicted with a time slot maintained by the adjacent node in the set of the time slot identifiers to be released;
and determining the intersection of the non-conflicting time slots in the time slot release response of the at least one adjacent node to obtain a set of release time slot identifiers.
4. The method of claim 1, wherein prior to broadcasting the slot request to the at least one neighboring node, further comprising:
and acquiring the information of the reserved time slot of the node, wherein the reserved time slot is used for sending the time slot request or sending the service data.
5. The method of claim 4, wherein after obtaining the set of identifiers of timeslots to be allocated, the method further comprises:
broadcasting the set of the to-be-allocated time slot identifications to the at least one neighboring node through the reserved time slot.
6. The method of claim 1, wherein the time slots maintained by the neighboring nodes comprise time slots occupied by the neighboring nodes themselves and time slots occupied by other nodes neighboring the neighboring nodes.
7. An apparatus for dynamically allocating timeslots, comprising:
the system comprises a time slot request broadcasting module, a time slot request transmitting module and a time slot receiving module, wherein the time slot request broadcasting module is used for broadcasting a time slot request to at least one adjacent node, the time slot request comprises a set of to-be-applied time slot identifications, network control information of a request node does not exist, and the time slot identifications in the set of to-be-applied time slot identifications are uniformly dispersed;
a time slot response obtaining module, configured to obtain a time slot response fed back by the at least one neighboring node, where the time slot response includes a time slot identifier that is not in conflict with a time slot maintained by the neighboring node in the set of the to-be-applied time slot identifier;
and the allocation time slot determining module is used for determining the intersection of the non-conflicted time slots in the time slot response of the at least one adjacent node to obtain a set of the time slot identifiers to be allocated.
8. The apparatus of claim 7, further comprising:
a release request broadcasting module, configured to broadcast a time slot release request to at least one neighboring node, where the time slot release request includes a set of identifiers of time slots to be released;
a release response obtaining module, configured to obtain a timeslot release response fed back by the at least one neighboring node, where the timeslot release response includes a timeslot identifier that is not in conflict with a timeslot maintained by the neighboring node in the set of to-be-released timeslot identifiers;
and the release time slot determining module is used for determining the intersection of the non-conflicted time slots in the time slot release response of the at least one adjacent node to obtain a set of release time slot identifiers.
9. An apparatus, characterized in that the apparatus comprises:
one or more processors;
storage means for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement a method of dynamically allocating timeslots as claimed in any one of claims 1 to 6.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method of dynamically allocating timeslots according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711251662.6A CN108024367B (en) | 2017-12-01 | 2017-12-01 | Method, device, equipment and storage medium for dynamically allocating time slot |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711251662.6A CN108024367B (en) | 2017-12-01 | 2017-12-01 | Method, device, equipment and storage medium for dynamically allocating time slot |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108024367A CN108024367A (en) | 2018-05-11 |
| CN108024367B true CN108024367B (en) | 2020-11-20 |
Family
ID=62077942
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711251662.6A Active CN108024367B (en) | 2017-12-01 | 2017-12-01 | Method, device, equipment and storage medium for dynamically allocating time slot |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108024367B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109104767B (en) * | 2018-07-30 | 2023-04-18 | 武汉中元通信股份有限公司 | Dynamic time slot allocation optimization method |
| CN112653534B (en) * | 2019-10-12 | 2023-09-19 | 中国移动通信有限公司研究院 | Time slot alignment method, device, equipment and computer readable storage medium |
| CN113037937B (en) * | 2019-12-25 | 2023-04-07 | 鹤壁天海电子信息系统有限公司 | Voice conference communication method and device based on centerless ad hoc network |
| CN112153742B (en) * | 2020-08-31 | 2022-07-26 | 西安电子科技大学 | MANET network dynamic time slot distribution method, system, equipment and application |
| CN112383491B (en) * | 2020-11-06 | 2024-02-06 | 北京升哲科技有限公司 | Method, device, equipment and storage medium for determining broadcast time slot |
| CN112564975B (en) * | 2020-12-11 | 2022-09-27 | 广州广哈通信股份有限公司 | Time slot allocation method and system for ring network node |
| CN113099538B (en) * | 2021-04-08 | 2022-09-16 | 北京和峰科技有限公司 | Data transmission method and device and electronic equipment |
| CN113596923B (en) * | 2021-07-12 | 2023-07-25 | 武汉大学 | Hybrid time slot scheduling method for wireless network |
| WO2023097699A1 (en) * | 2021-12-03 | 2023-06-08 | 北京小米移动软件有限公司 | Srs triggering method and apparatus, and storage medium |
| CN114501673A (en) * | 2022-02-17 | 2022-05-13 | 北京升哲科技有限公司 | Time slot allocation method, time slot allocation device, electronic equipment and storage medium |
| CN114375057B (en) * | 2022-03-22 | 2022-07-22 | 杭州格物智安科技有限公司 | Wireless network system node time slot allocation method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102026292A (en) * | 2009-09-18 | 2011-04-20 | 华为技术有限公司 | Resource management method and equipment |
| WO2014084463A1 (en) * | 2012-11-29 | 2014-06-05 | 아주대학교 산학협력단 | Time division multiple access frame structure for ad-hoc network and method for allocating dynamic time slots using same |
| CN104427619A (en) * | 2013-09-10 | 2015-03-18 | 富士通株式会社 | Time slot allocation method and device |
| CN104427620A (en) * | 2013-09-10 | 2015-03-18 | 富士通株式会社 | Time slot allocation method and device |
| CN104427621A (en) * | 2013-09-10 | 2015-03-18 | 富士通株式会社 | Time slot allocation method and device |
-
2017
- 2017-12-01 CN CN201711251662.6A patent/CN108024367B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102026292A (en) * | 2009-09-18 | 2011-04-20 | 华为技术有限公司 | Resource management method and equipment |
| WO2014084463A1 (en) * | 2012-11-29 | 2014-06-05 | 아주대학교 산학협력단 | Time division multiple access frame structure for ad-hoc network and method for allocating dynamic time slots using same |
| CN104427619A (en) * | 2013-09-10 | 2015-03-18 | 富士通株式会社 | Time slot allocation method and device |
| CN104427620A (en) * | 2013-09-10 | 2015-03-18 | 富士通株式会社 | Time slot allocation method and device |
| CN104427621A (en) * | 2013-09-10 | 2015-03-18 | 富士通株式会社 | Time slot allocation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108024367A (en) | 2018-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108024367B (en) | Method, device, equipment and storage medium for dynamically allocating time slot | |
| KR101033689B1 (en) | Preamble allocation method and random access method in mobile communication system | |
| US8130731B2 (en) | Method, network nodes and system for broadcast transmission of data | |
| CN102612152B (en) | Ad Hoc network MAC (Media Access Control) protocol realizing method based on STDMA (Self Organizing Time Division Multiple Access) | |
| CN109151951B (en) | Data interaction method for multi-frequency centralized network networking | |
| WO2017101209A1 (en) | Service transmission method and apparatus | |
| KR101413777B1 (en) | TDMA frame structure of Ad-Hoc network and dynamic time slot assignment method using the same | |
| US7382799B1 (en) | On-demand broadcast protocol | |
| US9936497B2 (en) | Node scheduling method and system and device | |
| CN108834215A (en) | A kind of connectionless transport method and terminal suitable for uplink small data packet | |
| CN100559738C (en) | The multi-address access method according to requirement that the band conflict is decomposed | |
| CN108282905B (en) | Random access method and network element thereof | |
| CN114449589A (en) | Time slot resource reservation system and method | |
| CN102118799A (en) | Contention based (CB) resource configuration method and device | |
| CN102572843B (en) | Communication resource distributing method and equipment | |
| KR20110038148A (en) | A group shared distributed reservation protocol | |
| KR20150015264A (en) | Method and apparatus for distributed association of wireless networks | |
| Suman et al. | A Dynamic TDMA Slot Scheduling (DTSS) scheme for efficient channel allocation in tactical ad hoc networks | |
| CN108471640B (en) | Dynamic and static mixed time slot allocation method and system | |
| KR101215959B1 (en) | Method for allocating resources in a wireless network | |
| WO2019141079A1 (en) | Resource configuration information processing method and apparatus, and terminal device | |
| WO2024093605A1 (en) | Data transmission methods, device, and storage medium | |
| Wu | Dynamic frame length channel assignment in wireless multihop ad hoc networks | |
| CN114448550B (en) | Dynamic TDMA (time division multiple Access) ad hoc network resource conflict solving method based on neighbor node information | |
| CN112672358B (en) | Time slot scheduling method based on mobile ad hoc network |
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 | ||
| CB02 | Change of applicant information |
Address after: 200120, room 1, building 666, Lane 606-607, Zhang Heng Road, Shanghai, Pudong New Area Applicant after: Shanghai Jinzhuo Technology Co., Ltd Address before: 200120, room 1, building 666, Lane 606-607, Zhang Heng Road, Shanghai, Pudong New Area Applicant before: SHANGHAI KINDROID NETWORK TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |