CN114268898B

CN114268898B - Time slot updating method, device and storage medium

Info

Publication number: CN114268898B
Application number: CN202010971000.1A
Authority: CN
Inventors: 张烨
Original assignee: Guangdong Oppo Mobile Telecommunications Corp Ltd
Current assignee: Guangdong Oppo Mobile Telecommunications Corp Ltd
Priority date: 2020-09-15
Filing date: 2020-09-15
Publication date: 2023-04-18
Anticipated expiration: 2040-09-15
Also published as: WO2022057456A1; CN114268898A

Abstract

The embodiment of the application discloses a time slot updating method, a time slot updating device and a storage medium, which are applied to a base station X, wherein the base station X is any one base station in a positioning service system, the positioning service system comprises K base stations, and the method comprises the following steps: the base station X acquires a time slot occupation table by monitoring a data frame of a neighboring base station belonging to the base station X in the positioning service system to obtain a plurality of time slot occupation tables, wherein each base station corresponds to one time slot occupation table, and each time slot occupation table represents the time slot state of each base station in the K base stations; acquiring a first time slot occupation table of the base station X; calculating according to the plurality of time slot occupation tables and the first time slot occupation table to obtain a second time slot occupation table; and updating the time slot number of the base station X according to the second time slot occupation table. The embodiment of the application provides a flexible positioning service solution.

Description

Time slot updating method, device and storage medium

Technical Field

The present application relates to the field of electronic device technologies, and in particular, to a time slot updating method, apparatus, and storage medium.

Background

At present, in an indoor positioning technology based on Ultra Wideband (UWB), a plurality of anchor point devices (also called base stations) with fixed positions are generally arranged in a space where a user moves in a wired manner, the user wears tag devices supporting the UWB technology, the base stations perform signaling interaction with the tag devices of each user to determine a distance between the base station and the tag devices, and report the distance and identity information of the tag devices to a location server, and the location server calculates a current location of the user according to distance information of the same tag device reported by at least three base stations, thereby implementing a positioning service. The new increase of the base station needs to interact with the positioning server to realize time slot configuration and position calibration, and the stop of the base station needs to interact with the positioning server to realize time slot resource release and topology updating of the positioning service system. Therefore, the current solutions lack flexibility.

Disclosure of Invention

The embodiment of the application provides a time slot updating method, a time slot updating device and a storage medium, aiming at providing a flexible positioning service solution, realizing space division multiplexing of limited time slots in the same space on the premise of ensuring different numbers of any base station adjacent to a base station, and realizing infinite base station capacity under the condition of limited time slot quantity.

In a first aspect, an embodiment of the present application provides a time slot updating method, which is applied to a base station X, where the base station X is any base station in a location service system, the location service system includes K base stations, and K is an integer greater than 1, and the method includes:

the base station X acquires a time slot occupation table by monitoring a data frame of a neighboring base station belonging to the base station X in the positioning service system to obtain a plurality of time slot occupation tables, wherein each base station corresponds to one time slot occupation table, and each time slot occupation table represents the time slot state of each base station in the K base stations;

acquiring a first time slot occupation table of the base station X;

calculating according to the plurality of time slot occupation tables and the first time slot occupation table to obtain a second time slot occupation table;

and updating the time slot number of the base station X according to the second time slot occupation table.

In a second aspect, an embodiment of the present application provides a timeslot update apparatus, which is applied to a base station X, where the base station X is any base station in a location service system, the location service system includes K base stations, and K is an integer greater than 1, and the apparatus includes: a listening unit, an acquisition unit, an arithmetic unit and an update unit, wherein,

the monitoring unit is configured to monitor a data frame of a neighboring base station belonging to the base station X in the positioning service system to obtain a time slot occupancy table, so as to obtain multiple time slot occupancy tables, where each base station corresponds to one time slot occupancy table, and each time slot occupancy table represents a time slot state of each base station in the K base stations;

the acquiring unit is configured to acquire a first time slot occupancy table of the base station X;

the operation unit is used for performing operation according to the plurality of time slot occupation tables and the first time slot occupation table to obtain a second time slot occupation table;

and the updating unit is used for updating the time slot number of the base station X according to the second time slot occupation table.

In a third aspect, an embodiment of the present application provides a base station, including a processor, a memory, a communication interface, and one or more programs, where the one or more programs are stored in the memory and configured to be executed by the processor, and the program includes instructions for executing the steps in the method according to the first aspect of the embodiment of the present application.

In a fourth aspect, an embodiment of the present application provides an electronic device, including a processor, a memory, a communication interface, and one or more programs, where the one or more programs are stored in the memory and configured to be executed by the processor, and the programs include instructions for executing steps in the method of the first aspect of the embodiment of the present application.

In a fifth aspect, an embodiment of the present application provides a computer-readable storage medium, where the computer-readable storage medium stores a computer program for electronic data exchange, where the computer program makes a computer perform some or all of the steps described in the first aspect of the embodiment of the present application.

In a sixth aspect, embodiments of the present application provide a computer program product, where the computer program product includes a non-transitory computer-readable storage medium storing a computer program, where the computer program is operable to cause a computer to perform some or all of the steps as described in the first aspect of embodiments of the present application. The computer program product may be a software installation package.

It can be seen that, in the embodiment of the present application, the present application is applied to a base station X, where the base station X is any base station in a location service system, the location service system includes K base stations, where K is an integer greater than 1, the base station X acquires a time slot occupancy table by intercepting a data frame of a neighboring base station belonging to the base station X in the location service system, to obtain multiple time slot occupancy tables, each base station corresponds to one time slot occupancy table, each time slot occupancy table represents a time slot state of each base station in the K base stations, a first time slot occupancy table of the base station X is obtained, an operation is performed according to the multiple time slot occupancy tables and the first time slot occupancy table, to obtain a second time slot occupancy table, and a time slot number of the base station X is updated according to the second time slot occupancy table. Therefore, the space division multiplexing of the limited time slot in the same space can be realized by reasonably utilizing the dynamic serial number of the time slot on the premise of ensuring different serial numbers of the adjacent base stations of any base station, and the capacity of the infinite base station can be realized under the condition of limited time slot quantity.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the embodiments or the prior art descriptions will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.

Fig. 1A is a schematic diagram of an application scenario of positioning based on UWB technology according to an embodiment of the present application;

fig. 1B is a schematic diagram illustrating a ranging signal interaction of an SS-TWR according to an embodiment of the present disclosure;

fig. 1C is a schematic diagram of a ranging signal interaction of a DS TWR according to an embodiment of the present disclosure;

fig. 1D is a schematic diagram of one-to-many interaction between a tag and a base station according to an embodiment of the present application;

fig. 1E is a schematic diagram of a final coordinate obtained by calculating TDoA according to an embodiment of the present application;

fig. 1F is a schematic structural diagram of a superframe provided in an embodiment of the present application;

fig. 1G is a schematic structural diagram of a super frame added to a beacon frame according to an embodiment of the present application;

fig. 1H is a schematic structural diagram of a location service system 10 according to an embodiment of the present application;

fig. 1I is a diagram illustrating an exemplary configuration of a base station 200 according to an embodiment of the present disclosure;

fig. 2A is a flowchart illustrating a timeslot update method according to an embodiment of the present application;

fig. 2B is a schematic diagram of a timeslot configuration process according to an embodiment of the present application;

fig. 2C is a diagram illustrating an example of a location of a base station according to an embodiment of the present application;

fig. 2D is a schematic diagram illustrating a coverage area of a base station according to an embodiment of the present disclosure;

fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application;

fig. 4 is a block diagram illustrating functional units of a timeslot update apparatus according to an embodiment of the present disclosure.

Detailed Description

In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

The terms "first," "second," and the like in the description and claims of the present application and in the above-described drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements but may alternatively include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.

In this application, the electronic device may include various Ultra Wide Band (UWB) module devices, such as a smart phone, a vehicle-mounted device, a wearable device, a charging device (e.g., a charger), a smart watch, smart glasses, a wireless bluetooth headset, a computing device or other processing devices connected to a wireless modem, and various forms of User Equipment (UE), a Mobile Station (MS), a virtual reality/augmented reality device, a terminal device (terminal device), and the like, and the electronic device may also be a base Station or a device or a server with a base Station function.

The electronic device may further include an intelligent home device, and the intelligent home device may be at least one of: intelligent audio amplifier, intelligent camera, intelligent electric rice cooker, intelligent wheelchair, intelligent massage armchair, intelligent furniture, intelligent dish washer, intelligent TV set, intelligent refrigerator, intelligent electric fan, intelligent room heater, intelligent clothes hanger that dries in the air, intelligent lamp, intelligent router, intelligent switch, intelligent flush mounting plate, intelligent humidifier, intelligent air conditioner, intelligent door, intelligent window, intelligent top of a kitchen range, intelligent sterilizer, intelligent closestool, the robot etc. of sweeping the floor do not restrict here.

In order to better understand the scheme of the embodiments of the present application, the following first introduces the related terms and concepts that may be involved in the embodiments of the present application.

(1) Ultra-wideband UWB is an off-the-shelf communication technology, and according to the federal communications commission (federal communications commission) standard, the operating frequency band of UWB is 3.1-10.6GHz, the ratio of-10 dB bandwidth to the center frequency of the system is greater than 20%, and the system bandwidth is at least 500MHz. Data is transmitted by using non-sine wave narrow pulses of nanosecond to microsecond level. The traditional ultra-wideband UWB technology is used for industrial places such as mines, warehouses and the like, and the main application scene is to monitor the real-time positions of employees and goods indoors. The base stations are well calibrated in indoor places and are connected with one another in a wired or Wi-Fi mode to carry out synchronization. In the example application scenario shown in fig. 1A, a is a base station supporting UWB technology positioning, CLE PC is a location server (also called positioning server, e.g., location computing device), ehternet LAN-TCP/IP is a transmission control protocol/internet protocol supporting ethernet local area network between base stations, and location monitoring for users wearing tag devices is implemented by providing at least one base station in each area.

The one-to-one interaction between the tag and the base station has two modes of SS-TWR and DSTWR.

First, single-sided two-way ranging (SS-TWR)

SS-TWR is a simple measure of the time of a single round trip message, with device a actively sending data to device B, and device B returning data in response to device a. As shown in fig. 1B, device a (Device a) actively Transmits (TX) data (corresponding to the TX time node to the round time start point in the figure), and records a transmission time stamp, and Device B (Device B) records a reception time stamp after Receiving (RX), and RMARKER represents a time node when data transmission (reception or transmission) is completed; after the time delay Treply, the device B sends data and simultaneously records the sending time stamp, and the device A receives the data and simultaneously records the receiving time stamp.

Therefore, two time difference data, namely the time difference Tround of the device A and the time difference Treply of the device B can be obtained, and finally the flight time of the wireless signal is obtained

The following:

both differential times are calculated based on a local clock, and the local clock errors can be cancelled out, but a slight clock offset exists between different devices, and it is assumed that the clock offsets of device a and device B are eA and eB, respectively, so that the obtained flight time increases with the increase of Treply, and the equation of the ranging error is as follows:

where Tprop is the actual time of flight of the wireless signal.

Second, bilateral two-way Ranging (DS TWR)

The DS TWR obtains two round-trip delays based on 3 message transfers between the initiating node and the responding node, and measures the distance at the responding end. As shown in fig. 1C, when the device a returns data immediately after receiving the data, the following four time differences can be obtained:

(1) the first time difference Tround1 of device A (time difference between sending and receiving data)

(2) Delay Treply1 after device B receives data for the first time (delay after receiving first data)

(3) Time difference of device B, tround2 (time difference between data transmission and data reception)

(4) Delay Treply2 after device A receives data for the first time (delay after receiving second data)

Calculating time of flight of a wireless signal using the following formula

Analyzing the errors of the bilateral two-way ranging flight time: the above mechanisms of ranging are all asymmetric ranging methods, as they do not need to be identical for the response time. Even with 20ppm crystals, the clock error is on the ps level. The error formula is as follows:

wherein k is _a And k _b Is the ratio of the actual frequency of the crystal oscillator to the nominal frequency, and therefore k _a And k _b Very close to 1.

Tag to base station one-to-many interaction

Each employee or cargo has a Tag with a unique identifier, which periodically broadcasts a signal to surrounding base stations. As shown in fig. 1D, after the Tag (Tag in the figure) broadcasts the signal (poll in the figure), the RMARKER indicates a time node when the data is completely transmitted (received or transmitted); the surrounding three base stations (Anchor A, anchor B, anchor C in the figure) receive the signals, and sequentially send reply signals (RespA, respB, respC in the figure) to the tags according to the synchronization information among the base stations. When the tag receives the reply signals from three or more base stations, it sends a broadcast signal (Final in the figure) to the outside. Therefore, each base station can calculate the flight time of the wireless signal at the self node after three base stations respectively hear the final packet by the DS TWR mechanism interactive signal.

TpropA is the flight time of a wireless signal between a base station a and a tag, tpropB is the flight time of a wireless signal between a base station B and a tag, tpropC is the flight time of a wireless signal between a base station C and a tag, tround1A is the time difference between tag transmission data and tag reception base station a data, tround1B is the time difference between tag transmission data and tag reception base station B data, tround1C is the time difference between tag transmission data and tag reception base station C data, treply1A is the delay of base station a, treply1B is the delay of base station B, treply1C is the delay of base station C, treply2A is the delay from tag reception base station a to tag transmission of a Final signal, treply2B is the delay from tag reception base station B to tag transmission of a Final signal, and Treply2C is the delay from tag reception base station C to tag transmission of a Final signal.

And each base station uploads the calculation result to the main server. As shown in fig. 1E, TDoA is three-dimensionally calculated on the main server to obtain the final coordinates, X1, X2, and X3 correspond to the positions of Anchor a, anchor B, and Anchor C, the circle corresponds to the position range with the distance determined by the flight time of the wireless signal as the radius, and Xu is the position of the tag.

(2) Super frame

There are multiple tags in an indoor scene, and a super frame needs to be set on the whole time axis for continuous repetition. Each tag needs to allocate a slot, complete respective position calculation in the respective slot, and upload the slot to the base station.

As shown in fig. 1F, in the super frame schematic structure, interval represents a time interval, scheduling interval represents a scheduled time interval, tag I slot represents a time slot of a Tag I, poll TX represents a Tag transmission signal, resp-X RX represents a signal of a Tag receiving base station X, resp-Y RX represents a signal of a Tag receiving base station Y, resp-Z RX represents a signal of a Tag receiving base station Z, and Final TX represents a Tag transmission Final signal.

If the synchronization between the base stations is also realized wirelessly through the ultra-wideband UWB technology, a BeaCoN frame (BeaCoN, BCN) time slot needs to be added before the interactive time slot between the tags and the base stations, the tags communicate with each other in the time slot, and the respective sequence is determined. As shown in fig. 1G, superframe (n) represents Superframe n, idle Time represents Idle Time, BCN represents a Time Slot for carrying a beacon frame, SVC represents a reserved Time Slot, TWR Slot represents a Time Slot for carrying a bidirectional ranging signal, wake up represents an awake Time Slot, sleep represents a sleep Time Slot, and RX represents a receiving status.

In the above scenario of the ultra-wideband UWB technology of the conventional toB, the following features can be summarized:

the number of tags is limited and the slot address of each tag is already allocated.

The base station needs to calibrate the position in advance and is connected in a wired or ultra-wideband UWB technology-distinguished mode to carry out signal synchronization.

Both the base station and the tag need to transmit and receive signals.

The indoor coordinates of the label are calculated by the base station side and returned to the server, and the label does not know the coordinates of the label per se.

The tag only wakes up in the slot period belonging to itself.

Based on the problems existing in the current UWB positioning technology, the present application provides a timeslot update method and system, which are described in detail below.

Referring to fig. 1H, an embodiment of the present application provides a location service system 10, which includes a tag device 100 and a base station 200, where the base station 200 interacts UWB signals with the tag device 100, the base station 200 is a service-side device supporting UWB technology, such as a UWB base station, a UWB anchor device, and the like, and the tag device 200 is a user-side device supporting UWB technology, which may include, but is not limited to, a wireless communication device 110, an entry transponder device 120, a home device 130, a tie tag 140, and the like. Other UWB devices (which are not shown in fig. 1H for simplicity) may include other computing devices including, but not limited to, laptop computers, desktop computers, tablet computers, personal assistants, routers, monitors, televisions, printers, and appliances.

Fig. 1I is a diagram illustrating a base station 200 according to an embodiment of the present disclosure. The base station 200 may include a core processing unit 201, a UWB transceiver 202, a communication unit 203, a general interface unit 204, and a power supply unit 205, where the communication unit 203 may specifically include but is not limited to one or more of bluetooth, wi-Fi, and cellular communication modules, the general interface unit 204 is configured to access various sensors including but not limited to indicator lights, vibration sensors, and other sensors, and the power supply unit 205 may include but is not limited to a battery, a DC-to-DC-DC module, a filter circuit, an undervoltage detection circuit, and the like.

The core processing unit 201 may include a processor and a memory, and the processor may include one or more processing cores. The processor, which is coupled to various components throughout the base station 200 using various interfaces and lines, performs various functions of the base station 200 and processes data by executing or executing instructions, programs, code sets, or instruction sets stored in memory, and calling data stored in memory. The processor may include one or more processing units, such as: the processor may include a Central Processing Unit (CPU), an Application Processor (AP), a modem processor, a Graphics Processing Unit (GPU), an Image Signal Processor (ISP), a controller, a video codec, a Digital Signal Processor (DSP), a baseband processor, and/or a neural-Network Processing Unit (NPU), among others. Wherein the controller may be the neural center and the command center of the base station 200. The controller can generate an operation control signal according to the instruction operation code and the timing signal to complete the control of instruction fetching and instruction execution.

The Memory may include a Random Access Memory (RAM) or a Read-Only Memory (Read-Only Memory). Optionally, the memory includes a non-transitory computer-readable medium. The memory may be used to store an instruction, a program, code, a set of codes, or a set of instructions. The memory may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for implementing at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing various method embodiments described below, and the like, and the operating system may be an Android (Android) system (including an Android system depth development-based system), an IOS system developed by apple, including an IOS system depth development-based system, or other systems. The stored data area may also store data created by the base station 200 in use (such as nominal location data), and the like.

It should be noted that the structural diagram of the base station 200 is merely an example, and more or fewer devices may be specifically included, which is not limited herein.

Referring to fig. 2A, fig. 2A is a schematic flowchart of a time slot updating method, which is applied to a base station X to be added to a positioning service system, where the base station X is any one of base stations in the positioning service system, the positioning service system includes K base stations, and K is an integer greater than 1.

201. And the base station X acquires a time slot occupation table by monitoring a data frame of a neighboring base station belonging to the base station X in the positioning service system to obtain a plurality of time slot occupation tables, wherein each base station corresponds to one time slot occupation table, and each time slot occupation table represents the time slot state of each base station in the K base stations.

The data frame may be a beacon frame, and the beacon frame may carry valid information of the base station (e.g., a self device number, a timeslot number, location information, a signaling start timestamp, etc.). Different base stations occupy different beacon frames. When the time slot of a beacon frame is occupied by a base station, the frequency domain resource of the beacon frame can bear the effective information of the base station, such as information of base station identification, position coordinates and the like, and the base station X confirms that the beacon frame bearing the effective information is occupied by monitoring the frequency domain resource of the beacon frame. The base station numbers of the neighboring base stations of any one base station in the location service system may be different. A neighboring base station of a certain base station may be understood as a base station that can receive the data frame of the base station, for example, a neighboring base station of base station X may be understood as a base station that can receive the data frame of base station X.

In one possible example, the number of neighboring base stations of the base station X is within a preset range.

Wherein, the preset range can be set by the user or the default of the system.

In one possible example, the preset range includes a lower threshold and an upper threshold, the lower threshold is smaller than the upper threshold, the lower threshold is 4, and the upper threshold is 6.

In this embodiment, the preset range may include a lower threshold and an upper threshold, since the number of base station interactions directly affects the time length of the whole superframe, it is specified that any base station in a room must have the number of neighboring base stations audible to the base station smaller than N, that is, the upper threshold (N < =6 in general). When a base station can hear the information sent by N or more than N base stations, the base station enters a sleep state and wakes up after a random time length to monitor the time slot information again. If N =6, every 6 base stations poll. After the polling is finished, there is a guard interval time slot and the next super frame is proceeded. And since automatic mapping needs to be realized, the lower threshold of N is 4.

In one possible example, the location service system further includes base station Y, base station J, and base station W; in step 201, before obtaining a plurality of slot occupation tables by intercepting data frames of neighboring base stations belonging to the base station X in the positioning service system to obtain the slot occupation tables, the method may further include the following steps:

a1, the base station X monitors a data frame in a preset time period, and monitors a data frame Y of the base station Y, a data frame J of the base station J and a data frame W of the base station W, wherein the preset time period is a continuous preset number of positioning service cycles, and the positioning service cycles are working cycles of the positioning service system;

and A2, the base station X configures the self time slot number according to the time slot occupation conditions of the data frame Y, the data frame J and the data frame W.

In a specific implementation, the base station X may implement configuration of its own timeslot number by intercepting a data frame of at least one base station of the location service system. The specific manner of implementing the configuration of the timeslot number of the base station X may be various, and is not limited herein.

For example, the positioning service system may further include a base station Y, a base station J, and a base station W; the base station X realizes the configuration of the time slot number of the base station X by intercepting the data frame of at least one base station of the positioning service system, and the configuration comprises the following steps: a base station X monitors a data frame in a preset time period, monitors a data frame Y of the base station Y, a data frame J of the base station J and a data frame W of the base station W, and the preset time period is a continuous preset number of positioning service periods which are working periods of a positioning service system; and the base station X configures the self time slot number according to the time slot occupation conditions of the data frame Y, the data frame J and the data frame W.

The purpose of channel sensing is to obtain the actual occupation situation of the channel in the current space as accurately as possible, the sensing accuracy is affected when the sensing duration is too short, and the network access initialization efficiency is affected when the sensing duration is too long, so the preset time period may be any reasonable preset duration, for example, 10 to 100 times of the transmission time interval, which is not limited herein, and for example, assuming that the transmission time interval of the location service system is 15 ms, the preset time period may take any value from 150ms to 1500ms, for example.

In a specific implementation, the base station X may determine the time slots occupied by the base station Y, the base station J, and the base station W through data frame interception, so as to select one of the unoccupied time slots, such as sequential selection or random selection.

In addition, the base station X may configure the device number while configuring the time slot according to the uniform device number rule, for example, the base station X determines an occupied base station number according to the data frame, if the device number is changed according to a digital numbering mechanism; and the base station X determines the number of the self equipment according to the occupied base station number. For example, assuming that the base station X senses base stations with device numbers 2, 4, and 5, its own device number 3 may be configured.

The timeslot configuration process in the above steps can be described by using a schematic flowchart shown in fig. 2B, where INIT corresponds to an initial power-on state, HAVE _ ID corresponds to a state in which the base station configures a device number for itself, NO _ ID corresponds to a state in which the device number is not configured, and NO _ ID _ REVC corresponds to a state in which the base station that does not configure the device number receives data.

Specifically, first, the base station switches to a power-up state;

if the local terminal is directly set as a seed node (namely, the first base station in the current space), the local terminal directly occupies the first address (namely, the slot address + the transmission resource formed by the working frequency band) to start working;

if the local terminal is not set as a seed node, the base station unconditionally receives 10 periods for network interception, and if the interception result is that the network has an idle address (the idle address specifically means that a frame sent by the address is not received, the address is not reported in the received frame (each module reports the address of the received frame)), the time slot configuration is carried out according to the idle address;

and then continuously monitoring for 10 periods, and if no response exists in the 10 periods, determining that the local computer is not the seed node, wherein the no response means that the data frame cannot be received or the local address is not reported in the received frame.

It can be seen that, in this example, the base station X implements reasonable configuration of its own time slot resource by intercepting the data frame, avoiding resource configuration conflict, and does not need to send signaling to other base stations, and has no influence on the states of other base stations.

In addition, in this example, the location service system may further include a base station Z; the method further comprises the following steps: the base station X receives a data frame Z of the base station Z and judges that the time slot number of the base station X is the same as the time slot number carried by the data frame Z; and the base station X deletes the time slot number of the base station X and triggers a reconfiguration process through preset conditions.

Wherein, deleting means that the base station X no longer occupies the timeslot resource.

The preset condition may be that a timer is overtime, and the timing duration of the timer may be any preset value or an empirical value, and is not limited herein.

The base station Z may be a base station co-located with the base station X at a similar time interval, the base station X releases the time slot resource, the base station Z may also synchronously detect a collision and release the time slot resource, and then may randomly select an idle time slot for configuration, or the base station X and the base station Z interactively confirm a time slot configuration of a complementary collision.

As can be seen, in this example, when the base station X detects a timeslot configuration conflict, it can perform configuration fallback by deleting its timeslot number, thereby implementing conflict resolution.

Alternatively, the method further comprises: the base station X broadcasts a conflict test request message according to the time slot number of the base station X and intercepts a conflict test response message, wherein the conflict test response message is used for indicating that the time slot of the base station X conflicts with the time slot of a certain base station in the positioning service system; and if the conflict test response message is intercepted, deleting the self time slot number, and triggering a reconfiguration process through a preset condition.

As can be seen, in this example, the real-time performance is better when determining whether to conflict by performing message interaction with other base stations.

For another example, the base station X performs configuration of its own timeslot number by listening to a data frame of at least one base station of the location service system, including: the base station X receives a data frame of the at least one base station; the base station X extracts a time slot number report of each data frame in the data frames of the at least one base station, wherein the time slot number report comprises the corresponding relation between the equipment number of the base station and the time slot number; and the base station X determines the self time slot number according to the at least one time slot number report of the at least one base station.

The timeslot number report may be timeslot numbers of all base stations directly heard by the current base station and timeslot numbers of the current base station.

As can be seen, in this example, the base station X can more fully learn the time slot occupation status of other base stations of the current system through the time slot number, so as to provide the time slot configuration accuracy.

In one possible example, the following steps may be further included:

and the base station X performs data interaction with at least three base stations of the positioning service system to realize automatic mapping of the position of the base station X.

The self-position may specifically be coordinate information of the base station X, or position indication information corresponding to a specific space, such as a room number, a house number, a security gate, an elevator number, and the like.

It is understood that the specific implementation manner of the base station X for implementing the self-location mapping may be various, such as SS TWR algorithm, DS TWR algorithm, RTDoA algorithm, etc., and is not limited herein.

For example, the base station X performs data interaction with at least three base stations of the location service system to achieve automatic mapping of its location, including: and the base station X carries out data interaction with at least three base stations of the positioning service system according to a reverse time difference of arrival (RTDOA) algorithm so as to realize automatic mapping of the position of the base station X.

In this example, the base station X performs data interaction with at least three base stations of the location service system according to a reverse time difference of arrival RTDOA algorithm to achieve automatic mapping of its own location, including: the base station X executes at least two of the steps A, B, C to obtain at least two distance differences;

A. the base station X acquires a time slot number of the data frame Y and a self position of the base station Y carried by the data frame Y, acquires a time slot number of the data frame J and a self position of the base station J carried by the data frame J, calculates a signal flight time between the base station Y and the base station J according to the self position of the base station Y and the self position of the base station J, determines a signal transmission time delay of the base station Y and the base station J according to the time slot number of the data frame Y and the time slot number of the data frame J, determines a data frame transmission time difference of the base station Y and the base station J according to the signal flight time between the base station Y and the base station J and the signal transmission time delay of the base station Y and the base station J, determines a data frame X receiving time difference of a local terminal device according to the data frame X receiving time difference, and determines a distance difference between a first distance and a second distance according to the data frame X receiving time difference, the data frame Y and the data frame J, and the first distance is a distance between the base station Y and the base station J, and the second distance between the base station X and the base station J;

B. the base station X acquires a time slot number of the data frame Y carried by the data frame Y and a self position of the base station Y, acquires a time slot number of the data frame K carried by the data frame K and a self position of the base station K, calculates signal flight time between the base station Y and the base station K according to the self position of the base station Y and the self position of the base station K, determines signal transmission time delay of the base station Y and the base station K according to the time slot number of the data frame Y and the time slot number of the data frame K, determines a data frame transmission time difference of the base station Y and the base station K according to the signal flight time between the base station Y and the base station K and the signal transmission time delay of the base station Y and the base station K, determines a data frame Y receiving time difference of a local terminal device according to the time for receiving the data frame Y and the time for receiving the data frame K, and determines a distance difference between the first distance and a third distance according to the data frame Y receiving time difference, the data frame Y and the data frame K;

C. the base station X acquires a time slot number of the data frame J and a self position of the base station J carried by the data frame J, acquires a time slot number of the data frame K carried by the data frame K and a self position of the base station K, calculates signal flight time between the base station J and the base station K according to the self position of the base station J and the self position of the base station K, determines signal transmission time delay of the base station J and the base station K according to the time slot number of the data frame J and the time slot number of the data frame K, determines a data frame transmission time difference of the base station J and the base station K according to the signal flight time between the base station J and the base station K and the signal transmission time delay of the base station J and the base station K, determines a data frame J receiving time difference of a local terminal device according to the data frame J receiving time difference and the data frame transmission time difference of the base station J and the base station K, and determines a distance difference between the second distance and the third distance according to the data frame J receiving time difference, the data frame J receiving time difference of the base station J and the data frame transmission time difference of the base station K;

and the base station X determines the self position of the base station X according to the at least two distance differences, the self position of the base station Y, the self position of the base station J and the self position of the base station K.

Therefore, in this example, the base station X can accurately calculate its own position through the RTDOA algorithm, and can use the UWB technique without additionally configuring the positioning technique and without sending signaling to other base stations, thereby improving the positioning efficiency.

By way of another example, the base station X interacts data with at least three base stations of the location service system to achieve automatic mapping of its location, including: and the base station X carries out data interaction with at least three base stations of the positioning service system according to a preset unilateral two-way ranging SS-TWR algorithm so as to realize automatic mapping of the position of the base station X.

In this example, the base station X performs data interaction with at least three base stations of the location service system according to a preset one-sided two-way ranging SS-TWR algorithm to achieve automatic mapping of its own location, including:

the base station X broadcasts a first ranging message and simultaneously records the sending time of the first ranging message;

the base station X receives a second ranging message from the base station Y, a third ranging message from the base station J, and a fourth ranging message from the base station K, the second ranging message including a time when the base station Y receives the first ranging message and a time when the base station Y transmits the second ranging message, the third ranging message including a time when the base station J receives the first ranging message and a time when the base station J transmits the third ranging message, and the fourth ranging message including a time when the base station K receives the first ranging message and a time when the base station K transmits the fourth ranging message;

the base station X determines the distance between the base station X and the base station Y according to the sending time of the first ranging message, the time of the base station Y receiving the first ranging message, the time of sending the second ranging message and the time of the base station X receiving the second ranging message in the second ranging message;

the base station X determines the distance between the base station X and the base station J according to the sending time of the first ranging message, the time of the base station J for receiving the first ranging message, the time of sending the third ranging message and the time of the base station X for receiving the third ranging message in the third ranging message;

the base station X determines the distance between the base station X and the base station K according to the sending time of the first ranging message, the time of the base station K for receiving the first ranging message, the time of sending the fourth ranging message and the time of the base station X for receiving the fourth ranging message in the fourth ranging message;

and the base station X calculates the position of the base station X according to the distance between the local terminal equipment and the base station Y, the distance between the local terminal equipment and the base station J and the distance between the local terminal equipment and the base station K.

Therefore, in this example, the base station X can accurately calculate its own position through the SS-TWR algorithm, and can use the UWB technique without additionally configuring a positioning technique, thereby reducing implementation complexity and improving positioning convenience.

Further, the method can also comprise the following steps:

the base station X is added into the positioning service system according to the time slot number of the base station X and the position broadcast data frame X of the base station X, the positioning service means that target equipment determines the position of the target equipment by receiving data frames broadcast by any M base stations of the positioning service system, the target equipment is a base station or label equipment, and M is an integer greater than or equal to 3.

When M is 3, two-dimensional coordinate positioning can be realized, and when M is 4, three-dimensional coordinate positioning can be realized.

In specific implementation, the base station X implements a hot plug function, and the tag device may be converted into a base station for use in some cases.

In one possible example, the location service system further includes a base station L, a signal coverage of the base station X and a signal coverage of the base station L are independent from each other, and a timeslot number of the base station X is the same as a timeslot number supported by the base station L.

In a specific implementation, the signal coverage of the ranging service is expanded by adding a base station.

In the specific implementation, when a base station is expanded, if the base station needs to automatically map its position, it needs to ensure that at least 3 base stations with calibrated positions and a newly added base station are in a reachable state, so that accurate positioning can be achieved.

For example, the exemplary base station location shown in fig. 2C is illustrated. In the figure, X, Y is a position coordinate axis, each circle represents a base station, and a connection line between the circles represents that signals of two base stations are reachable (i.e., a direct communication distance between the base stations is the length of the connection line), which may be referred to as a base station and a base station reachable for short. Assuming that a user initially sets base stations at three positions of coordinates (0,0), (2,0) and (0,2), if a base station at coordinate (1,1) is added, since the base station at (1,1) is respectively reachable with the base stations at coordinates (0,0), (2,0) and (0,2), the base station at (1,1) can realize position calibration through automatic mapping.

Therefore, in this example, the base station supports a hot plug mode to expand the location service network, and is convenient to use.

In this possible example, if the added base station and a target base station of the plurality of base stations have the same slot number, the signal coverage of the added base station and the signal coverage of the target base station are independent of each other.

As shown in fig. 2D, each signal strength indicator represents a base station, and each ellipse represents the signal coverage of a pair of base stations. As shown in the figure, due to the signal coverage limitation, for example, the base station A1 can hear the information of the surroundings A2, A3, A4, so that 4 base stations can be heard at A1 at the same time; the base station A3 can hear the information of the surroundings A1, A2, A4, A5, A6, and therefore 6 base stations can be heard at the same time at A3. For another example, although the base station A5 cannot directly hear A1, A5 obviously cannot multiplex the time slot of A1. Since A1 and A5 can be heard in turn on the A3 side, a collision may occur if both share a time slot.

The base stations A1 and A2 can only receive the base stations A2, A1, A3 and A4, and only the reports of A1 to A6 are received in the data frame, so that the base stations A1 and A2 cannot know the existence of A7 and A8, and the two pairs of base stations anchor may be assigned to the same timeslot number. But this does not cause signal interference. Assuming that the signal coverage radius of a base station is unit 1, if signals of two base stations interfere with each other, the signal coverage areas of the 2 base stations overlap, that is, the distance between the two base stations is less than 2. When the distance between the two base stations is between 1 and 2, the base station can not directly receive the data frame of the other base station, but the base station can know that the other base station exists by receiving the number report in the data frame, thereby avoiding the conflict of the time slot numbers.

Therefore, if any two base stations (referred to as base station 1 and base station 2) have slot number conflicts, the following two conditions must be satisfied:

(a) The distance from the base station 1 to the base station 2 is between 1 and 2.

(b) The absence of base station 3 allows base station 3 to base station 1 to base station 2 distances all <1.

A base station interworks with base stations within its communication range, defining a and C to be reachable: a and C intercommunicate or (presence of B makes A and B reachable, and B and C reachable). The conditions that A and C cannot be < = > A and C are not intercommunicated and the non-intercommunicating is the necessary condition that the non-intercommunicating is unreachable (for any base station B, B and A are unreachable or B and C are unreachable), = > A and C are not intercommunicated and the conditions that B and A are not intercommunicated or B and C are not intercommunicated for any base station B, B and A are intercommunicated) and the base stations are not intercommunicated (no base station B exists and B and C are intercommunicated) = > when the base stations are arranged, if any two base stations are ensured to be reachable, the base stations with the same time slot number can be ensured not to conflict with each other, at the moment, a plurality of base stations with the same time slot number can exist in the network at the same time, and the base stations can not overlap and have no interference because signals cannot overlap. Therefore, the time slot space division multiplexing of the network is realized, and the infinite capacity of the base station under the limited time slot quantity can be realized.

This is ensured by the reachable transitivity starting from the second base station during the installation and ensuring that the new base station is in communication with at least one base station installed before.

In a specific implementation, in a reverse TDoA mode, basic timing sequence interaction between a base station and a tag is as shown in the following table, and the base station may poll and broadcast information to neighboring base stations and tags according to its own time slot number; the label only receives and does not transmit, and self positioning is obtained by obtaining the information of mutual distance measurement of the base stations and the distance information from the label to each base station. As in the following table: base station label RTDoA timing sequence table:

since the number of base station interactions directly affects the time length of the entire superframe, it can be specified that any base station indoors, the number of nearby base stations that can be heard by that base station must be less than N (typically N < = 6). When a base station can hear the information sent by N or more than N base stations, the base station enters a sleep state and wakes up after a random time length to monitor the time slot information again. If N =6, every 6 base stations poll. After the polling is finished, there is a guard interval time slot and the next super frame is proceeded.

202. And acquiring a first time slot occupation table of the base station X.

The first slot occupation table includes slot states of respective base stations of neighboring base stations of the base station X, and the slot states may be idle states or occupied states, for example, the idle state may be represented by 0 and the occupied state may be represented by 1. In a specific implementation, the base station X may determine the corresponding first timeslot occupation table based on its coverage.

203. And carrying out operation according to the plurality of time slot occupation lists and the first time slot occupation list to obtain a second time slot occupation list.

The operation manner may be a logical operation or a physical operation, and the logical operation may be an or operation.

In a possible example, in step 203, performing an operation according to the multiple slot occupancy tables and the first slot occupancy table to obtain a second slot occupancy table, which may be implemented as follows:

and performing OR operation according to the plurality of time slot occupation tables and the first time slot occupation table to obtain the second time slot occupation table.

The plurality of time slot occupation tables and the first time slot occupation table can be subjected to or operation together to obtain a second time slot occupation table, and the time slot state of each base station can be inquired through the second time slot occupation table.

204. And updating the time slot number of the base station X according to the second time slot occupation table.

The time slot state of each base station can be seen in the second time slot occupation table, the time slot in the idle state can be determined from the second time slot occupation table, the time slot number of the base station X can be updated to the time slot number of the base station corresponding to the time slot in the idle state, and if the unoccupied time slot does not exist in the second time slot occupation table, the time slot number of the base station X cannot be updated.

In a possible example, the step 204 of updating the slot number of the base station X according to the second slot occupancy table may include the following steps:

41. determining unoccupied target time slots in the second time slot occupation table, wherein the target time slots are any time slots in the unoccupied time slots in the second time slot occupation table;

42. and updating the time slot number of the base station X to the time slot number of the target base station corresponding to the target time slot.

The second time slot occupation table may adopt 0 to represent an idle time slot, and 1 represents an occupied time slot, so that an unoccupied target time slot in the second time slot occupation table may be determined, that is, 0 is found out from the second time slot occupation table, the target time slot is any one of the unoccupied time slots in the second time slot occupation table, and further, the time slot number of the base station X may be updated to the time slot number of the target base station corresponding to the target time slot.

In one possible example, the method further comprises:

b1, detecting whether an unoccupied time slot exists in the second time slot occupation table or not;

b2, when the unoccupied time slots exist in the second time slot occupying table, the step of determining the unoccupied target time slots in the second time slot occupying table is executed;

and B3, when the unoccupied time slots do not exist in the second time slot occupation table, confirming that the time slot number of the base station X cannot be updated.

In a specific implementation, it may be detected whether an unoccupied time slot exists in the second time slot occupying table, that is, 0 may be found out from the second time slot occupying table, and when an unoccupied time slot exists in the second time slot occupying table, step 41 may be executed, otherwise, when an unoccupied time slot does not exist in the second time slot occupying table, it is determined that the time slot number of the base station X cannot be updated.

In the embodiment of the application, each base station can upload the time slot occupation table sensed by the base station when broadcasting outwards in sequence.

For example, as shown in fig. 2D, a slot occupancy table of each of the base stations A1 to A8 is provided as follows:

the A1 side time slot occupation table is as follows: 11 110 00 0

The A2 side slot occupation table is as follows: 11 110 00 0

The A3 side time slot occupation table is as follows: 11 11 110 0

The A4 side slot occupation table is as follows: 11 11 110 0

The A5 side slot occupation table is as follows: 00 11 11 11

The A6 side slot occupation table is as follows: 00 11 11 11

The A7 side slot occupation table is as follows: 00 00 11 11

The A8 side time slot occupation table is as follows: 00 00 11 11

Furthermore, whether any base station can occupy the time slot can be judged through the time slot occupation table, which specifically comprises the following steps: the base station obtains the time slot occupation tables of all the surrounding adjacent base stations and carries out OR logic operation on the time slot occupation tables.

For another example, the time slot table that the base station A5 side needs to do or is as follows:

the A3 side time slot occupation table is as follows: 11 11 110 0

The A4 side time slot occupation table is as follows: 11 11 110 0

The A5 side slot occupation table is as follows: 00 11 11 11

The A6 side slot occupation table is as follows: 00 11 11 11

The A7 side slot occupation table is as follows: 00 00 11 11

The A8 side slot occupation table is as follows: 00 00 11 11

In a specific implementation, after performing or operation on the slot occupation tables of A3, A4, A5, A6, A7, and A8, a new slot occupation table is obtained as follows: 11 11 11 1, then it can be seen that all slots are occupied and the slot number of A5 cannot be updated.

For another example, the time slot table that the A7 side needs to do "OR" is

The A5 side slot occupation table is as follows: 00 11 11 11

The A6 side slot occupation table is as follows: 00 11 11 11

The A7 side slot occupation table is as follows: 00 00 11 11

The A8 side slot occupation table is as follows: 00 00 11 11

In a specific implementation, after performing or operation on the slot occupation tables of A5, A6, A7, and A8, a new slot occupation table is obtained as follows: 00 11 11 1, then it can be seen that, the first two time slots are not occupied, then the time slot number of A7 can be changed into the time slot number of A1, and similarly, the time slot number of A8 can be changed into the time slot number of A2.

In one possible example, before the step 201, the following steps may be included:

c1, acquiring a target iris image;

c2, evaluating the image quality of the target iris image to obtain a target image quality evaluation value;

c3, when the target image quality evaluation value is larger than a preset image quality evaluation threshold value, matching the target iris image with a preset iris template;

and C4, executing step 201 when the target iris image is successfully matched with the preset iris template.

The preset image quality evaluation threshold value and the preset iris template can be set by the user or default by the system. In specific implementation, the target iris image may be acquired through a camera, and image quality evaluation is performed on the target iris image by using at least one image quality evaluation index to obtain a target image quality evaluation value, where the image quality evaluation index may be at least one of the following: entropy, average gradient, edge preservation, sharpness, etc., and are not limited herein. Furthermore, the target iris image and the preset iris template can be matched when the target image quality evaluation value is greater than the preset image quality evaluation threshold value, and the step 201 is executed when the target iris image and the preset iris template are successfully matched, otherwise, the iris image can be prompted to be collected again, so that the iris recognition efficiency is improved.

Further, in the step C2, performing image quality evaluation on the target iris image to obtain a target image quality evaluation value, the method may include the following steps:

c21, performing multi-scale feature decomposition on the target iris image to obtain a low-frequency feature component image and a high-frequency feature component image;

c22, dividing the low-frequency characteristic component image into a plurality of areas;

c23, determining an information entropy corresponding to each of the plurality of regions to obtain a plurality of information entropies;

c24, determining an average information entropy and a target mean square error according to the plurality of information entropies;

c25, determining a target fine adjustment adjusting coefficient corresponding to the target mean square error;

c26, adjusting the average information entropy according to the target fine adjustment coefficient to obtain a target information entropy;

c27, determining a first evaluation value corresponding to the target information entropy according to a mapping relation between preset information entropy and evaluation values;

c28, acquiring a first shooting parameter of the target corresponding to the target iris image;

c29, determining a target low-frequency weight corresponding to the first shooting parameter of the target according to a mapping relation between preset shooting parameters and the low-frequency weight, and determining a target high-frequency weight according to the target low-frequency weight;

c30, determining the distribution density of the target characteristic points according to the high-frequency characteristic component image;

c31, determining a second evaluation value corresponding to the target feature point distribution density according to a preset mapping relation between the feature point distribution density and the evaluation value;

and C32, carrying out weighting operation according to the first evaluation value, the second evaluation value, the target low-frequency weight and the target high-frequency weight to obtain a target image quality evaluation value of the target iris image.

In specific implementation, a multi-scale decomposition algorithm may be adopted to perform multi-scale feature decomposition on the target iris image to obtain a low-frequency feature component image and a high-frequency feature component image, and the multi-scale decomposition algorithm may be at least one of the following: the pyramid transform algorithm, the wavelet transform, the contourlet transform, the shear wave transform, etc., are not limited herein, and in a specific implementation, the number of the low-frequency feature component images may be 1, and the number of the high-frequency feature component images may be 1 or more. Further, the low-frequency feature component image may be divided into a plurality of regions, each of which has the same or different area size. The low-frequency feature component image reflects the main features of the image and can occupy the main energy of the image, and the high-frequency feature component image reflects the detail information of the image.

Further, the information entropy corresponding to each of the plurality of regions can be determined to obtain a plurality of information entropies, the average information entropy and the target mean square error are determined according to the plurality of information entropies, the information entropy can reflect the amount of the image information to a certain extent, and the mean square error can reflect the stability of the image information. The mapping relationship between the preset mean square error and the fine adjustment coefficient can be stored in advance, and then the target fine adjustment coefficient corresponding to the target mean square error can be determined according to the mapping relationship, in the embodiment of the application, the value range of the fine adjustment coefficient can be-0.075.

Further, the average information entropy may be adjusted according to the target fine-tuning adjustment coefficient to obtain a target information entropy, where the target information entropy = (1 + target fine-tuning adjustment coefficient) × the average information entropy. The mapping relationship between the preset information entropy and the evaluation value may be stored in advance, and further, the first evaluation value corresponding to the target information entropy may be determined according to the mapping relationship between the preset information entropy and the evaluation value.

In addition, a first target shooting parameter corresponding to the target iris image may be obtained, and reference is made to the above description for the first target shooting parameter, which is not described herein again. The method can also pre-store a mapping relation between preset shooting parameters and low-frequency weights, further, a target low-frequency weight corresponding to a first shooting parameter of a target can be determined according to the mapping relation between the preset shooting parameters and the low-frequency weights, a target high-frequency weight is determined according to the target low-frequency weight, and the target low-frequency weight + the target high-frequency weight =1.

Further, a target feature point distribution density may be determined from the high-frequency feature component images, where the target feature point distribution density = total number of feature points/area of the high-frequency feature component images. The method may further include pre-storing a mapping relationship between a preset feature point distribution density and an evaluation value, determining a second evaluation value corresponding to the target feature point distribution density according to the mapping relationship between the preset feature point distribution density and the evaluation value, and finally performing a weighting operation according to the first evaluation value, the second evaluation value, the target low-frequency weight, and the target high-frequency weight to obtain a target image quality evaluation value of the target iris image, which is specifically as follows:

target image quality evaluation value = first evaluation value + target low-frequency weight + second evaluation value + target high-frequency weight

Therefore, image quality evaluation can be performed on the basis of two dimensions of the low-frequency component and the high-frequency component of the target iris image, and evaluation parameters suitable for a shooting environment, namely a target image quality evaluation value, can be accurately obtained.

It can be seen that, in the embodiment of the present application, the method is applied to a base station X, where the base station X is any one base station in a location service system, the location service system includes K base stations, where K is an integer greater than 1, the base station X obtains a timeslot occupation table by intercepting a data frame of a neighboring base station belonging to the base station X in the location service system, to obtain multiple timeslot occupation tables, each base station corresponds to one timeslot occupation table, each timeslot occupation table represents a timeslot state of each base station in the K base stations, obtains a first timeslot occupation table of the base station X, performs an operation according to the multiple timeslot occupation tables and the first timeslot occupation table, obtains a second timeslot occupation table, and updates a timeslot number of the base station X according to the second timeslot occupation table. Therefore, the space division multiplexing of the limited time slot in the same space can be realized by reasonably utilizing the dynamic serial number of the time slot on the premise of ensuring different serial numbers of the adjacent base stations of any base station, and the capacity of the infinite base station can be realized under the condition of limited time slot quantity.

Referring to fig. 3, fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure, as shown in the figure, the electronic device includes a processor, a memory, a communication interface, and one or more programs, where the one or more programs are stored in the memory and configured to be executed by the processor, the electronic device may be a base station X, the base station X is any base station in a location service system, the location service system includes K base stations, and K is an integer greater than 1, and in this embodiment, the programs include instructions for performing the following steps:

acquiring a first time slot occupation table of the base station X;

In one possible example, in said updating of the slot number of the base station X according to the second slot occupancy table, the above procedure comprises instructions for:

determining an unoccupied target time slot in the second time slot occupation list, wherein the target time slot is any one of the unoccupied time slots in the second time slot occupation list;

and updating the time slot number of the base station X to the time slot number of the target base station corresponding to the target time slot.

In one possible example, the program further includes instructions for performing the steps of:

detecting whether an unoccupied time slot exists in the second time slot occupation list or not;

when the unoccupied time slots exist in the second time slot occupying table, executing the step of determining the unoccupied target time slots in the second time slot occupying table;

and when the second time slot occupation table does not have unoccupied time slots, confirming that the time slot number of the base station X cannot be updated.

In one possible example, in obtaining the second slot occupation table by performing the operation according to the plurality of slot occupation tables and the first slot occupation table, the program includes instructions for:

In one possible example, the location service system further comprises base station Y, base station J, and base station W; before the time slot occupancy table is obtained by intercepting the data frame of the neighboring base station belonging to the base station X in the positioning service system to obtain multiple time slot occupancy tables, the program further includes instructions for executing the following steps:

the base station X monitors a data frame in a preset time period, and monitors a data frame Y of the base station Y, a data frame J of the base station J and a data frame W of the base station W, wherein the preset time period is a continuous preset number of positioning service cycles, and the positioning service cycles are working cycles of the positioning service system;

and the base station X configures the self time slot number according to the time slot occupation conditions of the data frame Y, the data frame J and the data frame W.

The above description has introduced the solution of the embodiment of the present application mainly from the perspective of the method-side implementation process. It is understood that the electronic device comprises corresponding hardware structures and/or software modules for performing the respective functions in order to realize the functions. Those of skill in the art will readily appreciate that the present application is capable of hardware or a combination of hardware and computer software implementing the various illustrative elements and algorithm steps described in connection with the embodiments provided herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the embodiment of the present application, the electronic device may be divided into the functional units according to the method example, for example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated into one processing unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit. It should be noted that the division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.

Fig. 4 is a block diagram showing functional units of a timeslot update apparatus 400 according to an embodiment of the present application. The time slot updating apparatus 400 is applied to a base station X, where the base station X is any base station in a positioning service system, the positioning service system includes K base stations, and K is an integer greater than 1, and the apparatus includes: a listening unit 401, an acquisition unit 402, an arithmetic unit 403 and an update unit 404, wherein,

the intercepting unit 401 is configured to acquire a time slot occupation table by intercepting a data frame of a neighboring base station belonging to the base station X in the positioning service system, so as to obtain a plurality of time slot occupation tables, where each base station corresponds to one time slot occupation table, and each time slot occupation table includes a time slot state of each base station in the K base stations;

the obtaining unit 402 is configured to obtain a first time slot occupancy table of the base station X;

the operation unit 403 is configured to perform an operation according to the multiple time slot occupancy tables and the first time slot occupancy table to obtain a second time slot occupancy table;

the updating unit 404 is configured to implement the timeslot number of the base station X according to the second timeslot occupation table.

In a possible example, in the aspect of updating the timeslot number of the base station X according to the second timeslot occupation table, the updating unit 404 is specifically configured to:

determining unoccupied target time slots in the second time slot occupation table, wherein the target time slots are any time slots in the unoccupied time slots in the second time slot occupation table;

In a possible example, the updating unit 404 is further specifically configured to:

detecting whether an unoccupied time slot exists in the second time slot occupation table;

when the second time slot occupying table has unoccupied time slots, executing the step of determining the unoccupied target time slots in the second time slot occupying table;

In a possible example, in terms of obtaining a second timeslot occupation table by performing the operation according to the multiple timeslot occupation tables and the first timeslot occupation table, the operation unit 403 is specifically configured to:

In one possible example, the location service system further comprises base station Y, base station J, and base station W; the device is also used for realizing the following functions:

the monitoring unit 401 is further configured to monitor a data frame in a preset time period, and monitor a data frame Y of the base station Y, a data frame J of the base station J, and a data frame W of the base station W, where the preset time period is a continuous preset number of positioning service cycles, and the positioning service cycle is a working cycle of the positioning service system;

the arithmetic unit 403 is further configured to configure its own timeslot number according to the timeslot occupation statuses of the data frame Y, the data frame J, and the data frame W.

It should be noted that listening unit 401, obtaining unit 402, calculating unit 403, and updating unit 404 may all be implemented by a processor.

Embodiments of the present application also provide a computer storage medium, where the computer storage medium stores a computer program for electronic data exchange, the computer program enabling a computer to execute part or all of the steps of any one of the methods described in the above method embodiments, and the computer includes an electronic device.

Embodiments of the present application also provide a computer program product comprising a non-transitory computer readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any of the methods as described in the above method embodiments. The computer program product may be a software installation package, the computer comprising an electronic device.

It should be noted that for simplicity of description, the above-mentioned embodiments of the method are described as a series of acts, but those skilled in the art should understand that the present application is not limited by the described order of acts, as some steps may be performed in other orders or simultaneously according to the present application. Further, those skilled in the art will recognize that the embodiments described in this specification are preferred embodiments and that acts or modules referred to are not necessarily required for this application.

In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.

In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the above-described units is only one type of logical functional division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some interfaces, devices or units, and may be an electric or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit may be implemented in the form of hardware, or may also be implemented in the form of a software functional unit.

The integrated unit may be stored in a computer readable memory if it is implemented in the form of a software functional unit and sold or used as a stand-alone product. Based on such understanding, the technical solutions of the present application, which are essential or part of the technical solutions contributing to the prior art, or all or part of the technical solutions, may be embodied in the form of a software product, which is stored in a memory and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the above methods of the embodiments of the present application. And the aforementioned memory comprises: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.

Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable memory, which may include: flash Memory disks, read-Only memories (ROMs), random Access Memories (RAMs), magnetic or optical disks, and the like.

The foregoing detailed description of the embodiments of the present application has been presented to illustrate the principles and implementations of the present application, and the above description of the embodiments is only provided to help understand the method and the core concept of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.

Claims

1. A time slot updating method is applied to a base station X, wherein the base station X is any base station in a positioning service system, the positioning service system comprises K base stations, and K is an integer greater than 1, and the method comprises the following steps:

acquiring a first time slot occupation table of the base station X;

updating the time slot number of the base station X according to the second time slot occupation table;

wherein the method further comprises:

acquiring a target iris image;

performing image quality evaluation on the target iris image to obtain a target image quality evaluation value;

when the target image quality evaluation value is larger than a preset image quality evaluation threshold value, matching the target iris image with a preset iris template;

when the target iris image is successfully matched with the preset iris template, executing a step that the base station X acquires a time slot occupation table by monitoring a data frame of a neighboring base station belonging to the base station X in the positioning service system;

the image quality evaluation of the target iris image to obtain a target image quality evaluation value comprises the following steps:

carrying out multi-scale feature decomposition on the target iris image to obtain a low-frequency feature component image and a high-frequency feature component image;

dividing the low-frequency feature component image into a plurality of regions;

determining an information entropy corresponding to each of the plurality of regions to obtain a plurality of information entropies;

determining an average information entropy and a target mean square error according to the plurality of information entropies;

determining a target fine tuning adjustment coefficient corresponding to the target mean square error;

adjusting the average information entropy according to the target fine adjustment coefficient to obtain a target information entropy;

determining a first evaluation value corresponding to the target information entropy according to a mapping relation between a preset information entropy and the evaluation value;

acquiring a first shooting parameter of a target corresponding to the target iris image;

determining a target low-frequency weight corresponding to the first shooting parameter of the target according to a mapping relation between preset shooting parameters and the low-frequency weight, and determining a target high-frequency weight according to the target low-frequency weight;

determining the distribution density of target characteristic points according to the high-frequency characteristic component image;

determining a second evaluation value corresponding to the target feature point distribution density according to a preset mapping relation between the feature point distribution density and the evaluation value;

and performing weighting operation according to the first evaluation value, the second evaluation value, the target low-frequency weight and the target high-frequency weight to obtain a target image quality evaluation value of the target iris image.

2. The method of claim 1, further comprising:

3. The method according to claim 1 or 2, wherein said updating the slot number of the base station X according to the second slot occupancy table comprises:

4. The method according to any one of claims 1 to 3, wherein the obtaining a second slot occupancy table by performing the operation according to the plurality of slot occupancy tables and the first slot occupancy table comprises:

5. The method according to any of claims 1-4, wherein the number of neighboring base stations of base station X is within a preset range.

6. The method of claim 5, wherein the preset range comprises a lower threshold and an upper threshold, the lower threshold is less than the upper threshold, the lower threshold is 4, and the upper threshold is 6.

7. The method of claim 6, wherein the location service system further comprises base station Y, base station J, and base station W; before the obtaining a time slot occupancy table by intercepting data frames of neighboring base stations belonging to the base station X in the positioning service system to obtain a plurality of time slot occupancy tables, the method further includes:

8. A time slot updating device is applied to a base station X, the base station X is any base station in a positioning service system, the positioning service system comprises K base stations, and K is an integer greater than 1, the device comprises: a listening unit, an acquisition unit, an arithmetic unit and an update unit, wherein,

the updating unit is used for updating the time slot number of the base station X according to the second time slot occupation table;

wherein the apparatus is further specifically configured to:

acquiring a target iris image;

the image quality evaluation of the target iris image to obtain a target image quality evaluation value includes:

dividing the low-frequency feature component image into a plurality of regions;

acquiring a first shooting parameter of a target corresponding to the iris image of the target;

9. A base station comprising a processor, a memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs comprising instructions for performing the steps in the method of any of claims 1-7.

10. An electronic device comprising a processor, memory, a communication interface, and one or more programs stored in the memory and configured to be executed by the processor, the programs including instructions for performing the steps in the method of any of claims 1-7.

11. A computer-readable storage medium, characterized in that a computer program for electronic data exchange is stored, wherein the computer program causes a computer to perform the method according to any one of claims 1-7.