Intelligent time slot scheduling method, system, device and storage medium based on TDMA

By adopting the intelligent time slot scheduling method based on TDMA in the indoor positioning system, the unique time slots are allocated and unresponsive slots are recovered, the problems of insufficient positioning accuracy and waste of resources are solved, and efficient resource management and signal coordination are achieved, improving The stability and accuracy of the system are achieved.

CN118714665BActive Publication Date: 2024-11-15SHANDONG PROMOTE MECHANICAL & ELECTRICAL TECHNOLOGY CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411187479.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-28
Publication Date
2024-11-15
Estimated Expiration
2044-08-28

AI Technical Summary

Technical Problem

In the existing indoor positioning system, the positioning accuracy is insufficient, time slot conflicts and resource waste are serious, especially in industrial or commercial environments with high-precision position tracking and automatic identification. How to improve positioning accuracy and resource management efficiency and avoid signal conflicts become urgently resolved. The problem.

Method used

Using the intelligent time slot scheduling method based on TDMA, by assigning a unique time slot to each identification device and associating a hash value, it is stored in the hash table. If all time slots in the area are occupied, the earlier allocated and unresponsive ones will be retrieved. Time slots are assigned to new devices first, and time slot lengths are calculated based on signal propagation paths and attenuation conditions to reduce conflicts and resource waste.

Benefits of technology

It improves the accuracy and resource utilization of positioning data, reduces system complexity and management difficulty, and ensures the stability and reliability of the system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118714665B_ABST
    Figure CN118714665B_ABST
Patent Text Reader

Abstract

The embodiments of the present disclosure provide a TDMA-based intelligent time slot scheduling method, system, device and storage medium, which are applied to the field of wireless communication and network technology. The method is applied to indoor positioning systems. The time slot scheduling method includes: receiving a request sent by an identification device, allocating a unique time slot for it, and associating the hash value corresponding to the time slot, and storing it in a hash table; if all time slots in the area are occupied, traversing the hash table, reclaiming the time slot that was allocated earlier and did not receive a response from the corresponding identification device at the specified time to other identification devices; receiving repeated time slot requests sent by the same identification device, judging whether the time slot allocated to it has expired, and sending a delay request instruction if it has not expired; the instruction includes a sending time window. In this way, it is possible to quickly identify and resolve resource conflicts and ensure the stability and reliability of the system.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of wireless communication and network technology, and further to the field of wireless resource management, and in particular to a TDMA-based intelligent time slot scheduling method, system, device and storage medium. Background Art

[0002] In industrial or commercial indoor positioning systems that require high-precision location tracking and automatic identification, when workers carry identification devices (such as RFID tags, Bluetooth beacons, etc.) into a designated indoor space, although the identification devices can automatically send signals to achieve functions such as automatic clocking in and location tracking, most base stations in existing positioning systems have insufficient positioning accuracy, resulting in inaccurate data such as automatic clocking in and location tracking. In addition, there are also some problems with the time slot allocation mechanism in existing indoor positioning systems:

[0003] 1. Time slot conflicts and waste of resources: Since workers may frequently enter and exit designated areas, identification equipment will automatically send signals frequently, and a large number of time slots will be repeatedly occupied, resulting in time slot conflicts and waste of resources.

[0004] 2. Dynamic management of time slots is difficult. When a large number of workers pass through a designated area at the same time, all available time slots are occupied. If new equipment enters the designated area at this time, the existing time slot allocation mechanism often chooses to enable spare time slots or allocate time slots based on equipment information priority, which increases the complexity of the system and the difficulty of management.

[0005] In indoor positioning systems, especially in industrial or commercial environments that require high-precision location tracking and automatic identification, how to increase positioning accuracy while efficiently managing communications between multiple identification devices, avoiding signal conflicts, and optimizing resource allocation has become a technical problem that needs to be solved urgently. Summary of the invention

[0006] The present invention provides a TDMA-based intelligent time slot scheduling method, device, equipment and storage medium.

[0007] According to a first aspect of the present disclosure, a TDMA-based intelligent time slot scheduling method is provided, which is applied to an indoor positioning system. The indoor positioning system includes multiple dual-antenna base stations and identification devices. When the identification device enters a designated area, it automatically sends a time slot occupancy request to the base station. The time slot scheduling method includes:

[0008] Receive the request sent by the identification device, assign a unique time slot to it, associate the hash value corresponding to the time slot, and store it in the hash table; if all time slots in the area are occupied, traverse the hash table and reclaim the time slots that were allocated earlier and did not receive a response from the corresponding identification device at the specified time to other identification devices;

[0009] Receive repeated time slot requests sent by the same identification device, determine whether the time slot allocated to it has expired, and if not, send a delay request instruction; the instruction includes a sending time window.

[0010] In some implementations of the first aspect, the method further includes:

[0011] Obtain indoor space measurement information and personnel activity information, build a three-dimensional model, and simulate signal propagation path and attenuation;

[0012] Based on TDMA, the time slot length is calculated and divided according to indoor space measurement information, personnel activity information, signal propagation path and attenuation.

[0013] In some implementations of the first aspect, receiving a request sent by an identification device, assigning a unique time slot to the request, associating a hash value corresponding to the time slot, and storing the hash value in a hash table includes:

[0014] If an identification device enters the designated area and requests a time slot, the request sent by the identification device is received, a unique time slot is automatically assigned to it, and the hash value corresponding to the time slot is associated. The key-value pair is generated and stored in the hash table, with the identification device ID and the index of the time slot as the key, and the hash value and expiration time of the time slot as the value.

[0015] In some implementations of the first aspect, receiving repeated time slot requests sent by the same identification device, determining whether the time slot allocated thereto has expired, and sending a delay request instruction if it has not expired; the instruction including the sending time window includes:

[0016] Receive repeated time slot requests sent by the same identification device, traverse the hash table based on the identification device ID and current time carried in the request, and determine whether the current time is less than the expiration time of the time slot allocated to it. If so, the time slot has not expired, and send a delay request instruction, which includes a sending time window.

[0017] In some implementations of the first aspect, the method further includes:

[0018] Determine whether the current time is less than the expiration time of the time slot assigned to it. If it is greater than or equal to, the time slot expires, accept repeated requests, delete the old key-value pair, generate a new key-value pair, and update the hash table.

[0019] In some implementations of the first aspect, the method further includes:

[0020] If an identification device that has been allocated a time slot has not sent a request for a long time and has not responded when required to send a request at a specified time, the hash table will be traversed to reclaim the time slot it occupies. When a new identification device enters, the reclaimed time slot will be allocated to the new identification device first.

[0021] According to a second aspect of the present disclosure, a TDMA-based intelligent time slot scheduling system is provided, characterized in that it is applied to an indoor positioning system, the indoor positioning system includes multiple dual-antenna base stations and identification devices, and the identification device automatically sends a time slot occupancy request to the base station when entering a designated area; the time slot scheduling system includes:

[0022] The first processing unit is used to receive a request sent by an identification device, allocate a unique time slot to it, associate a hash value corresponding to the time slot, and store it in a hash table; if all time slots in the area are occupied, traverse the hash table, and reclaim the time slot that was allocated earlier and did not receive a response from the corresponding identification device at the specified time to other identification devices;

[0023] The second processing unit is used to receive repeated time slot requests sent by the same identification device, determine whether the time slot allocated thereto has expired, and if not, send a delay request instruction; the instruction includes a sending time window.

[0024] According to a third aspect of the present disclosure, an electronic device is provided. The electronic device includes: at least one processor; and a memory connected to the at least one processor in communication; the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the method described in the first aspect above.

[0025] According to a fourth aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, where the computer instructions are used to cause a computer to execute the method as described in the first aspect above.

[0026] In the present disclosure, by allocating a unique time slot to each identification device and associating a hash value for storage, the time slot conflict problem can be quickly identified and resolved, ensuring the stability and reliability of the system; by recycling unresponsive time slots and reallocating them to new devices, the utilization rate of system resources is improved.

[0027] It should be understood that the contents described in the summary of the invention are not intended to limit the key or important features of the embodiments of the present disclosure, nor are they intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] The above and other features, advantages and aspects of the embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. The accompanying drawings are provided for a better understanding of the present disclosure and do not constitute a limitation of the present disclosure.

[0029] In the accompanying drawings, the same or similar reference numerals represent the same or similar elements, wherein:

[0030] Figure 1 A flow chart of a TDMA-based intelligent time slot scheduling method provided by an embodiment of the present disclosure is shown;

[0031] Figure 2 A schematic diagram of a TDMA-based intelligent time slot scheduling method provided by an embodiment of the present disclosure is shown;

[0032] Figure 3 A flowchart of a clock synchronization method applied to a TDMA-based intelligent time slot scheduling method provided by an embodiment of the present disclosure is shown;

[0033] Figure 4 A block diagram of a TDMA-based intelligent time slot scheduling system according to an embodiment of the present disclosure is shown;

[0034] Figure 5 A block diagram of an exemplary electronic device capable of implementing embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0035] In order to make the purpose, technical solution and advantages of the embodiments of the present disclosure clearer, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present disclosure.

[0036] In addition, the term "and / or" in this article is only a description of the association relationship between the associated objects, indicating that there can be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0037] In view of the problems mentioned in the background technology, the present disclosure provides a TDMA-based intelligent time slot scheduling method, device, equipment and storage medium.

[0038] Specifically, a request sent by an identification device is received, a unique time slot is allocated to it, and a hash value corresponding to the time slot is associated and stored in a hash table; if all time slots in the area are occupied, the hash table is traversed, and time slots that were allocated earlier and did not receive a response from the corresponding identification device within the specified time are reclaimed to other identification devices; repeated time slot requests sent by the same identification device are received, and it is determined whether the time slot allocated to it has expired. If not, a delay request instruction is sent; the instruction includes a sending time window.

[0039] In this way, time slot conflicts can be reduced, resource allocation can be optimized, and the accuracy and reliability of positioning data can be improved.

[0040] It should be noted that Time Division Multiple Access (TDMA) is a communication technology used by multiple users to share the same transmission channel. In a TDMA system, time is divided into several time slots of fixed length, and different users communicate in different time slots.

[0041] The following is a detailed description of a TDMA-based intelligent time slot scheduling method, device, equipment and storage medium provided by the present disclosure in conjunction with the accompanying drawings and specific embodiments.

[0042] Figure 1 A flow chart of a TDMA-based intelligent time slot scheduling method provided by an embodiment of the present disclosure is shown.

[0043] like Figure 1 As shown, a TDMA-based intelligent time slot scheduling method 100 is applied to an indoor positioning system, wherein the indoor positioning system includes multiple dual-antenna base stations and identification devices, and when the identification device enters a designated area, it automatically sends a time slot occupancy request to the base station; the time slot scheduling method includes:

[0044] S110, receiving the request sent by the identification device, assigning a unique time slot to it, and associating the hash value corresponding to the time slot, and storing it in the hash table; if all time slots in the area are occupied, traverse the hash table, and reclaim the time slots that were allocated earlier and did not receive a response from the corresponding identification device within the specified time to other identification devices.

[0045] Specifically, if an identification device enters the designated area and requests a time slot, the request sent by the identification device is received, a unique time slot is automatically assigned to it, and the hash value corresponding to the time slot is associated, with the identification device ID and the index of the time slot as the key, and the hash value and expiration time of the time slot as the value, to generate a key-value pair stored in the hash table; if all time slots in the area are occupied, the hash table is traversed to locate the time slot that was allocated earlier and send instructions to the device occupying the time slot, requiring it to respond within a short time. If it does not respond, the time slot is reclaimed and allocated to other identification devices.

[0046] Furthermore, if a large number of identification devices pass through the designated area in a short period of time and occupy all time slots in the area, if a new identification device enters the area, the time slot occupancy request sent is received, the hash table is traversed, and a sorting table is listed in "earliest-latest" order according to the allocation time. The earliest time slot allocated to the identification device is confirmed, and a time window is sent to the identification device, requiring it to respond at the specified time. If there is no response, the time slot is reclaimed and allocated to the new identification device; if a response is received from the identification device, the time slot allocated to the identification device at an earlier time is confirmed according to the sorting table, and a time window is sent to the identification device, requiring it to respond at the specified time. If there is no response, the time slot is reclaimed and allocated to the new identification device; the above operations are repeated until the newly entered identification device is allocated to the time slot.

[0047] Figure 2 A schematic diagram of a TDMA-based intelligent time slot scheduling method provided by an embodiment of the present disclosure is shown.

[0048] For example:

[0049] like Figure 2 As shown, suppose a large number of workers carrying identification devices pass through designated area 3 from 10:21 to 10:25, occupying all time slots in area 3. At 10:26, a new identification device S enters area 3. The time slot occupation request sent by S is received, and the hash table is traversed. According to the allocation time, the following sorting table is listed in "earliest-latest" order:

[0050] Allocate time Time slot index Device ID Expiration time 10:00 1 A 10:30 10:05 2 B 10:35 …… N N ……

[0051] As shown in the above table, by allocating time, confirm that time slot 1 is allocated to identification device A at the earliest time, and send the time window 10:26-10:27 to identification device A, requiring it to respond between 10:26-10:27. If there is no response, time slot 1 is reclaimed and allocated to the new identification device S; if a response is received from identification device A, then according to the sorting table, the time window 10:27-10:28 is sent to identification device B, requiring it to respond between 10:27-10:28. If there is no response, time slot 2 is reclaimed and allocated to the new identification device S; repeat the above operations until the new identification device S is allocated to the time slot.

[0052] According to an embodiment of the present disclosure, multiple base stations are set up in a designated indoor space, and each base station is equipped with dual antennas to enhance signal coverage and reception capabilities, thereby improving the system's response speed and positioning accuracy to mobile devices; by allocating a unique time slot to each identification device and associating a hash value for storage, time slot conflicts can be quickly identified and resolved, thereby ensuring the stability and reliability of the system.

[0053] S120, receiving repeated time slot requests sent by the same identification device, determining whether the time slot allocated thereto has expired, and if not, sending a delay request instruction; the instruction includes a sending time window.

[0054] Specifically, repeated time slot requests sent by the same identification device are received, and the hash table is traversed according to the identification device ID and current time carried in the request to determine whether the current time is less than the expiration time of the time slot allocated to it. If so, the time slot has not expired, and a delay request instruction is sent, which includes a sending time window. After receiving the delay request instruction, the identification device enters a short-term sleep state.

[0055] According to the embodiments of the present disclosure, for repeated requests from the same identification device, whether to send a delay request instruction is determined by judging whether the time slot has expired, thereby reducing unnecessary processing and improving the system response speed; by sending a delay request instruction containing a sending time window, a clear sending time range is provided for the identification device, thereby avoiding time slot conflicts caused by frequent requests from users. For example:

[0056] like Figure 2 As shown, if a worker carrying identification device X repeatedly enters and exits designated area 2 from 10:30 to 10:33, identification device X automatically sends a time slot request each time it enters designated area 2, as shown below:

[0057] Request 1: Request time 10:30; device ID X.

[0058] Request 2: Request time 10:31; device ID X.

[0059] Receive the time slot request, traverse the hash table based on the device ID and current time carried in the request, and obtain the following information:

[0060] Time slot index 1; time slot hash value 098cba; device ID X; expiration time 10:35.

[0061] For request 2, it is determined that the current time is 10:31, which is less than the expiration time of the time slot allocated for it. The time slot has not expired, and a delay request instruction is sent. The instruction contains a sending time window of 10:35-10:37, which indicates that device X enters a short-term sleep state after receiving the delay request instruction, and is released from the sleep state between 10:35-10:37, and sends a time slot request again.

[0062] In some embodiments, the method 100 further includes:

[0063] Determine whether the current time is less than the expiration time of the time slot assigned to it. If it is greater than or equal to, the time slot expires, accept repeated requests, delete the old key-value pair, generate a new key-value pair, and update the hash table.

[0064] According to the embodiments of the present disclosure, when a time slot expires, the system automatically deletes the old key-value pair and generates a new key-value pair, thereby avoiding the occupation of system resources by the expired time slot and improving the automation of the system.

[0065] Receive time slot request: request time 10:36; device ID X.

[0066] According to the device ID and current time carried in the request, traverse the hash table to obtain the following information:

[0067] Time slot index 1; time slot hash value 098cba; device ID X; expiration time 10:35.

[0068] For this request, the current time is determined to be 10:36, which is greater than the expiration time of the time slot assigned to it. The time slot expires, and the repeated request is accepted. The old key-value pair is deleted, a new key-value pair is generated, and the hash table is updated:

[0069] Time slot index 1; time slot hash value 543fed; device ID X; expiration time 10:40.

[0070] It should be noted that the above examples are time examples given for the convenience of explanation. In actual applications, the time is mostly in seconds, and the identification device may resend the request only at an interval of 2-3 seconds.

[0071] According to an embodiment of the present disclosure, a hash table is used to store time slot information, with identification device ID and time slot index as keys, thereby improving the efficiency of data retrieval and facilitating rapid response to requests for identification devices; by storing the hash value and expiration time of the time slot in the hash table, the consistency and integrity of the data are ensured, and data loss or errors are avoided.

[0072] In some embodiments, the method further comprises:

[0073] Obtain indoor space measurement information and personnel activity information, build a three-dimensional model, and simulate signal propagation path and attenuation;

[0074] Based on TDMA, the time slot length is calculated and divided according to indoor space measurement information, personnel activity information, signal propagation path and attenuation.

[0075] Assume that the dimensions of an indoor space are L = 30 meters in length, W = 20 meters in width, and H = 5 meters in height. Through sensors or manual measurement, the location information of indoor walls, obstacles, etc., as well as possible reflection points can be obtained. At the same time, through surveillance cameras or personnel tracking systems, personnel activity information can be obtained, such as the personnel density ρ = 0.5 people / square meter (assuming average indoor distribution) and the personnel movement speed v = 1 meter / second (average speed).

[0076] Use 3D modeling software (e.g., AutoCAD, Blender, etc.) to build a 3D model of the indoor space based on the acquired space dimensions and obstacle location information.

[0077] The electromagnetic wave propagation model (for example, the free space path loss model, the multipath propagation model, etc.) is used to simulate the propagation path and attenuation of the signal indoors. Taking the free space path loss model as an example, the formula can be as follows:

[0078] ;

[0079] Where d (m) is the signal propagation distance, f (Hz) is the signal frequency, and c is the speed of light (approximately 3×108 m / s).

[0080] Assume that a 2.4 GHz Wi-Fi signal is used (i.e., f=2.4×109 Hz), and consider the direct path of the signal from the base station to the identification device as well as possible reflection paths.

[0081] For a direct path, we can calculate the straight-line distance between the base station and the identification device as d; for a reflected path, we need to calculate the path length of the signal after it is reflected by a wall or obstacle, and consider the effect of the wall material on signal attenuation, which is usually expressed by the reflection coefficient.

[0082] For simplicity, it is assumed that the indoor environment is a homogeneous medium and only one reflection is considered. Through the three-dimensional model, all possible signal propagation paths and their lengths can be calculated, as shown below:

[0083] The base station coordinates are (0, 0, 0); the identification device coordinates are (x, y, z), where x∈[0, L], y∈[0, W], z∈[0, H];

[0084] The direct path is the straight-line distance between the base station and the identification device. The distance can be calculated using the following formula:

[0085] ;

[0086] The reflection path involves the signal reflecting from one or more walls or ceilings / ground before being received by the identification device. Here, only one reflection is considered. There are six possible reflection situations to consider:

[0087] Reflected from the left wall (x=0 plane):

[0088] ;

[0089] in, is the straight-line distance from the reflection point to the identification device; (Lx) is the distance of the signal from the base station to the left wall.

[0090] Reflection from the top wall (z=H plane):

[0091] ;

[0092] in, is the straight-line distance from the reflection point to the identification device; z is the additional distance the signal travels from the base station to the reflection point.

[0093] Reflected from the bottom wall (z=0 plane):

[0094] ;

[0095] in, is the straight-line distance from the reflection point to the identification device; H is the additional distance the signal travels from the base station to the reflection point.

[0096] Reflected from the front wall (y=0 plane, assuming the base station is at the bottom left corner):

[0097] ;

[0098] in, is the straight-line distance from the reflection point to the identification device; y is the additional distance the signal propagates from the base station to the reflection point.

[0099] Reflection from the back wall (y=W plane):

[0100] ;

[0101] in, It is the straight-line distance from the reflection point to the marking device; is the additional distance the signal travels from the base station to the reflection point.

[0102] It is understandable that for each reflection case, it is necessary to check whether the reflection point is within the wall, that is, whether the coordinate value is within a reasonable range, and to eliminate those impossible path data (such as paths where the reflection point exceeds the wall boundary).

[0103] Select the shortest path:

[0104] ;

[0105] In actual applications, the signal may choose the shortest or fastest path among multiple paths to reach the identification device. Therefore, we need to compare all calculated path lengths and select the shortest one as the actual path for signal propagation.

[0106] The above calculation assumes that the reflection of the signal on the wall is perfect (that is, there is no attenuation), and does not take into account other complex phenomena such as signal diffraction and reflection. In practical applications, there are multiple base stations and multiple identification devices indoors, and multiple reflections need to be considered. Therefore, more complex signal propagation models such as ray tracing algorithms or similar numerical methods can be considered.

[0107] Based on TDMA (time division multiple access) technology, we need to calculate the appropriate time slot length according to the signal propagation path and attenuation. The length division of the time slot must take into account both that the signal will not conflict with the signals of other time slots during the propagation process, and also that the overall efficiency of the system must be improved.

[0108] Based on this, we can consider the maximum delay time Δt of signal propagation max , which depends on the longest path length d of the signal propagation max And the propagation speed of the signal in the medium:

[0109] ;

[0110] Due to signal attenuation and multipath effects, we also need to consider factors such as the signal reception threshold and signal-to-noise ratio. For safety reasons, a safety margin α (for example, α=15) can be set so that the time slot length T slot for:

[0111] ;

[0112] Assume that through the three-dimensional model and signal propagation simulation, we obtain the maximum path length of signal propagation as d max = 800 m (taking into account the reflection path), then:

[0113] Δt max =800 / 3×10 8 ≈266.67×10 −8 s;

[0114] T slot =15×266.67×10 −8 =1500×10 −8 s=0.04ms.

[0115] It should be noted that the above process is only a simple example. In actual application, multiple factors need to be considered comprehensively, including signal characteristics, system requirements, environmental complexity, etc.

[0116] According to the embodiments of the present disclosure, by acquiring data such as indoor space measurement information and personnel activity information, simulating the signal propagation path and attenuation, and calculating a more accurate time slot length, the system's time management accuracy is improved, and the system's adaptability and flexibility are enhanced.

[0117] In some embodiments, the method further comprises:

[0118] If an identification device that has been allocated a time slot has not sent a request for a long time and has not responded when required to send a request at a specified time, the hash table will be traversed to reclaim the time slot it occupies. When a new identification device enters, the reclaimed time slot will be allocated to the new identification device first.

[0119] For example:

[0120] like Figure 2 As shown, if a worker carrying an identification device S passes through designated area 1 and does not enter designated area 1 again after leaving, he is assigned time slot 1 when he first enters designated area 1, and the time slot expires at 10:40. Before the time slot expires, the identification device S does not send any request; at 10:39, it is required to send a request at 10:40-10:41 but there is no response, so time slot 1 is reclaimed, the hash table is updated, and when a new identification device enters, the reclaimed time slot 1 is preferentially allocated to the new identification device.

[0121] It can be understood that each area may include 1-N time slots, each area has an independent hash table, and the hash table of each area in the system main server includes the area identifier.

[0122] The TDMA-based intelligent time slot scheduling method 100 requires precise time division to allocate resources. If the clocks of various components in the system (such as base stations, identification devices, servers, etc.) are not synchronized, then the allocation and execution of time slots will be chaotic, resulting in resource conflicts, data loss or communication interruption. Therefore, clock synchronization is very critical.

[0123] According to an embodiment of the present disclosure, a clock synchronization method applied to the above time slot scheduling method is further provided.

[0124] Figure 3 A flowchart of a clock synchronization method applied to a TDMA-based intelligent time slot scheduling method provided by an embodiment of the present disclosure is shown; Figure 3 As shown, the clock synchronization method 300 includes:

[0125] S310, selecting a reference time source.

[0126] It can be understood that the reference time source can be one or more.

[0127] S320, periodically broadcast a time synchronization signal to all base stations participating in time slot scheduling through a reference time source, wherein the time synchronization signal includes a timestamp of the current reference time; so that each base station can correct its own time according to the timestamp to achieve time synchronization with the reference time source.

[0128] S330, the base stations participating in the time slot scheduling synchronously forward the time synchronization signal to the identification device, so that each identification device corrects its own time according to the timestamp to achieve time synchronization with the reference time source.

[0129] Specifically, in the entire system, one or more high-precision, high-stability time sources are first selected as reference time sources, such as a GPS timing module or an atomic clock.

[0130] A clock synchronization calibration period is set, during which a time synchronization signal is broadcast to all base stations participating in time slot scheduling through a reference time source, and the time synchronization signal includes a timestamp of the current reference time.

[0131] After receiving the time synchronization signal, each base station synchronously forwards the time synchronization signal to the identification device in the specified area. At the same time, it reads the timestamp in it and compares it with its own time to obtain the time difference. The base station time is adjusted according to the time difference to achieve time synchronization with the reference time source.

[0132] After receiving the time synchronization signal, each identification device reads the timestamp therein and compares it with its own time to obtain the time difference, and adjusts the device time according to the time difference to achieve time synchronization with the reference time source.

[0133] In practical applications, the Network Time Protocol (NTP) or its variants (such as SNTP) can also be used to achieve time synchronization between devices, base stations and servers.

[0134] According to the embodiments of the present disclosure, by selecting a reference time source and regularly broadcasting a time synchronization signal, it is ensured that the time of each base station and identification device is consistent with the reference time source, providing a time reference for the accurate operation of the system.

[0135] In practical applications, the above-mentioned TDMA-based intelligent time slot scheduling method 100 and clock synchronization method 300 can be integrated into existing various types of indoor positioning systems, such as: underground mine tunnel positioning system, logistics warehousing positioning system, museum exhibit tracking system, etc.

[0136] Taking the underground mine tunnel positioning system in a mining area as an example, in the complex underground mine tunnel environment of the mining area, the system uses the identification devices carried by the workers (such as RFID tags, Bluetooth beacons, etc.) to realize automatic clocking in and location tracking, thereby ensuring the safety of the workers and improving production efficiency. However, the underground mine tunnel has a narrow space and severe signal attenuation. The frequent movement of workers and equipment makes it easy for signals to conflict and interfere. Therefore, traditional indoor positioning systems often cannot meet the requirements of high precision and low latency.

[0137] The TDMA-based intelligent time slot scheduling method 100 and the clock synchronization method 300 are integrated into the mine tunnel positioning system to accurately control the time slot allocation of each identification device to avoid signal conflicts and interference, thereby improving positioning accuracy. At the same time, the system can recycle time slots that are not effectively used to reduce resource waste.

[0138] Furthermore, high-precision location tracking and automatic identification functions enable mine managers to understand the distribution and working status of workers in real time, so as to rationally arrange production tasks and dispatch resources, which helps to improve production efficiency and reduce production costs. In addition, in emergency situations, such as mining disasters, the system can quickly locate the specific location information of workers and provide strong support for rescue work.

[0139] According to the embodiments of the present disclosure, the following technical effects are achieved:

[0140] 1. By introducing dual-antenna base stations and intelligent time slot scheduling mechanism, the problems of small coverage and low positioning accuracy of traditional base stations are effectively solved, and the signal reception and processing capabilities are enhanced.

[0141] 2. The allocation status and expiration time of time slots are recorded in a hash table, and time slots that are not effectively used are recovered in real time and reallocated to new identification devices, which improves the utilization rate of time slots and reduces system bottlenecks caused by resource conflicts.

[0142] 3. By selecting a reference time source and regularly broadcasting time synchronization signals, the time consistency of each base station and identification equipment is ensured, communication errors and data inconsistencies caused by time deviations are reduced, and the overall reliability and stability of the system are enhanced.

[0143] 4. Easy to implement and can be integrated into the existing indoor positioning system to realize automatic time slot scheduling, reduce the need for manual intervention in the system, and reduce the maintenance cost of the system.

[0144] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all described as a series of action combinations, but those skilled in the art should be aware that the present disclosure is not limited by the order of the actions described, because according to the present disclosure, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily required by the present disclosure.

[0145] The above is an introduction to the method embodiment. The following is a further explanation of the solution disclosed in the present disclosure through a system embodiment.

[0146] Figure 4 A block diagram of a TDMA-based intelligent time slot scheduling system according to an embodiment of the present disclosure is shown.

[0147] like Figure 4 As shown, the intelligent time slot scheduling system based on TDMA is applied to the indoor positioning system, which includes multiple dual-antenna base stations and identification devices. When the identification device enters a designated area, it automatically sends a time slot occupancy request to the base station; the intelligent time slot scheduling system based on TDMA 400 may include:

[0148] The first processing unit 410 is used to receive a request sent by an identification device, allocate a unique time slot to it, associate a hash value corresponding to the time slot, and store it in a hash table; if all time slots in the area are occupied, the hash table is traversed to reclaim the time slots that were allocated earlier and did not receive a response from the corresponding identification device within the specified time to other identification devices.

[0149] The second processing unit 420 is used to receive repeated time slot requests sent by the same identification device, determine whether the time slot allocated thereto has expired, and if not, send a delay request instruction; the instruction includes a sending time window.

[0150] Understandably, Figure 4 Each module / unit in the TDMA-based intelligent time slot scheduling system 400 shown has the function of implementing each step in the TDMA-based intelligent time slot scheduling method 100 provided in the embodiment of the present disclosure, and can achieve its corresponding technical effect. The specific working process of the described module can refer to the corresponding process in the aforementioned method embodiment, and for the convenience and conciseness of the description, it will not be repeated here.

[0151] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device and a readable storage medium.

[0152] Figure 5 A block diagram of an exemplary electronic device capable of implementing embodiments of the present disclosure is shown.

[0153] The electronic device 500 is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0154] The electronic device 500 includes a computing unit 501, which can perform various appropriate actions and processes according to a computer program stored in a ROM 502 or a computer program loaded from a storage unit 508 into a RAM 503. In the RAM 503, various programs and data required for the operation of the electronic device 500 can also be stored. The computing unit 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An I / O interface 505 is also connected to the bus 504.

[0155] Multiple components in the electronic device 500 are connected to the I / O interface 505, including: an input unit 506, such as a keyboard, a mouse, etc.; an output unit 507, such as various types of displays, speakers, etc.; a storage unit 508, such as a disk, an optical disk, etc.; and a communication unit 509, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 509 allows the electronic device 500 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0156] The computing unit 501 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 501 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 501 performs the various methods and processes described above, such as method 100 and method 300. For example, in some embodiments, method 100 or method 300 may be implemented as a computer software program, which is tangibly included in a machine-readable medium, such as a storage unit 508. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 500 via ROM 502 and / or communication unit 509. When the computer program is loaded into RAM 503 and executed by the computing unit 501, one or more steps of the method 100 or method 300 described above may be performed. Alternatively, in other embodiments, the computing unit 501 may be configured to execute the method 100 or the method 300 in any other appropriate manner (eg, by means of firmware).

[0157] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0158] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0159] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0160] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0161] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0162] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.

[0163] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.

[0164] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A TDMA-based intelligent time slot scheduling method, characterized in that: Applied to an indoor positioning system, the indoor positioning system includes multiple dual-antenna base stations and identification devices, and the identification device automatically sends a time slot occupancy request to the base station when entering a designated area; The time slot scheduling method comprises: Obtain indoor space measurement information and personnel activity information, establish a three-dimensional model, and simulate the signal propagation path and attenuation. Based on TDMA, calculate and divide the time slot length according to the indoor space measurement information, personnel activity information, signal propagation path and attenuation. Receive the request sent by the identification device, assign a unique time slot to it, associate the hash value corresponding to the time slot, and store it in the hash table; if all time slots in the area are occupied, traverse the hash table and reclaim the time slot that was assigned earlier and did not receive a response from the corresponding identification device at the specified time to other identification devices; wherein, The receiving a request sent by the identification device, assigning a unique time slot to it, associating a hash value corresponding to the time slot, and storing it in a hash table, includes: if an identification device enters a designated area and requests a time slot, receiving the request sent by the identification device, automatically assigning a unique time slot to it, associating a hash value corresponding to the time slot, using the identification device ID and the index of the time slot as a key, and the hash value of the time slot and the expiration time as a value, generating a key-value pair and storing it in the hash table; Receive repeated time slot requests sent by the same identification device, determine whether the time slot allocated thereto has expired, and if not, send a delay request instruction; the instruction includes a sending time window.

2. The method according to claim 1, characterized in that: The receiving of repeated time slot requests sent by the same identification device, determining whether the time slot allocated thereto has expired, and if not expired, sending a delay request instruction, wherein the instruction includes a sending time window, comprises: Receive repeated time slot requests sent by the same identification device, traverse the hash table according to the identification device ID and current time carried in the request, determine whether the current time is less than the expiration time of the time slot allocated to it, if so, the time slot has not expired, and send a delay request instruction, which includes a sending time window.

3. The method according to claim 2, characterized in that The method further comprises: Determine whether the current time is less than the expiration time of the time slot assigned to it. If it is greater than or equal to, the time slot expires, accept repeated requests, delete the old key-value pair, generate a new key-value pair, and update the hash table.

4. The method according to claim 1, characterized in that: The method further comprises: If an identification device that has been allocated a time slot has not sent a request for a long time and has not responded when required to send a request at a specified time, the hash table will be traversed to reclaim the time slot it occupies. When a new identification device enters, the reclaimed time slot will be allocated to the new identification device first.

5. An intelligent time slot scheduling system based on TDMA, characterized in that: Applied to an indoor positioning system, the indoor positioning system includes multiple dual-antenna base stations and identification devices, and the identification device automatically sends a time slot occupancy request to the base station when entering a designated area; The time slot scheduling device comprises: The first processing unit is used to obtain indoor space measurement information and personnel activity information, establish a three-dimensional model, simulate the signal propagation path and attenuation; based on TDMA, calculate and divide the time slot length according to the indoor space measurement information, personnel activity information, signal propagation path and attenuation; The first processing unit is also used to receive a request sent by an identification device, allocate a unique time slot to it, and associate a hash value corresponding to the time slot and store it in a hash table; if all time slots in the area are occupied, the hash table is traversed to recover the time slot that was allocated earlier and did not receive a response from the corresponding identification device at the specified time to other identification devices; wherein, The receiving a request sent by the identification device, assigning a unique time slot to it, associating a hash value corresponding to the time slot, and storing it in a hash table, includes: if an identification device enters a designated area and requests a time slot, receiving the request sent by the identification device, automatically assigning a unique time slot to it, associating a hash value corresponding to the time slot, using the identification device ID and the index of the time slot as a key, and the hash value of the time slot and the expiration time as a value, generating a key-value pair and storing it in the hash table; The second processing unit is used to receive repeated time slot requests sent by the same identification device, determine whether the time slot allocated thereto has expired, and if not, send a delay request instruction; the instruction includes a sending time window.

6. An electronic device, characterized in that: include: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1 to 4.

7. A non-transitory computer-readable storage medium storing computer instructions, characterized in that: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-4.