CN109756902B

CN109756902B - Multi-hop wireless network deployment method and device

Info

Publication number: CN109756902B
Application number: CN201711068053.7A
Authority: CN
Inventors: 吴杰; 李红春; 徐怡; 田军
Original assignee: Fujitsu Ltd
Current assignee: Fujitsu Ltd
Priority date: 2017-11-03
Filing date: 2017-11-03
Publication date: 2022-01-11
Anticipated expiration: 2037-11-03
Also published as: CN109756902A

Abstract

The embodiment of the invention provides a multi-hop wireless network deployment method and a device, wherein the multi-hop wireless network deployment device comprises the following steps: the first processing unit is used for processing the deployment schemes in the ith generation deployment scheme set obtained in advance by using a genetic algorithm to generate an i +1 generation deployment scheme set; the deployment scheme set comprises a plurality of deployment schemes, and each deployment scheme comprises more than one path from at least one source node to at least one destination node and/or channels used by links between every two nodes; a first determining unit, configured to determine the i +1 th generation deployment scenario set generated by the first processing unit as a final deployment scenario set when a predetermined condition is satisfied; and when the preset condition is not met, processing the deployment schemes in the (i + 1) th generation deployment scheme set until a final deployment scheme is obtained. By the device of the embodiment, a wireless network deployment scheme can be optimized, and the network performance of the deployment scheme is improved.

Description

Multi-hop wireless network deployment method and device

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for deploying a multi-hop wireless network.

Background

The development of wireless communication technology brings great convenience for users to access a network anytime and anywhere, in a multi-hop wireless network, a typical path from a source node to a destination node is formed by multiple hops, and each node in the multi-hop wireless network can generate or receive data packets and can also serve as a forwarding node to forward the data packets from other nodes. In existing wireless networks, a wireless Ad Hoc network, a wireless sensor network, and a wireless Mesh (Mesh) network all belong to a multi-hop wireless network.

In a multi-hop wireless network, the quality of network performance (such as interference, throughput, end-to-end delay, etc.) is closely related to the selection of node positions and/or the configuration of node interfaces, and if the selection of node positions and/or the configuration of node interfaces are not proper, the performance of the multi-hop wireless network is poor, and the construction cost is increased.

It should be noted that the above background description is only for the sake of clarity and complete description of the technical solutions of the present invention and for the understanding of those skilled in the art. Such solutions are not considered to be known to the person skilled in the art merely because they have been set forth in the background section of the invention.

Disclosure of Invention

In the prior art, when network deployment is performed, optimization of node position selection is usually only considered to reduce cost, but optimization of network performance cannot be guaranteed.

The embodiment of the invention provides a multi-hop wireless network deployment method and device, which consider node positions, path selection and/or channel allocation, thereby optimizing a wireless network deployment scheme and improving the network performance of the deployment scheme.

The above object of the embodiment of the present invention is achieved by the following technical solutions:

according to a first aspect of the embodiments of the present invention, there is provided a multi-hop wireless network deployment apparatus, the apparatus including:

the first processing unit is used for processing the deployment schemes in the ith generation deployment scheme set obtained in advance by using a genetic algorithm to generate an i +1 generation deployment scheme set; the deployment scheme set comprises a plurality of deployment schemes, and each deployment scheme comprises more than one path from at least one source node to at least one destination node and/or channels used by links between every two nodes; each deployment scheme comprises a first part and a second part, wherein the first part represents nodes passed by a path and/or channels used by links between the nodes, the second part represents nodes not passed by the path or channels not used between the nodes, and i is an integer greater than or equal to zero;

a first determining unit, configured to determine the i +1 th generation deployment scenario set generated by the first processing unit as a final deployment scenario set when a predetermined condition is satisfied; and when the preset condition is not met, processing the deployment schemes in the (i + 1) th generation deployment scheme set until a final deployment scheme is obtained.

According to a second aspect of the embodiments of the present invention, there is provided a multi-hop wireless network deployment method, where the method includes:

processing deployment schemes in an ith generation deployment scheme set obtained in advance by using a genetic algorithm to generate an (i + 1) th generation deployment scheme set; the deployment scheme set comprises a plurality of deployment schemes, and each deployment scheme comprises more than one path from at least one source node to at least one destination node and/or channels used by links between every two nodes; each deployment scheme comprises a first part and a second part, wherein the first part represents nodes passed by a path and/or channels used by links between the nodes, the second part represents nodes not passed by the path or channels not used between the nodes, and i is an integer greater than or equal to zero;

when a preset condition is met, determining the generated (i + 1) th generation deployment scheme set as a final deployment scheme set; and when the preset condition is not met, processing the deployment schemes in the (i + 1) th generation deployment scheme set until a final deployment scheme is obtained.

The embodiment of the invention has the advantages that when the multi-hop wireless network deployment is carried out, the node position, the path selection and/or the channel allocation are/is considered when the network deployment is carried out, so that the wireless network deployment scheme can be optimized, and the network performance of the deployment scheme is improved.

Specific embodiments of the present invention are disclosed in detail with reference to the following description and drawings, indicating the manner in which the principles of the invention may be employed. It should be understood that the embodiments of the invention are not so limited in scope. The embodiments of the invention include many variations, modifications and equivalents within the spirit and scope of the appended claims.

Features that are described and/or illustrated with respect to one embodiment may be used in the same way or in a similar way in one or more other embodiments, in combination with or instead of the features of the other embodiments.

It should be emphasized that the term "comprises/comprising" when used herein, is taken to specify the presence of stated features, integers, steps or components but does not preclude the presence or addition of one or more other features, integers, steps or components.

Drawings

Many aspects of the invention can be better understood with reference to the following drawings. The components in the figures are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention. For convenience in illustrating and describing some parts of the present invention, corresponding parts may be enlarged or reduced in the drawings. Elements and features depicted in one drawing or one embodiment of the invention may be combined with elements and features shown in one or more other drawings or embodiments. Moreover, in the drawings, like reference numerals designate corresponding parts throughout the several views, and may be used to designate corresponding parts for use in more than one embodiment.

In the drawings:

fig. 1 is a flowchart of a multi-hop wireless network deployment method in this embodiment 1;

fig. 2 is a schematic diagram of discretization of the region to be deployed in the embodiment 1;

FIG. 3 is a flowchart of the method of step 101 in this embodiment 1;

FIGS. 4A-4B and FIGS. 5A-5E are schematic views of the variation process in this embodiment 1;

fig. 6 is a flowchart of a multi-hop wireless network deployment method in the embodiment 2;

fig. 7 is a flowchart of a multi-hop wireless network deployment method in the embodiment 3;

fig. 8 is a schematic diagram of a multi-hop wireless network deployment apparatus in the embodiment 4;

FIG. 9 is a schematic diagram of a first processing unit in the embodiment 4;

fig. 10 is a schematic hardware configuration diagram of the multi-hop wireless network deployment apparatus in this embodiment 4.

Detailed Description

The foregoing and other features of embodiments of the present invention will become apparent from the following description, taken in conjunction with the accompanying drawings. These embodiments are merely exemplary and are not intended to limit the present invention. In order to enable those skilled in the art to easily understand the principle and the implementation manner of the present invention, the embodiment of the present invention is described by taking a wireless sensor network as an example, but it is to be understood that the embodiment of the present invention is not limited to the wireless sensor network, for example, the method and the apparatus provided by the embodiment of the present invention are also applicable to other networks requiring multi-hop wireless network deployment.

The meaning of the genetic algorithm is briefly described below for easy understanding.

The genetic algorithm is a random search algorithm based on biological natural selection and genetic mechanism, optimized search is completed by simulating a biological evolution process, and in recent years, the genetic algorithm is widely applied to the field of wireless network deployment. The method for calculating the wireless network deployment scheme by using the genetic algorithm mainly comprises the following steps: firstly, establishing a model, coding a deployment scheme into a section of chromosome, wherein each chromosome is composed of a plurality of gene positions (candidate positions), and in order to facilitate the processing process of a genetic algorithm, the deployment scheme in each generation of deployment scheme set needs to be coded; secondly, selecting and applying an adaptive function to determine the advantages and disadvantages of chromosomes, then combining the chromosomes with each other to generate a new generation of chromosomes in a crossed manner, finally obtaining a new deployment scheme by adopting a variation mode, and circularly performing the process until a better deployment scheme is calculated.

The following describes a specific embodiment of the present invention with reference to the drawings.

Example 1

This embodiment 1 provides a multi-hop wireless network deployment method; fig. 1 is a flowchart of the multi-hop wireless network deployment method, as shown in fig. 1, the method includes:

101, processing a deployment scheme in an ith generation deployment scheme set obtained in advance by using a genetic algorithm to generate an (i + 1) th generation deployment scheme set;

step 102, when a preset condition is met, determining the generated (i + 1) th generation deployment scheme set as a final deployment scheme set; and when the preset condition is not met, processing the deployment schemes in the (i + 1) th generation deployment scheme set until a final deployment scheme is obtained.

In this embodiment, in order to obtain a better deployment scheme, not only the location deployment of nodes but also the selection of paths in a multi-hop wireless network need to be considered, so in this embodiment, the deployment scheme collectively includes a plurality of deployment schemes, and each deployment scheme includes more than one path from at least one source node to at least one destination node; each deployment scenario includes a first portion and a second portion, wherein the first portion represents nodes passed by the path, the second portion represents nodes not passed by the path, and i is an integer greater than or equal to zero.

By the method of the embodiment, when the multi-hop wireless network deployment is carried out, the node position and the path selection are considered, so that the wireless network deployment scheme can be optimized, and the network performance of the deployment scheme is improved.

In this embodiment, the first part may be represented by nodes (e.g., node identifiers) sequentially passed by the path, and the second part may be represented by a predetermined real number different from the number representing the node identifier.

In this embodiment, each deployment scenario (each individual) may be represented (encoded) by using a Path allocation table (Path _ Tab), where each row of the Path allocation table represents a Path from a source node to a destination node, the row represents the number of paths from the source node to the destination node, each column of the Path allocation table represents the number of hops of nodes on the Path, and the column represents the number of all node positions; the path allocation table is divided into a first part and a second part, where the first part represents the node Identification (ID) passed by each path, the second part represents no node, for example, represented by the number "0", that is, the first non-zero value of each row in the table represents the source node ID, the last non-zero value represents the destination node ID, the zero value represents a node that is not passed, or no node, the occurrence of the first 0 of each row represents that the path is ended, and the non-zero values of each row are sequentially connected to form a path from the source node to the destination node, where table 1 is an illustration of a path allocation table:

table 1 Path assignment table (Path _ Tab)

1	2	3	6	9	0	0	0	0
									1	4	7	8	9	0	0	0	0
5	8	9	0	0	0	0	0	0
									5	6	9	0	0	0	0	0	0

As shown in table 1, the number of nodes of the deployment scenario is 9, and there exist 4 paths from the source node to the destination node, which are 1-2-3-6-9 (5-hop path), 1-4-7-8-9 (5-hop path), 5-8-9 (3-hop path), and 5-6-9 (3-hop path), respectively, where 0 indicates that a path does not pass through a node at the corresponding hop count position.

In this embodiment, the path allocation table may also be expressed in other forms, and only the corresponding parameters may be embodied.

In this embodiment, before step 101, the method further includes: firstly, discretizing a to-be-deployed area into a plurality of candidate node positions, and numbering each node position in sequence to obtain a node ID; the discretization method in the present embodiment will be described below with reference to fig. 2.

FIG. 2 is a schematic diagram of discretization of an area to be deployed in the present embodiment; as shown in fig. 2, the area to be deployed is discretized into N points according to the communication radius of each node, the source node position and the destination node position, each point represents a candidate node position, and each node (candidate node, source node and destination node) is numbered in sequence as 1-8, wherein the discretization may be uniform or non-uniform, which is not illustrated here, and the candidate node positions include deployed node positions and undeployed node positions.

In this embodiment, in steps 101 to 102, the ith generation deployment scheme set may be an initial deployment scheme set, and when the value of i is zero, the initial deployment scheme set is a 0 th generation deployment scheme set. Using the encoding method of this embodiment, the deployment schemes in the 0 th generation deployment scheme set are generated according to a predetermined routing algorithm, and then using a genetic algorithm to perform corresponding iteration to generate a final deployment scheme set.

In this embodiment, the predetermined routing algorithm may be a Dijkstra algorithm and a Bellman-Ford algorithm, for example, according to a source node, a candidate node position, and a destination node in a multi-hop wireless network, a Dijkstra algorithm is used to calculate a shortest path from the source node to the destination node, at least one obtained shortest path is represented in the form of a path allocation table, and is used as a deployment scheme, and a plurality of deployment schemes are sequentially generated to obtain an initial deployment scheme set.

For example, after obtaining the initial set of deployment scenarios, the 0 th generation set of deployment scenarios may be processed based on genetic algorithms to obtain an i +1 th generation (1 st generation) set of deployment scenarios. The method for processing the 0 th generation deployment scheme set based on the genetic algorithm mainly comprises the following steps: carrying out processing including selection, intersection and variation on the 0 th generation deployment scheme set, and taking the 1 st generation population or the 1 st generation deployment scheme set as a final deployment scheme set when a preset condition is met; otherwise, for the generated 1 st generation deployment scheme set, the 1 st generation deployment scheme is processed by using a genetic algorithm, that is, i is equal to 1, the processes of selection, intersection and variation in step 101 are repeated, and so on, until a final deployment scheme is obtained, and the multi-hop wireless network deployment method is explained below.

In this embodiment, an improved genetic algorithm matching the above individual coding modes is also proposed, so as to obtain an optimized deployment scenario set.

Fig. 3 is a flowchart of an implementation of step 101 in this embodiment. As shown in fig. 3, step 101 includes:

step 301, selecting a first predetermined number of deployment schemes from the ith generation deployment scheme set to obtain a first deployment scheme set;

step 302, selecting a second predetermined number of groups of deployment schemes from the first deployment scheme set, wherein each group of deployment schemes comprises two deployment schemes, and performing cross processing on the two deployment schemes in each group of deployment schemes;

step 303, selecting a third predetermined number of deployment schemes from the first deployment scheme set after performing interchange processing on the deployment schemes of the second predetermined number of groups to obtain a second deployment scheme set, and performing mutation processing on the deployment schemes in the second deployment scheme set to obtain the (i + 1) th generation deployment scheme set.

In this embodiment, step 301 corresponds to a selection process in a genetic algorithm, and in step 301, the selection process may further set a rank for each deployment scenario by setting an appropriate objective function, and set a selection probability for each deployment scenario, and may select a first predetermined number of deployment scenarios by "roulette" to obtain a first deployment scenario set.

In this embodiment, the objective function may be a multi-objective function, which includes a function representing network capability and a function representing network cost, where the network capability may be determined according to a difference between network capacity and network load, and the network cost may be determined according to the number of nodes or the number of nodes and the number of interfaces of each node, and this embodiment is not limited thereto.

In the present embodiment, step 302 corresponds to a crossover process in the genetic algorithm, and step 303 corresponds to a mutation process in the genetic algorithm, which will be described in detail below by way of example.

In step 302, paths of the same source node and the destination node in the two deployment schemes are exchanged, and there is no duplicate path in the exchanged deployment schemes, for example, when the deployment schemes are represented by using the path allocation table, rows in which the paths of the same source node and the destination node are located may be interchanged, for example, the two deployment schemes are shown in the following tables 2 and 3:

TABLE 2

1	2	3	6	9	0	0	0	0
									1	4	7	8	9	0	0	0	0
5	8	9	0	0	0	0	0	0
									5	6	9	0	0	0	0	0	0

TABLE 3

1	2	3	6	9	0	0	0	0
									1	2	5	8	9	0	0	0	0
5	8	9	0	0	0	0	0	0
									5	6	9	0	0	0	0	0	0

The paths (and not duplicated) of the same source node and destination node in tables 2 and 3 are 1-4-7-8-9 and 1-2-5-8-9, respectively, and the two paths are interchanged to obtain tables 4 and 5 below, where duplicated paths are not present in tables 4 and 5 after the interchange.

TABLE 4

1	2	3	6	9	0	0	0	0
									1	2	5	8	9	0	0	0	0
5	8	9	0	0	0	0	0	0
									5	6	9	0	0	0	0	0	0

TABLE 5

1	2	3	6	9	0	0	0	0
									1	4	7	8	9	0	0	0	0
5	8	9	0	0	0	0	0	0
									5	6	9	0	0	0	0	0	0

In step 303, one embodiment of the variation is: selecting temporary nodes on candidate positions except a source node and a destination node, determining a first path from the source node to the temporary node and a second path from the temporary node to the destination node of one path of one deployment scheme in a second deployment scheme set, and replacing the one path with the combination of the first path and the second path;

the mutation method is described below with reference to fig. 4A-4B, where as shown in fig. 4A, one path of the deployment scenario is S-1-2-3-4-D, as shown in fig. 4B, a temporary node M at a candidate location other than the source node S and the destination node D is selected as a node to be mutated, a first path S-5-M from the source node S to M and a second path M-6-4-D from M to the destination node D of the path are determined, and the combination S-5-M-6-4-D of the first path and the second path replaces the one path S-1-2-3-4-D.

In this embodiment, M may select a node on the one path, or may select a node on a candidate position outside the path, and generate the first path and the second path by using a predetermined routing algorithm, which is not limited in this embodiment. For example, when the deployment scheme uses the path allocation table to represent, the node IDs sequentially passed by the mutated path are replaced with the node IDs in the row where the original path is located.

In step 303, another embodiment of the variation is: selecting a neighbor node of a node on a path of one deployment scheme in the second deployment scheme set, wherein the neighbor node is not on the path; determining a third path from the neighbor node to the destination node of the one path or a fourth path from the source node of the one path to the neighbor node, replacing the path from the one node to the destination node with the combination of the one node and the third path, or replacing the path from the source node to the one node with the combination of the one node and the fourth path;

the mutation method is described below with reference to fig. 5A-5E, as shown in fig. 5A, one path of the deployment scenario is S-1-M-2-3-D, as shown in fig. 5B, a temporary node M on the path except the source node S and the destination node D is selected as a node to be mutated, and a neighbor node N1 of M is selected, where N1 is not on the path S-1-M-2-3-D, a third path N1-4-D from N1 to D is determined, a combination of M and N1-4-D, M-N1-4-D, is substituted for M-2-3-D, i.e., the path is mutated into S-1-M-N1-4-D; or, as shown in fig. 5C-5D, selecting a neighbor node N2 of M, determining a fourth path S-5-N2 from S to N2, replacing S-1-M with S-5-N2-M, which is a combination of M and S-5-N2, i.e., mutating the one path to S-5-N2-M-2-3-D; alternatively, as shown in FIG. 5E, the combination of the third path and the fourth path with the node may replace the path from the source node to the node and the path from the node to the destination node, i.e., the one path may be mutated to S-5-N2-M-N1-4-D.

In this embodiment, the deployment scenario mutated in the step 303 may be the deployment scenario after the intersection in the step 302, or may be the deployment scenario that does not participate in the intersection process in the first deployment scenario set, which is not limited in this embodiment.

In this embodiment, the third path and the fourth path may be generated by using a predetermined routing algorithm, which is not limited in this embodiment. For example, when the deployment scheme is represented by using the path allocation table, the node IDs sequentially passed by the mutated path are substituted for the node IDs in the row where the original path is located, and no duplicate path exists in the deployment scheme after mutation.

In this embodiment, the generation of illegal solutions can be avoided by the above variation method.

In step 102 of this embodiment, the predetermined condition may be that i +1 is equal to a preset first threshold, or that each deployment scenario in a set of consecutive m-generation deployment scenarios in the set of i + 1-generation deployment scenarios is the same, where m is a preset second threshold, and if it is satisfied that i +1 is equal to the preset first threshold, or that each deployment scenario in the set of consecutive m-generation deployment scenarios in the set of i + 1-generation deployment scenarios is the same, the set of i + 1-generation deployment scenarios is determined as a final deployment scenario set. When the preset condition is not met, processing the (i + 1) th generation deployment scheme set until a final deployment scheme set is obtained; for example, when the first threshold is set to 100, if i +1 is 100, determining the resulting i +1 th generation deployment scenario set as a final deployment scenario set; or when the second threshold is set to 5, if each deployment scheme in the successive 5-generation deployment scheme sets is the same, that is, each deployment scheme in the i-3 th, i-2 th, i-1 th, i + 1-th generation deployment scheme sets is the same, determining the obtained i + 1-th generation scheme set as a final deployment scheme set.

In step 102 of this embodiment, the predetermined condition may also be that the deployment scenario in the deployment scenario set satisfies that the network capability is greater than a third threshold, and the network cost is less than a fourth threshold, and when the predetermined condition is satisfied, the deployment scenario set of the (i + 1) th generation is determined as the final deployment scenario set. When the predetermined condition is not satisfied, the deployment scenario set of the (i + 1) th generation is processed, and the determination manner of the network capability and the network cost is as described in the selection process in step 301, which is not described herein again.

Example 2

This embodiment 2 provides a multi-hop wireless network deployment method; the difference from the method in embodiment 1 is that the deployment scheme in embodiment 2 does not mean a path from a source node to a destination node, but means a channel used by a link between every two nodes after the nodes and the path are determined well, and fig. 6 is a flowchart of the multi-hop wireless network deployment method, as shown in fig. 6, the method includes:

601, processing deployment schemes in an ith generation deployment scheme set obtained in advance by using a genetic algorithm to generate an (i + 1) th generation deployment scheme set;

step 602, when a predetermined condition is satisfied, determining the (i + 1) th generation deployment plan set generated by the first processing unit as a final deployment plan set; and when the preset condition is not met, processing the deployment schemes in the (i + 1) th generation deployment scheme set until a final deployment scheme is obtained.

In this embodiment, in order to obtain a better deployment scheme, channel allocation of links between nodes in a multi-hop wireless network needs to be considered, and therefore, in this embodiment, the deployment scheme collectively includes a plurality of deployment schemes, each deployment scheme including a channel used by a link between every two nodes; each deployment scenario includes a first portion and a second portion, wherein the first portion represents channels used by links between nodes, the second portion represents channels unused between nodes, i.e., no links exist between nodes, no data needs to be transmitted, channels are not allocated, and i is an integer greater than or equal to zero.

By the method of the embodiment, when the multi-hop wireless network deployment is carried out, the channel allocation is considered, so that the wireless network deployment scheme can be optimized, and the network performance of the deployment scheme is improved.

In this embodiment, the first part may be represented using a channel number, and the second part may be represented using a predetermined real number, which is different from a number representing the channel number.

In this embodiment, each deployment scenario (each individual) may be represented (coded) by using a channel allocation table (CA _ Tab), where the number of rows and columns of the channel allocation table are equal to the number of nodes, and the number of rows and columns respectively correspond to a node Identification (ID) (where the number of rows and columns may or may not be included in the channel allocation table), the channel allocation table is divided into a first part and a second part, where the first part represents a channel number (ID) used by a link between each two nodes, and the second part represents an unused channel between nodes, for example, by using the number "0", that is, a non-zero value corresponding to the number of rows and columns in the table represents a channel ID used by a link composed of the node IDs corresponding to the row and columns, and a zero value represents an unused channel, or there is no link between nodes and no data transmission is needed, unallocated channels, table 6 below is an illustration of a channel allocation table:

table 6 channel allocation table (CA _ Tab)

As shown in table 6, the number of the nodes of the deployment scenario is 9, where the channel number used by the link 1-2 is 3, the channel number used by the link 1-3 is 2, and the channel number used by the link 2-3 is 1, and here, no one example is given, and 0 indicates that there is no link between the node 9 and the node 1, or that there is no channel allocated between the node 9 and the node 1.

In this embodiment, the channel allocation table may also be expressed in other forms, only the corresponding parameters may be embodied.

In this embodiment, before step 601, the method further includes: firstly, discretizing a to-be-deployed area into a plurality of candidate node positions, and numbering each node position in sequence to obtain a node ID; the specific implementation thereof can refer to example 1, and details are not repeated herein.

In this embodiment, in steps 601 to 602, the ith generation deployment scheme set may be an initial deployment scheme set, and when the value of i is zero, the initial deployment scheme set is a 0 th generation deployment scheme set. Using the above coding method of this embodiment, randomly generating a deployment scheme in the 0 th generation deployment scheme set, and then using a genetic algorithm to perform corresponding iteration to generate a final deployment scheme set.

In this embodiment, as shown in table 6, where the non-zero values may be randomly generated, a randomly generated channel allocation table is used as a deployment scheme, and a plurality of deployment schemes are sequentially generated to obtain an initial deployment scheme set.

For example, after obtaining the initial set of deployment scenarios, the 0 th generation set of deployment scenarios may be processed based on genetic algorithms to obtain an i +1 th generation (1 st generation) set of deployment scenarios. The method for processing the 0 th generation deployment scheme set based on the genetic algorithm mainly comprises the following steps: carrying out processing including selection, intersection and variation on the 0 th generation deployment scheme set, and taking the 1 st generation population or the 1 st generation deployment scheme set as a final deployment scheme set when a preset condition is met; otherwise, for the generated 1 st generation deployment scheme set, the 1 st generation deployment scheme is processed by using a genetic algorithm, that is, i is equal to 1, the processes of selection, intersection and variation in step 601 are repeated, and so on, until a final deployment scheme is obtained, and the multi-hop wireless network deployment method is explained below.

In this embodiment, an improved genetic algorithm matching the above individual coding modes is further proposed to obtain an optimized deployment scenario set, and the specific process of the genetic algorithm may refer to

steps

301 and 303 in example 1.

In the present embodiment, the difference from step 301-303 in embodiment 1 is:

in step 302, channels used by links between two nodes in the same deployment scenario are exchanged, for example, when the deployment scenario is represented by a channel allocation table, the predetermined scenario may be the same predetermined number of rows, and the predetermined number of rows are interchanged, for example, the deployment scenario is as shown in tables 7 and 8 below:

TABLE 7

TABLE 8

For example, the predetermined location may be rows 4-6, and the channel numbers of rows 4-5 are interchanged to obtain tables 9 and 10 below, where there are no duplicate paths in tables 4 and 5 after the interchange.

TABLE 9

Watch 10

For example, the predetermined position may also be a non-adjacent row, such as 1, 3, 8 rows, or a position corresponding to several row and column numbers in the channel allocation table, which is not limited in this embodiment.

In step 303, a first channel used by a link between two same nodes at a predetermined location of one deployment scenario in the second deployment scenario set is changed to a second channel, where the second channel may be randomly generated, as shown in tables 7 and 11, when the predetermined location of the mutation is link 2-5, the first channel 2 used by link 2-5 is changed to second channel 1, and when the predetermined location of the mutation is link 7-9, the first channel 3 used by link 7-9 is changed to second channel 2.

TABLE 11

In this embodiment, the number of the predetermined locations may be determined according to a variance ratio, the larger the variance ratio is, the larger the number of the predetermined locations is, and in addition, the number of the channels is determined according to a network, for example, in a multi-hop wireless network, the number of the channels is usually set to 11, and is numbered 1 to 11 in sequence.

In this embodiment, the specific implementation manner of step 602 is the same as that of step 102 in embodiment 1, and is not described herein again.

In this embodiment, the methods in

embodiments

1 and 2 may be performed independently or simultaneously, for example, when optimizing the deployment scheme, only the node position and the path selection, or only the channel allocation, or simultaneously optimizing the node position, the path selection and the channel allocation may be performed, so that waste of resources may be further avoided.

Example 3

Fig. 7 is a flowchart of a multi-hop wireless network deployment method in this embodiment, and as shown in fig. 7, the method includes:

step 701, discretizing a region to be deployed to generate candidate node positions; numbering each node in sequence;

step 702, generating an initial deployment scheme set, and setting a current initial deployment scheme set as an ith generation, wherein i is 0;

in this embodiment, each deployment scenario in the initial deployment scenario set is encoded using the encoding method in the above embodiments 1 and/or 2, and this is not repeated here.

703, selecting a first preset number of deployment schemes from the current ith generation deployment scheme set to obtain a first deployment scheme set;

step 704, selecting a second predetermined number of groups of deployment schemes from the first deployment scheme set, wherein each group of deployment schemes includes two deployment schemes, and performing cross processing on the two deployment schemes in each group of deployment schemes;

step 705, selecting a third predetermined number of deployment schemes from the first deployment scheme set after performing interchange processing on the deployment schemes of the second predetermined number of groups to obtain a second deployment scheme set, and performing variation processing on the deployment schemes in the second deployment scheme set to obtain the (i + 1) th generation deployment scheme set;

the specific implementation of steps 703-705 is the same as steps 301-303 in example 1 or 2, and is not repeated here;

step 706, determining whether the predetermined condition is satisfied, if yes, executing step 707, otherwise executing step 708; the predetermined condition may refer to the implementation of step 102, which is not described herein again.

Step 707, assigning i +1 to i, and returning to step 703;

step 708, determine the (i + 1) th generation deployment scenario set as the final deployment scenario set.

It can be seen from the foregoing embodiments that, when multi-hop wireless network deployment is performed, node positions, path selection, and/or channel allocation are considered when network deployment is performed, so that a wireless network deployment scheme can be optimized, and network performance of the deployment scheme is improved.

Example 4

Embodiment 4 further provides a multi-hop wireless network deployment apparatus, and as the principle of the apparatus for solving the problem is similar to the method in embodiments 1 to 2, the specific implementation thereof may refer to the implementation of the methods in embodiments 1 to 2, and repeated details are omitted.

Fig. 8 is a schematic diagram of an embodiment of a multi-hop wireless network deployment apparatus in this embodiment, as shown in fig. 8, the apparatus 800 includes:

a first processing unit 801, configured to process, by using a genetic algorithm, deployment schemes in an ith generation deployment scheme set obtained in advance, and generate an i +1 th generation deployment scheme set;

a first determining unit 802, configured to determine the i +1 th generation deployment scenario set generated by the first processing unit as a final deployment scenario set when a predetermined condition is satisfied; and when the preset condition is not met, processing the deployment schemes in the (i + 1) th generation deployment scheme set until a final deployment scheme is obtained.

The deployment scheme set comprises a plurality of deployment schemes, and each deployment scheme comprises more than one path from at least one source node to at least one destination node and/or channels used by links between every two nodes; each deployment scenario comprises a first part and a second part, wherein the first part represents nodes passed by a path and/or channels used by links between the nodes, the second part represents nodes not passed by the path or unused channels between the nodes, and i is an integer greater than or equal to zero; for example, the first portion is represented using nodes through which the path passes in sequence and/or is represented using a channel number; the second part is represented using a predetermined real number.

In this embodiment, a specific representation manner of the deployment scenario may refer to embodiments 1 and/or 2, for example, a path allocation table and/or a channel allocation table is used for representation, and the contents of the representation manner are incorporated herein and are not described herein again.

In this embodiment, the specific implementation manners of the first processing unit 801 and the first determining unit 802 may refer to step 101 and step 102 in embodiment 1 or step 601 and step 602 in embodiment 2, and repeated descriptions are omitted here.

In this embodiment, the apparatus may further include:

an initialization unit (not shown) configured to generate deployment scenarios in the 0 th generation deployment scenario set according to a predetermined routing algorithm when each deployment scenario includes more than one path from at least one source node to at least one destination node, and randomly generate deployment scenarios in the 0 th generation deployment scenario set when each deployment scenario includes a channel used by a link between every two nodes.

Fig. 9 is a schematic diagram of the first processing unit 801, and as shown in fig. 9, the first processing unit 801 includes:

a selecting unit 901, configured to select a first predetermined number of deployment schemes from the ith generation deployment scheme set, so as to obtain a first deployment scheme set;

a crossing unit 902, configured to select a second predetermined number of groups of deployment plans from the first deployment plan set, where each group of deployment plans includes two deployment plans, and cross-process the two deployment plans in each group of deployment plans;

a mutation unit 903, configured to select a third predetermined number of deployment schemes from the first deployment scheme set after performing the cross processing on the deployment schemes of the second predetermined number of groups to obtain a second deployment scheme set, and perform mutation processing on the deployment schemes in the second deployment scheme set to obtain the (i + 1) th generation deployment scheme set.

In an embodiment, the crossing unit 902 may exchange paths of the same source node and the destination node in the two deployment schemes in each set of deployment schemes; and/or exchanging channels used by links between the same two nodes at predetermined positions in the two deployment schemes.

In an embodiment, the mutation unit 903 selects temporary nodes at candidate positions except for the source node and the destination node, determines a first path from the source node to the temporary node of a path of one deployment scheme in the second deployment scheme set, and a second path from the temporary node to the destination node of the path, and replaces the path with a combination of the first path and the second path to obtain the i +1 th generation deployment scheme set;

or selecting a neighbor node of a node on a path of one deployment scheme in the second deployment scheme set, wherein the neighbor node is not on the path; determining a third path from the neighbor node to a destination node of the path or a fourth path from a source node of the path to the neighbor node, replacing the path from the one node to the destination node with the combination of the one node and the third path, or replacing the path from the source node to the one node with the combination of the one node and the fourth path, so as to obtain the (i + 1) th generation deployment scheme set;

and/or changing a first channel used by a link between the same two nodes at a predetermined position of one deployment scheme in the second deployment scheme set into a second channel to obtain the (i + 1) th generation deployment scheme set.

In this embodiment, the deployment scenario in the second deployment scenario set may be a scenario after being subjected to the cross processing by the cross unit 902, or may be a scenario without being subjected to the cross processing, and this embodiment is not limited thereto.

In this embodiment, the selecting unit 901 selects the first or third predetermined number of deployment scenarios from the ith generation deployment scenario set according to the network capability and the cost, the specific implementation of which may refer to step 301 in embodiment 1, the crossing unit 902, and the specific implementation of the variant unit 903 may refer to step 302 and 303 in

embodiment

1 or 2, which are not described herein again.

In this embodiment, the apparatus may further include:

a determining unit (not shown) configured to determine the predetermined condition according to the network capability and the cost, and a specific implementation thereof may refer to embodiment 1, which is not described herein again.

Fig. 10 is a schematic diagram of a hardware configuration of a multi-hop wireless network deployment apparatus according to an embodiment of the present invention, and as shown in fig. 10, the apparatus 1000 may include: an interface (not shown), a Central Processing Unit (CPU)1020 and a memory 1010; the memory 1010 is coupled to a central processor 1020. Wherein the memory 1010 may store various numbers; further, a program of the multi-hop wireless network deployment is stored, and the program is executed under the control of the central processor 1020, and various preset values, predetermined conditions, and the like are stored.

In one embodiment, the functionality of the multi-hop wireless network deployment device may be integrated into central processor 1020. Wherein, the central processor 1020 may be configured to: processing deployment schemes in an ith generation deployment scheme set obtained in advance by using a genetic algorithm to generate an (i + 1) th generation deployment scheme set; the deployment scheme set comprises a plurality of deployment schemes, and each deployment scheme comprises more than one path from at least one source node to at least one destination node and/or channels used by links between every two nodes; each deployment scheme comprises a first part and a second part, wherein the first part represents nodes passed by a path and/or channels used by links between the nodes, the second part represents nodes not passed by the path or channels not used between the nodes, and i is an integer greater than or equal to zero;

when a preset condition is met, determining the (i + 1) th generation deployment scheme set generated by the first processing unit as a final deployment scheme set; and when the preset condition is not met, processing the deployment schemes in the (i + 1) th generation deployment scheme set until a final deployment scheme is obtained.

Wherein, the central processor 1020 may be configured to: for cross variation processing on the deployment schemes in the ith generation deployment scheme set, reference may be made to

embodiment

1 or 2 for a specific cross variation method, which is not described herein again.

In this embodiment, reference may be made to

embodiment

1 or 2 for a specific implementation of the central processing unit 1020, which is not described herein again.

In another embodiment, the multi-hop wireless network deployment apparatus may also be configured on a chip (not shown in the figure) connected to the central processor 1020, and the function of the multi-hop wireless network deployment apparatus is realized through the control of the central processor 1020.

It is noted that the apparatus 1000 does not necessarily include all the components shown in fig. 10, for example, the communication module 1004 may also be included, and in addition, the apparatus 1000 may also include components not shown in fig. 10, which may refer to the prior art.

The embodiment also provides a node (not shown), which may be a common node or a gateway node, and may include modules such as a sensor, a CPU, a communication module, and a power supply, and in addition, may also include the multi-hop wireless network deployment apparatus shown in fig. 10, and may also integrate the functions of the multi-hop wireless network deployment apparatus into the CPU of the node, which is not described herein again.

An embodiment of the present invention further provides a computer-readable program, where when the program is executed in a multi-hop wireless network deployment apparatus, the program causes a computer to execute the multi-hop wireless network deployment method as described in any one of embodiments 1 to 2 above in the node.

An embodiment of the present invention further provides a storage medium storing a computer-readable program, where the computer-readable program enables a computer to execute the multi-hop wireless network deployment method according to any one of embodiments 1 to 2 in a multi-hop wireless network deployment apparatus.

The method of image formation in a multi-hop wireless network deployment device described in connection with the embodiments of the invention may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. For example, one or more of the functional block diagrams and/or one or more combinations of the functional block diagrams illustrated in fig. 8-10 may correspond to individual software modules of a computer program flow or individual hardware modules. These software modules may correspond to the various steps shown in fig. 1-7 (except 2, 4, 5), respectively. These hardware modules may be implemented, for example, by solidifying these software modules using a Field Programmable Gate Array (FPGA).

A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. A storage medium may be coupled to the processor such that the processor can read information from, and write information to, the storage medium; or the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The software module can be stored in a memory of the multi-hop wireless network deployment device or a memory card which can be inserted into the multi-hop wireless network deployment device.

One or more of the functional block diagrams and/or one or more combinations of the functional block diagrams described with respect to fig. 8-10 may be implemented as a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any suitable combination thereof designed to perform the functions described herein. One or more of the functional block diagrams and/or one or more combinations of the functional block diagrams described with respect to fig. 8-10 may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP communication, or any other such configuration.

While the invention has been described with reference to specific embodiments, it will be apparent to those skilled in the art that these descriptions are illustrative and not intended to limit the scope of the invention. Various modifications and alterations of this invention will become apparent to those skilled in the art based upon the spirit and principles of this invention, and such modifications and alterations are also within the scope of this invention.

With regard to the embodiments including the above embodiments, the following remarks are also disclosed.

Supplementary note 1, a multi-hop wireless network deployment apparatus, wherein the apparatus comprises:

the first processing unit is used for processing the deployment schemes in the ith generation deployment scheme set obtained in advance by using a genetic algorithm to generate an i +1 generation deployment scheme set; the deployment scheme set comprises a plurality of deployment schemes, and each deployment scheme comprises more than one path from at least one source node to at least one destination node and/or channels used by links between every two nodes; each deployment scheme comprises a first part and a second part, wherein the first part represents nodes passed by a path and/or channels used by links between the nodes, the second part represents nodes not passed by the path or unused channels between the nodes, and i is an integer greater than or equal to zero;

Supplementary note 2, the apparatus according to supplementary note 1, wherein the apparatus further comprises:

the initialization unit is used for generating the deployment schemes in the 0 th generation deployment scheme set according to a predetermined routing algorithm when each deployment scheme comprises more than one path from at least one source node to at least one destination node, and randomly generating the deployment schemes in the 0 th generation deployment scheme set when each deployment scheme comprises channels used by links between every two nodes.

Supplementary note 3, the apparatus according to supplementary note 1, wherein, the said first part uses node representation and/or uses the channel number representation that the route passes through sequentially; the second part is represented using a predetermined real number.

Supplementary note 4, the apparatus according to supplementary note 1, wherein the first processing unit includes:

a selecting unit, configured to select a first predetermined number of deployment schemes from the ith-generation deployment scheme set, so as to obtain a first deployment scheme set;

a crossing unit, configured to select a second predetermined number of groups of deployment plans from the first deployment plan set, where each group of deployment plans includes two deployment plans, and cross-process the two deployment plans in each group of deployment plans;

and a variation unit, configured to select a third predetermined number of deployment schemes from the first deployment scheme set after performing cross processing on the deployment schemes of the second predetermined number of groups, to obtain a second deployment scheme set, and perform variation processing on the deployment schemes in the second deployment scheme set, to obtain the i +1 th generation deployment scheme set.

Supplementary note 5, the apparatus according to supplementary note 4, wherein the said crossing unit exchanges the routes of the same source node and destination node in the said two deployment schemes in each group of deployment schemes; and/or exchanging channels used by links between the same two nodes at preset positions in the two deployment schemes.

Supplementary notes 6, the apparatus according to supplementary notes 4, wherein the mutation unit selects temporary nodes at candidate positions other than the source node and the destination node, determines a first path from the source node to the temporary node of a path of one deployment scheme in a second deployment scheme set and a second path from the temporary node to the destination node of the path, and replaces the path with a combination of the first path and the second path to obtain the deployment scheme set of the (i + 1) th generation;

or selecting a neighbor node of a node on a path of one deployment scheme in the second deployment scheme set, wherein the neighbor node is not on the path; determining a third path from the neighbor node to a destination node of the path or a fourth path from a source node of the path to the neighbor node, replacing the path from the one node to the destination node with a combination of the one node and the third path, or replacing the path from the source node to the one node with a combination of the one node and the fourth path, so as to obtain the (i + 1) th generation deployment scheme set;

Supplementary note 7, the apparatus according to supplementary note 1, wherein the apparatus further comprises:

a determining unit for determining the predetermined condition based on network capabilities and costs.

Supplementary note 8, the apparatus according to supplementary note 4, wherein the selecting unit selects a first predetermined number of deployment scenarios from the ith generation deployment scenario set according to network capabilities and costs.

Supplementary note 9, a multi-hop wireless network deployment method, wherein the method comprises:

Supplementary note 10, the method according to supplementary note 9, wherein the method further comprises:

when each deployment scheme comprises more than one path from at least one source node to at least one destination node, the deployment schemes in the 0 th generation deployment scheme set are generated according to a preset routing algorithm, and when each deployment scheme comprises a channel used by a link between every two nodes, the deployment schemes in the 0 th generation deployment scheme set are randomly generated.

Supplementary note 11, the method according to supplementary note 9, wherein the first part is represented using nodes through which the path passes in sequence and/or is represented using a channel number; the second part is represented using a predetermined real number.

Supplementary notes 12, the method according to supplementary notes 9, wherein the generating of the (i + 1) th generation deployment scenario set by processing the deployment scenarios in the (i) th generation deployment scenario set obtained in advance using a genetic algorithm comprises:

selecting a first preset number of deployment schemes from the ith generation deployment scheme set to obtain a first deployment scheme set;

selecting a second preset number of groups of deployment schemes from the first deployment scheme set, wherein each group of deployment schemes comprises two deployment schemes, and performing cross processing on the two deployment schemes in each group of deployment schemes;

and selecting a third preset number of deployment schemes from the first deployment scheme set after the cross processing is carried out on the deployment schemes of the second preset number group to obtain a second deployment scheme set, and carrying out variation processing on the deployment schemes in the second deployment scheme set to obtain the (i + 1) th generation deployment scheme set.

Supplementary note 13, the method according to supplementary note 12, wherein the interleaving process comprises: exchanging paths of the homologous node and the destination node in the two deployment schemes in each group of deployment schemes; and/or exchanging channels used by links between the same two nodes at preset positions in the two deployment schemes.

Reference 14, the method according to reference 12, wherein the mutation process comprises: selecting temporary nodes on candidate positions except a source node and a destination node, determining a first path from the source node to the temporary node of a path of a deployment scheme in a second deployment scheme set and a second path from the temporary node to the destination node of the path, and replacing the path with the combination of the first path and the second path to obtain the (i + 1) th generation deployment scheme set;

Supplementary note 15, the method according to supplementary note 9, wherein the method further comprises:

the predetermined condition is determined based on network capabilities and costs.

Supplementary note 16, the method according to supplementary note 12, wherein a first predetermined number of deployment scenarios is selected from the ith generation deployment scenario set according to network capabilities and costs.

Claims

1. A multi-hop wireless network deployment apparatus, wherein the apparatus comprises:

a first determining unit, configured to determine the i +1 th generation deployment scenario set generated by the first processing unit as a final deployment scenario set when a predetermined condition is satisfied; when the preset condition is not met, processing the deployment scheme in the (i + 1) th generation deployment scheme set until a final deployment scheme is obtained;

wherein the first processing unit comprises:

a variation unit, configured to select a third predetermined number of deployment schemes from the first deployment scheme set after performing cross processing on the deployment schemes of the second predetermined number of groups to obtain a second deployment scheme set, and perform variation processing on the deployment schemes in the second deployment scheme set to obtain the i +1 th generation deployment scheme set;

the variation unit selects temporary nodes on candidate positions except a source node and a destination node, determines a first path from the source node to the temporary node of a path of a deployment scheme in a second deployment scheme set and a second path from the temporary node to the destination node of the path, and replaces the path with a combination of the first path and the second path to obtain the (i + 1) th generation deployment scheme set;

2. The apparatus of claim 1, wherein the apparatus further comprises:

3. The apparatus of claim 1, wherein the first portion is represented using nodes through which the path passes in sequence and/or represented using a channel number; the second part is represented using a predetermined real number.

4. The apparatus according to claim 1, wherein the intersection unit exchanges paths of a source node and a destination node in the two deployment scenarios in each group of deployment scenarios; and/or exchanging channels used by links between the same two nodes at preset positions in the two deployment schemes.

5. The apparatus of claim 1, wherein the apparatus further comprises:

6. The apparatus of claim 1, wherein the selection unit selects a first predetermined number of deployment scenarios from the ith generation deployment scenario set based on network capabilities and costs.

7. A multi-hop wireless network deployment method, wherein the method comprises:

when a preset condition is met, determining the generated (i + 1) th generation deployment scheme set as a final deployment scheme set; when the preset condition is not met, processing the deployment scheme in the (i + 1) th generation deployment scheme set until a final deployment scheme is obtained;

wherein processing the deployment plans in the ith generation deployment plan set comprises:

a selection process for selecting a first predetermined number of deployment scenarios from the ith generation of deployment scenario set, resulting in a first deployment scenario set;

a crossover process for selecting a second predetermined number of groups of deployment plans from the first set of deployment plans, wherein each group of deployment plans comprises two deployment plans, and crossover-processing the two deployment plans in each group of deployment plans;

a variation process, configured to select a third predetermined number of deployment schemes from the first deployment scheme set after the cross processing is performed on the deployment schemes of the second predetermined number of groups, so as to obtain a second deployment scheme set, and perform a variation process on the deployment schemes in the second deployment scheme set, so as to obtain the i +1 th generation deployment scheme set;

wherein the mutation process comprises: selecting a third preset number of deployment schemes from the first deployment scheme set after the cross processing to obtain a second deployment scheme set, selecting a temporary node on a candidate position except a source node and a destination node from one deployment scheme in the second deployment scheme set, determining a first path between the source node and the temporary node of a path of the deployment scheme in the second deployment scheme set and a second path between the temporary node and the destination node of the path, and replacing the path with a combination of the first path and the second path to obtain the (i + 1) th generation deployment scheme set;