Multi-device low-power-consumption rapid networking method based on star flash technology

Abstract

The invention belongs to the technical field of wireless communication networks, and particularly relates to a multi-device low-power-consumption rapid networking method based on a star flash technology. The method comprises the following steps: after a gateway sends out a network frame, a device to be networked calculates an optimal adding hierarchy through an innovative optimal adding hierarchy strategy according to the load of the device, the signal strength of the gateway and the remaining electric quantity of a battery; the gateway distributes an independent time window for each level in combination with a star flash technology asynchronous time slot distribution mechanism; the to-be-networked equipment completes network access in the time slot of the belonging hierarchy; the network access equipment forms a father-son relationship, and child nodes accurately calculate wake-up time to reduce air listening power consumption; all the devices adjust the relay duration in real time to reduce redundant relays; and when the network state suddenly changes, automatic reconstruction is performed to keep optimal. According to the invention, multi-device high-efficiency low-power-consumption networking can be realized.

Description

Technical Field

[0001] The present invention belongs to the technical field of wireless communication networks, and in particular relates to a multi-device low-power rapid networking method based on star flash technology. Background Art

[0002] With the rapid development of the Internet of Things (IoT), the need for multi-device collaborative networking is becoming increasingly prominent in scenarios such as smart homes, industrial monitoring, and wearables. Existing wireless networking technologies, such as Bluetooth, Wi-Fi, and ZigBee, face numerous bottlenecks when handling large-scale device access. Low-power devices often struggle to maintain connections, leading to insufficient battery life. Time slot conflicts and delays often occur when multiple devices access the network concurrently. Dynamically adjusting relay strategies when network topology or device status changes can be difficult, resulting in redundant forwarding. Static resource allocation often fails to adapt to real-time device load and signal strength variations.

[0003] As an emerging short-range wireless communication technology, Starflash technology has the advantages of low latency, high reliability and flexible time slot scheduling. However, the existing networking solutions based on Starflash technology have not yet formed a systematic optimization strategy for multi-device scenarios. There are deficiencies in device level selection, dynamic time slot allocation, time synchronization accuracy and relay timing convergence. It is difficult to take into account both fast networking and low power consumption requirements, and cannot meet the efficiency and stability requirements of large-scale device collaborative interconnection. Summary of the Invention

[0004] In response to the technical problems existing in the above background technologies, the present invention proposes a multi-device low-power rapid networking method based on Star Flash technology.

[0005] In order to achieve the above object, the technical solution adopted by the present invention includes the following steps:

[0006] S1. The gateway sends a network frame. The networked device calculates the optimal joining tier based on its own load, signal strength with the gateway, and remaining battery power collected in real time, using an innovative optimal joining tier strategy.

[0007] S2. The gateway allocates an independent time window for each layer based on the layer distribution reported by each device and the asynchronous time slot allocation mechanism of Star Flash technology;

[0008] S3: The device to be networked wakes up in the time slot of its layer and sends a joining request. After the gateway sends back a confirmation, the device is connected to the network.

[0009] S4: After joining the network, devices within one hop form a parent-child relationship. The child node uses the next cycle scheduling information dynamically broadcast by the parent node and the two-way delay calibration mechanism to accurately calculate the wake-up time of the next cycle, thereby aligning the networking time slot and reducing the power consumption of the idle listening function.

[0010] S5. All networked devices adjust relay duration in real time based on their layer and subnet layers during each networking cycle, so that relay timing converges with load changes and reduces redundant relays.

[0011] S6. When it is detected that the network topology, signal mutation or device status changes significantly beyond the threshold, steps S1 to S5 are automatically re-executed to maintain the optimal state of the network.

[0012] Preferably, the specific implementation of calculating the optimal joining level by innovating the optimal joining level strategy in step S1 is as follows:

[0013] S11. At the beginning of networking, the gateway broadcasts an auction invitation frame, which specifies the maximum number of layers, bidding parameter set, auction round limit, networking period, and penalty increment, and notifies all devices to be networked to enter the bidding preparation state;

[0014] S12, after receiving the invitation frame, each device in the network to be formed immediately collects and standardizes the data, including the load , signal strength , power , for each level , calculate the initial quote for each device ,in To bid on a parameter set, a device broadcasts its bids for all tiers in the allocated time slot and collects bid lists for each tier from its neighbors in parallel;

[0015] S13. After each round of bidding, the gateway will Parallel second-price auction: From the list of received bids, the lowest and second-lowest bids are selected, the lowest-bid device is designated as the winner, and the winning bid is announced online.

[0016] S14. If a certain equipment wins the bid in a multi-level auction, Calculate the net utility as: ,in, represents the net effect, The preset benchmark income is The net effect of equipment selection is the winning bid price The largest level is the final joining level, and the rest are considered to be automatically abandoned;

[0017] S15. For devices that are not confirmed within the specified time slot after winning the bid, the gateway will increase the penalty increment of its original bid in the next round of bidding; at the same time, for the vacant level caused by it, the gateway will immediately initiate a supplementary bidding among the second lowest bidders.

[0018] Preferably, in step S2, the gateway allocates an independent time window to each layer based on the hierarchical distribution reported by each device and the asynchronous time slot allocation mechanism of the Star Flash technology. The specific operation is as follows:

[0019] S21. The gateway sorts all the layers according to the number of nodes to be networked reported by each device. If the number of nodes in any layer is lower than the preset merging threshold, the layer is merged with the adjacent layer into a joint layer to reduce idle time slots.

[0020] S22. Allocate a minimum guaranteed time slot to each level, and distribute the remaining time slots according to the proportion of the number of nodes in each level;

[0021] S23. Before the start of each time slot, the gateway sends a wake-up preparation message to the first k devices with the highest net utility value in the layer. Only these k devices enter the answering state first, and the rest of the devices continue to sleep until the time slot officially starts.

[0022] S24. If a certain layer completes all network access confirmations within its time slot, the gateway immediately issues a time slot release and dynamically allocates the remaining time slot to the next layer for emergency re-shooting or accelerated network access;

[0023] S25. The gateway counts the network access completion rate of each layer and compares it with the target completion rate. If a layer does not meet expectations, its guaranteed time slot or merging threshold is automatically increased in the next networking cycle until the network access rates of all layers converge to the target.

[0024] Preferably, before the parent-child relationship is formed between the devices within one hop after network access in step S4, it is necessary to determine the parent node, which is specifically implemented as follows:

[0025] The child node sends a parent node request signal within the short query time slot of its own level. The sending time slot is randomly selected by the child node ID through a hash algorithm to avoid collective simultaneous transmission;

[0026] All potential parent nodes send serviceable responses in the fixed waiting time slot after receiving the request in the ascending order of their respective device hash values. The response time slot length is the same;

[0027] After waiting for responses, the child node temporarily adds the first, second, and third arriving response nodes to the candidate parent node pool to achieve fast local aggregation;

[0028] Based on the rotation priority logic, the child node shakes hands with the candidate nodes in the local historical rotation order. The first node that successfully establishes a handshake is confirmed as the parent node.

[0029] Preferably, in step S4, the child node uses the next cycle scheduling information dynamically broadcast by the parent node and the two-way delay calibration mechanism to accurately calculate the wake-up time of the next cycle, thereby aligning the networking time slot and reducing the power consumption of the idle listening. The specific implementation is as follows:

[0030] S41. After completing the first network access, the child node initializes the error sequence and saves the time difference between the actual arrival time of the parent node's network frame and its own preset wake-up time in the last N cycles in a circular queue;

[0031] S42. When the parent node sends a network access confirmation frame, it appends its frame transmission plan for the next cycle in the form of a time offset table to the frame payload. The table lists the sequence of scheduled frame transmission times relative to the end of the current cycle.

[0032] S43: After receiving and parsing the frame plan, the child node immediately starts the two-way delay detection process and sends a detection request frame with a local sending timestamp to the parent node. , the parent node receives and returns the content And its own receiving timestamp , local reply timestamp response frame , one-way delay of child node , ;

[0033] S44, the child node sends the frame according to the parsed plan time , measured one-way delay and the mean deviation of the error series , generate a benchmark wake-up point , ; Then, the compensation buffer time is set according to the current network load index and its own remaining power to form a candidate time set;

[0034] S45. Select the time corresponding to the minimum deviation in the error sequence from the candidate time set as the preliminary wake-up time, and segment the compensation buffer time into a main monitoring segment and an auxiliary monitoring segment to form a complete wake-up execution window;

[0035] S46: The child node calculates a confidence interval based on the preliminary wake-up time and the standard deviation of the error series. If the standard deviation is less than or equal to the threshold, the preliminary wake-up time is directly used. If the standard deviation is greater than the threshold, the baseline wake-up point is corrected and used as the final wake-up time.

[0036] S47. If the parent node frame is not captured in both the main monitoring segment and the auxiliary monitoring segment, the difference between the actual monitoring end time and the parent node frame sending time is recorded again in the error sequence, and when S42 to S46 are re-executed in the next cycle, the error is included in the average deviation of the error sequence. Calculation of , performing bias correction.

[0037] Preferably, the error sequence management mechanism in step S41 is specifically implemented as follows:

[0038] S411. The child node sets the dynamic length N of the error sequence and adjusts it in real time based on signal stability. When the error standard deviation is less than or equal to the set threshold for three consecutive periods, the length N changes to 1.25N to accumulate more historical data and improve trend prediction accuracy. When the error standard deviation is greater than the set threshold for three consecutive periods, the length N changes to 0.75N to prevent old errors from interfering with the current calculation.

[0039] S412, perform sliding window filtering on the error sequence to remove abnormal values. If a certain period error satisfy ,in If it is the error standard deviation, it is marked as an outlier, removed and replaced by the error value of the previous period;

[0040] S413, after each networking cycle ends, the child node calculates the first-order difference of the error sequence. The first-order difference is that after each networking cycle ends, the child node extracts the current cycle error and the previous cycle error from the error sequence, and performs the difference to obtain the first-order difference. If the first-order difference is positive twice in a row, the reference wake-up point is reset in step S44. Make corrections.

[0041] As a preference, in step S5, all networked devices adjust the relay duration in real time based on their level and subnet layers in each networking cycle, so that the relay timing converges with the load change and reduces redundant relays. The specific implementation is as follows: first, the device obtains its own level L and the maximum subnet level depth S, and calculates the double logarithmic slow-increasing terms, which are respectively , , based on the preset basic relay duration, the adjusted relay duration is calculated and updated ,in To preset the basic relay duration, is the adjusted relay duration.

[0042] Compared with the prior art, the advantages and positive effects of the present invention are:

[0043] 1. Adopt an innovative optimal joining level strategy, calculate the optimal level through an auction mechanism combined with device load, signal strength and power consumption, achieve reasonable device stratification, reduce network access conflicts and improve networking efficiency.

[0044] 2. Combined with the asynchronous time slot allocation of Star Flash technology, it dynamically merges levels and adjusts time slots to give priority to waking up high-net-utility devices, reduce the waste of idle time slots, and reduce the energy consumption of device sleep.

[0045] 3. The sub-node uses two-way delay calibration and error sequence management to accurately calculate the wake-up time and align the networking time slots, significantly reducing the power consumption of the idle listening state and improving the synchronization accuracy.

[0046] 4. Dynamically adjust the relay duration based on the hierarchy and subnet depth, optimize the relay timing through double logarithmic slow increase items, reduce redundant relays, and improve relay efficiency.

[0047] 5. It has an automatic network reorganization mechanism. When a sudden change in network topology, signal or device status is detected, the network will be automatically reconstructed to maintain the optimal state and enhance adaptability. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following is a brief introduction to the drawings required for use in the description of the embodiments. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0049] Figure 1 This is a structural flow diagram of a multi-device low-power rapid networking method based on Star Flash technology; DETAILED DESCRIPTION

[0050] In order to more clearly understand the above-mentioned objects, features and advantages of the present invention, the present invention is further described below in conjunction with the accompanying drawings and embodiments. It should be noted that the embodiments of the present application and the features therein can be combined with each other without conflict.

[0051] In the following description, many specific details are set forth to facilitate a full understanding of the present invention. However, the present invention may also be implemented in other ways than those described herein. Therefore, the present invention is not limited to the specific embodiments disclosed below.

[0052] Embodiment: With the rapid growth of the scale of IoT devices, the number of devices connected to the network at the same time has increased significantly in scenarios such as smart homes, industrial monitoring, and environmental monitoring. Existing networking solutions are often difficult to balance fast networking and low power consumption during large-scale access due to problems such as high air listening power consumption, large network access delays, serious time slot conflicts, and weak dynamic adjustment capabilities. They are unable to meet real-time and reliability requirements. In response to the above problems, this embodiment proposes a multi-device low-power rapid networking method that combines layered auctions with asynchronous time slot allocation based on Star Flash technology. Through refined hierarchical division, dynamic time slot management, and two-way delay calibration, dual optimization of network access efficiency and power consumption is achieved. The specific implementation process is as follows: Figure 1 shown.

[0053] First, the gateway sends out a network frame, and the networked device calculates the optimal joining level through an innovative optimal joining level strategy based on its own load collected in real time, the signal strength with the gateway, and the remaining battery power. The specific implementation of the innovative optimal joining level strategy to calculate the optimal joining level is as follows: the gateway broadcasts an auction invitation frame at the beginning of networking, which specifies the maximum number of layers, bidding parameter set, auction round limit, networking cycle, and penalty increment, and notifies all networked devices to enter the bidding preparation state; after receiving the invitation frame, each device in the network immediately collects and standardizes the load, including , signal strength , power , for each level , calculate the initial quote for each device ,in The device broadcasts all its bids for the bidding parameter set in the allocated time slot and collects the bid lists of the neighbors for each level in parallel. After each round of bidding, the gateway will Parallel execution of second-price auction: In the list of received bids, the lowest bid and the second lowest bid are selected, the lowest-bid device is determined as the winner, and the results are announced to the network; if a device wins the bid in a multi-level auction, each winning bidder is listed in the auction results. Calculate the net utility as: ,in, represents the net effect, The preset benchmark income is The net effect of equipment selection is the winning bid price The highest level is the final entry level, while all others are automatically forfeited. For devices that fail to confirm their winning bids within the specified time slot, the gateway will impose a penalty on their original bids in the next round of bidding. Furthermore, for any vacant levels created by these bids, the gateway will immediately initiate a re-bidding process among the second-lowest bidders. This closed-loop process, through layered auctions, timely feedback, and adaptive penalties, not only rapidly builds the initial network topology but also maintains fair competition and optimal energy consumption when connecting large numbers of devices. This provides strong scalability and flexible deployment.

[0054] Then, in order to reduce the idle listening power consumption and time slot conflict rate of the equipment, the asynchronous time slot allocation mechanism of Star Flash technology is adopted, and the dynamic time slot merging and release effect is added. The gateway allocates an independent time window for each level based on the hierarchical distribution reported by each device, combined with the asynchronous time slot allocation mechanism of Star Flash technology; the specific operation of the gateway allocating an independent time window for each level based on the hierarchical distribution reported by each device, combined with the asynchronous time slot allocation mechanism of Star Flash technology is as follows: the gateway sorts all levels according to the number of nodes to be networked reported by each device. If the number of nodes in any level is lower than the preset merging threshold, the level is merged with the adjacent level into a joint level to reduce idle time slots; each level is first allocated a minimum guaranteed time slot, and the remaining time slots are divided according to the proportion of the number of nodes in each level. Matching; before the time slot of each layer is about to start, the gateway sends a wake-up preparation to the first k devices with the highest net utility value in the layer. Only these k devices will enter the answering state first, and the remaining devices will continue to sleep until the time slot officially starts; if a layer completes all network access confirmations within its time slot, the gateway will immediately issue a time slot release and dynamically allocate the remaining time period to the next layer for emergency re-shooting or accelerated network access; the gateway counts the network access completion rate of each layer and compares it with the target completion rate. If a layer does not meet expectations, it will automatically increase its guaranteed time slot or merge threshold in the next networking cycle until the network access rate of all layers converges to the target. Specifically, after receiving the network access intention report from all devices, the gateway first stores the number of nodes reported by each layer in an array, and quickly sorts them in order from small to large or from large to small (such as using a merge or quick sort algorithm) to obtain an ordered list of layers. The gateway then traverses the list. If the number of nodes in any level in the sorted sequence falls below a preset merge threshold (this threshold is adaptively adjusted based on network scale and historical statistics), the level is merged with its adjacent, sorted level with the closest number of nodes. During the merge, the gateway generates a new joint level identifier and merges all device registrations from both levels into a single list of pending allocations. The gateway also updates the level mapping table, mapping the original level number to the joint level number to ensure consistent logic for subsequent timeslot allocations. After the merge is complete, the gateway broadcasts an announcement notifying affected devices of the new level number and the range of pending timeslots, and simultaneously updates its internal scheduling queue. The system pre-assigns a fixed minimum guaranteed timeslot length to each level. This length is calculated based on the minimum expected number of network access requests and the maximum single-frame duration, ensuring at least basic network access even under extremely low latency and high load conditions. The sum of all guaranteed timeslots is deducted from the total available timeslots to obtain the total number of remaining timeslots. Next, the gateway calculates the weight of each tier based on the number of devices currently waiting to join the network. Finally, it allocates the remaining time slots to each tier according to their weighted proportions. This allocation is combined with the shortest guaranteed time slot to form the total available time slots for each tier. The gateway distributes the allocation table via multicast or broadcast, and synchronizes the start and end times of the time slots across the entire network to ensure that devices at each tier accurately know their network access windows.Upon completing the above steps, the gateway has already determined the net utility of devices at each tier. Within a controllable reserved time before the start of a time slot, the gateway selects the top K devices with the highest net utility for each tier (K ​​can be a constant or adaptively set based on the tier size) and sends each of them a wake-up preparation command. This command includes the upcoming time slot number, duration, and necessary synchronization timestamps. Devices receiving the command immediately exit deep sleep, preheat their radio modules, and enable their receive links. Devices not selected remain in deep sleep until receiving a unified wake-up broadcast at the actual start of their tier's time slot. The gateway also starts a countdown timer to ensure reliable delivery or retransmission of the command within the controllable reserved time. The gateway then continuously listens for and counts network access confirmation frames within each tier's time slot. Once it detects that all devices in that tier have successfully joined the network (or a preset minimum confirmation ratio has been reached), it generates and broadcasts a time slot release notification, which includes the release start time and available time. The released time slots are dynamically added to the next level's emergency time slot pool for rescheduling or early network access attempts. The gateway updates the global time slot allocation table and sends a change event, allowing the next level device to receive the new wake-up command and quickly attempt network access before the original time slot. Furthermore, if the next level's network access demand exceeds the dynamically allocated capacity, the gateway will perform a short-term reallocation based on the remaining total time slots to ensure that the system avoids time slot waste or congestion. After completing all time slots at each level, the gateway calculates the completion rate (number of devices actually connected to the network divided by the total number of devices waiting to be connected) by counting the number of devices already connected to the network at each level. This rate is compared with the preset target completion rate. If the completion rate is greater than or equal to the preset target completion rate, the minimum guaranteed time slot and merging threshold for that level remain unchanged. Otherwise, the guaranteed time slot length or merging threshold for that level in the next networking cycle are proportionally increased, and the adjustment plan is sent via a configuration frame. After all adjustments are completed at all levels, the gateway initiates the next networking cycle. Through continuous iteration, the network access completion rate is improved with each round until the completion rate of all layers stably reaches or exceeds the target value, thus ensuring fast and reliable networking in large-scale multi-device environments.

[0055] A device waiting to be connected wakes up and sends a join request within its assigned time slot. The gateway sends back a confirmation, completing the device's network access. Specifically, to ensure timely network access, the device wakes up from deep sleep 10ms before the start of its assigned time slot, powers on the RF link, and activates the receive module, reducing power consumption. At the start of the time slot, the device immediately sends a join request frame containing its device ID, layer identifier, capability parameters, and calibration information, enhancing fast connection. After receiving the request frame, the gateway verifies the address pool and security authentication, assigns a short address and time slot information based on the current network topology, and constructs a confirmation frame, enhancing reliable network access. After the confirmation frame is sent to the device via the response link, the device parses the confirmation information, updates its own network parameters, and switches to a normal network access state, establishing a data transmission and reception channel and ensuring stable network access. If the device does not receive the confirmation within the time slot, the gateway triggers a retry mechanism and delays the request, directing the device to a backup time slot, enhancing fault tolerance.

[0056] After joining the network, the devices within one hop form a parent-child relationship. The child node uses the next cycle scheduling information dynamically broadcast by the parent node and the two-way delay calibration mechanism to accurately calculate the wake-up time of the next cycle, thereby aligning the networking time slot and reducing the power consumption of the idle listening. Among them, the child node uses the next cycle scheduling information dynamically broadcast by the parent node and the two-way delay calibration mechanism to accurately calculate the wake-up time of the next cycle, thereby aligning the networking time slot and reducing the power consumption of the idle listening. The specific implementation is as follows: the child node initializes the error sequence after completing the first network access, and saves the time difference between the actual arrival time of the parent node networking frame and its own preset wake-up time in the last N cycles in a circular queue; when the parent node sends the network access confirmation frame, it attaches its frame transmission plan for the next cycle in the form of a time offset table to the frame payload. The table lists the sequence of scheduled frame transmission times relative to the end of this cycle;

[0057] After receiving and parsing the frame plan, the child node immediately starts the two-way delay detection process and sends a detection request frame with a local sending timestamp to the parent node. , the parent node receives and returns the content And its own receiving timestamp , local reply timestamp response frame , one-way delay of child node , ; The child node is based on the parsed frame sending plan time , measured one-way delay and the mean deviation of the error series , generate a benchmark wake-up point , ; Then, the compensation buffer time is set according to the current network load index and its own remaining power to form a set of candidate moments; the moment corresponding to the minimum deviation in the error sequence is selected from the candidate moment set as the preliminary wake-up time, and the compensation buffer time is segmented into the main monitoring segment and the auxiliary monitoring segment to form a complete wake-up execution window; the child node calculates the confidence interval based on the preliminary wake-up time and the standard deviation of the error series. If the standard deviation is less than or equal to the threshold, the preliminary wake-up time is directly used. If the standard deviation is greater than the threshold, it is corrected based on the benchmark wake-up point as the final wake-up moment; if the parent node frame is not captured in the main monitoring segment and the auxiliary monitoring segment, the actual monitoring end time and the parent node frame sending time difference are recorded again in the error sequence, and when re-executing the calibration steps such as two-way delay measurement, benchmark wake-up point calculation, and confidence interval determination in the next cycle, the error is included in the average deviation of the error sequence. Calculation of , performing deviation correction, the deviation correction is.

[0058] The management mechanism of the error sequence is specifically implemented as follows: the child node sets the dynamic length N of the error sequence and adjusts it in real time according to the signal stability. When the error standard deviation is less than or equal to the set threshold in three consecutive cycles, the length N changes to 1.25N to accumulate more historical data and improve the trend prediction accuracy; when the error standard deviation is greater than the set threshold in three consecutive cycles, the length N changes to 0.75N to avoid the old error interfering with the current calculation; then the error sequence is subjected to sliding window filtering to remove outliers. If the error in a certain period is greater than the set threshold, the error sequence is filtered. satisfy ,in If the error standard deviation is the error standard deviation, it is marked as an outlier, and the outlier is removed and replaced with the error value of the previous cycle; after each networking cycle ends, the child node calculates the first-order difference of the error sequence. The first-order difference is that after each networking cycle ends, the child node extracts the current cycle error and the previous cycle error from the error sequence, and performs the difference to obtain the first-order difference. If the first-order difference is positive twice in a row, the reference wake-up point is reset. The reference wake-up point Corrected to ,in, is the corrected wake-up point, is the first-order difference of the current period and the first-order difference of the previous period.

[0059] When all networked devices adjust the relay duration in real time based on their level and subnet number in each networking cycle, the relay timing converges with the load change and reduces redundant relays. The specific implementation of adjusting the relay duration in real time based on the level and subnet number is as follows: first, the device obtains its own level L and the maximum subnet level depth S, and calculates the double logarithmic slow-increasing terms, which are respectively , , based on the preset basic relay duration, the adjusted relay duration is calculated and updated ,in To preset the basic relay duration, is the adjusted relay duration.

[0060] Finally, if a sudden change in network topology, signal strength, or device status is detected, exceeding a threshold, the gateway automatically re-executes the aforementioned steps to maintain the optimal network state. Specifically, while the network is operating, the gateway continuously monitors the link quality, topology, and device operating status of each node. If any link is disconnected, signal strength drops sharply, or key indicators such as device energy consumption and load fluctuate beyond a preset threshold, the self-healing process is triggered. At this point, the gateway first suspends normal communications and broadcasts a network reorganization notification. Upon receiving this notification, all devices enter a ready state and report their latest status information within a predetermined time window. The gateway then re-executes the hierarchical auction, asynchronous time slot allocation, latency calibration, and relay duration adjustment steps to rebuild the optimal network topology using the latest network-wide parameters. During the reorganization process, the gateway compares the network access completion rate and latency accuracy of this and previous accesses, dynamically adjusting auction parameters, time slot quotas, and compensation strategies until network performance returns to target levels.

[0061] The above description is merely a preferred embodiment of the present invention and does not constitute any other form of limitation to the present invention. Any person skilled in the art may utilize the technical contents disclosed above to change or modify them into equivalent embodiments with equivalent changes for application in other fields. However, any simple modification, equivalent change, and modification of the above embodiments made in accordance with the technical essence of the present invention without departing from the technical solution of the present invention shall still fall within the scope of protection of the technical solution of the present invention.

Claims

1. A multi-device low-power rapid networking method based on Star Flash technology, characterized in that: The following steps are involved: S1. The gateway sends a network frame. The networked device calculates the optimal joining tier based on its own load, signal strength with the gateway, and remaining battery power collected in real time, using an innovative optimal joining tier strategy. S2. The gateway allocates an independent time window for each layer based on the layer distribution reported by each device and the asynchronous time slot allocation mechanism of Star Flash technology; S3: The device to be networked wakes up in the time slot of its layer and sends a joining request. After the gateway sends back a confirmation, the device is connected to the network. S4: After joining the network, devices within one hop form a parent-child relationship. The child node uses the next cycle scheduling information dynamically broadcast by the parent node and the two-way delay calibration mechanism to accurately calculate the wake-up time of the next cycle, thereby aligning the networking time slot and reducing the power consumption of the idle listening function. S5. All networked devices adjust relay duration in real time based on their layer and subnet layers during each networking cycle, so that relay timing converges with load changes and reduces redundant relays. S6. When it is detected that the network topology, signal mutation or device status changes significantly beyond the threshold, steps S1 to S5 are automatically re-executed to maintain the optimal state of the network.

2. The method for rapidly networking multiple devices with low power consumption based on Star Flash technology according to claim 1, characterized in that: The specific implementation of calculating the optimal joining level by innovating the optimal joining level strategy in step S1 is as follows: S11. At the beginning of networking, the gateway broadcasts an auction invitation frame, which specifies the maximum number of layers, bidding parameter set, auction round limit, networking period, and penalty increment, and notifies all devices to be networked to enter the bidding preparation state; S12, after receiving the invitation frame, each device in the network to be formed immediately collects and standardizes the data, including the load , signal strength , power , for each level , calculate the initial quote for each device ,in To bid on a parameter set, a device broadcasts its bids for all tiers in the allocated time slot and collects bid lists for each tier from its neighbors in parallel; S13. After each round of bidding, the gateway will Parallel second-price auction: From the list of received bids, the lowest and second-lowest bids are selected, the lowest-bid device is designated as the winner, and the winning bid is announced online. S14. If a certain equipment wins the bid in a multi-level auction, Calculate the net utility as: ,in, represents the net effect, The preset benchmark income is The net effect of equipment selection is the winning bid price The largest level is the final joining level, and the rest are considered to be automatically abandoned; S15. For devices that are not confirmed within the specified time slot after winning the bid, the gateway will increase the penalty increment of its original bid in the next round of bidding; at the same time, for the vacant level caused by it, the gateway will immediately initiate a supplementary bidding among the second lowest bidders.

3. The method for rapidly networking multiple devices with low power consumption based on Star Flash technology according to claim 1, characterized in that: In step S2, the gateway allocates an independent time window to each layer based on the hierarchical distribution reported by each device and the asynchronous time slot allocation mechanism of the Star Flash technology. The specific operation is as follows: S21. The gateway sorts all the layers according to the number of nodes to be networked reported by each device. If the number of nodes in any layer is lower than the preset merging threshold, the layer is merged with the adjacent layer into a joint layer to reduce idle time slots. S22. Allocate a minimum guaranteed time slot to each level, and distribute the remaining time slots according to the proportion of the number of nodes in each level; S23. Before the start of each time slot, the gateway sends a wake-up preparation message to the first k devices with the highest net utility value in the layer. Only these k devices enter the answering state first, and the rest of the devices continue to sleep until the time slot officially starts. S24. If a certain layer completes all network access confirmations within its time slot, the gateway immediately issues a time slot release and dynamically allocates the remaining time slot to the next layer for emergency re-shooting or accelerated network access; S25. The gateway counts the network access completion rate of each layer and compares it with the target completion rate. If a layer does not meet expectations, its guaranteed time slot or merging threshold is automatically increased in the next networking cycle until the network access rates of all layers converge to the target.

4. The method for rapidly networking multiple devices with low power consumption based on Star Flash technology according to claim 1, characterized in that: Before the parent-child relationship is formed between the devices within one hop after network access in step S4, it is necessary to determine the parent node, which is specifically implemented as follows: The child node sends a parent node request signal within the short query time slot of its own level. The sending time slot is randomly selected by the child node ID through a hash algorithm to avoid collective simultaneous transmission; All potential parent nodes send serviceable responses in the fixed waiting time slot after receiving the request in the ascending order of their respective device hash values. The response time slot length is the same; After waiting for responses, the child node temporarily adds the first, second, and third arriving response nodes to the candidate parent node pool to achieve fast local aggregation; Based on the rotation priority logic, the child node shakes hands with the candidate nodes in the local historical rotation order. The first node that successfully establishes a handshake is confirmed as the parent node.

5. The method for rapidly networking multiple devices with low power consumption based on Star Flash technology according to claim 1, characterized in that: In step S4, the child node uses the next cycle scheduling information dynamically broadcast by the parent node and the two-way delay calibration mechanism to accurately calculate the wake-up time of the next cycle, thereby aligning the networking time slot and reducing the power consumption of the idle listening. The specific implementation is as follows: S41. After completing the first network access, the child node initializes the error sequence and saves the time difference between the actual arrival time of the parent node's network frame and its own preset wake-up time in the last N cycles in a circular queue; S42. When the parent node sends a network access confirmation frame, it appends its frame transmission plan for the next cycle in the form of a time offset table to the frame payload. The table lists the sequence of scheduled frame transmission times relative to the end of the current cycle. S43: After receiving and parsing the frame plan, the child node immediately starts the two-way delay detection process and sends a detection request frame with a local sending timestamp to the parent node. , the parent node receives and returns the content And its own receiving timestamp , local reply timestamp response frame , one-way delay of child node , ; S44, the child node sends the frame according to the parsed plan time , measured one-way delay and the mean deviation of the error series , generate a benchmark wake-up point , ; Then, the compensation buffer time is set according to the current network load index and the remaining power to form a candidate time set; S45. Select the time corresponding to the minimum deviation in the error sequence from the candidate time set as the preliminary wake-up time, and segment the compensation buffer time into a main monitoring segment and an auxiliary monitoring segment to form a complete wake-up execution window; S46: The child node calculates a confidence interval based on the preliminary wake-up time and the standard deviation of the error series. If the standard deviation is less than or equal to the threshold, the preliminary wake-up time is directly used. If the standard deviation is greater than the threshold, the baseline wake-up point is corrected and used as the final wake-up time. S47. If the parent node frame is not captured in both the main monitoring segment and the auxiliary monitoring segment, the difference between the actual monitoring end time and the parent node frame sending time is recorded again in the error sequence, and when S42 to S46 are re-executed in the next cycle, the error is included in the average deviation of the error sequence. Calculation of , performing bias correction.

6. The method for rapidly networking multiple devices with low power consumption based on Star Flash technology according to claim 5, characterized in that: The error sequence management mechanism in step S41 is specifically implemented as follows: S411. The child node sets the dynamic length N of the error sequence and adjusts it in real time based on signal stability. When the error standard deviation is less than or equal to the set threshold for three consecutive periods, the length N changes to 1.25N to accumulate more historical data and improve the accuracy of trend prediction. When the error standard deviation is greater than the set threshold for three consecutive cycles, the length N changes to 0.75N to prevent old errors from interfering with the current calculation; S412, perform sliding window filtering on the error sequence to remove abnormal values. If a certain period error satisfy ,in If it is the error standard deviation, it is marked as an outlier, removed and replaced by the error value of the previous period; S413, after each networking cycle ends, the child node calculates the first-order difference of the error sequence. The first-order difference is that after each networking cycle ends, the child node extracts the current cycle error and the previous cycle error from the error sequence, and performs the difference to obtain the first-order difference. If the first-order difference is positive twice in a row, the reference wake-up point is reset in step S44. Make corrections.

7. The method for rapidly networking multiple devices with low power consumption based on Star Flash technology according to claim 1, characterized in that: In step S5, all networked devices adjust the relay duration in real time based on their level and subnet layers in each networking cycle, so that the relay timing converges with the load change and reduces redundant relays. The specific implementation is as follows: first, the device obtains its own level L and the maximum subnet level depth S, and calculates the double logarithmic slow-increasing terms, which are respectively , , based on the preset basic relay duration, the adjusted relay duration is calculated and updated ,in To preset the basic relay duration, is the adjusted relay duration.

Images