CN113316168B

CN113316168B - Node networking parameter modification method and device, storage medium and electronic equipment

Info

Publication number: CN113316168B
Application number: CN202110492361.2A
Authority: CN
Inventors: 赵展峰
Original assignee: Beijing Hefeng Technology Co ltd
Current assignee: Beijing Hefeng Technology Co ltd
Priority date: 2021-05-06
Filing date: 2021-05-06
Publication date: 2022-12-23
Anticipated expiration: 2041-05-06
Also published as: CN113316168A

Abstract

The disclosure relates to a method, a device, a storage medium and an electronic device for modifying node networking parameters, wherein the method comprises the following steps: acquiring link quality between every two nodes in the ad hoc network of the network parameters to be modified; determining an optimal path from the target node to each other node according to the link quality to construct an optimal path tree of the ad hoc network; and modifying the networking parameters of each node in sequence according to the hierarchical relation of the optimal path tree. Therefore, technicians are not required to manually determine the modification sequence of each node, the complexity and the inefficiency of manually determining the modification sequence are avoided, the efficiency of modifying the networking parameters of each node in the ad hoc network is improved, the method is not limited by the scale of the ad hoc network and the network topology structure, and the application range of the method for modifying the networking parameters of the nodes is enlarged. In addition, the method can initiate to modify the networking parameters from any node without local configuration of each node, thereby simplifying the process of modifying the networking parameters of each node in the ad hoc network.

Description

Node networking parameter modification method and device, storage medium and electronic equipment

Technical Field

The present disclosure relates to the field of wireless ad hoc network technologies, and in particular, to a method and an apparatus for modifying a node networking parameter, a storage medium, and an electronic device.

Background

The wireless ad hoc network is a wireless mobile network designed by adopting a brand-new wireless mesh network concept, has the characteristics of self-organization, peer-to-peer and multi-hop, is a centerless distributed network architecture, has flexible and changeable network topology, and can adapt to various complex and changeable application scenes. In practical use, the wireless ad hoc network needs to meet the requirements of setting different networking parameters in different application scenarios, however, the wireless ad hoc network needs to communicate only when networking parameters of all nodes in the network are consistent, and therefore, each node in the network needs to be modified.

In a centralized network, the networking parameters of other nodes are modified one by the central node, and finally the networking parameters of the central node are modified to complete the modification of the networking parameters of all the nodes in the network.

Disclosure of Invention

The present disclosure provides a method, an apparatus, a storage medium, and an electronic device for modifying a node networking parameter, so as to improve efficiency of modifying a node networking parameter in an ad hoc network.

In order to achieve the above object, a first aspect of the present disclosure provides a method for modifying a node networking parameter, where the method includes:

acquiring link quality between every two nodes in the ad hoc network of the network parameters to be modified;

determining an optimal path from a target node to each other node according to the link quality to construct an optimal path tree of the ad hoc network, wherein the target node is any node in the ad hoc network;

and modifying the networking parameters of each node in sequence according to the hierarchical relation of the optimal path tree.

Optionally, before the sequentially modifying the networking parameters of each node according to the hierarchical relationship of the optimal path tree, the method further includes:

and determining that the link quality of each path on the optimal path tree is greater than or equal to a preset threshold value.

Optionally, the target node is a root node of the optimal path tree; the modifying the networking parameters of each node in sequence according to the hierarchical relationship of the optimal path tree comprises the following steps:

sequentially controlling each level node to send a networking parameter modification instruction to the child nodes of the level node according to the level relation of the optimal path tree, wherein the root node sends the networking parameter modification instruction to each child node of the root node at the beginning;

when the leaf node of each level receives the networking parameter modification instruction, controlling the leaf node to modify the networking parameters, and feeding back a modification success response to a father node of the leaf node;

and controlling the father node to forward the networking parameter modification instruction to each child node of the father node aiming at each level until a leaf node of the last level modifies the networking parameters according to the received networking parameter modification instruction and sends a modification success response to the father node of the father node, wherein the father node of each level modifies the self networking parameters and sends the modification success response to the father node of the father node when receiving the modification success response sent by each child node of the father node, and the father node does not modify the self networking parameters and sends the modification failure response to the father node of the father node when receiving the modification failure response sent by at least one child node of the father node.

Optionally, the root node and the parent node of each level correspond to a receiving time, and the root node and the parent node of each level receive responses fed back by their respective child nodes within the receiving time given by the root node and the parent node of each level.

Optionally, the method further comprises:

aiming at a father node of each level, when a response sent by at least one child node of the father node is not received within the preset time length, determining whether the child node which does not send the response is located in an online list of the father node, wherein the response comprises a modification success response and a modification failure response;

if at least one child node in the child nodes which do not send the response is determined to be located in the online list of the father node, determining that the child nodes which do not send the response and are located in the online list fail to modify networking parameters, and sending modification failure responses to the father node of the father node; and

and if determining that each child node which does not send the response is not located in the online list of the father node, determining that each child node which does not send the response successfully modifies the networking parameters, and sending a successful modification response to the father node of the father node.

Optionally, the method further comprises:

when the modification is finished, if the nodes of the network parameters which are not successfully modified still exist in the optimal path tree, determining the optimal path tree only comprising the nodes of the network parameters which are not successfully modified, and executing the step of modifying the network parameters of each node in sequence according to the hierarchical relationship of the optimal path tree until the network parameters of each node in the optimal path tree are successfully modified.

Optionally, the determining an optimal path from the target node to each other node according to the link quality includes:

symmetrically processing the link quality between every two nodes to ensure that the receiving and transmitting link quality between the two nodes is the same;

and determining the optimal path from the target node to each other node by using an optimal path algorithm according to the link quality after the symmetric processing.

A second aspect of the present disclosure provides an apparatus for modifying a node networking parameter, where the apparatus includes:

the acquisition module is used for acquiring the link quality between every two nodes in the ad hoc network of the networking parameters to be modified;

a first determining module, configured to determine, according to the link quality, an optimal path from a target node to each other node to construct an optimal path tree of the ad hoc network, where the target node is any node in the ad hoc network;

and the modification module is used for sequentially modifying the networking parameters of each node according to the hierarchical relationship of the optimal path tree.

A third aspect of the present disclosure provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the method provided by the first aspect of the present disclosure.

A fourth aspect of the present disclosure provides an electronic device, comprising:

a memory having a computer program stored thereon;

a processor for executing the computer program in the memory to implement the steps of the method provided by the first aspect of the present disclosure.

By the technical scheme, the optimal path from the target node to each other node can be determined according to the link quality between every two nodes in the ad hoc network with the networking parameters to be modified, so that the optimal path tree of the ad hoc network is constructed, and the networking parameters of each node are sequentially modified according to the hierarchical relationship of the optimal path tree. Therefore, technicians are not required to manually determine the modification sequence of each node, the complexity and the inefficiency of manually determining the modification sequence are avoided, the efficiency of modifying the networking parameters of each node in the ad hoc network is improved, the method is not limited by the scale of the ad hoc network and the network topology structure, and the application range of the method for modifying the networking parameters of the nodes is enlarged. In addition, any node can be used as a target node, namely, the modification of networking parameters can be initiated from any node, and each node does not need to be locally configured, so that the process of modifying the networking parameters of each node in the ad hoc network is simplified.

Additional features and advantages of the disclosure will be set forth in the detailed description which follows.

Drawings

The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description serve to explain the disclosure without limiting the disclosure. In the drawings:

fig. 1 is a diagram illustrating modification of a node networking parameter in a related art according to an example embodiment.

Figure 2 is a flow diagram illustrating a method for modifying a node networking parameter in accordance with an example embodiment.

FIG. 3 is a flow diagram illustrating a method of constructing an optimal path tree in accordance with an exemplary embodiment.

FIG. 4 is a diagram illustrating an optimal path tree, according to an example embodiment.

FIG. 5 is a schematic diagram illustrating another optimal path tree in accordance with an exemplary embodiment.

Figure 6 is a diagram illustrating an optimal path tree including only nodes that have not successfully modified networking parameters, according to an example embodiment.

Figure 7 is a block diagram illustrating an apparatus for modifying a node networking parameter, in accordance with an example embodiment.

FIG. 8 is a block diagram illustrating an electronic device in accordance with an example embodiment.

Detailed Description

The following detailed description of the embodiments of the disclosure refers to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the present disclosure, are given by way of illustration and explanation only, not limitation.

In the related art, the networking parameters of all nodes in the wireless ad hoc network are modified in the following two ways. The method comprises the following steps: each node of the wireless ad hoc network carries out local networking parameter modification, and the wireless ad hoc network has the advantages of high success rate and the defects that each node needs to be attended by people and each node needs to be informed one by one to carry out modification. However, in practical application, the wireless ad hoc network has a large scale and contains a large number of nodes, and each node is not attended by people, so that the method has limited conditions and is not flexible enough. The second method comprises the following steps: the method has the advantages that other nodes are not needed to be attended, the node can complete the method only by the node, the defect that technicians are needed to determine the modification sequence of the nodes according to the topology condition of the wireless ad hoc network, and then the modification of the networking parameters of each node must be completed in sequence according to the modification sequence. The method can also be applied to the situations of few nodes and simple topology, but for the situations of many nodes and complex topology, the technical personnel can very difficultly determine the modification sequence of the nodes, and the wrong modification sequence can also cause the situation that one or some nodes are offline.

Fig. 1 is a diagram illustrating modification of a node networking parameter in a related art according to an example embodiment. As shown in fig. 1, the ad hoc network includes a node a, a node B, a node C, and a node D, and the topological structures of these nodes are shown in the left diagram of fig. 1, where the node a is a node initiating network parameter modification, the node B is a relay node, and the node C and the node D are modified nodes. Node C and node D are communicatively coupled to node a via relay node B. The normal modification order should be node C and node D, node B and node a. However, if the modification order determined by the technician is wrong, the networking parameters of the relay node B are modified first, if the nodes C and D are not modified yet. Since the networking parameters of the relay node B are different from those of the node a, the node C and the node D, the network of the node C and the node D is disconnected from the node a, that is, the node C and the node D are disconnected, so that the node a can not modify the node C and the node D any more, as shown in the right diagram of fig. 1.

In view of this, the present disclosure provides a method, an apparatus, a storage medium, and an electronic device for modifying a node networking parameter, so as to improve efficiency of modifying a node networking parameter in an ad hoc network.

Figure 2 is a flow diagram illustrating a method for modifying a node networking parameter in accordance with an example embodiment. As shown in fig. 2, the method may include the following steps.

In step 201, link quality between every two nodes in the ad hoc network whose networking parameters are to be modified is obtained.

In this disclosure, the electronic device executing the method for modifying the node networking parameter provided by this disclosure may access any node in the ad hoc network whose networking parameter is to be modified, and may further obtain, from the node accessed by the electronic device, the link quality between every two nodes in the ad hoc network. Wherein the link quality characterizes the energy and quality of the data frames received between the two nodes.

It should be noted that, the specific manner in which the node accessed by the electronic device determines the link quality between every two nodes belongs to a mature technology, and this disclosure does not specifically limit this.

In step 202, an optimal path from a target node to each other node is determined according to the link quality to construct an optimal path tree of the ad hoc network, wherein the target node is any node in the ad hoc network.

In this disclosure, the target node is a node accessed by the electronic device executing the method for modifying the node networking parameter provided by the present disclosure, and the electronic device may access any node in the ad hoc network to which the networking parameter is to be modified, that is, the target node is any node in the ad hoc network.

After the link quality between every two nodes in the ad hoc network is obtained, the target node can be used as a root node, and the optimal path from the target node to each other node is determined according to an optimal path algorithm, so that an optimal path tree of the ad hoc network is constructed. A specific construction manner of the optimal path tree will be described in detail below.

In step 203, the networking parameters of each node are modified in sequence according to the hierarchical relationship of the optimal path tree.

After the optimal path tree is constructed, according to the hierarchical relationship of the optimal path tree, the modification sequence of modifying the networking parameters of each node in the ad hoc network is determined, and then the networking parameters of each node in the ad hoc network can be modified in sequence according to the modification sequence.

By adopting the technical scheme, the optimal path from the target node to each other node can be determined according to the link quality between every two nodes in the ad hoc network with the networking parameters to be modified so as to construct the optimal path tree of the ad hoc network, and then the networking parameters of each node are modified in sequence according to the hierarchical relationship of the optimal path tree. Therefore, technicians are not required to manually determine the modification sequence of each node, the complexity and the inefficiency of manually determining the modification sequence are avoided, the efficiency of modifying the networking parameters of each node in the ad hoc network is improved, the method is not limited by the scale of the ad hoc network and the network topology structure, and the application range of the method for modifying the networking parameters of the nodes is enlarged. In addition, any node can be used as a target node, namely, the modification of the networking parameters can be initiated from any node, and each node does not need to be locally configured, so that the process of modifying the networking parameters of each node in the ad hoc network is simplified.

In order to facilitate those skilled in the art to better understand the method for modifying the node networking parameters provided in the present disclosure, a detailed description of a specific implementation of the method is provided in the following full description.

First, a construction method of the optimal path tree will be described in detail. FIG. 3 is a flow diagram illustrating a method of constructing an optimal path tree in accordance with an exemplary embodiment. As shown in fig. 3, the method of constructing the optimal path tree may include step 301 and step 302.

In step 301, the link quality between each two nodes is symmetrically processed to make the link quality between the two nodes the same.

It should be noted that, for any two nodes in the ad hoc network, the link quality is different for different transmission directions. Illustratively, table 1 is a table of link qualities between every two nodes in the ad hoc network to be modified in networking parameters. As shown in table 1, for example, the link quality corresponding to the transmission direction from node a to node B is 11, and the link quality corresponding to the transmission direction from node B to node a is 8. In table 1, if there is no link quality between two nodes, it indicates that no communication is performed between the two nodes, for example, no communication is performed between node C and node D.

Table 1 is a table of link quality between every two nodes in the ad hoc network to be modified in networking parameters

	A	B	C	D	E	F	G	H
									A		11	-1	11		10
B	8		13	2	11	5
									C	2	8			5
D	10	-1					-2
									E		10			18	8
F		-1	5		15
									G				-1		8
H	5				2		8

When the optimal path tree is determined, the link quality between two nodes needs to be considered, and if the link quality between two nodes is different, different optimal path trees are constructed when the optimal path tree is constructed. Therefore, in the present disclosure, in order to simplify the way of constructing the optimal path tree, the link quality between every two nodes may be first symmetrically processed to make the link quality between any two nodes the same.

Illustratively, the symmetric processing may be performed according to the formula e [ i ] [ j ] = e [ j ] [ i ] = min (e [ i ] [ j ], e [ j ] [ i ]). For example, the link quality corresponding to the transmission direction from node a to node B is also determined to be 8, so that the link quality corresponding to the transmission direction from node a to node B is the same as the link quality corresponding to the transmission direction from node B to node a, and is 8. The link quality table between the nodes after the symmetric processing in the above manner is shown in table 2.

Table 2 is a table of link quality between each two nodes after symmetric processing

	A	B	C	D	E	F	G	H
									A		8	-1	10		5
B	8		8	-1	10	-1
									C	-1	8			5
D	10	-1					-2
									E		10			15	2
F		-1	5		15
									G				-2		8
H	5				2		8

In step 302, according to the link quality after the symmetric processing, an optimal path from the target node to each other node is determined by using an optimal path algorithm.

And after the link quality after the symmetrical processing is obtained, constructing an optimal path tree by utilizing the optimal path from the target node to each other node by utilizing an optimal path algorithm according to the link quality after the symmetrical processing.

The basic idea of the optimal path algorithm is as follows: firstly, adding a target node into a known optimal path node set, adding other nodes left in the ad hoc network into an unknown optimal path node set, then, taking out a node with the best link quality from the nodes in the known optimal path node set each time from the unknown optimal path node set, and putting the node into the known optimal path node set until the unknown optimal path node set is empty.

Specifically, a known optimal path node set Y and an unknown optimal path node set N. Firstly, adding the target node into the set Y, adding the other nodes into the set N, and enabling the optimal path tree T to be empty. Then, a node is taken from the set N so that the link quality e [ Ni ] [ Yi ] of Ni- > Yi is maximized. Wherein, ni is a node in the unknown optimal path node set N, and Yi is a node in the optimal path node set Y. Thereafter, the node Ni is removed from set N and added to set Y. And judging whether the node Yi exists in the optimal path tree T, if not, adding Yi into T, and if so, adding the node Ni into a Yi adjacent point list in T, namely, adding Ni into a child node of Yi.

For example, assuming that node a in table 1 or table 2 is the target node, node a is located in the optimal path node set Y, and node B, C, D, E, F, G, H is located in the unknown optimal path node set N. Then, the node with the maximum link quality to the node A, namely the node D, is determined from the unknown optimal path node set N, the node D is moved from the unknown optimal path node set N to the optimal path node set Y, and the node C is determined as a child node of the node A in the optimal path tree T, wherein the node A is a root node.

Then, the node with the highest link quality, i.e., node B, of node a and node D is determined from the unknown optimal path node set N (which includes node B, C, E, F, G, H at this time). At this time, the node B is moved from the unknown optimal path node set N to the optimal path node set Y. And, since the link quality from the node B to the node a is 8 and the link quality from the node B to the node D is-1, the node B is determined as a child node of the node a in the optimal path tree T.

Then, the nodes with the maximum link quality of the node a, the node D and the node B, that is, the node H, the node G and the node E, are determined from the unknown optimal path node set N (which includes the node C, E, F, G, H at this time). However, since the link quality from the node H to the node a is 5, the link quality from the node G to the node D is-2, and the link quality from the node E to the node B is 10, the node E is moved from the unknown optimal path node set N to the optimal path node set Y this time. And, in the optimal path tree T, the node E is determined as a child node of the node B.

Then, the nodes with the maximum link quality of the node a, the node D, the node B and the node E, that is, the node H, the node G, the node C and the node F, are respectively determined from the unknown optimal path node set N (which includes the node C, F, G, H at this time). And the link quality 15 from the node F to the node E is the maximum, and the node F is moved from the unknown optimal path node set N to the optimal path node set Y. And, in the optimal path tree T, the node F is determined as a child node of the node E.

Then, the nodes with the maximum link quality of the node a, the node D, the node B, the node E and the node F, that is, the node H, the node G, the node C, the node H and the node C, are respectively determined from the unknown optimal path node set N (which includes the node C, G, H at this time). And the link quality 8 from the node C to the node B is maximum, and the node C is moved from the unknown optimal path node set N to the optimal path node set Y. And, in the optimal path tree T, the node C is determined as a child node of the node B.

Then, the nodes with the maximum link quality of the node a, the node D, the node B, the node E, the node F and the node C, that is, the node H, the node G and the node C, are respectively determined from the unknown optimal path node set N (including the node G, H at this time). And the link quality from the node H to the node A is 5 the maximum, and the node H is moved from the unknown optimal path node set N to the optimal path node set Y. And, in the optimal path tree T, the node H is determined as a child node of the node a.

Finally, respectively determining the nodes with the maximum link quality of the node A, the node D, the node B, the node E, the node F, the node C and the node H from the unknown optimal path node set N (including the node G at this time), namely none, the node G, the node C and the node H. And the link quality from the node G to the node H is 8 the maximum, and the node G is moved from the unknown optimal path node set N to the optimal path node set Y. And, in the optimal path tree T, the node G is determined as a child node of the node H. At this point, the unknown optimal path node set N is empty, and the optimal path tree T obtained at this time is shown in fig. 4. Wherein the values on each transmission link in fig. 4 characterize the link quality of that transmission link.

By adopting the technical scheme, the optimal path tree from networking is determined according to the optimal path from the target node to each other node, then the networking parameters of each node are modified in sequence based on the hierarchical relation of the optimal path tree, and thus, the paths along which the networking parameters of the nodes are modified are all the paths with the optimal current transmission quality, so that the success rate of modifying the networking parameters of the nodes in the wireless ad hoc network is improved to a great extent, namely, the efficiency of modifying the networking parameters of each node in the ad hoc network is further improved.

In addition, considering that the communication between nodes is affected when the link quality of a path is poor, when the link quality of a certain path in the optimal path tree is poor, the networking parameter modification instruction cannot be successfully transmitted, so that the nodes on the path with the poor link quality cannot receive the networking parameter modification instruction sent by the parent node, and the nodes on the path with the poor link quality cannot successfully modify the networking parameters of the nodes. Therefore, in order to avoid the above problem, in the present disclosure, before modifying the networking parameter of each node, it is further determined whether the link quality of each path on the optimal path tree is greater than or equal to a preset threshold, and when determining that the link quality of each path is greater than or equal to the preset threshold, step 203 in fig. 2 is executed to sequentially modify the networking parameter of each node according to the hierarchical relationship of the optimal path tree. Otherwise, stopping modifying the networking parameters of each node in the ad hoc network.

The following describes a specific embodiment in which step 203 modifies the networking parameters of each node in turn according to the hierarchical relationship of the optimal path tree.

Step 203 may sequentially modify the networking parameters of each node according to the hierarchical relationship of the optimal path tree in a specific manner:

(1) And sequentially controlling the nodes of each level to send networking parameter modification instructions to the child nodes of the nodes according to the level relation of the optimal path tree. Initially, a root node (i.e., a target node accessed by an electronic device executing the method for modifying the networking parameters of the node) in the optimal path tree sends a networking parameter modification instruction to each child node of the root node.

In this disclosure, the networking parameter modification instruction is used to instruct the node that receives the instruction to modify the networking parameter, where the networking parameter modification instruction may include the networking parameter to be modified and the modified networking parameter.

For example, assuming that the structure of the optimal path tree is as shown in fig. 4, the root node a first sends a networking parameter modification instruction to its child node B, D, H, then the node H sends a networking parameter modification instruction to its child node G and the node B to its child nodes E and C, and finally the node E sends a networking parameter modification instruction to its child node F.

(2) When the leaf node of each level receives the networking parameter modification instruction, the leaf node is controlled to modify the networking parameters, and the success of modification is fed back to the father node of the leaf node.

For example, as shown in fig. 4, node D, node G, node C, and node F all belong to leaf nodes, and when they receive a networking parameter modification instruction sent by their respective parent nodes (e.g., the parent node of node D is node a, the parent node of node G is node H, and the parent node of node C is node B), since they do not have child nodes, there is no need to send a networking parameter modification instruction to their child nodes, so that it is only necessary to directly modify their networking parameters and feed a modification success response back to their parent nodes, so as to inform the parent nodes that their networking parameters have been successfully modified.

(3) And controlling the father node of each level to forward a networking parameter modification instruction to each child node of the father node until the leaf node of the last level modifies the networking parameters according to the received networking parameter modification instruction and sends a modification success response to the father node of the father node. When receiving the modification failure response sent by at least one child node, the father node does not modify the networking parameters of the father node and sends the modification failure response to the father node of the father node.

In the disclosure, the parent node of each level may forward the networking parameter modification instruction to each child node thereof until the leaf node of the last level receives the networking parameter modification instruction and sends a modification success response to its parent node. Illustratively, as shown in fig. 4, the parent node H may send a networking parameter modification instruction to its child node G, and since the child node G is a leaf node, when it receives the networking parameter modification instruction, it modifies the networking parameter, and sends a modification success response to the parent node H. And, the parent node H modifies the self-networking parameters and sends a modification success response to its parent node (i.e., root node a) upon receiving the modification success response sent by the child node G. Similarly, the father node E sends a networking parameter modification instruction to the child node F, and since the child node F is a leaf node, when receiving the networking parameter modification instruction, the father node E modifies the networking parameter and sends a modification success response to the father node E. And the father node E modifies the self networking parameters and sends a modification success response to the father node B when receiving the modification success response sent by the child node F. Similarly, when the child node C receives the networking parameter modification instruction, the networking parameter modification is performed, and a modification success response is sent to the parent node B. When the father node B receives the modification success response sent by the child node E and the child node C, the father node B modifies the self-networking parameters and sends the modification success response to the father node (namely, the root node A). When the root node A receives the successful modification response sent by the child node B, D, H, the self networking parameters are modified, and thus the networking parameters of all nodes in the ad hoc network are modified.

In addition, if the parent node of each hierarchy receives the modification failure response sent by at least one child node of the parent node, the parent node does not modify the self-networking parameters and sends the modification failure response to the parent node of the parent node. For example, if the leaf node does not receive the networking parameter modification instruction, or fails to modify the networking parameter after receiving the networking parameter modification instruction, a modification failure response is sent to its parent node. As shown in fig. 4, it is assumed that the leaf node F does not receive the networking parameter modification instruction, or fails to modify the networking parameters after receiving the networking parameter modification instruction, and sends a modification failure response to its parent node E, and the node E does not modify its networking parameters when receiving the modification failure response, and sends a modification failure response to its parent node (i.e., node B). The node B also does not modify the self-networking parameters when receiving the failure modification response sent by the child node E, and further sends the failure modification response to the root node A, and the root node A also does not modify the self-networking parameters when receiving the failure modification response sent by the node B.

It should be noted that, if the node H receives the modification success response sent by its child node G, the node H modifies its own networking parameters and sends the modification success response to the root node. That is, when the modification of the networking parameters of the path of the node a, the node B, the node E, and the node F fails, the modification of the networking parameters of the path of the node H and the node G is not affected.

By adopting the mode, when the networking parameters of the nodes in the ad hoc network are modified, the nodes are initiated by the root node and gradually spread in a single hop along the path of the optimal path tree, the transmission of the networking parameter modification instruction and the response every time is limited to be completed in the single hop, and each path is the path with the optimal current transmission quality, so the success rate of modifying the networking parameters of the wireless ad hoc network nodes is improved to a great extent, and the efficiency of modifying the networking parameters of each node in the ad hoc network is further improved.

In practical application, the modification duration of the networking parameters of the nodes in the ad hoc network is limited, and the nodes in the ad hoc network cannot be waited for indefinitely to complete the modification of the networking parameters. Therefore, in one embodiment, the root node and the parent node of each hierarchy respectively have a receiving duration, and the root node and the parent node of each hierarchy respectively receive the response fed back by the respective child node within their respective receiving durations. Wherein, the response fed back by the child node comprises a modification success response and a modification failure response.

Illustratively, as shown in fig. 4, the root node a starts its response timer when sending a networking parameter modification instruction to its child node B, D, H, and the response timer is used to limit the root node a to receive the response fed back by the child node B, D, H only within its receiving duration. The parent node H starts its response timer when forwarding the networking parameter modification instruction to its child node G, so as to limit the parent node H to receive the response fed back by the child node G only within its receiving time. The parent node B starts its response timer when forwarding the networking parameter modification instruction to its child node E, C, so as to limit the parent node B to receive the response fed back by the child node E, C only within its receiving duration. And the father node E starts a response timer thereof when forwarding the networking parameter modification instruction to the child node F thereof so as to limit the father node E to receive the response fed back by the child node F only within the receiving time length thereof. It should be noted that the receiving durations corresponding to the root node and the parent node of each hierarchy may be the same or different, and this disclosure does not specifically limit this.

In addition, under the condition that the root node and the father node of each hierarchy respectively correspond to a receiving time length, the method for modifying the node networking parameters may further include:

firstly, for a father node of each level, when a response sent by at least one child node of the father node is not received within a preset time length, determining whether the child node which does not send the response is located in an online list of the father node.

Each child node communicating with the father node is stored in the online list of the father node, and the nodes with the same networking parameters can communicate with each other, so that the child nodes of the father node are all stored in the online list of the father node, and the stored networking parameters of the child nodes are all the same as the networking parameters of the father node.

And then, if at least one child node in the child nodes which do not send the response is determined to be positioned in the online list of the parent node, determining that the child nodes which do not send the response and are positioned in the online list fail to modify the networking parameters, and sending a modification failure response to the parent node of the parent node.

As described above, if a child node does not send a response within a preset time period but is still located in the online list of the parent node, it indicates that the current networking parameters of the child node are the same as the networking parameters of the parent node, that is, the child node does not successfully modify its networking parameters, and at this time, the parent node sends a response of failed modification to the parent node of the parent node.

For example, in fig. 4, it is assumed that node E does not receive the response sent by its child node F within the preset time period, and it is determined that the child node F is still located in the online list of node E, which indicates that the child node F fails to modify the networking parameters, and at this time, node E sends a modification failure response to its parent node (i.e., node B).

In addition, if it is determined that each child node in the child nodes which do not send the response is not located in the online list of the parent node, it is determined that each child node which does not send the response successfully modifies the networking parameters, and a modification success response is sent to the parent node of the parent node.

As described above, each child node that does not send a response is not located in the online list of the parent node, which indicates that the current networking parameter of each child node that does not send a response is different from the networking parameter of the parent node, that is, the current networking parameter of each child node that does not send a response is already the modified networking parameter, that is, each child node that does not send a response successfully modifies the networking parameter, and at this time, the parent node may send a successful modification response to the parent node of the parent node.

For example, in fig. 4, it is assumed that node B does not receive the responses sent by child nodes E and C within a preset time period, and it is determined that neither child node E nor child node C is located in the online list of node B, which indicates that child nodes E and C successfully modify the networking parameters, and at this time, node B sends a modification success response to its parent node (i.e., root node a).

By adopting the technical scheme, when the father node does not receive the response sent by at least one child node, whether the child node which does not send the response successfully modifies the networking parameters can be further determined, and then the response can be fed back to the father node of the previous level, so that the father node of the previous level can modify the networking parameters in time.

In practical application, after the ad hoc network modifies the networking parameters once, some nodes which do not successfully modify the networking parameters may still exist in the ad hoc network, so that the networking parameters of the nodes which do not successfully modify the networking parameters can be modified again, so that all the networking parameters of the nodes in the ad hoc network can be successfully modified.

Specifically, when the modification is finished, if a node of which the networking parameter is not successfully modified still exists in the optimal path, the optimal path tree including only the node of which the networking parameter is not successfully modified is determined, and then the networking parameter of each node in the optimal path tree is modified according to the modification method.

For example, it is assumed that an optimal path tree constructed by 8 nodes A, B, C, D, E, F, G, H included in the ad hoc network is shown in fig. 5. The optimal path tree shown in fig. 5 may be constructed in the above-described manner of constructing the optimal path tree shown in fig. 4, which is not described in detail in this disclosure.

First, it is determined that the link quality of each path in the optimal path tree shown in fig. 5 is greater than or equal to a preset threshold. Then, the root node A sends a networking parameter modification instruction to the child node B thereof, and starts a response timer of the root node A. After receiving the networking parameter modification instruction, the node B forwards the networking parameter modification instruction to the child node C, D, E, and starts a response timer of the node B. And the nodes C and D are leaf nodes which modify the networking parameters after receiving the networking parameter modification instruction and send modification success responses to the node B. Meanwhile, the node E is a non-leaf node, and after receiving the networking parameter modification instruction, the node E continues to forward the networking parameter modification instruction to the child nodes H and F and starts a response timer of the node E. The node F is a leaf node, and it is assumed that the node E does not receive the networking parameter modification instruction due to the link, and therefore does not make any feedback, so that the node E does not receive a response fed back by the node F within its receiving duration. Meanwhile, after receiving the networking parameter modification instruction forwarded by the node E, the node H continues to forward the networking parameter modification instruction to the child node G thereof, and starts a response timer of the node H. And the node G modifies the networking parameters of the leaf node after receiving the networking parameter modification instruction sent by the node H, and sends a modification success response to the node H so that the node H receives the modification success response sent by the child node G within the preset time length of the node H.

Since the node E does not receive the response fed back by the node F within the receiving time, the node E sends a modification failure response to its parent node (i.e., the node B) after the preset time. Accordingly, the node B transmits a modification failure response to its parent node (i.e., the root node a) after its preset duration. And when the root node A receives the modification failure response sent by the node B, determining that the modification is finished, and marking that the modification of the networking parameters of all the nodes in the ad hoc network fails.

After the modification is finished, the networking parameters of the node A, B, E, F are not modified successfully, and the optimal path tree including only the nodes whose networking parameters are not modified successfully is shown in fig. 6. Therefore, the networking parameters of the nodes in the optimal path tree shown in fig. 6 may be modified again until the networking parameters of all the nodes in the ad hoc network are successfully modified.

By adopting the technical scheme, when the modification fails, the nodes which fail to modify can be modified again only until the networking parameters of all the nodes are successfully modified, so that the flexibility of modifying the networking parameters of all the nodes in the ad hoc network is improved.

Based on the same inventive concept, the disclosure also provides a modification device of the node networking parameters. Fig. 7 is a block diagram illustrating an apparatus for modifying a node networking parameter, according to an example embodiment. As shown in fig. 7, the apparatus 700 for modifying a node networking parameter may include:

an obtaining module 701, configured to obtain link quality between every two nodes in the ad hoc network whose networking parameters are to be modified;

a first determining module 702, configured to determine an optimal path from a target node to each other node according to the link quality to construct an optimal path tree of the ad hoc network, where the target node is any node in the ad hoc network;

a modifying module 703, configured to sequentially modify the networking parameters of each node according to the hierarchical relationship of the optimal path tree.

Optionally, the apparatus further comprises:

and the second determining module is used for determining that the link quality of each path on the optimal path tree is greater than or equal to a preset threshold value.

Optionally, the modifying module 703 may include:

the first control submodule is used for sequentially controlling each level node to send a networking parameter modification instruction to the child nodes of the optimal path tree according to the level relation of the optimal path tree, wherein the root node initially sends the networking parameter modification instruction to each child node of the root node;

the second control submodule is used for controlling the leaf node to modify the networking parameters when the leaf node of each level receives the networking parameter modification instruction, and feeding back a modification success response to the father node of the leaf node;

and the third control sub-module is used for controlling the father node to forward the networking parameter modification instruction to each child node of the father node aiming at each level until the leaf node of the last level modifies the networking parameters according to the received networking parameter modification instruction and sends a modification success response to the father node of the father node, wherein the father node of each level modifies the networking parameters of the father node and sends the modification success response to the father node of the father node when receiving the modification success response sent by each child node of the father node, and the father node does not modify the networking parameters of the father node and sends the modification failure response to the father node of the father node when receiving the modification failure response sent by at least one child node of the father node.

Optionally, the apparatus further comprises:

a third determining module, configured to determine, for a parent node of each tier, whether a child node that does not send a response is located in an online list of the parent node when a response sent by at least one child node of the parent node is not received within the preset time period, where the response includes a modification success response and a modification failure response;

a fourth determining module, configured to determine that a child node that does not send a response and is located in the online list of the parent node fails to modify the networking parameters if it is determined that at least one child node of the child nodes that does not send a response is located in the online list of the parent node, and send a modification failure response to the parent node of the parent node; and

and the fifth determining module is used for determining that each child node which does not send the response successfully modifies the networking parameters and sending a successful modification response to the parent node of the parent node if it is determined that each child node which does not send the response is not located in the online list of the parent node.

Optionally, the apparatus further comprises:

and the execution module is used for determining the optimal path tree only comprising the nodes of the unsuccessfully modified networking parameters if the nodes of the unsuccessfully modified networking parameters still exist in the optimal path tree after the modification is finished, and executing the step of modifying the networking parameters of each node in sequence according to the hierarchical relationship of the optimal path tree until the networking parameters of each node in the optimal path tree are successfully modified.

Optionally, the first determining module 702 may include

The processing submodule is used for symmetrically processing the link quality between every two nodes so as to ensure that the link quality between the two nodes is the same;

and the determining submodule is used for determining the optimal path from the target node to each other node by using an optimal path algorithm according to the link quality after the symmetric processing.

With regard to the apparatus in the above embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be described in detail here.

FIG. 8 is a block diagram of an electronic device shown in accordance with an example embodiment. As shown in fig. 8, the electronic device 800 may include: a processor 801, a memory 802. The electronic device 800 may also include one or more of a multimedia component 803, an input/output (I/O) interface 804, and a communications component 805.

The processor 801 is configured to control the overall operation of the electronic device 800, so as to complete all or part of the steps in the above method for modifying the node networking parameters. The memory 802 is used to store various types of data to support operation at the electronic device 800, such as instructions for any application or method operating on the electronic device 800 and application-related data, such as contact data, transmitted and received messages, pictures, audio, video, and so forth. The Memory 802 may be implemented by any type of volatile or non-volatile Memory device or combination thereof, such as Static Random Access Memory (SRAM), electrically Erasable Programmable Read-Only Memory (EEPROM), erasable Programmable Read-Only Memory (EPROM), programmable Read-Only Memory (PROM), read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk or optical disk. The multimedia components 803 may include screen and audio components. Wherein the screen may be, for example, a touch screen and the audio component is used for outputting and/or inputting audio signals. For example, the audio component may include a microphone for receiving an external audio signal. The received audio signal may further be stored in the memory 802 or transmitted through the communication component 805. The audio assembly also includes at least one speaker for outputting audio signals. The I/O interface 804 provides an interface between the processor 801 and other interface modules, such as a keyboard, mouse, buttons, etc. These buttons may be virtual buttons or physical buttons. The communication component 805 is used for wired or wireless communication between the electronic device 800 and other devices. Wireless Communication, such as Wi-Fi, bluetooth, near Field Communication (NFC for short), 2G, 3G, 4G, NB-IOT, eMTC, or other 5G, etc., or one or a combination thereof, but not limited thereto. The corresponding communication component 805 may therefore include: wi-Fi module, bluetooth module, NFC module, etc.

In an exemplary embodiment, the electronic Device 800 may be implemented by one or more Application Specific Integrated Circuits (ASICs), digital Signal Processors (DSPs), digital Signal Processing Devices (DSPDs), programmable Logic Devices (PLDs), field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors, or other electronic components for performing the above-described method for modifying the node networking parameters.

In another exemplary embodiment, a computer readable storage medium comprising program instructions which, when executed by a processor, implement the steps of the above-described method for modifying a node networking parameter is also provided. For example, the computer readable storage medium may be the memory 802 described above that includes program instructions executable by the processor 801 of the electronic device 800 to perform the method for modifying node networking parameters described above.

In another exemplary embodiment, a computer program product is also provided, which comprises a computer program executable by a programmable apparatus, the computer program having code portions for performing the above-mentioned method of modifying a node networking parameter when executed by the programmable apparatus.

The preferred embodiments of the present disclosure are described in detail with reference to the accompanying drawings, however, the present disclosure is not limited to the specific details of the above embodiments, and various simple modifications may be made to the technical solution of the present disclosure within the technical idea of the present disclosure, and these simple modifications all belong to the protection scope of the present disclosure.

It should be noted that the various features described in the above embodiments may be combined in any suitable manner without departing from the scope of the invention. To avoid unnecessary repetition, the disclosure does not separately describe various possible combinations.

In addition, any combination of various embodiments of the present disclosure may be made, and the same should be considered as the disclosure of the present disclosure as long as it does not depart from the gist of the present disclosure.

Claims

1. A method for modifying a node networking parameter, the method comprising:

acquiring link quality between every two nodes in the ad hoc network with the network parameters to be modified;

according to the hierarchical relation of the optimal path tree, sequentially modifying networking parameters of each node;

the target node is a root node of the optimal path tree; the modifying the networking parameters of each node in sequence according to the hierarchical relationship of the optimal path tree comprises the following steps:

sequentially controlling the nodes of each level to send networking parameter modification instructions to the child nodes of the nodes according to the level relation of the optimal path tree, wherein the root node initially sends the networking parameter modification instructions to each child node of the root node;

when the leaf node of each level receives the networking parameter modification instruction, controlling the leaf node to modify the networking parameters and feeding back a modification success response to a father node of the leaf node;

2. The method according to claim 1, wherein before said modifying the networking parameters of each node in turn according to the hierarchical relationship of the optimal path tree, the method further comprises:

3. The method of claim 1, wherein the root node and each level of parent nodes have a receive duration associated therewith, and wherein the root node and each level of parent nodes receive responses from their respective child nodes within their respective receive durations.

4. The method of claim 3, further comprising:

aiming at a father node of each level, when a response sent by at least one child node of the father node is not received within a preset time length, determining whether the child node which does not send the response is located in an online list of the father node, wherein the response comprises a modification success response and a modification failure response;

if at least one child node in the child nodes which do not send the response is determined to be positioned in the online list of the father node, determining that the child nodes which do not send the response and are positioned in the online list fail to modify networking parameters, and sending modification failure responses to the father node of the father node; and

5. The method according to any one of claims 1-4, further comprising:

and when the modification is finished, if the nodes of the networking parameters which are not successfully modified still exist in the optimal path tree, determining the optimal path tree only comprising the nodes of the networking parameters which are not successfully modified, and executing the step of sequentially modifying the networking parameters of each node according to the hierarchical relation of the optimal path tree until the networking parameters of each node in the optimal path tree are successfully modified.

6. The method of claim 1, wherein determining the optimal path from the target node to each of the other nodes based on the link quality comprises:

and determining the optimal path from the target node to each other node by using an optimal path algorithm according to the link quality after the symmetrical processing.

7. An apparatus for modifying networking parameters of a node, the apparatus comprising:

a first determining module, configured to determine an optimal path from a target node to each other node according to the link quality to construct an optimal path tree of the ad hoc network, where the target node is any node in the ad hoc network;

the modification module is used for sequentially modifying the networking parameters of each node according to the hierarchical relation of the optimal path tree;

the modification module includes:

the first control submodule is used for sequentially controlling each level node to send a networking parameter modification instruction to the child nodes of the node according to the level relation of the optimal path tree, wherein the networking parameter modification instruction is initially sent to each child node of the root node by the root node;

8. A non-transitory computer readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 6.

9. An electronic device, comprising:

a memory having a computer program stored thereon;

a processor for executing the computer program in the memory to carry out the steps of the method of any one of claims 1 to 6.