A wireless networking communication method in peer-to-peer mode

Abstract

The present invention proposes a peer-to-peer wireless networking communication method, and the steps are as follows: n numbered terminal nodes in a local area network periodically broadcast and listen for shared information; when a new terminal node accesses the local area network, it receives the shared information broadcast by the numbered terminal nodes in the local area network; the new terminal node sequentially numbers itself as n + 1 according to the shared information, and i responds to the broadcast information of the terminal node with a relatively stronger signal strength according to the signal strength of the received shared information. The terminal node i updates the shared information and broadcasts it, and other terminal nodes synchronously update the broadcast shared information, where i is any natural number in [1, n]. By numbering and networking the devices, the present invention eliminates the need for independent relay devices, saves resources; eliminates the limitations in the use of portable and mobile devices caused by the fixed position of the independent relay nodes; and the self-organizing network method has high flexibility and is applicable to 433 MHz wireless communication networking, LoRa communication networking, etc.

Description

Technical Field

[0001] The present invention relates to the technical field of wireless ad hoc networks, and particularly to a peer-to-peer wireless networking communication method. Background Art

[0002] A wireless ad hoc network is a technology different from traditional wireless communication. In a traditional wireless communication network, a fixed network base station is required to perform user access and forward user data, such as the mobile Internet we use now. In such a traditional wireless communication network, in relatively densely populated areas, there are a large number of base stations to provide communication for people. However, in remote areas or when moving over a large range during emergency rescue, due to the lack of base station coverage, communication difficulties will occur, restricting the spread of information in space.

[0003] At the same time, a wireless ad hoc network has no central network and can be flexibly deployed according to needs without infrastructure support, such as computer rooms and transmission networks. A wireless ad hoc network can be set arbitrarily, the signal avoids interference from obstacles, the transmission is unobstructed, and blind spots are eliminated. It can also be extended through a multi-hop relay network to further expand the coverage area.

[0004] Nowadays, in most ad hoc networking methods, the addition of independent relay nodes or independent hosts is required, and the positions of the relay nodes are fixed, greatly restricting the activity range of mobile devices and bringing inconvenience to the networking of mobile devices in industrial complex environments.

[0005] The invention patent with the application number 201810614791.5 discloses a multi-hop relay networking method. After the first RN detects the system message sent by the surrounding RNs, it will determine the superior RN of the first RN according to the relevant information of the surrounding RNs in the system message, thus completing the multi-hop relay networking. In the process of executing this invention, the superior will be determined. The confirmation of the superior represents the confirmation of the dependency relationship. Once the superior fails or disconnects from the local area network, if the local area networking dynamically adjusts the superior, there will be a period during which the information of the faulty superior and subordinate devices cannot be shared. If the local area networking cannot dynamically adjust, the faulty superior and subordinate devices have already disconnected from the local area information network. Summary of the Invention

[0006] Aiming at the technical problem of the limitation in the use of portable and mobile devices caused by the fixed position of independent relay nodes in industrial complex environments, the present invention proposes a peer-to-peer wireless networking communication method that does not require independent relay devices for wireless ad hoc networking, and each device is a peer device, which can ensure the effective transmission of information.

[0007] To achieve the above object, the technical solution of the present invention is realized as follows: A peer-to-peer wireless networking communication method, where n numbered terminal nodes in a local area network periodically broadcast and listen for shared information; when a new terminal node accesses the local area network, it receives the shared information broadcast by the numbered terminal nodes in the local area network; the new terminal node sequentially numbers itself as n + 1 according to the shared information, and based on the signal strength of the received shared information, it i responds to the broadcast information of the terminal node with stronger signal strength, and the terminal node i updates the shared information and broadcasts it, and other terminal nodes synchronously update the broadcast shared information, where i i is any natural number in [1, n].

[0008] Preferably, the terminal node is both a receiver and a repeater, and functions as a relay node; the terminal node sends shared information including the device status of itself and the other terminal nodes.

[0009] Preferably, the communication failure of the terminal node is detected by a labeling detection mechanism, and the failure information is broadcast to trigger an audible and visual alarm, and at the same time, the queue information of the labels in the data frame of the shared information in the group is updated.

[0010] Preferably, the labeling detection mechanism is that if the terminal node with label i - 1 does not receive the broadcast information of the terminal node with label i for three consecutive polling cycles and the terminal node with label i + 1 does not receive the broadcast information of the terminal node with label i for three consecutive polling cycles, then the terminal node with label i has a communication failure or has left the local area network.

[0011] Preferably, the period T of the periodic broadcast of the terminal node consists of a transmission time, a listening time, and a margin time; the information between the n numbered terminal nodes is shared periodically, and the broadcast opportunity is calculated starting from the latest received shared information.

[0012] Preferably, the terminal node calculates the waiting time N * T according to the difference N between its own label and the label of the terminal node of the received shared information.

[0013] Preferably, when n is greater than or equal to 2, if the terminal node with label n + 1 only receives the shared information broadcast by the terminal node with label i , then during the next cycle of the terminal node with label i broadcasting, the terminal node with label n + 1 initiates a response. At this time, the terminal node with label i knows that the terminal node with label n + 1 has accessed, and updates the shared information during the next cycle of broadcasting; if the terminal node with label n + 1 receives several pieces of broadcast information and selects the terminal node with label i with stronger signal strength in the broadcast information, then during the next cycle of the terminal node with labeli The terminal node with the label broadcasts in the next cycle, and the terminal node with the label n + 1 initiates an answer. At this time, the terminal node with the label i knows that the terminal node with the label n + 1 has accessed, updates the shared information during the next cycle broadcast, and the remaining terminal nodes synchronously update the data frame information.

[0014] Preferably, the terminal nodes in the local area network are connected to a concentrator, and the concentrator obtains the group information in the local area network and uploads it to the cloud platform.

[0015] Preferably, a convergence node is provided in each local area network. The convergence node is connected to the terminal nodes in the local area network, and the convergence node is connected to the access node.

[0016] Preferably, when the convergence node does not receive the broadcast information of the terminal node within three cycles, it determines that the terminal node is a dropped device, and the convergence node tells the access node the broadcast information.

[0017] Compared with the prior art, the beneficial effects of the present invention are as follows: referring to the multi-hop network topology structure, by setting labels for nodes and broadcasting cyclically in sequence, information sharing is achieved, and a local self-organizing network is formed; by networking devices with labels, independent relay devices are omitted, saving resources; the limitation of the use of portable and mobile devices caused by the fixity of the position of the independent relay node is removed; the self-organizing network method proposed by the present invention has high flexibility and is applicable to 433 MHz wireless communication networking, LoRa communication networking, etc. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required for use in the description of the embodiments or the prior art. Obviously, the following drawings are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0019] Figure 1 It is a schematic flow chart of the present invention.

[0020] Figure 2 It is a schematic diagram of the principle of information interaction of the present invention.

[0021] Figure 3 It is a schematic diagram of two terminal nodes in the local area network of the present invention.

[0022] Figure 4 It is a communication schematic diagram of Embodiment 3 of the present invention.

[0023] Figure 5 It is a communication schematic diagram of Embodiment 4 of the present invention.

[0024] Figure 6 Schematic diagram of communication for Embodiment 5 of the present invention

[0025] Figure 7 Schematic diagram of communication for Embodiment 6 of the present invention

[0026] Figure 8 Schematic diagram of communication for Embodiment 7 of the present invention

[0027] Figure 9 Schematic diagram of communication for the failure of the intermediate terminal node in the present invention

[0028] Figure 10 Schematic diagram of the inability to communicate due to the failure of the intermediate terminal node in the present invention

[0029] Figure 11 Schematic diagram of the service transmission of the networking device

[0030] Figure 12 Schematic diagram of data interaction between adjacent terminal nodes in the present invention

[0031] Figure 13 Schematic diagram of the tree - shaped network topology structure Detailed implementation manners

[0032] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

[0033] Embodiment 1

[0034] As Figure 1 shown, a peer - to - peer wireless networking communication method, where n numbered terminal nodes in a local area network periodically broadcast and monitor shared information; when a new terminal node accesses the local area network, it receives the shared information broadcast by the numbered terminal nodes in the local area network; the new terminal node sequentially numbers itself as n + 1 according to the shared information, and responds to the broadcast information of the terminal node i with a stronger signal strength according to the signal strength of the received shared information. The terminal node i updates the shared information and broadcasts it, and other terminal nodes synchronously update the broadcast shared information, where i is any natural number in [1,n]. The information interaction between terminal nodes is as Figure 2As shown, the terminal node is a detector or a sensor. The detector terminal forms its own network and broadcasts information cyclically according to its own label. The surrounding terminal nodes or terminal devices receive the broadcast device messages and their own labels and react, and then pass them on in turn. The terminal nodes within the local area network are connected to the concentrator. The concentrator obtains the group information within the local area network and uploads it to the cloud platform. If you want to upload the group information to the cloud platform, you can connect the concentrator as an ordinary device to the group in the local area network at any time, obtain the group messages and then upload them to the cloud platform. The concentrator is immobile. The working status of all devices within the group can be monitored in real time on the cloud platform, and commands can be sent from the cloud platform to the concentrator. The concentrator then issues the commands to the group to achieve one-device monitoring and one-device control.

[0035] The terminal node is both a receiver and a repeater, functioning as a relay node; the terminal node sends shared information including the device status of itself and other terminal nodes, enabling the sharing of all information within the group, achieving one alarm and synchronous reminders for the rest of the devices, and ensuring a wider spread of alarm information. At the same time, according to its own label, the terminal node effectively expands the coverage of the self-organizing network through forward and reverse transmissions.

[0036] The communication faults of the terminal nodes are detected through the label detection mechanism, and the fault information is broadcast to trigger audible and visual alerts. The terminal node itself is equipped with audible and visual prompts and can give prompts after its own fault or the fault of surrounding devices. The label detection mechanism is that if the terminal node with label i - 1 does not receive the broadcast information of the terminal node with label i for three consecutive polling cycles and the terminal node with label i + 1 does not receive the broadcast information of the terminal node with label i for three consecutive polling cycles, then the terminal node with label i has a communication fault or has left the local area network. Generally, the number of retry attempts is three, and three is the minimum test cycle, which can ensure stability.

[0037] The period T of the periodic broadcast of the terminal node consists of the transmission time, the listening time, and the margin time; the transmission time is the time when the node sends the shared information, the listening time is the time for listening to the shared information, and the margin time is the additional margin time to compensate for the hardware processing time. The information is periodically shared among the n labeled terminal nodes, and the broadcast timing is calculated starting from the latest received shared information, which is more accurate. Each time, the waiting time is calibrated based on the latest received information. The terminal node calculates the waiting time as N * T based on the difference N between its own label and the label of the terminal node that received the shared information. This does not depend on a single device, does not form a bundling relationship, and prevents the disorder of the group timing caused by the error of a single device.

[0038] When n is greater than or equal to 2, if the terminal node with label n + 1 only receives the shared information broadcast by the terminal node with label i then at the label iThe terminal node with the label will broadcast in the next cycle, and the terminal node with the label n+1 will initiate an answer. At this time, the terminal node with the label i knows that the terminal node with the label n+1 has accessed, and updates the shared information during the next cycle broadcast; if the terminal node with the label n+1 receives several broadcast messages, it selects the terminal node with a stronger signal strength in the broadcast messages and with the label i , then in the terminal node with the label i The terminal node will broadcast in the next cycle, and the terminal node with the label n+1 will initiate an answer. At this time, the terminal node with the label i knows that the terminal node with the label n+1 has accessed, updates the shared information during the next cycle broadcast, and the remaining terminal nodes synchronously update the data frame information.

[0039] Embodiment 2

[0040] A peer-to-peer wireless networking communication method. All terminal nodes are equal. First, a terminal node, i.e., a detector, is set into the local area network, broadcasts periodically and listens. If no replied information is received, it is determined that there is only one device in the local area network at this time, and it is marked as No. 1. The No. 1 terminal node broadcasts periodically, and the cycle time is T, which consists of the sending time, the listening time, and the remaining time. The second device is connected to enter the network configuration mode, that is, it starts to listen for information. After listening for one time cycle, when it listens to only the broadcast information of the No. 1 terminal node and is informed that there is only one member in the local area network group, it replies to the No. 1 device, and all devices record the device numbers that can be listened to. In the interaction information, each device will announce how many devices there are in the current group and which number it is. Then the listening device can obtain this information. And it will also be carried in the broadcast information. At this time, there are two detection devices in the area. It is listened that there is only one device in the current group, and there are two in total including itself. In the program, after processing, it numbers itself as No. 2 and then broadcasts. The broadcast information tells the No. 1 terminal node that the number of members in the current group is 2. Because the No. 1 device has received the broadcast of the No. 2 device, and the No. 2 broadcast information tells the No. 1 device the latest news of the current group, and the information is always shared. In this way, the information between the No. 1 and No. 2 terminal nodes is shared periodically. The broadcast timing starts to be calculated from the latest received broadcast information. According to the difference N between its own device number and the device number of the received broadcast information, calculate the waiting time N*T, as shown in Figure 3 shown.

[0041] Other communication methods are the same as those in Embodiment 1.

[0042] When the third device applies to access the network, its number is 3, and there are 5 cases, which are shown in Embodiments 3-7 respectively.

[0043] Embodiment 3

[0044] A peer-to-peer wireless networking communication method, asFigure 4 As shown, when the No. 1 terminal node and the No. 2 terminal node normally broadcast information sharing, the No. 3 terminal node is placed on the right side of the No. 2 terminal node. After the No. 1 terminal node and the No. 2 terminal node finish broadcasting, the No. 3 terminal node will receive two broadcast messages, or only receive the broadcast message of the No. 2 terminal node. All devices record the device numbers that can be monitored, and the broadcast messages will also carry them. If the No. 3 terminal node receives two broadcast messages, according to the signal strength RSSI1 and RSSI2 in the two messages, if RSSI1 < RSSI2, it can be known that the No. 3 terminal node is closer to the No. 2 terminal node. When the No. 2 terminal node broadcasts in the next cycle, the No. 3 terminal node initiates an answer. At this time, the No. 2 terminal node knows that a new device has been connected. When broadcasting in the next cycle, the broadcast message is updated. When the No. 3 terminal node receives the broadcast of the No. 2 terminal node, it starts timing. After the timing of one cycle T ends, it starts broadcasting, and the other devices synchronously update the data frame information.

[0045] Other communication methods are the same as those in Embodiment 2.

[0046] Embodiment 4

[0047] A peer-to-peer wireless networking communication method, as Figure 5 As shown, when the No. 1 terminal node and the No. 2 terminal node normally broadcast information sharing, the No. 3 terminal node is placed on the right side of the No. 2 device. After the No. 1 terminal node and the No. 2 terminal node finish broadcasting, the No. 3 terminal node only receives the broadcast message of the No. 2 terminal node. Then, when waiting for the No. 2 terminal node to broadcast in the next cycle, the No. 3 terminal node initiates an answer. At this time, the No. 2 terminal node knows that a new device has been connected. When broadcasting in the next cycle, the broadcast message is updated. When the No. 3 terminal node receives the broadcast of the No. 2 terminal node, it starts timing for one cycle. After the timing ends, it starts broadcasting. At the same time, if the No. 1 terminal node does not receive the broadcast message of the No. 3 terminal node, then when the No. 1 terminal node receives the broadcast of the No. 2 terminal node, it starts timing. After the timing of two cycle times T ends, it starts broadcasting. Because the No. 1 terminal node knows that there are 3 devices in the current group through the No. 2 terminal node, it starts timing from receiving the information of the No. 2 device. If it can receive the information of the No. 3 device, then the timing is one cycle. If it cannot receive the information of the No. 3 device, it times for two cycles. In this way, it does not depend on a certain device and will not form a bundling relationship, preventing the group timing disorder caused by the error of a certain device.

[0048] Other communication methods are the same as those in Embodiment 2.

[0049] Embodiment 5

[0050] A peer-to-peer wireless networking communication method, as Figure 6As shown, when the No. 1 terminal node and the No. 2 terminal node normally broadcast information sharing, the No. 3 terminal node is placed on the left side of the No. 1 terminal node. After the No. 1 terminal node and the No. 2 terminal node finish broadcasting, the No. 3 terminal node will receive two broadcast messages. All devices record the device numbers that can be monitored, and the broadcast messages will also carry them. If the No. 3 terminal node receives two broadcast messages, according to the signal strength RSSI1 and RSSI2 in the two messages, and RSSI1 > RSSI2, it can be known that the No. 3 terminal node is closer to the No. 1 device. When the No. 1 terminal node broadcasts in the next cycle, the No. 3 terminal node initiates a response. At this time, the No. 1 terminal node knows that a new device has been connected. When broadcasting in the next cycle, the broadcast message is updated, and the other devices synchronously update the data frame information.

[0051] Other communication methods are the same as those in Embodiment 2.

[0052] Embodiment 6

[0053] A peer-to-peer wireless networking communication method, as Figure 7 As shown, when the No. 1 terminal node and the No. 2 terminal node normally broadcast information sharing, the No. 3 terminal node is placed on the left side of the No. 1 terminal node. After the No. 1 terminal node and the No. 2 terminal node finish broadcasting, the No. 3 terminal node starts timing when receiving the broadcast of the No. 1 terminal node. After timing for 2 cycle T times, it starts to broadcast. If the No. 3 terminal node only receives the broadcast message of the No. 1 terminal node, then when waiting for the No. 1 terminal node to broadcast in the next cycle, the No. 3 terminal node initiates a response. At this time, the No. 1 terminal node knows that a new device has been connected. When broadcasting in the next cycle, the broadcast message is updated. The No. 3 terminal node starts timing when receiving the broadcast of the No. 1 terminal node. After timing ends, it starts to broadcast. At the same time, if the No. 3 terminal node does not receive the broadcast message of the No. 2 terminal node, then the No. 3 terminal node starts timing when receiving the No. 1 broadcast. After timing for 2 cycle times T, it starts to broadcast. Because there are 3 devices in the current group through the No. 1 device for the No. 3 device, I start timing from receiving the information of the No. 1 device. If I can receive the information of the No. 2 device, then timing for 1 cycle is enough. If I cannot receive the information of the No. 2 device, then timing for two cycles. In this way, it does not depend on a certain device, does not form a bundling relationship, and prevents the timing disorder of the group caused by an error of a certain device.

[0054] Other communication methods are the same as those in Embodiment 2.

[0055] Embodiment 7

[0056] A peer-to-peer wireless networking communication method, as Figure 8As shown, when the No. 1 terminal node and the No. 2 terminal node share information normally, the No. 3 terminal node is placed between the No. 1 terminal node and the No. 2 terminal node, and the processing is also analyzed and processed as in the case of Embodiment 3-6. First, if only the No. 1 terminal node or the No. 2 terminal node is received, information interaction is performed; if the No. 3 terminal node receives two pieces of information, after comparing the signal strengths, it selects the terminal node with the stronger signal strength for information interaction.

[0057] Other communication methods are the same as those in Embodiment 2.

[0058] Embodiment 8

[0059] A peer-to-peer wireless networking communication method. The above embodiments consider adding devices to the original group. If a communication problem is caused by a failure of one of the devices during operation, such as Figure 9 As shown,

[0060] The No. 1 terminal node and the No. 2 terminal node share information normally, the No. 2 terminal node and the No. 3 terminal node share information normally, and the No. 1 terminal node and the No. 3 terminal node share information normally. If a communication failure occurs in the No. 2 terminal node, after the No. 1 terminal node broadcasts, it does not receive the broadcast of the No. 2 terminal node within the periodic time, and does not receive the broadcast information of the No. 2 terminal node three times in a row. If the No. 3 terminal node also does not receive the broadcast information of the No. 2 terminal node three times in a row, it is determined that the No. 2 terminal node has a communication failure or has left the group. However, if within three cycles, the No. 3 terminal node receives the broadcast information of the No. 2 terminal node and broadcasts it, and at this time the No. 1 terminal node also receives the broadcast information of the No. 3 terminal node, it is determined that the No. 2 terminal node device has no failure, but has just moved its position. Similarly, if there is a problem with the No. 1 device or the No. 3 device, the processing situation is basically the same.

[0061] Such as Figure 10As shown, the No. 1 terminal node shares information normally with the No. 2 terminal node, and the No. 2 terminal node shares information normally with the No. 3 terminal node. The distance between the No. 1 terminal node and the No. 3 terminal node is relatively far and they cannot communicate. If the No. 2 terminal node has a communication failure, this link fails. Subsequently, if there are newly added devices and it is monitored that the No. 2 terminal node has dropped out, they can number themselves as No. 2. The interaction protocol will carry the status of all devices within the group, indicating that the No. 2 device has failed and left the organization. Then, the subsequently connected devices can set their numbers to No. 2 according to the monitored information. Therefore, when arranging the on-site application environment, avoid the situation where only one terminal node serves as a relay node. Ensure that at least 2 devices can monitor the information within the effective transmission range of each device. At the same time, when a new terminal node is connected, it must wait until all group members have completed normal interaction before connecting to avoid confusion in timing and label sequence. Each device of a terminal node has a light prompt. When a device receives a number of group members inconsistent with its own record, it should indicate by flashing the light and turn off the flashing light until its own broadcast. In this way, when all the lights in the group are not on, it means that the information synchronization within the group is completed.

[0062] All terminal nodes carry the labels and status of all devices within their reception range in the broadcast information, and receive the broadcast information of nearby devices to update the status in real time, forming data update transmission between regional blocks.

[0063] The device network addition service transmission process is as Figure 11 shown, which is the network addition schematic diagram of Embodiment 3. The network addition device is a newly added device, listening means the device is in the receiving state, and responding means sending a message reply after receiving data.

[0064] This invention refers to a multi-hop network topology. Some nodes (the middle terminal nodes) in the local area network serve as relay nodes, effectively connecting the access nodes that are far apart and completing reliable communication transmission. As Figure 12 shown, a zigzag network consisting of N terminal nodes is formed, and adjacent terminal nodes conduct data transmission.

[0065] Other communication methods are the same as those in Embodiment 2.

[0066] Embodiment 9

[0067] A peer-to-peer wireless networking communication method adopts a standard tree-like network topology structure. Sensors, aggregation nodes, and access nodes are connected through the uplink and downlink of a given channel and are managed in a hierarchical mode for layer-by-layer transmission. As Figure 13As shown. There is a convergence node in each local area network. The convergence node is connected to the terminal nodes in the local area network and is also connected to the access node. When the convergence node does not receive the broadcast information from the terminal node within three cycles, it determines that the terminal node is a disconnected device, and the convergence node notifies the access node of the broadcast information.

[0068] The access node is equivalent to a wireless gateway. There are n convergence nodes configured below it, and m detectors are configured below each convergence node. When an alarm message appears in one of the detectors and is uploaded to the gateway, the gateway will then uniformly issue the configuration. The alarm message is first transmitted to the convergence node, and after the convergence node collects the information, it uploads the information to the access node. After receiving the detector alarm message, the gateway device can respond to the convergence node or issue an instruction configuration. After receiving it, the convergence node forwards it to the sensor.

[0069] Meanwhile, when a new device accesses the network, by configuring the protocol parameters, it can apply to join a certain convergence node, and at the same time, the convergence node reports to the access node. Configuring the protocol parameters means setting the communication parameters, which can be the same as the configuration of a certain convergence node. It can be configured through infrared, handheld instrument, upper computer, etc., or directly written as the same parameters in the program. When a device is disconnected or fails, if the convergence node does not receive the information of the disconnected device within 3 polling cycles, it determines that it is disconnected and notifies the access node of the data result. The convergence node periodically initiates broadcast data to check the information of the following sensors. Similarly, the sensors will respond. If one sensor device does not respond, it is recorded. If it fails to receive three consecutive times, it is considered that this sensor device is disconnected or faulty, and the convergence node uploads the information to the access node.

[0070] Other methods are the same as those in Embodiment 8.

[0071] The above are only the preferred embodiments of the present invention and are not intended to limit the present invention. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included in the protection scope of the present invention.

Claims

1. A peer-to-peer wireless networking communication method, characterized in that n labeled terminal nodes within the local area network periodically broadcast and listen for shared information; when a new terminal node accesses the local area network, it receives the shared information broadcast by the labeled terminal nodes within the local area network; the new terminal node sequentially labels itself as n + 1 according to the shared information, and responds to the broadcast information of the terminal node with a stronger signal strength according to the signal strength of the received shared information i ; the terminal node i updates the shared information and broadcasts it, and other terminal nodes synchronously update the broadcast shared information, where i is any natural number in [1, n]; The communication failure of the terminal node is detected by the label detection mechanism, and the failure information is broadcast to trigger an audible and visual alarm; The label detection mechanism is that if the terminal node with label i-1 does not receive the broadcast information of the terminal node with label i for three consecutive polling cycles and the terminal node with label i+1 does not receive the broadcast information of the terminal node with label i for three consecutive polling cycles, then the terminal node with label i has a communication failure or has left the local area network; The period T of the periodic broadcast of the terminal node consists of the transmission time, the listening time, and the margin time; the information is periodically shared among the n numbered terminal nodes, and the broadcast time is calculated starting from the latest received shared information; The terminal node calculates the waiting time N*T according to the difference N between its own label and the label of the terminal node that has received the shared information.

2. The wireless networking communication method in peer-to-peer mode according to claim 1, wherein The terminal node is both a receiver and a repeater, and has the function of a relay node; the terminal node sends the shared information including the device status of itself and the other terminal nodes.

3. The wireless networking communication method in peer-to-peer mode according to claim 1 or 2, characterized in that, When n is greater than or equal to 2, if the terminal node labeled n + 1 only receives the shared information broadcast by the terminal node labeled i , then in the next cycle when the terminal node labeled i broadcasts, the terminal node labeled n + 1 initiates an answer. At this time, the terminal node labeled i knows that the terminal node labeled n + 1 accesses, and updates the shared information when broadcasting in the next cycle; if the terminal node labeled n + 1 receives several broadcast messages and selects the terminal node labeled i with stronger signal strength in the broadcast messages, then in the next cycle when the terminal node labeled i broadcasts, the terminal node labeled n + 1 initiates an answer. At this time, the terminal node labeled i knows that the terminal node labeled n + 1 accesses, updates the shared information when broadcasting in the next cycle, and the remaining terminal nodes synchronously update the data frame information.

4. The peer-to-peer mode wireless networking communication method according to claim 3, characterized in that, The terminal nodes in the local area network are connected to the concentrator, and the concentrator obtains the group information in the local area network and uploads it to the cloud platform.

5. The wireless networking communication method in peer-to-peer mode according to claim 4, wherein A convergence node is provided in each local area network. The convergence node is connected to the terminal nodes in the local area network, and the convergence node is connected to the access node.

6. The peer-to-peer mode wireless networking communication method according to claim 5, wherein, When the convergence node does not receive the broadcast information of the terminal node within three cycles, it determines that the terminal node is a dropped device, and the convergence node informs the access node of the broadcast information.

Images