Networking method, networking system and electronic equipment

Abstract

The embodiment of the invention discloses a networking method and system and electronic equipment, and the method comprises the steps: obtaining the number of effective data frames according to a preset time window, determining a period for initiating an association request according to a preset rule and the number, and finally initiating the association request to a central coordinator according to the period. Therefore, the processing pressure of the central coordinator on the network access request is reduced, and the networking efficiency and the network coordination are improved.

Description

Technical Field

[0001] This invention relates to the field of power line carrier communication, and more particularly to a networking method, system, and electronic device. Background Technology

[0002] In the field of power line communication, a stable network architecture is required to achieve network communication among a large number of terminal devices. The Central Coordinator (CCO), as the core coordinator of the network, is responsible for key functions such as network control, network maintenance, and data management. Stations (STAs) are the terminal nodes accessing the network, such as various sensors and actuators. Each STA needs to establish an association with the CCO to access the network and achieve data transmission.

[0003] With the development of IoT technology, the number of STAs accessing the network has increased significantly, especially in the early stages of large-scale node networking. The CCO (Control Center Operator) needs to handle a large number of association requests from STAs. Due to the limited processing capacity of the CCO, situations may arise where processing is not timely due to the excessive number of requests. In existing technologies, STAs that have not yet joined the network periodically initiate association request messages until they receive an association confirmation message allowing them to join the network.

[0004] However, if there are too many STAs, it will cause the CCO's network status to become too congested, thus preventing it from responding to the STA's network access confirmation messages in a timely manner, and causing the STA to be unable to join the network. Summary of the Invention

[0005] In view of this, embodiments of the present invention provide a networking method, system, and electronic device that can reduce the processing pressure on the central coordinator for network access requests and improve networking efficiency and network coordination.

[0006] In a first aspect, embodiments of the present invention disclose a networking method applied to a site to be connected to a network, the method comprising:

[0007] The number of valid data frames to be acquired according to the predetermined time window;

[0008] The period for initiating association requests is determined according to the predetermined rules based on the number of valid data frames.

[0009] An association request is initiated to the central coordinator according to the stated cycle.

[0010] In some embodiments, the number of valid data frames acquired according to a predetermined time window specifically includes:

[0011] The number of valid data frames is obtained according to the time window on the carrier sense multiple access slot.

[0012] In some embodiments, the number of valid data frames acquired according to a predetermined time window specifically includes:

[0013] Obtain the number of valid data frames corresponding to multiple predefined time windows;

[0014] The average number of valid data frames corresponding to the multiple predetermined time windows is taken as the number of valid data frames.

[0015] In some embodiments, determining the period for initiating the association request according to the number of valid data frames based on predetermined rules includes:

[0016] The period for initiating association requests is determined based on the number of valid data frames using a predetermined functional relationship.

[0017] The predetermined function is a monotonically increasing function.

[0018] In some embodiments, determining the period for initiating the association request according to the number of valid data frames based on predetermined rules includes:

[0019] The range of the number of valid data frames is determined by a predetermined correspondence.

[0020] The period for initiating association requests is determined based on the aforementioned interval.

[0021] In some embodiments, determining the period for initiating the association request based on the interval specifically means:

[0022] Determine the range of the period for the associated requests corresponding to the interval;

[0023] The period of the association request is determined based on the range of the association request period and the network status itself.

[0024] In some embodiments, the method further includes:

[0025] In response to the number of valid data frames within a predetermined time window exceeding a first threshold, the transmission of the association request is stopped for a first predetermined time.

[0026] In some embodiments, the method further includes:

[0027] In response to the fact that the number of valid data frames within a predetermined time window is less than a second threshold, the association request is sent immediately.

[0028] Secondly, embodiments of the present invention disclose a networking system, the system comprising:

[0029] Central coordinator;

[0030] Multiple sites are configured to acquire a number of valid data frames according to a predetermined time window; determine the period for initiating association requests based on the number of valid data frames according to predetermined rules; and initiate association requests to the central coordinator according to the period.

[0031] Thirdly, embodiments of the present invention provide an electronic device, including a memory and a processor, wherein the memory is used to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement the method as described in the first aspect.

[0032] The technical solution of this invention obtains the number of valid data frames according to a predetermined time window, then determines the period for initiating association requests based on this number according to predetermined rules, and finally initiates association requests to the central coordinator according to this period. This reduces the processing pressure on the central coordinator for network access requests and improves network efficiency and coordination. Attached Figure Description

[0033] The above and other objects, features and advantages of the present invention will become clearer from the following description of embodiments of the invention with reference to the accompanying drawings, in which:

[0034] Figure 1 This is a schematic diagram of the networking system according to an embodiment of the present invention;

[0035] Figure 2 This is a flowchart of the networking method according to an embodiment of the present invention;

[0036] Figure 3 This is a flowchart illustrating the process of obtaining the number of valid data frames according to a predetermined time window, as per an embodiment of the present invention.

[0037] Figure 4 This is a schematic diagram of an electronic device according to an embodiment of the present invention. Detailed Implementation

[0038] The present application is described below based on embodiments, but it is not limited to these embodiments. In the detailed description of the present application below, certain specific details are described in detail. Those skilled in the art can fully understand the present application without these details. To avoid obscuring the substance of the present application, well-known methods, processes, flows, elements, and circuits are not described in detail.

[0039] Furthermore, those skilled in the art should understand that the accompanying drawings provided herein are for illustrative purposes only and are not necessarily drawn to scale.

[0040] Unless the context explicitly requires it, words such as "including" or "contains" throughout the application should be interpreted as including rather than exclusive or exhaustive; that is, meaning "including but not limited to".

[0041] In the description of this application, it should be understood that the terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance. Furthermore, in the description of this application, unless otherwise stated, "a plurality of" means two or more.

[0042] In the initial stages of network deployment, the CCO receives a large number of association request messages. These messages are core communication messages initiated by STAs to the CCO, requesting network access and establishing association relationships; they mark the starting point of the STA's network entry process. However, the CCO's processing capacity for association request messages is limited. Specifically, the CCO's ability to process association request messages per unit of time has an upper limit, stemming from several constraints: Hardware-wise, physical configurations such as processor performance and memory capacity limit the number of messages that can be parsed and responded to per second; software-wise, the computational efficiency of complex logic such as node authentication and resource allocation is limited, making it difficult to handle dense requests; and communication interface transmission rate bottlenecks can lead to message reception congestion. Furthermore, in the initial stages of network deployment, the CCO also needs to handle concurrent tasks such as network topology initialization and channel detection, further distributing resources. Therefore, in large-scale network scenarios, when a large number of STAs simultaneously send association request messages, it can lead to request backlog, processing delays, and even a vicious cycle, resulting in slow network entry or network collapse.

[0043] If there are a large number of primary nodes directly connected to the CCO, the CCO can alleviate processing pressure by using association summary messages. Specifically, when there are many primary nodes in the network, and a large number of association request messages are sent to the CCO, the CCO will not return an association confirmation message for each request individually. Instead, it will centrally process these scattered requests within a preset time window, and then integrate the association results from multiple nodes into a single message, which will be broadcast to the corresponding primary node. The association confirmation message is a one-to-one response message from the CCO to an association request message sent by a single STA. Specifically, when an STA sends an association request message to the CCO, the CCO will process the request individually, including verifying the node's identity, determining whether network access is allowed, allocating dedicated network resources, and then sending the processing result to that STA via an association confirmation message.

[0044] However, if there are too few primary nodes in the system, the CCO needs to reply to each association acknowledgment message for every node at other levels. When there are too many nodes, the CCO cannot reply to association request messages in a timely manner because the number of association acknowledgment messages it can send per unit of time is limited. Since STAs that have not yet joined the network will resend their association request messages after a predetermined period, if the CCO's reply time is too long, by the time the STA receives the association acknowledgment message, it has already resent the association request message and updated the end-to-end frame sequence number. Due to the mismatch in end-to-end frame sequence numbers, the STA will discard this association acknowledgment message and enter a vicious cycle, unable to join the network.

[0045] Since the number of frames a channel can accommodate per unit time is limited, it is difficult to alleviate this problem by increasing the number of frames on the channel. Therefore, a solution is needed that can reduce the processing pressure on the CCO for network access requests, improve network efficiency and network coordination, thereby improving the efficiency and stability of STA network access.

[0046] Figure 1 This is a schematic diagram of the networking system according to an embodiment of the present invention, such as... Figure 1 As shown, the network system includes a central coordinator (CCO) and multiple sites STA1, STA2, and STA3. These sites can connect directly to the CCO as primary nodes, or they can connect to the CCO through a proxy coordinator (PCO). Figure 1 As shown, STA1 is directly connected to CCO; STA2 is a secondary node that connects to PCO2, and PCO2 is connected to CCO; STA3 is a tertiary node that connects to PCO3, and PCO3 connects to PCO2, and PCO2 is connected to CCO.

[0047] As the core control node in a network architecture such as power line carrier communication, the Control Node (CCO) is responsible for the overall management of the network from establishment to operation and maintenance. During network initialization, the CCO provides a unified clock reference to all STAs (Stations) through periodic broadcast signals, ensuring consistent communication timing across nodes and laying the foundation for orderly network operation. In the node access management phase, it receives association request messages from nodes seeking access, verifies their identities, and decides whether to allow access based on the verification results. It also allocates dedicated network resources, such as a unique network address and specific communication time slots, to verified nodes. Regarding communication order maintenance, the CCO effectively avoids data transmission conflicts between different nodes through reasonable time slot allocation, ensuring smooth information exchange. It can also monitor the connection status and communication quality of all network nodes in real time. When problems such as node offline or signal attenuation occur, it can promptly trigger reconnection mechanisms or adjust routing paths to ensure data transmission stability.

[0048] STAs are used to access the network and participate in communication. During the network setup phase, STAs actively search for signals emitted by the CCO or PCO, and apply for network access by sending association request messages. After obtaining network addresses, communication time slots, and other resources allocated by the CCO, the STA joins the network. During network operation, STAs collect and upload various types of data from themselves and their surroundings, and also receive control commands from the CCO or other nodes. They adhere to the clock synchronization mechanism and communication rules established by the CCO to ensure orderly data transmission.

[0049] Based on network hierarchy and functional differences, STAs can be divided into primary nodes and secondary and higher-level nodes. Primary nodes can assume the responsibilities of PCO (Programmable Controller), assisting secondary and higher-level nodes at greater distances to access the network and extend network coverage. As the most numerous basic unit in the network, the access efficiency, data processing capabilities, and communication stability of STAs directly affect the data acquisition accuracy and command execution performance of the entire network.

[0050] In the networking process of this invention embodiment, instead of sending association requests according to a predetermined cycle as in the prior art, the workload of the CCO is first determined by obtaining the number of valid data frames. Then, the cycle for initiating association requests is determined according to predetermined rules, and association requests are initiated according to the cycle. Specifically, when the number of valid data frames is large, the cycle for initiating association requests is increased to alleviate the pressure on the CCO; when the number of valid data frames is small, the cycle for initiating association requests is decreased to enable STAs to join the network as soon as possible. This improves networking efficiency, reduces the processing pressure on the CCO, and enhances the stability of the networking system.

[0051] This invention, in its embodiments, acquires the number of valid data frames within a predetermined time window, then determines the period for initiating association requests based on this number according to predetermined rules, and finally initiates association requests to the central coordinator according to this period. This reduces the processing pressure on the central coordinator for network access requests, improving networking efficiency and network coordination.

[0052] Figure 2 This is a flowchart of the networking method according to an embodiment of the present invention, such as... Figure 2 As shown, the networking method includes:

[0053] Step S100: Obtain the number of valid data frames according to the predetermined time window.

[0054] The predetermined time window represents a pre-defined time period during which the number of valid data frames is determined for the STA to join the network. Specifically, the number of valid data frames is determined by the number of SOF frames. SOF frames are specific sequences or signals used in a communication system to mark the beginning of a complete valid data frame; their format and characteristics are predefined by the communication protocol, such as specific bit combinations and pulse patterns. In this embodiment, the number of valid data frames determines the network congestion level of the CCO, thus providing a basis for adjusting the period of initiating association requests. Valid frames include frames related to the STA's network entry that represent the network entry status, such as association request frames, association confirmation frames, and association summary frames, as well as other types of frames, such as probe request frames and permission to send frames. Specifically, the CCO periodically sends a central beacon frame at the beginning of a superframe to clarify the network's time slot allocation and synchronization information. After receiving this beacon frame, the STA initiates an association request frame during the contention access period after the beacon ends. Specifically, the STA first listens for the channel. If it is idle, it waits for the distributed inter-frame interval before sending. If it is busy, it triggers the binary exponential backoff algorithm and retryes when the channel becomes idle. The frame carries its own device identifier, capability parameters, and other information, and the transmission must be completed within the contention access period. The association confirmation frame is sent by the CCO after receiving the association request. When the number of requests is small, the CCO replies immediately via unicast within the contention access period. If the contention access time is insufficient, the confirmation information may be embedded in the beacon frame of the next cycle. The association summary frame is the CCO's batch response to a large number of simultaneous requests from STAs. It is also sent during the contention access period. The CCO integrates multiple association confirmation messages into a single frame and uses a unified message to provide feedback on the network access permission and resource allocation status of a batch of nodes.

[0055] To better identify frames related to STA network entry, in addition to counting all valid data frames, the number of association request frames, association confirmation frames, and association summary frames within valid data frames can be obtained according to a predetermined time window. This provides a more accurate count of frames related to STA network entry. Specifically, valid data frames may include some frames unrelated to the STA's network entry request. These frames can interfere with the CCO's assessment of network congestion. Therefore, only the number of association request frames, association confirmation frames, and association summary frames—frames related to the association request—can be counted, thereby improving the accuracy of the CCO's assessment of network congestion. The association request frame is the frame included in the association request sent by the STA to the CCO. The CCO's response to the association request is divided into association confirmation frames and association summary frames. The association confirmation frame is a one-to-one response; that is, after successful verification by the CCO, this frame is generated separately for each STA, clearly informing them of the network entry result and attaching allocated resource information to ensure that the node clearly understands its own network entry status. The association summary frame is a batch processing tool used by the CCO to handle large-scale node onboarding. Specifically, when multiple STAs send association requests simultaneously, the CCO integrates multiple verification results into a single frame and provides feedback on the network access permission and resource allocation of the batch of nodes through a unified summary message. By only counting the number of association request frames, association confirmation frames, and association summary frames—frames related to association requests—in valid data frames, the accuracy of the CCO's network congestion assessment is improved.

[0056] In some embodiments, the number of valid data frames acquired according to a predetermined time window specifically refers to the number of valid data frames acquired according to a time window on a Carrier Sense Multiple Access (CSMA) slot. That is, the predetermined time window specifically refers to a time window on a Carrier Sense Multiple Access slot. A Carrier Sense Multiple Access slot is a specific time segment in which an unconnected node uses the channel through contention before accessing the network, and it is a key component of the shared channel access mechanism. In a network composed of a CCO and STAs, nodes already connected to the network typically have dedicated time slots allocated by the CCO for data transmission, while unconnected nodes, having not yet obtained dedicated resources, need to initiate communication attempts within the CSMA slots.

[0057] In some embodiments, multiple time windows can be set, and the number of valid data frames within each time window can be counted separately, and then the average number of valid data frames can be calculated. Figure 3 This is a flowchart illustrating the process of obtaining the number of valid data frames according to a predetermined time window, as described in this embodiment of the invention. Figure 3 As shown, it includes the following steps:

[0058] Step S110: Obtain the number of valid data frames corresponding to multiple predetermined time windows.

[0059] Specifically, multiple predetermined time windows are set, and the number of valid data frames within each time window is obtained. For example, three time windows are set, each with a duration of 500ms, and the number of valid data frames in the three time windows are 5, 8, and 11, respectively.

[0060] Step S120: The average number of valid data frames corresponding to the multiple predetermined time windows is taken as the number of valid data frames.

[0061] After obtaining the number of valid data frames corresponding to multiple predetermined time windows, the average number of valid data frames corresponding to multiple predetermined time windows is calculated, and this average is taken as the number of valid data frames. Taking the above example, the average number of valid data frames corresponding to the three predetermined time windows is 8. In this case, 8 is taken as the number of valid data frames. By averaging the number of valid data frames corresponding to each predetermined time window, the number of valid data frames is made more accurate, thereby improving the accuracy of the association request period setting.

[0062] Step S200: Determine the period for initiating association requests according to the number of valid data frames based on predetermined rules.

[0063] After obtaining the number of valid data frames, the period for initiating association requests needs to be adjusted based on this number. Specifically, the association request period refers to the period during which the STA sends association request messages to the CCO. The number of valid data frames represents the degree of network congestion at the CCO. More valid data frames indicate greater network pressure on the CCO, requiring an increase in the association request initiation period to reduce this pressure. Conversely, fewer valid data frames indicate less network pressure on the CCO, requiring a decrease in the initiation period to allow the STA to join the network as quickly as possible.

[0064] In some embodiments, determining the period for initiating the association request based on the number of valid data frames according to a predetermined rule includes: determining the period for initiating the association request based on the number of valid data frames using a predetermined functional relationship. That is, the period for initiating the association request can be determined by pre-setting a functional relationship between the number of valid data frames and the period for the association request. Specifically, the function is a monotonically increasing function, meaning that the period for initiating the association request increases as the number of valid data frames increases.

[0065] For example, if the number of valid data frames is x and the period of the associated request is y, then the function can be:

[0066] y = ax + b

[0067] Where a and b are both pre-defined constants, and the value of a is greater than 0.

[0068] By setting a predetermined function relationship to determine the cycle of association requests, the system can accurately adapt the association request cycle to the number of each detected valid data frame, which facilitates the management and planning of STA.

[0069] In some embodiments, determining the period for initiating an association request according to the number of valid data frames in accordance with predetermined rules includes: determining the interval in which the number of valid data frames falls through a predetermined correspondence; and determining the period for initiating an association request based on the interval.

[0070] Specifically, the predetermined correspondence is formed by pre-setting several intervals covering all non-negative integers. For example, all non-negative integers can be divided into: interval 1: 0-5, interval 2: 6-10, interval 3: 11-15, and interval 4: greater than or equal to 16. The predetermined correspondence determines which interval the number of valid data frames falls into. For example, if the number of valid data frames is 13, then the valid data frames fall into interval 3. After determining the intervals in which the number of valid data frames falls, the period of the association request is determined according to the correspondence between the intervals and the period of the association request. For example, the period corresponding to interval 1 is 4s, interval 2 is 8s, interval 3 is 12s, and interval 4 is 16s. Therefore, the period corresponding to the number of valid data frames of 13 is 12s.

[0071] In some embodiments, besides directly using the interval corresponding to the association request period, a range of association request periods can be determined based on the interval, and the association request period can be determined within that range. That is, determining the association request period based on the interval specifically involves: determining the range of association request periods corresponding to the interval; and determining the association request period based on the range of the association request period and the STA's own network status. Here, the interval does not correspond to a specific period value, but rather to a range of association request periods. For example, the range of association request periods corresponding to interval 2 is 4-8 seconds. After obtaining the range of association request periods, the association request period is determined based on the range and the STA's own network status. Specifically, the better the STA's network status, the smaller the association request period should be set. For example, if the STA's network status is good, the association request period can be set to 4.3 seconds; if the STA's network status is poor, the association request period can be set to 7.5 seconds.

[0072] By determining the association request period through step S200, the STA initiates association requests according to the association request period, which can reduce the network pressure on the CCO.

[0073] Step S300: Initiate an association request to the central coordinator according to the cycle.

[0074] After determining the period for initiating association requests, the STA initiates an association request to the CCO according to the determined period. That is, after determining the period, the time for initiating the current association request is determined by adding the time of the previous association request to the association request period. For example, if the time of the previous association request was 17:14:23 and the association request period was 12 seconds, then the time for initiating the current association request is determined to be 17:14:35.

[0075] It should be understood that the networking method of the present invention can be executed on each cycle of the STA, or once every predetermined number of cycles, or when the site has not joined the network within a predetermined time. The present invention does not impose any restrictions on this.

[0076] In some embodiments, the method further includes: stopping the transmission of association requests for a first predetermined time period in response to the number of valid data frames within a predetermined time window exceeding a first threshold. Specifically, after obtaining the number of valid data frames, if the number is too large, it indicates that the CCO's network is overly congested. In this case, the transmission of association requests can be stopped for a period of time to avoid CCO network overload. Specifically, by setting a first threshold, when the number of valid data frames exceeds the first threshold, it is determined that the CCO's network is overly congested, and the transmission of association requests is stopped for a first predetermined time. After the first predetermined time of stopping the transmission of association requests, step S100 is re-executed to obtain the number of valid data frames again, thereby determining the operation to be performed based on the number of valid data frames. It should be understood that after determining that the CCO's network is overly congested, in addition to stopping the transmission of association requests for a first predetermined time, alarm information can also be sent to the terminal device of the maintenance personnel to remind them to handle the situation.

[0077] In some embodiments, the method further includes: immediately sending the association request in response to the number of valid data frames within a predetermined time window being less than a second threshold. Wherein, after obtaining the number of valid data frames, if the number of valid data frames is too small, it indicates that the CCO's network status is relatively idle. In this case, an association request can be sent to the CCO immediately, thereby ensuring full utilization of the CCO's network resources. Specifically, by setting a second threshold, when the number of valid data frames is less than the second threshold, it is determined that the CCO's network status is relatively idle. At this time, an association request is immediately sent to the CCO, thereby accelerating the network access process and improving the CCO's network resource utilization.

[0078] This invention, in its embodiments, acquires the number of valid data frames within a predetermined time window, then determines the period for initiating association requests based on this number according to predetermined rules, and finally initiates association requests to the central coordinator according to this period. This reduces the processing pressure on the central coordinator for network access requests, improving networking efficiency and network coordination.

[0079] Figure 4 This is a schematic diagram of an electronic device according to an embodiment of the present invention. (For example...) Figure 4 As shown, Figure 4 The illustrated electronic device is a general address lookup device, comprising a general computer hardware architecture, including at least a processor 41 and a memory 42. The processor 41 and memory 42 are connected via a bus 43. The memory 42 is adapted to store instructions or programs executable by the processor 41. The processor 41 can be a standalone microprocessor or a collection of one or more microprocessors. Thus, the processor 41 executes the instructions stored in the memory 42, thereby performing the method flow of the embodiments of the present invention as described above to process data and control other devices. The bus 43 connects the aforementioned components together, and also connects these components to a display controller 44, a display device, and an input / output (I / O) device 45. The input / output (I / O) device 45 can be a mouse, keyboard, modem, network interface, touch input device, motion-sensing input device, printer, and other devices known in the art. Typically, the input / output device 45 is connected to the system via an input / output (I / O) controller 46.

[0080] Those skilled in the art will understand that embodiments of this application can be provided as methods, apparatus (devices), or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-readable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0081] This application is described with reference to flowchart illustrations of methods, apparatus (devices), and computer program products according to embodiments of this application. It should be understood that each step in the flowchart can be implemented by computer program instructions.

[0082] These computer program instructions may be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including an instruction means, the implementation process of which is described in the instruction means. Figure 1 The function specified in one or more processes.

[0083] These computer program instructions may also be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing device, produce instructions for implementing processes. Figure 1 A device for a function specified in one or more processes.

[0084] Another embodiment of the present invention relates to a non-volatile storage medium for storing a computer-readable program for use by a computer to execute some or all of the above-described method embodiments.

[0085] That is, those skilled in the art will understand that all or part of the steps in the methods of the above embodiments can be implemented by a program specifying the relevant hardware. This program is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as a USB flash drive, a portable hard drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0086] The above description is merely a preferred embodiment of this application and is not intended to limit this application. Various modifications and variations can be made to this application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of this application should be included within the protection scope of this application.

Claims

1. A networking method applied to sites to be connected to a network, characterized in that, The method includes: The number of valid data frames to be acquired according to the predetermined time window; The period for initiating association requests is determined according to the predetermined rules based on the number of valid data frames. An association request is initiated to the central coordinator according to the stated cycle.

2. The method according to claim 1, characterized in that, The number of valid data frames acquired according to the predetermined time window is specifically as follows: The number of valid data frames is obtained according to the time window on the carrier sense multiple access slot.

3. The method according to claim 1, characterized in that, The number of valid data frames acquired according to the predetermined time window is specifically as follows: Obtain the number of valid data frames corresponding to multiple predefined time windows; The average number of valid data frames corresponding to the multiple predetermined time windows is taken as the number of valid data frames.

4. The method according to claim 1, characterized in that, The step of determining the period for initiating the association request according to the predetermined rules based on the number of valid data frames includes: The period for initiating association requests is determined based on the number of valid data frames using a predetermined functional relationship. The predetermined function is a monotonically increasing function.

5. The method according to claim 1, characterized in that, The step of determining the period for initiating the association request according to the predetermined rules based on the number of valid data frames includes: The range of the number of valid data frames is determined by a predetermined correspondence. The period for initiating association requests is determined based on the aforementioned interval.

6. The method according to claim 5, characterized in that, The specific steps for determining the period for initiating the association request based on the interval are as follows: Determine the range of the period for the associated requests corresponding to the interval; The period of the association request is determined based on the range of the association request period and the network status itself.

7. The method according to claim 1, characterized in that, The method further includes: In response to the number of valid data frames within a predetermined time window exceeding a first threshold, the transmission of the association request is stopped for a first predetermined time.

8. The method according to claim 1, characterized in that, The method further includes: In response to the fact that the number of valid data frames within a predetermined time window is less than a second threshold, the association request is sent immediately.

9. A networking system, characterized in that, The system includes: Central coordinator; Multiple sites are configured to acquire a number of valid data frames according to a predetermined time window; determine the period for initiating association requests based on the number of valid data frames according to predetermined rules; and initiate association requests to the central coordinator according to the period.

10. An electronic device comprising a memory and a processor, characterized in that, The memory is used to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement the method as described in any one of claims 1-8.

Images