A wireless ad hoc network communication method, device and electronic equipment

Abstract

The application relates to the field of wireless communication, in particular to a wireless ad hoc network communication method, device and electronic equipment. A wireless ad hoc network communication method is applied to a wireless communication device, the wireless communication device is a first node, the first node is any node in a wireless ad hoc network, and the method comprises the following steps: the first node acquires a locally stored network topology graph, the network topology graph comprises the connection relationship of each node in the wireless ad hoc network; the second node and the third node are determined according to the network topology graph; the first value and the second value are determined according to the network topology graph, the first value and the second value are compared, and if the first value is greater than the second value, the first node is prohibited from sending a broadcast message to the second node. The application realizes that only one node sends a broadcast message to the second node in the forwarding process, avoids repeated sending of the broadcast message, and reduces the consumption of network resources.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of wireless communication, in particular to a wireless ad hoc network communication method and device and electronic equipment. BACKGROUND

[0002] Wireless ad hoc network is a kind of distributed wireless packet autonomous network, without fixed infrastructure, node status is equal, can be freely moved, has the characteristics of flexible networking, multi-hop relay, anti-destroying self-healing, etc., has very wide application prospect.

[0003] In a wireless communication system, broadcast means that the sending of a node can be received by other nodes. In the current wireless ad hoc network system, the adjacent non-source nodes of the source node receive the broadcast message sent by the source node and forward it to the adjacent nodes of the non-source nodes. The broadcast message is forwarded for many times to realize the whole network broadcast.

[0004] For the above related technology, the inventor believes that in the process of realizing the whole network broadcast of the broadcast message, the broadcast message is repeatedly sent, which consumes a lot of network resources. If not controlled, the broadcast message may be sent in a loop, causing network paralysis and communication failure. SUMMARY

[0005] In order to solve the problem of large network consumption caused by repeated sending of broadcast messages in the process of whole network broadcast of broadcast messages, to avoid the network paralysis caused by the loop sending of broadcast messages and communication failure, the present application provides a wireless ad hoc network communication method, device and electronic equipment.

[0006] In a first aspect of the present application, a wireless ad hoc network communication method is provided, applied to a wireless communication device, the wireless communication device being a node in a wireless ad hoc network, and the method comprising:

[0007] The first node acquires a locally stored network topology graph, the network topology graph including the connection relationship of each node in the wireless ad hoc network; according to the network topology graph, a second node and a third node are determined; the second node is a node connected to the first node, and the third node is a node connected to the second node; according to the network topology graph, a first value and a second value are determined; the first value is the cumulative forwarding number of the broadcast message sent from the first node to the second node, and the second value is the cumulative forwarding number of the broadcast message sent from the third node to the second node;

[0008] The first value and the second value are compared; if the first value is greater than the second value, the first node is prohibited to send the broadcast message to the second node.

[0009] By adopting the technical scheme, the first node determines the second node connected with the first node and the third node connected with the second node according to the locally stored network topology graph, and determines the cumulative forwarding times of the broadcast message sent to the second node via the first node and the third node respectively, and the node with more message forwarding times is prohibited from sending the broadcast message to the second node, so that only one node sends the broadcast message to the second node in the forwarding process, the repeated sending of the broadcast message is avoided, the node with the least message forwarding times is selected to send the broadcast message, the efficiency of message forwarding is effectively improved, and the consumption of network resources is reduced.

[0010] In a possible implementation, before the first node acquires the locally stored network topology graph, the method further includes:

[0011] The first node detects the signal strength between the first node and the second node, and when the signal strength is greater than or equal to a preset signal strength threshold, the first node establishes a connection relationship with the second node and constructs a network topology graph.

[0012] In a possible implementation, the method further includes:

[0013] The first node generates a node ID and locally stores the node ID, and then updates the network topology graph, wherein the node ID is 1 added to the cumulative number of nodes in the wireless ad hoc network.

[0014] By adopting the technical scheme, the node ID is used to mark the nodes in the wireless ad hoc network, and the connection relationship between each node is facilitated to be recorded and analyzed.

[0015] In a possible implementation, comparing the first value and the second value includes:

[0016] If the first value is equal to the second value, the node with the smaller node ID among the first node and the third node sends the broadcast message to the second node.

[0017] By adopting the technical scheme, when the message forwarding times of the broadcast message from the source node to the second node via the first node or the third node are the same, the node with the smaller node ID among the first node and the third node is specified to send the broadcast message to the second node, the repeated sending of the message caused by the multiple nodes sending the broadcast message to the same node when the message forwarding times are the same is avoided, and the consumption of network resources is reduced.

[0018] In a possible implementation, the method further includes:

[0019] The first node updates a first message sending list to a second message sending list according to a preset rule after receiving the broadcast message sent by the fourth node, the preset rule is that a receiving node is prohibited from sending the broadcast message to a sending node after receiving the broadcast message sent by the sending node, the first message sending list includes the fourth node, and the second message sending list does not include the fourth node.

[0020] By adopting the technical scheme, the first node will not send the broadcast message to the fourth node after receiving the broadcast message sent by the fourth node, the repeated sending of the message to the fourth node is avoided, and the consumption of network resources is reduced.

[0021] In a possible implementation, the method further includes:

[0022] The first node detects a signal strength between the first node and the second node, when the signal strength between the first node and the second node is less than the preset signal strength threshold, the first node disconnects the connection relationship with the second node, and updates the network topology graph.

[0023] In a possible implementation, the method further includes:

[0024] When the first node detects that the signal strength between the first node and the fifth node is greater than or equal to the signal strength threshold, the first node establishes a connection relationship with the fifth node, and updates the network topology graph, the fifth node being a new node in the wireless ad hoc network.

[0025] By adopting the technical scheme, when the nodes in the wireless ad hoc network disconnect or a new node establishes a connection relationship with the nodes in the wireless ad hoc network to change the network topology structure, each node in the wireless ad hoc network updates the network topology graph to obtain the latest connection relationship of each node in the wireless ad hoc network.

[0026] In a possible implementation, the signal between the first node and the second node is a WiFi signal or a Bluetooth signal.

[0027] A wireless ad hoc network communication device is provided in a second aspect of the application, the device being a wireless communication device, the wireless communication device being a first node, the first node being any node in the wireless ad hoc network, and the device including an acquisition unit, a determination unit and a comparison unit, wherein

[0028] The acquisition unit is configured to acquire a network topology graph stored locally by the first node, the network topology graph including connection relationships of nodes in the wireless ad hoc network.

[0029] The determining unit is configured to determine a first value and a second value according to the network topology graph, the first value being a cumulative forwarding number of a broadcast message sent from the first node to the second node, and the second value being a cumulative forwarding number of the broadcast message sent from the third node to the second node; the comparing unit is configured to compare the first value and the second value; and if the first value is greater than the second value, the first node is prohibited from sending the broadcast message to the second node.

[0030] In a possible implementation, the determining unit is further configured to detect a signal strength between the first node and the second node; and if the signal strength is greater than or equal to a preset signal strength threshold, the first node and the second node establish a connection relationship, and a network topology graph is constructed.

[0031] In a possible implementation, the apparatus further includes an updating unit, the first node generates a node ID and locally stores the node ID, and the network topology graph is updated, the node ID being 1 added to a cumulative number of nodes in the wireless ad hoc network.

[0032] In a possible implementation, if the first value is equal to the second value, the broadcast message is sent to the second node by a node with a smaller node ID from among the first node and the third node.

[0033] In a possible implementation, the updating unit is further configured to update a message sending list, after the first node receives the broadcast message sent by the fourth node, a first message sending list is updated to a second message sending list according to a preset rule, the preset rule being that after a receiving node receives a broadcast message sent by a sending node, the receiving node is prohibited from sending the broadcast message to the sending node, the first message sending list including the fourth node, and the second message sending list not including the fourth node.

[0034] In a possible implementation, the first node detects a signal strength between the first node and the second node; if the signal strength between the first node and the second node is less than the preset signal strength threshold, the first node disconnects the connection relationship with the second node, and the network topology graph is updated.

[0035] In a possible implementation, the determining unit is further configured to detect a signal strength between the first node and a fifth node; if the first node detects that the signal strength between the first node and the fifth node is greater than or equal to the signal strength threshold, the first node establishes a connection relationship with the fifth node, and the network topology graph is updated, the fifth node being a newly added node in the wireless ad hoc network.

[0036] In a possible implementation, the signal between the first node and the second node is a WiFi signal or a Bluetooth signal.

[0037] In a third aspect of the present application, an electronic device is provided, which comprises a processor, a memory, a user interface and a network interface, the memory is configured to store instructions, the user interface and the network interface are configured to communicate with other devices, and the processor is configured to execute the instructions stored in the memory to enable the electronic device to perform the method described in any one of the above aspects.

[0038] In summary, the present application includes at least one of the following beneficial technical effects:

[0039] The first node determines the second node connected to the first node according to the locally stored network topology map, determines the third node connected to the second node, and respectively determines the cumulative forwarding times of the broadcast message sent to the second node through the first node and the third node. The node with more message forwarding times is prohibited to send the broadcast message to the second node, so that only one node sends the broadcast message to the second node in the forwarding process, the repeated sending of the broadcast message is avoided, and the consumption of network resources is reduced.

[0040] In the process of sending the broadcast message, the path with the least forwarding times is selected to forward the broadcast message, so as to improve the efficiency of message sending. BRIEF DESCRIPTION OF DRAWINGS

[0041] Figure 1 is a flowchart of a wireless ad hoc network communication method according to an embodiment of the present application;

[0042] Figure 2 is a schematic diagram of a wireless ad hoc network according to an embodiment of the present application;

[0043] Figure 3 is a structural schematic diagram of a wireless ad hoc network communication device according to an embodiment of the present application;

[0044] Figure 4 is a structural schematic diagram of an electronic device according to an embodiment of the present application.

[0045] Legend of reference signs: 301, acquisition unit; 302, determination unit; 303, comparison unit; 304, update unit; 400, electronic device; 401, processor; 402, communication bus; 403, user interface; 404, network interface; 405, memory. DETAILED DESCRIPTION

[0046] In order to better understand the technical solutions in the specification, the technical solutions in the specification will be clearly and completely described below in combination with the drawings in the specification. Obviously, the described embodiments are only some of the embodiments of the present application, not all.

[0047] In the description of the embodiments of the present application, "for example" is used to represent as an example, illustration or description. Any embodiment or design scheme described as "for example" in the embodiments of the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the use of "for example" and the like is intended to present the relevant concept in a specific manner.

[0048] In the description of the embodiments of the present application, the terms "first", "second" are only for descriptive purposes, and should not be interpreted or implied as indicating or implying relative importance or implicitly indicating the indicated technical features. Therefore, the features defined with "first", "second" can explicitly or implicitly include one or more of the features. The term "comprise" and its variants mean "comprise but not limited to", unless otherwise specifically emphasized.

[0049] The wireless communication device in the present application can be any electronic device with wireless communication function, such as a mobile phone, a Bluetooth speaker, a tablet computer, etc.

[0050] A wireless ad hoc network communication method is applied to a wireless communication device, and the wireless communication device is a first node, which is any node in a wireless ad hoc network. There are several nodes in the wireless ad hoc network, and only the first node is taken as an example in the embodiment. In the embodiment, each node in the wireless ad hoc network stores the connection relationship information of all nodes in the wireless ad hoc network, that is, stores the connection node list of all nodes, and constructs a network topology graph according to the connection node list of all nodes.

[0051] Referring to Figure 1 It shows a wireless ad hoc network communication method provided by an embodiment of the present application, which includes the following steps:

[0052] Step S101: The first node acquires the locally stored network topology graph, and the network topology graph includes the connection relationship of each node in the wireless ad hoc network.

[0053] In a possible implementation, the first node detects the signal strength between the first node and the second node, and when the signal strength between the first node and the second node is greater than or equal to a preset signal strength threshold, i.e., the signal strength between the first node and the second node reaches a signal strength at which a connection relationship can be established, the first node establishes a connection relationship with the second node and constructs a network topology graph; the first node obtains a node ID according to a rule of adding 1 to the cumulative number of nodes in the wireless ad hoc network, and locally stores the node ID, and then updates the locally stored network topology graph.

[0054] In the updating of the network topology graph, the first node sends a broadcast message containing the locally stored network topology graph to other nodes, receives a broadcast message containing a network topology graph stored by another node and sent by the another node, and locally stores the connection relationship in the network topology graph of the another node, and when the received network topology graph is the same as the locally stored network topology graph, the first node updates the locally stored network topology graph, and stops sending the broadcast message containing the locally stored network topology graph.

[0055] Step S102: determining the second node and the third node according to the network topology graph; the second node is a node connected to the first node, and the third node is a node connected to the second node.

[0056] Step S103: determining the first value and the second value according to the network topology graph; the first value is the cumulative forwarding number of the broadcast message sent by the first node to the second node, and the second value is the cumulative forwarding number of the broadcast message sent by the third node to the second node.

[0057] It should be noted that the forwarding number disclosed in the present specification must be sent by the forwarding node to the forwarded node directly, and must be the shortest forwarding path (i.e., the least forwarding number) of the forwarding node to the forwarded node.

[0058] Step S104: comparing the first value and the second value, and if the first value is greater than the second value, the first node prohibits sending the broadcast message to the second node.

[0059] In a possible implementation, when the first node is not the source node, the first node receives a broadcast message sent by the fourth node and including the source node ID, and updates the first message sending list to the second message sending list according to a preset rule; the preset rule is that after receiving the broadcast message sent by the sending node, the receiving node prohibits sending the broadcast message to the sending node, the first message sending list includes the fourth node, and the second message sending list does not include the fourth node.

[0060] When the first node is the source node, the first message sending list does not need to be updated, and the first message sending list is a list of nodes connected to the first node.

[0061] The first node determines a second node connected to the first node according to the locally stored connection relationship of each node, determines a third node connected to the second node, and then determines, according to the locally stored connection relationship of each node and the source node ID in the broadcast message, a first value as the cumulative number of times of forwarding of the broadcast message from the source node to the second node via the first node and a second value as the cumulative number of times of forwarding of the broadcast message from the source node to the second node via the third node, compares the first value and the second value, and determines whether the first node sends the broadcast message to the second node.

[0062] If the first value is greater than the second value, the first node prohibits sending the broadcast message to the second node; if the first value is less than the second value, the first node sends the broadcast message to the second node.

[0063] In a possible implementation, if the first value is equal to the second value, the broadcast message is sent to the second node by the node with a smaller node ID among the first node and the third node.

[0064] In a possible implementation, when the first node detects that the second node has no third node connected thereto, the first node directly sends the broadcast message to the second node, without determining the number of times of forwarding of the broadcast message from the source node to the second node via the first node, thereby reducing consumption of network resources.

[0065] When the first node detects that the signal strength between the first node and the second node is less than a preset signal strength threshold, the first node disconnects the connection relationship with the second node and updates the locally stored network topology graph.

[0066] When the first node detects that the signal strength between the first node and the new node is greater than or equal to the preset signal strength threshold, the first node establishes a connection relationship with the new node and updates the locally stored network topology graph.

[0067] The signal between the nodes can be a WiFi signal or a Bluetooth signal, or can be another wireless networking signal.

[0068] Reference is made to Figure 2 A wireless ad hoc network provided by the embodiments of the present application is shown in the figure.

[0069] Take Figure 2 the wireless ad hoc network as an example, when node 5 is a source node, node 5 sends a broadcast message to its connected nodes, i.e., node 5 sends the broadcast message to node 1 and node 6, and node 1 and node 6 prohibit sending the broadcast message to node 5.

[0070] Node 1 receives the broadcast message and determines the other connection nodes of node 2, i.e. node 1 determines that the other connection nodes of node 2 are node 3, node 7 and node 9, determines that the number of message forwarding required for sending the broadcast message from the source node to node 2 through node 3, node 7 and node 9 respectively is 5, 3 and 4, and determines that the number of message forwarding required for sending the broadcast message from the source node to node 2 through node 1 is 2, i.e. node 1 sends the broadcast message to node 2.

[0071] Node 6 receives the broadcast message and determines the other connection nodes of node 10 and node 7, determines that node 10 has no other connection node and directly sends the broadcast message to node 10. Determines that the other connection nodes of node 7 are node 2, node 8 and node 9, determines that the number of message forwarding required for sending the broadcast message from the source node to node 7 through node 2, node 8 and node 9 respectively is 3, 4 and 5, and determines that the number of message forwarding required for sending the broadcast message from the source node to node 7 through node 6 is 2, i.e. node 6 sends the broadcast message to node 7.

[0072] Node 2 receives the broadcast message and determines the other connection nodes of node 3, node 7 and node 9, determines that the other connection nodes of node 3 are node 9 and node 4, determines that the number of message forwarding required for sending the broadcast message from the source node to node 3 through node 9, node 4 and node 2 respectively is 4, 5 and 3, and determines that node 2 sends the broadcast message to node 3. Determines that the other connection nodes of node 7 are node 6, node 8 and node 9, determines that the number of message forwarding required for sending the broadcast message from the source node to node 7 through node 6, node 8, node 9 and node 2 respectively is 2, 5, 4 and 3, and determines that node 2 prohibits sending the broadcast message to node 7. Determines that the other connection nodes of node 9 are node 3, node 4, node 7 and node 8, determines that the number of message forwarding required for sending the broadcast message from the source node to node 9 through node 3, node 4, node 7, node 8 and node 2 respectively is 4, 5, 3, 4 and 3, and determines that the number of message forwarding required for sending the broadcast message from the source node to node 9 through node 7 and node 2 respectively is the same, at this time node 2 with smaller node ID sends the broadcast message to node 9.

[0073] Node 7 receives the broadcast message and determines other connection nodes of node 2, node 8 and node 9. The other connection nodes of node 2 are node 1, node 3 and node 9, and the message forwarding times from the source node to node 2 through node 1, node 3, node 9 and node 7 are 2, 5, 4 and 3 respectively, i.e. node 7 is prohibited to send the broadcast message to node 2. The other connection nodes of node 8 are node 4 and node 9, and the message forwarding times from the source node to node 8 through node 4, node 9 and node 7 are 5, 4 and 3 respectively, i.e. node 7 sends the broadcast message to node 8. The other connection nodes of node 9 are node 2, node 3, node 4 and node 8, and the message forwarding times from the source node to node 9 through node 2, node 3, node 4, node 8 and node 7 are 3, 4, 5, 4 and 3 respectively, i.e. the message forwarding times from the source node to node 9 through node 2 and node 7 are the same, and node 7 is prohibited to send the broadcast message to node 9 because the node ID of node 7 is larger than that of node 2.

[0074] Node 3 receives the broadcast message and determines that node 3 is prohibited to send the broadcast message to node 9 and node 3 sends the broadcast message to node 4 according to the above determination method.

[0075] Node 9 receives the broadcast message and determines that node 9 is prohibited to send the broadcast message to node 3, node 9 is prohibited to send the broadcast message to node 4, node 9 is prohibited to send the broadcast message to node 7 and node 9 is prohibited to send the broadcast message to node 8 according to the above determination method.

[0076] Node 8 receives the broadcast message and determines that node 8 is prohibited to send the broadcast message to node 4 and node 8 is prohibited to send the broadcast message to node 9 according to the above determination method.

[0077] Node 4 receives the broadcast message and determines that node 4 is prohibited to send the broadcast message to node 8 and node 4 is prohibited to send the broadcast message to node 9 according to the above determination method.

[0078] When the wireless self-organizing network structure and the source node are not changed, the sending path of the broadcast message does not need to be determined again in the second time of sending the broadcast message, and the broadcast of the message in the whole network can be directly completed according to the path in the last time.

[0079] When the wireless self-organizing network structure changes, i.e. a new node is connected to the wireless self-organizing network, a node in the wireless self-organizing network is disconnected from the wireless self-organizing network, or the connection relationship of the nodes in the wireless self-organizing network is changed due to route change, each node in the wireless self-organizing network updates the network topology graph, determines the sending path of the message according to the above determination method, selects the path with the minimum broadcast message forwarding times to send the broadcast message, avoids multiple nodes sending the broadcast message to the same node, realizes the efficient sending of the broadcast message, and improves the utilization rate of network resources.

[0080] With reference to Figure 3 It shows a structure schematic diagram of a wireless self-organizing network communication device provided by an embodiment of the application. The device is a wireless communication device, the wireless communication device is a first node, the first node is any node in the wireless self-organizing network, and the device comprises an acquisition unit 301, a determination unit 302, and a comparison unit 303, wherein

[0081] The acquisition unit 301 is configured to acquire a network topology graph stored locally by the first node. The network topology graph comprises the connection relationship of the nodes in the wireless self-organizing network.

[0082] The determination unit 302 is configured to determine a second node and a third node according to the network topology graph. The second node is a node connected to the first node, and the third node is a node connected to the second node. The determination unit 302 is further configured to determine a first value and a second value according to the network topology graph. The first value is the cumulative forwarding times of the broadcast message sent from the first node to the second node, and the second value is the cumulative forwarding times of the broadcast message sent from the third node to the second node.

[0083] The comparison unit 303 is configured to compare the first value and the second value. If the first value is greater than the second value, the first node is prohibited to send the broadcast message to the second node.

[0084] In a possible implementation, the determination unit 302 is further configured to detect the signal strength between the first node and the second node. When the signal strength is greater than or equal to a preset signal strength threshold, the first node establishes a connection relationship with the second node, and constructs the network topology graph.

[0085] In a possible implementation, the device further comprises an updating unit 304. The updating unit 304 is configured to generate a node ID, locally store the node ID, and update the network topology graph. The node ID is 1 plus the cumulative number of nodes in the wireless self-organizing network.

[0086] In a possible implementation, if the first value is equal to the second value, the node with the smaller node ID among the first node and the third node sends the broadcast message to the second node.

[0087] In a possible implementation, the updating unit 304 is further configured to update a message sending list of the first node; after the first node receives the broadcast message sent by the fourth node, the first message sending list is updated to a second message sending list according to a preset rule, the preset rule is that after a receiving node receives a broadcast message sent by a sending node, the receiving node is prohibited from sending a broadcast message to the sending node, the fourth node is included in the first message sending list, and the fourth node is not included in the second message sending list.

[0088] In a possible implementation, when the signal strength between the first node and the second node is less than a preset signal strength threshold, the first node disconnects the connection relationship with the second node, and updates the network topology graph.

[0089] In a possible implementation, the determining unit 302 is further configured to detect a signal strength between the first node and a fifth node, and when the signal strength between the first node and the fifth node is greater than or equal to the signal strength threshold, the first node establishes a connection relationship with the fifth node, and updates the network topology graph, the fifth node being a newly added node in the wireless ad hoc network.

[0090] In a possible implementation, the signal between the first node and the second node is a WiFi signal or a Bluetooth signal.

[0091] It should be noted that the apparatus provided in the above embodiments is only used as an example for the division of the above functional modules in realizing the functions thereof, and in actual applications, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the above-described functions. In addition, the apparatus and method embodiments provided in the above embodiments belong to the same concept, and the specific implementation process is detailed in the method embodiments, which will not be described here.

[0092] Referring to FIG. 4, a structural schematic diagram of an electronic device is provided in the embodiments of the present application. As shown in the figure, the electronic device 400 can include at least one processor 401, at least one network interface 404, a user interface 403, a memory 405, and at least one communication bus 402. Figure 4

[0093] The communication bus 402 is configured to realize the connection and communication between the components.

[0094] The user interface 403 can include a display screen (Display) and a camera (Camera), and the optional user interface 403 can further include a standard wired interface and a wireless interface.

[0095] The network interface 404 can optionally include a standard wired interface and a wireless interface (such as a WI-FI interface). ​

[0096] The processor 401 can include one or more processing cores. The processor 401 connects various parts within the server through various interfaces and lines, performs various functions of the server and processes data by running or executing instructions, programs, code sets or instruction sets stored in the memory 405, and calling data stored in the memory 405. Alternatively, the processor 401 can be implemented in at least one of a hardware form of a digital signal processing (DSP), a field-programmable gate array (FPGA), and a programmable logic array (PLA). The processor 401 can integrate a combination of one or more of a central processing unit (CPU), a graphics processing unit (GPU), and a modem. Among them, the CPU mainly processes operating systems, user interfaces, and application programs; the GPU is responsible for rendering and drawing the content to be displayed on the display screen; and the modem is used for processing wireless communication. It can be understood that the above-mentioned modem can also not be integrated into the processor 401, but can be implemented by a separate chip.

[0097] The memory 405 can include a random access memory (RAM) and a read-only memory (ROM). Alternatively, the memory 405 includes a non-transitory computer-readable storage medium. The memory 405 can be used to store instructions, programs, codes, code sets or instruction sets. The memory 405 can include a program storage area and a data storage area, wherein the program storage area can store instructions for implementing an operating system, instructions for at least one function (such as a touch function, a sound playing function, an image playing function, etc.), instructions for implementing the above-mentioned various method embodiments, etc.; the data storage area can store data involved in the above-mentioned various method embodiments, etc. The memory 405 can alternatively be at least one storage device located away from the aforementioned processor 401. As shown, the memory 405 as a computer storage medium can include an operating system, a network communication module, a user interface module, and an application program of a wireless ad hoc network communication method. Figure 4

[0098] In Figure 4 ​In the electronic device 400 shown, the user interface 403 is mainly used to provide an interface for the user to input, and obtain data input by the user; and the processor 401 can be used to call an application program stored in the memory 405 and storing a wireless ad hoc network communication method, which, when executed by one or more processors, causes the electronic device 400 to perform the method described in one or more of the above embodiments.

[0099] It should be noted that, for the foregoing method embodiments, in order to simply describe, they are all expressed as a series of action combinations, but those skilled in the art should know that the present application is not limited to the action sequence described, because according to the present application, certain steps can be performed in other sequences or simultaneously. Secondly, those skilled in the art should know that the embodiments described in the specification all belong to preferred embodiments, and the actions and modules involved are not necessarily required by the present application.

[0100] In the above embodiments, the description of each embodiment has its own emphasis, and the parts not described in detail in a certain embodiment can be referred to the related description of other embodiments.

[0101] The above is only exemplary embodiments of the present disclosure, and cannot limit the scope of the present disclosure. That is, any equivalent changes and modifications made according to the teachings of the present disclosure are still within the scope of the present disclosure. Other embodiments of the present disclosure will be easily obtained by those skilled in the art after considering the specification and the true disclosure. The present application is intended to cover any variations, uses, or adaptive changes of the present disclosure, which follow the general principles of the present disclosure and include common knowledge or conventional technical means in the technical field not disclosed by the present disclosure. The specification and examples are only considered as exemplary, and the scope and spirit of the present disclosure are defined by the claims.

Claims

1. A wireless ad hoc network communication method, characterized in that, The method, applied to a wireless communication device, wherein the wireless communication device is a first node, and the first node is any node in the wireless ad hoc network, includes: The first node obtains a locally stored network topology map, which includes the connection relationships of each node in the wireless ad hoc network. After receiving the broadcast message sent by the fourth node, the first node updates the first message sending list to the second message sending list according to a preset rule. The preset rule is that after the receiving node receives the broadcast message sent by the sending node, the receiving node is prohibited from sending the broadcast message to the sending node. The first message sending list includes the fourth node, but the second message sending list does not include the fourth node. Based on the network topology diagram, a second node and a third node are determined; the second node is a node connected to the first node, and the third node is a node connected to the second node. Based on the network topology diagram, a first value and a second value are determined; the first value is the cumulative number of times the broadcast message is forwarded from the first node to the second node, and the second value is the cumulative number of times the broadcast message is forwarded from the third node to the second node. Compare the size of the first value and the second value; If the first value is greater than the second value, then the first node is prohibited from sending the broadcast message to the second node; If the first value is equal to the second value, then the broadcast message is sent to the second node by the node with the smaller node ID between the first node and the third node.

2. The wireless ad hoc network communication method according to claim 1, characterized in that, Before the first node obtains the network topology map of its local storage, the following steps are also included: The first node detects the signal strength between the first node and the second node. When the signal strength is greater than or equal to a preset signal strength threshold, the first node and the second node establish a connection relationship and construct a network topology.

3. The wireless ad hoc network communication method according to claim 1, characterized in that, The method further includes: The first node generates a node ID and stores the node ID locally, thereby updating the network topology map. The node ID is the cumulative number of nodes in the wireless ad hoc network plus 1.

4. The wireless ad hoc network communication method according to claim 2, characterized in that, The method further includes: The first node detects the signal strength between the first node and the second node. When the signal strength between the first node and the second node is less than the preset signal strength threshold, the first node disconnects from the second node and updates the network topology.

5. A wireless ad hoc network communication method according to claim 2, characterized in that, The method further includes: When the first node detects that the signal strength between the first node and the fifth node is greater than or equal to the signal strength threshold, the first node establishes a connection with the fifth node and updates the network topology. The fifth node is a newly added node in the wireless ad hoc network.

6. The wireless ad hoc network communication method according to claim 2, characterized in that, The signal between the first node and the second node is a WiFi signal or a Bluetooth signal.

7. A wireless ad hoc network communication device, characterized in that, For executing a wireless ad hoc network communication method as described in claim 1, the device is a wireless communication equipment, the wireless communication equipment is a first node, the first node is any node in the wireless ad hoc network, and the device includes an acquisition unit (301), a determination unit (302), and a comparison unit (303), wherein... The acquisition unit (301) is used to acquire the network topology map stored locally by the first node, the network topology map including the connection relationship of each node in the wireless ad hoc network; The determining unit (302) is used to determine a second node and a third node according to the network topology diagram; the second node is a node connected to the first node, and the third node is a node connected to the second node; and to determine a first value and a second value according to the network topology diagram; the first value is the cumulative number of times a broadcast message is forwarded from the first node to the second node, and the second value is the cumulative number of times a broadcast message is forwarded from the third node to the second node; The comparison unit (303) is used to compare the size of the first value and the second value; if the first value is greater than the second value, the first node is prohibited from sending the broadcast message to the second node.

8. An electronic device (400), characterized in that, The device includes a processor (401), a memory (405), a user interface (403), and a network interface (404), wherein the memory (405) is used to store instructions, the user interface (403) and the network interface (404) are used to communicate with other devices, and the processor (401) is used to execute the instructions stored in the memory (405) to cause the electronic device (400) to perform the method as described in any one of claims 1-6.

Images