Link information storage method in networking communication

Abstract

The invention discloses a link information storage method in networking communication, which overcomes the problems of large storage space required by link information storage and low retrieval efficiency in the prior art, and comprises the following steps of: constructing a data structure, organizing, associating and mapping link data, and recording a link information storage position by using an index table. When a link is organized, a main node authenticates a node and then allocates a storage index address to the node, the storage index address is stored in a node equipment information table of a data structure, and the storage index address serves as an in-network address of the node and is written into a node path information table of the data structure; and other nodes in the network use the in-network address of the node as a storage index to store the MAC address in the node equipment information table, and write superior and subordinate data of the node into the node path information table, and the node creates a neighbor information list at the same time. The storage space requirement of link storage can be reduced, a network is organized through a data indexing method, and the link retrieval speed is increased.

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technology, and in particular to a link information storage method in networking communication. Background Art

[0002] Mesh Networking (Mesh) is a wireless network topology that aims to improve network coverage and stability. Multiple nodes are connected to form a mesh structure, so that each node can communicate with multiple other nodes. Even if a node fails, the network can still maintain connection through other nodes, providing higher redundancy and reliability.

[0003] Each node is not only a signal receiving or sending point, it can also act as a router to transmit data through other nodes. This distributed structure makes the network highly elastic and scalable. The link structure of Mesh networking forms a multi-path, multi-hop network topology through the interconnection of multiple nodes, making the network highly reliable and flexible.

[0004] In a full mesh structure, each node is directly connected to all other nodes in the network. The advantages of this structure are extremely high redundancy and stability, but it takes up a lot of storage space. As the number of nodes increases, the demand for storage will also increase. Recording path information in a Mesh network requires a lot of storage space and has low retrieval efficiency. Summary of the invention

[0005] The purpose of the present invention is to solve the problem in the prior art that link information storage requires a large storage space and has low retrieval efficiency, and to provide a link information storage method in network communication, which can reduce the storage space requirement for link storage, organize the network through a data indexing method, and improve the link retrieval speed.

[0006] In order to achieve the above object, the present invention adopts the following technical solutions: A method for storing link information in network communication, characterized in that it comprises the following steps: Construct a data structure to store link information, organize, associate and map link data, and use an index table to record the storage location of link information; When organizing links, the master node assigns a storage index address to the node after authenticating the node and stores it in the node device information table of the data structure, and writes the storage index address as the network address of the node into the node path information table of the data structure; Other nodes in the network use the node's network address as a storage index to store the MAC address in the node device information table, and write the node's upper and lower level data into the node path information table. The node also creates a neighbor information list.

[0007] According to the application scenario, a device is generally identified as the main node, which serves as the input terminal for external information commands and network authentication and organization. By building a data structure, the link information of the entire network is stored and managed. The link data is organized, associated and mapped using the data structure to achieve efficient storage and fast query of link data, reducing the incremental requirements for storage demand after the network capacity increases, reducing hardware costs, making the network scale controllable and easy to deploy. At the same time, an index table is designed in the established data structure to record the storage location of link information and improve the retrieval speed of link information.

[0008] Preferably, the data structure includes a node device information list storing the MAC address of each node, a node path information table storing the communication path information of each node and using the address index stored in the node as the node's network address (NID) index, and a node neighbor information table storing the node's neighbor node information, wherein the neighbor node information includes the network address of nearby nodes and the calculated link quality score.

[0009] After the device is powered on, the network is established. The free node initiates the link establishment process to the surrounding nodes. The master node completes the authentication and assigns the network address (NID) to the slave node. After the node obtains the network address, it notifies the corresponding relationship between the hardware address and the network address to other nodes in the network through message diffusion. After the node and the device in the network receive the address allocation frame, the corresponding relationship is stored in the data storage device according to the data format of the present invention.

[0010] Preferably, the node initiates a network access request, carries the MAC address and authentication information of the node, obtains the network address after network access, and synchronizes the node message to other nodes to create a node path information table.

[0011] The node triggers the network access request S1 through external command input or active power-on initiation, and sends the network access request frame through the RF chip, carrying the MAC address and authentication information of the node. The purpose of initiating a network access request is to join an existing network and obtain an address within the network from the network control end for identity identification during communication. In addition, the node's message will be synchronized to other node ends to create a node path (communication link) information table.

[0012] Preferably, after the network access request is initiated: if the free node accessing the network can communicate directly with the master node with authentication capability, the node accesses the network successfully; if it communicates with the master node through other nodes, the node initiates a proxy network access request, forwards the network access request through other nodes, and repeats the above steps according to the set number of repeated network accesses until the node accesses the network successfully.

[0013] In the second case, the node needs to initiate a proxy network access request and forward the network access request through other nodes. Because the node has not yet joined the network, for security reasons, and because of the design, its message cannot be forwarded and transmitted by other nodes in the network, so it needs to be proxied through other nodes.

[0014] Preferably, the node neighbor information table obtains neighbor information, including: The node actively requests neighbor information. After receiving the handshake response from the neighboring node, the node calculates whether the communication quality is met based on the response information and the collected RF information. If the conditions are met, the device is added to the node neighbor information table and sorted according to the link quality score. When idle, a node listens to valid communication data on the channel, obtains link information, and decides whether to update the data in the neighbor list based on link quality evaluation.

[0015] Preferably, when the node processes and uses link information: the node controls the link through the communication address defined in the data frame, uses the recipient address to filter whether the data is processed, and selects the communication link address as the recipient address when sending data according to the communication target.

[0016] The communication address includes the communication target address, the communication receiving address, and the communication sending address.

[0017] Preferably, during the networking communication process, the index in the data structure is updated in real time: if the node communication target is the main node, the highest priority path address is obtained from the node neighbor information table as the communication target; if the node cannot communicate directly with the main node, a multi-level path method is used for communication, and the index in the node path information table is updated in real time.

[0018] Preferably, the node neighbor information table is a two-dimensional structure, the first dimension is the network address and link quality information of the neighbor node, and the second dimension is different neighbor nodes; the storage structure in the node neighbor information table represents the priority of the node, and the node with a high priority is preferred during communication.

[0019] Preferably, the device information list is stored in FLASH, each node occupies 8 bytes of storage space, all nodes are written in sequence, and the address index stored in the node is used as the node's network address index.

[0020] Preferably, the index of the node path information table and the index of the node device information table are in a corresponding relationship.

[0021] Represents the information of the same device, and the path information is stored in memory.

[0022] Therefore, the present invention has the following beneficial effects: By building a data structure to store and manage the link information of the entire network, the data structure is used to organize, associate and map the link data to achieve efficient storage and fast query of the link data, reducing the incremental requirements for storage requirements after the network capacity increases, reducing hardware costs, making the network scale controllable and easy to deploy. At the same time, an index table is designed in the established data structure to record the storage location of the link information and improve the retrieval speed of the link information. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] Figure 1 The present invention is a flowchart of the steps of the link information storage method in the networking communication.

[0024] Figure 2 It is a schematic diagram of the node network access process in the present invention.

[0025] Figure 3 This is a flow chart of the steps for a node to access the network in the present invention.

[0026] Figure 4 It is a flowchart of the steps of link information processing in the present invention.

[0027] Figure 5 It is a schematic diagram of the communication network in the present invention. DETAILED DESCRIPTION

[0028] The present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments: Embodiment 1: This embodiment provides a link information storage method in networking communication, such as Figure 1 As shown, the operation process is as follows: construct a data structure to store link information, organize, associate and map link data, and use an index table to record the storage location of link information; when organizing the link, the master node assigns a storage index address to the node after authenticating the node and stores it in the node device information table of the data structure, and writes the storage index address as the network address of the node into the node path information table of the data structure; other nodes in the network use the network address of the node as the storage index to store the MAC address in the node device information table, and write the upper and lower level data of the node into the node path information table, and the node creates a neighbor information list at the same time.

[0029] By building a data structure to store and manage the link information of the entire network, the data structure is used to organize, associate and map the link data to achieve efficient storage and fast query of the link data, reducing the incremental requirements for storage requirements after the network capacity increases, reducing hardware costs, making the network scale controllable and easy to deploy. At the same time, an index table is designed in the established data structure to record the storage location of the link information and improve the retrieval speed of the link information.

[0030] The technical scheme and technical effects of the present invention will be further described below through specific examples. The following examples are explanations of the present invention and the present invention is not limited to the following examples.

[0031] In the prior art, link storage in networking communications mainly includes storage using path cache technology and storage using a link state database.

[0032] For path cache technology: the contents of the path cache include source nodes and destination nodes (Source and Destination Nodes), relay node list (Relay Nodes List) and path lifetime (PathLifetime), where the source node and destination node are the starting point and end point of the path respectively, the relay node list is the relay nodes passed in the transmission path, and the path lifetime is the effective time of the path. After the time expires, the path will be deleted.

[0033] The cache mechanism of path cache technology is: when a node finds a path to a target node, it temporarily saves the path information to speed up subsequent route search and data transmission. When the path in the cache expires or becomes invalid, the node will re-initiate the path discovery process.

[0034] But the disadvantages of path caching technology are: (1) The cached path is temporary. When the path storage pool overflows, part of the path will become invalid and need to be re-established the next time the path is needed. (2) The complete path information needs to be recorded, which takes up more memory space.

[0035] For the link state database: the contents stored in the link state database include link ID, source node and destination node, link cost and link state. Among them, link ID is the unique identifier of each link, source node and destination node are the starting point and end point of the link respectively, link cost is the transmission cost information of the link, and link state is the current state of the link, such as availability, signal quality, etc.

[0036] The data structure of the link state database is as follows: The link state database records the status information of all nodes and their links in the network. Each node broadcasts its link state information regularly, and other nodes update their link state databases after receiving this information.

[0037] The disadvantage of the link state database is that it needs to record a large amount of link information and the data structure is bloated.

[0038] Therefore, this embodiment provides a link information storage method in networking communication, which is used to solve the following technical problems: (1) reducing the storage space requirement of link storage so that network capacity and storage space consumption can be controlled.

[0039] (2) Organize the network through data indexing methods to improve link retrieval speed.

[0040] A method for storing link information in network communication, specifically comprising the following steps: Step 1: Build the data structure.

[0041] This embodiment designs a data structure for storing and managing the entire network. Specifically, the data structure includes three data tables, namely: Node device information list, used to record network nodes; A node path information table, used to store the communication path information of each node; Node neighbor information is used to store the neighbor information of this node.

[0042] Further explanation of the data table: (1) Node device information list.

[0043] The node device information list is stored in FLASH (flash memory), which stores the MAC address of each node, and uses the address index stored in the node as the node's network internal address (NID) index, which does not occupy storage space.

[0044] (2) Node path information table.

[0045] The node path information table is used to store the communication path (link) information of each node. The index of the node path information table and the index of the node device information list are in a corresponding relationship, representing the information of the same device. The path information (node ​​path information table) is stored in the memory.

[0046] (3) Node neighbor information table.

[0047] The node neighbor information table is used to store the neighbor information of the node, including the network address of the nearby nodes and the calculated link quality scores, which are stored in the node neighbor information table from high to low in terms of scores.

[0048] Step 2: Overview of data table usage for link organization and information storage.

[0049] The link organization process combines the physical line and the communication protocol to form a data link to ensure reliable data transmission. Specifically, it includes: the establishment of the physical line, the addition of the communication protocol, the formation of the data link, and the encapsulation and transmission of the frame.

[0050] According to the application scenario, a device is generally identified as a master node, which serves as the external information command input terminal and network authentication and organization.

[0051] (1) When the master node receives the information of a node, after authentication, the master node assigns a storage index address to the node and stores it in the node device information list. The storage index address is then used as the node's network address for communication and link address index. At the same time, the link information is written into the node path information table.

[0052] (2) After receiving the link information frame, other nodes in the network use the node's network address as a storage index to write the MAC address into the node device information list. At the same time, according to the link information, the node's upper and lower level data are stored in the node path information table for subsequent data communication.

[0053] (3) The node will also create a node neighbor information table to initiate communication with the master node.

[0054] There are two ways to obtain neighbor information: 1) Actively request neighbor information.

[0055] When a node needs to actively update the node neighbor information table, it will initiate a node neighbor information table request. After receiving the request, the neighboring node will reply with a handshake message. After receiving the handshake response, the node calculates whether it meets the available communication quality based on the response information and the collected RF information. If the conditions are met, the device will be added to the node neighbor information table and sorted according to the quality score.

[0056] 2) When a node is idle, it will monitor valid communication data on the channel, obtain link information, and decide whether to update the data in the node neighbor information table based on link quality evaluation.

[0057] The node neighbor information table is a two-dimensional data structure. The first dimension is the network address and link quality information of the neighbor node, and the second dimension is different neighbor nodes. The storage structure in the data table represents the priority of the neighbor node, and the one with a higher priority is preferred during communication.

[0058] Step 3: Overview of data table usage during link initialization and information storage.

[0059] This includes the single-node link creation process: The node triggers the network access request S1 through external command input or active power-on initiation, and sends a network access request frame, which carries the MAC address and authentication information of the node. The purpose of initiating a network access request is to join an existing network and obtain an address within the network from the network control end for identity identification during communication. In addition, the node's message will be synchronized to other nodes to create a node path information table (node ​​communication link information table).

[0060] like Figure 2 As shown in the figure, there are two situations when a node joins the network: (1) In the first case, a free node that has joined the network can communicate directly with a master node that has authentication capabilities.

[0061] The master node with authentication capability sends network information S11 through authentication, and the free node successfully joins the network. In conventional applications, a node is used as the master node, that is, as a unified input terminal for external information, which can connect to other remote or local user terminals. In networking, it is necessary to confirm whether the node belongs to the device of the current network, or select the node to join the current network through screening. The master node can collect node information and output it to the remote or local user terminal, and after confirmation by the user, the node is transmitted back to the master node. The master node adds the device to the device whitelist, or inputs the device whitelist to the master node in advance for master node authentication.

[0062] (2) In the second case, the master node communicates with other nodes.

[0063] The second situation is that the surrounding nodes reply as neighbor nodes. When the node is located in a position where it cannot communicate with the main node with authentication capabilities, but there are nodes that have joined the network in the surrounding area, the nodes that have joined the network will execute the neighbor node response S2 after receiving the network access request frame. After receiving the response from the neighbor node, the network access request node will select a node as a proxy node according to the preferred path and send a proxy network access request S3. If the proxy node accepts this message, it will forward and send the proxy network access request message S4. After receiving it, the main node completes the authentication and sends the network access response S5. After the proxy node processes S5, it sends S6 to the free node. After receiving it, the free node successfully joins the network.

[0064] In the first case, the node directly accesses the network successfully; in the second case, the node needs to initiate a proxy access request and forward the access request through other nodes, because the node has not yet accessed the network for security reasons. At the same time, because of the design, its message cannot be forwarded and transmitted by other nodes in the network, so it needs to be proxied through other nodes.

[0065] Furthermore, the node processes the network access process as follows Figure 3 As shown: Step (1): First, the node initiates a network access request. If it can directly access the network, it means that the network access is successful and the network access process ends; if it cannot directly access the network, it means that the network access fails, and then execute step (2).

[0066] Step (2): Determine whether the current node has received a response from a neighboring node. If so, execute step (3). If not, execute step (4).

[0067] Step (3): The neighbor node initiates proxy network access. If the proxy network access is successful, the network access process ends. If the proxy network access fails, step (4) is executed.

[0068] Step (4): Repeat the network access and wait for a random delay. After the waiting time is reached, return to step (1).

[0069] After the node initiates a network access request, if it can directly access the network, the process is completed. If it cannot complete the network access and receives a response from the neighboring node, it will access the network through the neighboring node. Repeat the above process according to the set number of repeated network access until the network access is successful or exit.

[0070] Step 4: The node processes and uses the link data stored in the data table.

[0071] The process of node processing and using link data includes: controlling the link through the communication target address, communication receiving address, and communication sending address defined in the data frame. Using the receiving address to filter whether the data is processed, and selecting the communication link address as the receiving address when sending data according to the communication target.

[0072] Furthermore, the node access process is as follows: Figure 4 As shown: Step (1): Determine whether the communication receiver is this device. If not, the link information processing process ends. If so, execute step (2).

[0073] Step (2): Determine whether the communication target is the master node. If so, execute step (5); if not, execute step (3).

[0074] Step (3): Determine whether the communication target is another node. If so, execute step (6). If not, execute step (4).

[0075] Step (4): Determine whether the communication target is this node. If not, the link information processing process ends. If so, process the link data and then end this link information processing process.

[0076] Step (5): Obtain the network address in the first index of the node neighbor information table as the next hop communication target, and execute step (7).

[0077] Step (6): Obtain the corresponding next-hop communication target in the path information list according to the target address, and execute step (7).

[0078] Step (7): Send link data and end the link information processing process.

[0079] The link information storage method in the networking communication provided by this embodiment provides a networking link information data structure and a link organization method, which can achieve the following beneficial effects: 1. Reduce the incremental storage requirements after the network capacity increases, reducing hardware costs.

[0080] 2. Make the network scale controllable and easy to deploy.

[0081] 3. Reduce retrieval time and link re-acquisition to reduce node power consumption and save energy.

[0082] Embodiment 2: This embodiment provides a link storage device in network communication, which is used to implement the link storage method in network communication in Embodiment 1, and can reduce the space requirement for link storage in the network so that network capacity and storage space consumption are controllable.

[0083] A link storage device in networking communication comprises a main control unit and a radio frequency unit. The main control unit comprises an MCU, and the radio frequency unit comprises a radio frequency chip. The radio frequency unit serves as a communication part.

[0084] Specific: The RF modulation technology can be FSK, LoRa, etc. to form a communication node, and multiple nodes form a communication network. According to specific coding rules, a unique hardware address (MAC) is assigned to each device for node identification in the network.

[0085] According to the application scenario, a device is generally identified as a master node, which serves as an external information command input terminal and network authentication and organization. After the device is powered on, the network is established. The free node initiates the link establishment process to the surrounding. The master node completes the authentication and assigns the network address (NID) to the slave node. After the node obtains the network address, it notifies the corresponding relationship between the hardware address and the network address to other nodes in the network through message diffusion. After the node and the device in the network receive the address allocation frame, the corresponding relationship is stored in the data storage device according to the data format provided in the first embodiment.

[0086] Specific: The data storage device stores a data structure, which is used to store and manage the entire network. The complete data structure contains three data tables, which are the node device information list, node path information table, and node neighbor information for recording network nodes. Through the organization, association and mapping of link data, efficient storage and fast query of link data are achieved.

[0087] Among them, the node device information list is stored in FLASH, each node occupies 8 bytes of storage space, and all nodes are written in sequence; the node path information table is stored in the memory.

[0088] When creating a single-node link, the node triggers the network access request S1 through external command input or active power-on initiation, and sends a network access request frame through the RF chip, carrying the MAC address and authentication information of the node.

[0089] In the link storage process of the entire networking communication, the main control unit and the radio frequency unit cooperate to perform networking communication, and the data storage device stores the data structure and updates the data structure in real time during the networking communication process.

[0090] Embodiment three: This embodiment further optimizes the first embodiment and provides an efficient data indexing method. The storage location of link information is recorded in an index table, so that the retrieval speed of link information is greatly improved. The design of the index table makes it possible to quickly obtain the required link information by locating the storage location through the index table when searching for link information.

[0091] A data structure is designed to store and manage the entire network. The complete data structure contains three data tables, namely, the node device information list, the node path information table, and the node neighbor information table for recording network nodes. By organizing, associating and mapping link data, efficient storage and fast query of link data are achieved.

[0092] Specific: 1. Node device information list.

[0093] In this embodiment, each node occupies 8 bytes of storage space, and all nodes are written in sequence.

[0094] In other embodiments, the link address length can be extended to more bytes, and the network capacity can be increased by extending the byte length. At the same time, the device unique address can also be shortened to achieve less FLASH occupancy.

[0095] In this embodiment, the obtained device information list is shown in the following table: 2. Node path information table.

[0096] In this embodiment, the node path information table obtained is as follows: Here is an example of device information storage. MAC2 is stored in index 2 of the device information list, and its assigned network address NID is 2. In addition, because MAC2 is connected to the main node through node MAC5, its next hop network address should be the network address of MAC5, which is 5 according to the index relationship. Therefore, the data stored in index 2 of the path information list is 5.

[0097] 3. Node neighbor information table.

[0098] In this embodiment, the node neighbor information table obtained is as follows: index Memory Address 1 0 1 0×2001000 Network address Link Quality Score 2 0×2001002 Network address Link Quality Score 3 0×2001004 Network address Link Quality Score 4 0×2001006 Network address Link Quality Score 5 0×2001008 Network address Link Quality Score 6 0×2001010 Network address Link Quality Score 7 0×2001012 Network address Link Quality Score 8 0×2001014 Network address Link Quality Score 9 0×2001016 Network address Link Quality Score 10 0×2001018 Network address Link Quality Score According to the data structure designed above, according to the overview of the use of data tables during link organization and information storage in Example 1 and the overview of the use of data tables during link initialization and information storage, a communication network (networking) is constructed to store link information.

[0099] The storage method in the first embodiment is used to construct a communication network, and a data structure is designed to store link information in the network. According to the constructed complete communication network and the designed data structure, the link communication process in the network is as follows: Figure 5 As shown: When node MAC1 needs to initiate communication, if the communication target is the master node, MAC1 communicates directly with the master node. First, the highest priority path address is obtained from the node neighbor information table as the communication target. If the address is the master node, the data S11 is sent, and the master node replies S12 to complete the communication.

[0100] When MAC1 cannot communicate directly with the master node, a multi-level path method is used for communication.

[0101] The specific manifestations are: (1) When MAC1 needs to communicate with the master node, it obtains the device with address 2 in the next-hop network through the neighbor table and sends link data S1.

[0102] (2) MAC2 receives data S1, analyzes the data source, data destination, and data sender. If the data source address is 1 and the data sender is 1, the node path information table index 1 in the memory is updated to 1. Corresponding to the device, index 1 represents device MAC1, and its next hop address is 1, that is, MAC1.

[0103] (3) MAC2 obtains the next hop address 3 from the node neighbor information table according to the data target, that is, it sends data S2 to MAC3.

[0104] (4) MAC3 receives data S2 and parses out the data source MAC1, the data target master node, and the data sender MAC2.

[0105] The data source index address is MAC1, and it is sent through MAC2, that is, 2 is stored in the memory of index 1 in the node path information table, which is MAC2, indicating that communication to MAC1 needs to go through MAC2. At the same time, the index 2 in the node path information table is updated to 2, that is, the device MAC2 can send directly to the target.

[0106] (5) MAC3 obtains the next hop address 0 (representing the master node) from the node neighbor information table according to the target address and sends data S3.

[0107] (6) The master node receives this data (data S3) and parses the data source MAC1, the data target master node, and the data sender MAC3. 3 is written to the memory of index 1 in the node path information table, and index 3 is updated to 3 at the same time.

[0108] (7) The master node needs to respond to this data (data S3) to MAC1. The data target address is 1 and is obtained from the path information list through index 1 to 3, that is, the next hop address is 3 (MAC3) and data S4 is sent.

[0109] (8) MAC3 receives data S4, parses the data target as MAC1, obtains the next hop address 2 from node path information list index 1, and sends data S5 to MAC2.

[0110] (9) MAC2 receives data S5, parses the data destination as MAC1, obtains the next hop address 1 from node path information list index 1, and sends data S6 to MAC1.

[0111] (10) MAC1 receives data S6 and interprets the data as destined for MAC1, thus completing the communication for this device.

[0112] According to the above communication process, the updated data table is obtained, as shown in the following table: Compared with the prior art, the link information storage method in the networking communication provided by this embodiment records the storage location of the link information through the index table, so that the retrieval speed of the link information is greatly improved. The designed data structure is used to store and manage the entire network, and the link data is organized, associated and mapped to achieve efficient storage and fast query of the link data, reducing the incremental requirements for storage demand after the network capacity increases.

[0113] Embodiment 4: This embodiment provides a link information storage method in networking communication. In a specific scenario, this embodiment is used in a photovoltaic micro-inverter networking communication scenario, and the link information storage method provided in the first embodiment is applied.

[0114] Photovoltaic inverter is an inverter that can convert the variable DC voltage generated by photovoltaic (PV) solar panels into AC power at the mains frequency. It can be fed back to the commercial power transmission system or used by off-grid power grids. It is an important component in photovoltaic systems. At present, the communication mode of inverters is highly digital, intelligent and networked, which effectively supports the coordinated operation of massive decentralized objects and the precise decision-making of complex system operation status under various market mechanisms, and promotes the energy system with electricity as the core to achieve efficient conversion and utilization of energy.

[0115] Distributed photovoltaic power stations are the mainstream form of photovoltaic power station construction at present, and photovoltaic inverters are an important part of photovoltaic power stations. Since distributed photovoltaic power stations are large in area and have a large number of inverters, it is particularly important to realize the collection and real-time monitoring of photovoltaic power station data. Distributed photovoltaic inverters use communication networks to achieve data collection and control.

[0116] At present, the methods of photovoltaic inverter networking mainly include optical fiber ring network and WIFI communication. When using WIFI communication, the WIFI module matched with the inverter can be used to realize wireless communication, and the IEEE protocol can be used to upload the inverter data to the monitoring platform through the wireless network.

[0117] Photovoltaic micro inverters often use WIFI communication, which is carried out through the WIFI communication module of the inverter itself, and can act as relays for each other. The local machine (current inverter) can be used as both a transmitting source and a receiving station, and can also act as a router to transmit data through other nodes. Finally, the final root node (i.e., the main node, photovoltaic inverter) is connected to the router to output the communication signal, with a transmission rate of about 20M / s. When the original communication path is disconnected, the nearby nodes (photovoltaic inverters) can be used for data transmission. The installation is simple and does not require wiring. It supports power-off transmission, flexible networking, high communication reliability, and the communication network has high elasticity and scalability.

[0118] However, in the process of PV micro-inverter networking communication, each PV inverter is connected to all other PV inverters, there are a large number of communication paths, and a large amount of storage space is occupied. There are still problems such as large link storage space requirements and low retrieval efficiency.

[0119] By adopting the link information storage method in the first embodiment, the space requirement for link storage in the network is reduced so that the network capacity and storage space consumption are controllable, and the retrieval speed is improved by using an efficient and compact data structure.

[0120] The photovoltaic micro-inverter is used as a node, and the communication path between photovoltaic inverters is used as a link to form a photovoltaic micro-inverter communication network. A unique hardware address (MAC) is assigned to each device according to a specific coding rule for node identification in the network.

[0121] A device is identified as a master node, which serves as an external information command input terminal and network authentication and organization. When establishing a communication network, the free node initiates a link establishment process to the surrounding nodes, and the master node completes the authentication and assigns a network address (NID) to the slave node. After the node obtains the network address, it notifies other nodes in the network of the correspondence between the hardware address and the network address through message diffusion. After the node and the device in the network receive the address allocation frame, the corresponding relationship is stored in the data format provided in Example 3. The node device information list stores the MAC address of each node, the node path information table stores the communication path information of each node, and the node neighbor information table stores the neighbor information of this node, including the network address of nearby nodes and the calculated link quality score.

[0122] After storage, the storage location of the link information is recorded using the index table, thereby improving the retrieval speed of the link information. When searching for link information, it is only necessary to locate the storage location through the index table to quickly obtain the required link information.

[0123] Applying the networking link information data structure and link organization method in Example 1 to photovoltaic micro-inverter networking communications can reduce the incremental requirements for storage needs after the network capacity increases, reduce hardware costs, and at the same time reduce retrieval time and link re-acquisition time, thereby reducing node power consumption and saving energy.

[0124] The above-described embodiment is only a preferred solution of the present invention and does not limit the present invention in any form. There are other variations and modifications without exceeding the technical solution described in the claims.

Claims

1. A method for storing link information in network communication, characterized in that: The following steps are involved: Build data structures, organize, associate and map link data, and use index tables to record link information storage locations; When organizing links, the master node assigns a storage index address to the node after authenticating the node and stores it in the node device information table of the data structure, and writes the storage index address as the network address of the node into the node path information table of the data structure; Other nodes in the network use the node's network address as a storage index to store the MAC address in the node device information table, and write the node's upper and lower level data into the node path information table. The node also creates a node neighbor information table.

2. A link information storage method in network communication according to claim 1, characterized in that: The data structure includes a node device information list storing the MAC address of each node, a node path information table storing the communication path information of each node, and a node neighbor information table storing the neighbor node information of the node, wherein the neighbor node information includes the network address of the nearby node and the calculated link quality score.

3. The link information storage method in network communication according to claim 1, characterized in that: The node initiates a network access request, carrying the MAC address and authentication information of the node, obtains the network address after accessing the network, and synchronizes the node message to other nodes to create a node path information table.

4. A link information storage method in network communication according to claim 3, characterized in that: After the network access request is initiated: if the free node accessing the network can communicate directly with the master node with authentication capability, the node accesses the network successfully; if it communicates with the master node through other nodes, the node initiates a proxy network access request, forwards the network access request through other nodes, and repeats the above steps according to the set number of repeated network accesses until the node accesses the network successfully.

5. A link information storage method in network communication according to claim 1 or 2 or 3 or 4, characterized in that: The node neighbor information table obtains neighbor information, including: The node actively requests neighbor information. After receiving the handshake response from the neighboring node, the node calculates whether the communication quality is met based on the response information and the collected RF information. If the conditions are met, the device is added to the node neighbor information table and sorted according to the link quality score. When idle, a node listens to valid communication data on the channel, obtains link information, and decides whether to update the data in the neighbor list based on link quality evaluation.

6. A link information storage method in network communication according to claim 1 or 2 or 3 or 4, characterized in that: When a node processes and uses link information: the node controls the link through the communication address defined in the data frame, uses the recipient address to filter whether the data is processed, and selects the communication link address as the recipient address when sending data according to the communication target.

7. A link information storage method in network communication according to claim 1 or 2 or 3 or 4, characterized in that: During the networking communication process, the index in the data structure is updated in real time: if the node communication target is the main node, the path address with the highest priority is obtained from the node neighbor information table as the communication target; if the node cannot communicate directly with the main node, a multi-level path method is used for communication, and the index in the node path information table is updated in real time.

8. A link information storage method in network communication according to claim 1, 2 or 3, characterized in that: The node neighbor information table is a two-dimensional structure, the first dimension is the network address and link quality information of the neighbor node, and the second dimension is different neighbor nodes; the storage structure in the node neighbor information table represents the priority of the node, and the node with a high priority is preferred during communication.

9. A link information storage method in network communication according to claim 1 or 2, characterized in that: The device information list is stored in FLASH, each node occupies 8 bytes of storage space, all nodes are written in sequence, and the address index stored in the node is used as the node's network address index.

10. A link information storage method in network communication according to claim 1 or 2, characterized in that: The index of the node path information table and the index of the node device information table are in a corresponding relationship.

Images