Information transmission path planning method and device for wireless sensor network
By combining the ant algorithm and dynamic window method in the wireless sensor network, the information transmission path is planned, and the problem of insufficient signal avoidance ability for unknown obstacles is solved, achieving more efficient signal transmission.
Patent Information
- Application Number
- CN202210175770.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-02-24
- Publication Date
- 2024-11-29
- Estimated Expiration
- 2042-02-24
AI Technical Summary
In existing wireless sensor networks, the obstacle avoidance ability of signals to avoid unknown obstacles during transmission.
Combining the Ant algorithm and dynamic window method, the information transmission path in the wireless sensor network is planned, and the raster map of the signal transmission path is constructed, and the initial optimal path is obtained using the two-way search strategy and the Ant algorithm, and the dynamic window method is used to obtain the initial optimal path. The turning points are checked to improve the signal's obstacle avoidance ability.
It improves the obstacle avoidance ability of unknown obstacles during the transmission process, and enhances the efficiency and accuracy of signal transmission.
Smart Images

Figure CN114567914B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of wireless sensor networks, and in particular to a method and device for planning an information transmission path of a wireless sensor network. Background Art
[0002] With the rapid development of smart cities, wireless sensor networks are increasingly being used in all aspects of people's lives. In wireless sensor networks, the network information transmission process is achieved through the transmission of radio waves carrying data information between sensors, routers, and hosts. However, in the process of radio wave transmission, that is, network information transmission, radio waves will be blocked by static obstacles such as cement and walls, and will also be interfered by radio waves generated by mobile electronic devices, that is, dynamic obstacles; therefore, how to plan the information transmission path of wireless sensor networks to reduce interference in the process of network information transmission and speed up information transmission is very important.
[0003] At present, an information transmission path from the starting point to the end point is found in the wireless sensor network through the ant colony algorithm. However, this scheme still has the following shortcomings: the signal has a weak ability to avoid unknown obstacles during transmission. Summary of the invention
[0004] The purpose of the embodiments of the present invention is to provide a method and device for planning an information transmission path of a wireless sensor network to solve the problem in the prior art that the signal has a weak ability to avoid unknown obstacles during transmission. By combining the ant algorithm and the dynamic window method to plan the information transmission path in the wireless network, the ability to avoid unknown obstacles during transmission can be improved.
[0005] To achieve the above object, an embodiment of the present invention provides an information transmission path planning method for a wireless sensor network, comprising:
[0006] According to the starting point and end point of signal transmission in the wireless sensor network, a grid map of the signal transmission path is constructed;
[0007] Based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a bidirectional search strategy is used to search the path on the grid map to obtain an initial optimal information transmission path;
[0008] The linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path are constrained, and the turning point of the initial optimal information transmission path is tested using a dynamic window method to obtain a final information transmission path.
[0009] As an improvement of the above solution, the information transmission path planning method of the wireless sensor network further includes:
[0010] Obtaining a first turning point of the final information transmission path;
[0011] Determining a theoretical value of a starting transmission heading angle of the final information transmission path according to the starting point and the first turning point;
[0012] Obtaining an actual value of a starting transmission heading angle of the final information transmission path;
[0013] Based on the comparison result of the actual value of the starting transmission heading angle and the theoretical value of the starting transmission heading angle, a final optimal information transmission path is obtained.
[0014] The theoretical value of the starting transmission heading angle of the final information transmission path is determined according to the following formula:
[0015] d=((X1-X s ) 2 +(Y1-Y s ) 2 ) 1 / 2
[0016]
[0017] θ=arcsin(c)
[0018] Among them, θ is the theoretical value of the starting transmission heading angle of the final information transmission path, (X s ,Y s ) is the starting point coordinate of signal transmission, and (X1, Y1) is the first turning point coordinate of the final information transmission path.
[0019] As an improvement of the above scheme, based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a bidirectional search strategy is used to search the path of the grid map to obtain the initial optimal information transmission path, including:
[0020] determining an initial pheromone concentration released by ants during a path search on the grid map;
[0021] Two groups of ants determine the next node based on a preset heuristic function and a preset probability selection formula;
[0022] When two groups of ants meet, they obtain several initial information transmission paths;
[0023] updating the pheromone concentrations of the initial information transmission paths;
[0024] Based on the distances and the number of turning points of the initial information transmission paths, an initial optimal information transmission path is selected.
[0025] As an improvement of the above solution, the two groups of ants determine the next node according to a preset heuristic function and a preset probability selection formula, including:
[0026] The preset heuristic function is used to determine whether the expectation degree between any two adjacent nodes is greater than a preset threshold. If so, the next node is determined using the preset probability selection formula.
[0027] As an improvement of the above solution, the determining of the initial pheromone concentration released by the ants during the path search on the grid map includes:
[0028] The initial pheromone concentration released by the ants during the path search on the grid map is determined according to the following formula:
[0029]
[0030]
[0031]
[0032]
[0033] Among them, k is the starting point of signal transmission in the wireless sensor network (x s ,y s ) and the end point (x e ,y e ), L is the straight line between the starting point and the end point of the signal transmission in the wireless sensor network, d is the distance from node i to DC L, q is the original pheromone concentration when the original pheromone concentration is uniformly distributed, q i is the initial pheromone concentration of node i.
[0034] As an improvement of the above solution, the preset heuristic function is:
[0035]
[0036] Where A is the magnification, d ijE It is the sum of the Euclidean distance from node i to the next node j and the Euclidean distance from the next node j to the end point E;
[0037] The preset probability selection formula is:
[0038]
[0039] in, n ij is the heuristic function, n x is the total expected degree of all nodes transferred from the original grid to the next grid, τ ij(t+1) is the pheromone concentration at time t+1.
[0040] As an improvement to the above scheme, the pheromone concentrations of the initial information transmission paths are updated according to the following formula:
[0041]
[0042]
[0043]
[0044] Among them, τ ij (t+1) is the pheromone concentration at time t+1, ρ is the pheromone concentration volatility coefficient, 0≤ρ≤1; τ ij represents the pheromone concentration at time t, Δτ ij is the pheromone concentration increment, Δτ at the initial time ij =0; Q is the total pheromone concentration, is the pheromone concentration increment on the initial optimal information transmission path; L m is the straight-line distance from the starting point to the end point, L max is the initial optimal information transmission path.
[0045] As an improvement of the above solution, the method of using a dynamic window method to test the turning point of the initial optimal information transmission path to obtain a final information transmission path includes:
[0046] The turning point of the initial optimal information transmission path is tested according to a preset evaluation function:
[0047]
[0048] Among them, v and ω represent the linear velocity and angular velocity of signal transmission respectively, angle(v,ω) is the direction angle evaluation function; vel(v,ω) is the velocity evaluation function; σ is the smoothing coefficient, γ and They are the weighting coefficients of the direction angle evaluation function and the speed evaluation function respectively.
[0049] As an improvement of the above solution, the direction angle evaluation function is:
[0050]
[0051] The speed evaluation function is:
[0052]
[0053] Among them, V m+1 V is the propagation speed of the signal when it reaches the m+1th turning point. m is the propagation speed of the mth turning point.
[0054] The embodiment of the present invention further provides an information transmission path planning device for a wireless sensor network, comprising:
[0055] A grid map construction module is used to construct a grid map of the signal transmission path according to the starting point and end point of the signal transmission in the wireless sensor network;
[0056] An initial optimal information transmission path acquisition module is used to perform path search on the grid map based on the distance and the number of turning points of the information transmission path by using an ant algorithm based on a bidirectional search strategy to obtain an initial optimal information transmission path;
[0057] The final information transmission path acquisition module is used to constrain the linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path, and use the dynamic window method to check the turning point of the initial optimal information transmission path to obtain the final information transmission path.
[0058] Compared with the prior art, the information transmission path planning method and device of a wireless sensor network provided in an embodiment of the present invention constructs a grid map of the signal transmission path according to the starting point and end point of the signal transmission in the wireless sensor network; based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a two-way search strategy is used to search the grid map for a path to obtain an initial optimal information transmission path; the linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path are constrained, and the turning points of the initial optimal information transmission path are checked using a dynamic window method to obtain a final information transmission path. It can be seen that the embodiment of the present invention can improve the signal's ability to avoid unknown obstacles during transmission by combining the ant algorithm and the dynamic window method to plan the information transmission path in a wireless network. BRIEF DESCRIPTION OF THE DRAWINGS
[0059] Figure 1 is a flow chart of a method for information transmission path planning of a wireless sensor network provided by an embodiment of the present invention;
[0060] Figure 2 It is a structural block diagram of an information transmission path planning device for a wireless sensor network provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0061] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0062] See also Figure 1 , Figure 1 1 is a flow chart of a method for planning an information transmission path of a wireless sensor network provided by an embodiment of the present invention, wherein the method for planning an information transmission path of a wireless sensor network comprises:
[0063] S1. Construct a grid map of the signal transmission path according to the starting point and end point of the signal transmission in the wireless sensor network;
[0064] S2, based on the distance and the number of turning points of the information transmission path, using an ant algorithm based on a bidirectional search strategy to search for a path on the grid map to obtain an initial optimal information transmission path;
[0065] S3. Constrain the linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path, and use a dynamic window method to check the turning point of the initial optimal information transmission path to obtain a final information transmission path.
[0066] Specifically, in step S1, the starting point and the end point of the signal transmission in the wireless sensor network are connected, the straight-line distance between the starting point and the end point is calculated, and then a parallel line is made at the starting point and the end point, which is parallel to each other and has a length equal to the straight-line distance between the starting point and the end point, and the four endpoints of the parallel lines are connected to form a parallelogram; this parallelogram is appropriately divided into grids of equal area, that is, a grid map of the signal transmission path is generated.
[0067] Specifically, in step S2, based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a bidirectional search strategy is used to perform a path search on the grid map to obtain an initial optimal information transmission path, including:
[0068] S21, determining the initial pheromone concentration released by the ants during the path search process on the grid map;
[0069] S22, two groups of ants determine the next node according to a preset heuristic function and a preset probability selection formula;
[0070] S23, when two groups of ants meet, several initial information transmission paths are obtained;
[0071] S24, updating the pheromone concentrations of the initial information transmission paths;
[0072] S25. Based on the distances and the number of turning points of the initial information transmission paths, select an initial optimal information transmission path.
[0073] In the embodiment of the present invention, according to the probability selection function composed of the heuristic function and the initial information density of each grid, a number of initial information transmission paths are obtained by bidirectional search; then, the information density of these initial information transmission paths is updated (when the information density of the initial optimal information transmission path is updated, the information density of the initial optimal information transmission path is updated). Update is not 0, i.e. the concentration increase of this path is higher than other paths);
[0074] Based on the distances and the number of turning points of several of the initial information transmission paths, the initial optimal information transmission path is screened out. If the obtained initial optimal information transmission path is not ideal, the heuristic function and the updated information concentration are again combined into a probability selection formula, and a two-way search is performed again. The above steps are repeated until a satisfactory optimal solution appears, that is, the initial optimal information transmission path is obtained.
[0075] Specifically, in step S21, determining the initial pheromone concentration released by the ants during the path search on the grid map includes:
[0076] The initial pheromone concentration released by the ants during the path search on the grid map is determined according to the following formula:
[0077]
[0078]
[0079]
[0080]
[0081] Among them, k is the starting point of signal transmission in the wireless sensor network (x s ,y s ) and the end point (x e ,y e ), L is the straight line between the starting point and the end point of the signal transmission in the wireless sensor network, d is the distance from node i to DC L, q is the original pheromone concentration when the original pheromone concentration is uniformly distributed, q i is the initial pheromone concentration of node i.
[0082] It should be noted that in the currently commonly used traditional information transmission planning algorithm, the original pheromone concentration adopts a uniform distribution method, which is simple and easy to implement, but the same grid information concentration will lead to blind search and poor convergence in the early stage of the algorithm. Since the two-way search strategy can greatly improve the global search ability of the algorithm, speed up the efficiency of the early search, and increase the effective solutions in the early stage, the embodiment of the present invention proposes to make the original information concentration different and bidirectionally dispersed based on the two-way search strategy, provide a general direction for the two-way search, avoid blind search and poor convergence in the early stage of the algorithm, and meet the application scenarios of arbitrary starting and end points.
[0083] Specifically, in step S22, the two groups of ants determine the next node according to a preset heuristic function and a preset probability selection formula, including:
[0084] The preset heuristic function is used to determine whether the expectation degree between any two adjacent nodes is greater than a preset threshold. If so, the next node is determined using the preset probability selection formula.
[0085] It can be understood that the embodiment of the present invention uses a heuristic function to determine the expectation level between any two adjacent nodes. If the expectation level between the two nodes is too low, the path consisting of the two adjacent nodes is abandoned. Otherwise, the preset probability selection formula is used to determine the next node.
[0086] Specifically, the preset heuristic function is:
[0087]
[0088] Where A is the magnification, d ijE It is the sum of the Euclidean distance from node i to the next node j and the Euclidean distance from the next node j to the end point E;
[0089] Specifically, d ijE =μd ij +(1-μ)d jE , where d ij is the Euclidean distance from node i to the next node j, d jE is the Euclidean distance from the next node j to the end point E, and μ is a constant.
[0090] It should be noted that the heuristic function of the traditional planning algorithm is inversely proportional to the distance between grid i and grid j, but the distance difference between adjacent grids is very small, and the guiding effect on the path search is not great. At present, an effective improvement is to use the weighted sum inverse of the distance from the next optional grid of the signal to the end point and the distance from the current grid to the next optional grid as the heuristic function. Although this method takes into account the cost of transferring the current grid to the next grid, the difference in the distance between adjacent grids is small, and the overall heuristic information is not greatly affected. Therefore, the embodiment of the present invention introduces an amplification factor A to increase the difference in heuristic information between adjacent grids, thereby increasing the probability of selecting a shorter node.
[0091] Specifically, the preset probability selection formula is:
[0092]
[0093] in, n ij is the heuristic function, n x is the total expected degree of all nodes transferred from the original grid to the next grid, τ ij (t+1) is the pheromone concentration at time t+1.
[0094] It should be noted that when transferring from one grid to the next, the number of nodes that may be transferred in the next grid is n;
[0095] From the heuristic function, we know that the expected degree of transfer between two nodes is:
[0096]
[0097] d ijE =μd ij +(1-μ)d jE
[0098] Therefore, the total expected degree of all nodes transferred from the original grid to the next grid is:
[0099]
[0100] Then, the probability of a node being selected in the next grid is:
[0101]
[0102] In the formula, n ij is the heuristic function, which indicates the expected degree of signal transfer from node i to node j; d ij is the Euclidean distance from node i to the next node j; d jE is the Euclidean distance from the next node j to the end point E, A is the magnification factor, and μ is a constant.
[0103] Update the information density of all possible paths to the destination, assuming that the information density of a node in the next grid is τ ij (t+1);
[0104] Then, the probability that the node is transferred by the previous node is:
[0105]
[0106] Among them, α is the probability of the node being selected obtained by the heuristic function.
[0107] It is understandable that the greater the transfer probability, the greater the probability of being selected for transfer, which facilitates the selection of more suitable and appropriate transfer nodes.
[0108] Specifically, in step S23, when two groups of ants meet, several initial information transmission paths are obtained.
[0109] Specifically, in step S24, the pheromone concentrations of the initial information transmission paths are updated according to the following formula:
[0110]
[0111]
[0112]
[0113] Among them, τ ij (t+1) is the pheromone concentration at time t+1, ρ is the pheromone concentration volatility coefficient, 0≤ρ≤1; τ ij represents the pheromone concentration at time t, Δτ ij is the pheromone concentration increment, Δτ at the initial time ij =0; Q is the total pheromone concentration, is the pheromone concentration increment on the initial optimal information transmission path; L m is the straight-line distance from the starting point to the end point, L max is the initial optimal information transmission path.
[0114] Specifically, ρ is the volatility coefficient of pheromone concentration, 0≤ρ≤1, and its value depends on the distance between the two nodes. If the transmission distance between the two points is long, the volatility coefficient can be appropriately larger; Q is the total pheromone concentration, and its size depends on the total area of the grid map. The larger the total area, the larger the Q value can be.
[0115] It should be noted that the traditional path planning algorithm adopts a global information concentration update method, and only the information concentration on the shortest path is updated. Although the optimal solution information can be well utilized, it will lead to premature concentration on the same path, reduce the global search ability of the algorithm, and easily fall into the local optimal solution. In addition, when updating the information concentration on the shortest path, it may be considered that there may not be only one shortest path, so most of the time only the information concentration on one of the shortest paths is updated, so that the optimal solution will be lost. Therefore, the embodiment of the present invention updates the information concentration of all paths that reach the end point, and finds the shortest path therein, and then introduces the factor of the number of turns when selecting the optimal path (the increase in the number of turns will greatly affect the propagation efficiency during signal propagation, and turning too frequently will also aggravate the attenuation of the signal and affect the propagation efficiency), and selects the shortest path with the least number of turns as the optimal path to update the information concentration, thereby obtaining a path with higher smoothness and more in line with signal propagation. For example, when the best path 1 and the second best path 2 are updated, the propagation distance and number of turns of the two need to be compared; if the propagation distance of path 1 is similar to that of path 2, but the number of turns is much greater than that of path 2, then path 1 should be abandoned and path 2 should be selected as the best path.
[0116] In the embodiment of the present invention, since the information density is dispersed in the distance grid, the information density τ at the starting point ij (0) Must be obtained through bidirectional search in the grid map.
[0117] Specifically, in step S25, based on the distances and the number of turning points of the initial information transmission paths, an initial optimal information transmission path is selected.
[0118] Specifically, in step S3, according to the characteristic limitations of the signal itself and factors of the surrounding environment, the linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path are constrained:
[0119] (1) Speed constraints
[0120] Assume that the initial propagation speed of the signal is V s , then V s ={(v,ω)|v∈[v max ,v min ],ω∈[ω max ,ω min ]},
[0121] In the formula, v and ω represent the linear velocity and angular velocity of signal transmission respectively; v min 、v max and ω min ,ω max They represent the maximum and minimum values of the midline velocity and angular velocity of signal transmission respectively.
[0122] Since the signal has attenuation during the propagation process, v is usually selected. max and ω max is the transmission line speed and angular velocity of the previous node, v min and ω min It is half of the transmission line speed and angular velocity of the previous node.
[0123] (2) Acceleration constraint
[0124] Although the signal is attenuated during transmission, it cannot be attenuated excessively, otherwise it will affect the quality of signal transmission and reception, or even prevent the signal from being received at all. Therefore, the following restrictions are imposed on the acceleration attenuation of the linear velocity and angular velocity between two nodes:
[0125] V d ={(v,ω)|v∈[v n ,v-at],ω∈[ω n ,ω n -bt]}
[0126] In the formula, v n and ω n They represent the linear velocity and angular velocity of the signal at the turning point n respectively; a and b represent the maximum attenuation acceleration of the linear velocity and angular velocity of signal transmission respectively. Generally, the maximum attenuation acceleration is the attenuation acceleration when the signal propagation speed of the previous node decays to two-thirds of the original.
[0127] Specifically, in step S3, the turning point of the initial optimal information transmission path is tested by using a dynamic window method to obtain a final information transmission path, including:
[0128] The turning point of the initial optimal information transmission path is tested according to a preset evaluation function:
[0129]
[0130] Among them, v and ω represent the linear velocity and angular velocity of signal transmission respectively, angle(v,ω) is the direction angle evaluation function; vel(v,ω) is the velocity evaluation function; σ is the smoothing coefficient, γ and They are the weighting coefficients of the direction angle evaluation function and the speed evaluation function respectively.
[0131] It can be understood that the function evaluation criterion is that the selected turning point can help the signal avoid obstacles as much as possible during transmission and move quickly toward the target. In the embodiment of the present invention, if the score of a turning point calculated by the evaluation function is too low, the turning point can be deleted, and its previous turning point and the next turning point are used as the starting point and the end point, and the approximate middle turning point is obtained by solving the above embodiment.
[0132] Specifically, the direction angle evaluation function is:
[0133]
[0134] The speed evaluation function is:
[0135]
[0136] Among them, V m+1 V is the propagation speed of the signal when it reaches the m+1th turning point. m is the propagation speed of the mth turning point.
[0137] In the embodiment of the present invention, since the transmission speed of the signal cannot decay too fast during transmission, and the turning angle of each turning node cannot be too high, the direction angle evaluation function and the speed evaluation function are as follows:
[0138]
[0139]
[0140] Where V m+1 V is the propagation speed of the signal when it reaches the m+1th turning point. m is the propagation speed of the mth turning point; γ and The value of depends on the angle deviation of the line connecting the starting point and the end point, and the length of the distance. Normally, the values of both are 1. However, if the deviation angle is large, γ can be appropriately small. If the straight line distance is short, The value can be appropriately larger.
[0141] In the embodiment of the present invention, the selection of turning points should fully consider the limitations of the signal's own characteristics and the constraints of the environment on the signal propagation speed. Therefore, the speed pair (linear speed and angular speed) in the two-dimensional space of the signal propagation speed is selected and certain constraints are imposed on them; and a reasonable evaluation function is designed to perform certain optimization screening on the selected nodes in the initial optimal transmission path, and finally complete the overall path optimization. It can be seen that by designing a reasonable and practical evaluation function, not only the propagation speed is reasonably evaluated, but also the turning angle is reasonably tested, so that the designed route not only has the shortest distance, but also greatly reduces the turning angle and number, has a low degree of interference from dynamic and static obstacles, and has high signal transmission efficiency.
[0142] In another preferred embodiment, the information transmission path planning method of the wireless sensor network further includes:
[0143] Obtaining a first turning point of the final information transmission path;
[0144] Determining a theoretical value of a starting transmission heading angle of the final information transmission path according to the starting point and the first turning point;
[0145] Obtaining an actual value of a starting transmission heading angle of the final information transmission path;
[0146] Based on the comparison result of the actual value of the starting transmission heading angle and the theoretical value of the starting transmission heading angle, a final optimal information transmission path is obtained.
[0147] Specifically, determining the theoretical value of the starting transmission heading angle of the final information transmission path according to the starting point and the first turning point includes:
[0148] The theoretical value of the starting transmission heading angle of the final information transmission path is determined according to the following formula:
[0149] d=((X1-X s ) 2 +(Y1-Y s ) 2 ) 1 / 2
[0150]
[0151] θ=arcsin(c)
[0152] Among them, θ is the theoretical value of the starting transmission heading angle of the final information transmission path, (X s ,Y s ) is the starting point coordinate of signal transmission, and (X1, Y1) is the first turning point coordinate of the final information transmission path.
[0153] It should be noted that in most planning algorithms, the initial transmission heading angle of the signal is a randomly set fixed angle, but when the angle deviation from the target point is large, the initial search route will detour, increasing the redundancy of the signal transmission path; therefore, the embodiment of the present invention proposes to obtain the initial transmission heading angle theoretical value by the angle between the line connecting the starting point and the first turning point and the horizontal direction. When the deviation between the initial transmission heading angle theoretical value and the initial transmission heading angle actual value is not greater than the preset deviation, the final information transmission path is determined to be the final optimal information transmission path. Otherwise, continue to iterate until the deviation between the initial transmission heading angle theoretical value and the initial transmission heading angle actual value is not greater than the preset deviation, and the final optimal information transmission path is obtained to avoid detours.
[0154] An information transmission path planning method for a wireless sensor network provided in an embodiment of the present invention constructs a grid map of the signal transmission path according to the starting point and end point of the signal transmission in the wireless sensor network; based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a two-way search strategy is used to search the grid map for a path to obtain an initial optimal information transmission path; the linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path are constrained, and the turning points of the initial optimal information transmission path are checked using a dynamic window method to obtain a final information transmission path. It can be seen that the embodiment of the present invention can improve the signal's ability to avoid unknown obstacles during transmission by combining the ant algorithm and the dynamic window method to plan the information transmission path in a wireless network.
[0155] See also Figure 2 , Figure 2 1 is a structural block diagram of an information transmission path planning device 10 for a wireless sensor network provided by an embodiment of the present invention. The information transmission path planning device 10 for a wireless sensor network includes:
[0156] A grid map construction module 11 is used to construct a grid map of the signal transmission path according to the starting point and the end point of the signal transmission in the wireless sensor network;
[0157] An initial optimal information transmission path acquisition module 12 is used to perform path search on the grid map based on the distance and the number of turning points of the information transmission path by using an ant algorithm based on a bidirectional search strategy to obtain an initial optimal information transmission path;
[0158] The final information transmission path acquisition module 13 is used to constrain the linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path, and use the dynamic window method to check the turning point of the initial optimal information transmission path to obtain the final information transmission path.
[0159] Preferably, the information transmission path planning device of the wireless sensor network further includes:
[0160] A first turning point acquisition module, used to acquire the first turning point of the final information transmission path;
[0161] A starting transmission heading angle theoretical value calculation module, used to determine the starting transmission heading angle theoretical value of the final information transmission path according to the starting point and the first turning point;
[0162] A starting transmission heading angle actual value acquisition module, used to acquire the starting transmission heading angle actual value of the final information transmission path;
[0163] The final optimal information transmission path acquisition module is used to obtain the final optimal information transmission path based on the comparison result of the actual value of the starting transmission heading angle and the theoretical value of the starting transmission heading angle.
[0164] Preferably, determining the theoretical value of the starting transmission heading angle of the final information transmission path according to the starting point and the first turning point includes:
[0165] The theoretical value of the starting transmission heading angle of the final information transmission path is determined according to the following formula:
[0166] d=((X1-X s ) 2 +(Y1-Y s ) 2 ) 1 / 2
[0167]
[0168] θ=arcsin(c)
[0169] Among them, θ is the theoretical value of the starting transmission heading angle of the final information transmission path, (X s ,Y s ) is the starting point coordinate of signal transmission, and (X1, Y1) is the first turning point coordinate of the final information transmission path.
[0170] Preferably, based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a bidirectional search strategy is used to perform path search on the grid map to obtain an initial optimal information transmission path, including:
[0171] determining an initial pheromone concentration released by ants during a path search on the grid map;
[0172] Two groups of ants determine the next node based on a preset heuristic function and a preset probability selection formula;
[0173] When two groups of ants meet, they obtain several initial information transmission paths;
[0174] updating the pheromone concentrations of the initial information transmission paths;
[0175] Based on the distances and the number of turning points of the initial information transmission paths, an initial optimal information transmission path is selected.
[0176] Preferably, the two groups of ants determine the next node according to a preset heuristic function and a preset probability selection formula, including:
[0177] The preset heuristic function is used to determine whether the expectation degree between any two adjacent nodes is greater than a preset threshold. If so, the next node is determined using the preset probability selection formula.
[0178] Preferably, the determining of the initial pheromone concentration released by the ants during the path search on the grid map comprises:
[0179] The initial pheromone concentration released by the ants during the path search on the grid map is determined according to the following formula:
[0180]
[0181]
[0182]
[0183]
[0184] Among them, k is the starting point of signal transmission in the wireless sensor network (x s ,y s ) and the end point (x e ,y e ), L is the straight line between the starting point and the end point of the signal transmission in the wireless sensor network, d is the distance from node i to DC L, q is the original pheromone concentration when the original pheromone concentration is uniformly distributed, q i is the initial pheromone concentration of node i.
[0185] Preferably, the preset heuristic function is:
[0186]
[0187] Where A is the magnification, d ijE It is the sum of the Euclidean distance from node i to the next node j and the Euclidean distance from the next node j to the end point E;
[0188] The preset probability selection formula is:
[0189]
[0190] in, n ij is the heuristic function, n x is the total expected degree of all nodes transferred from the original grid to the next grid, τ ij (t+1) is the pheromone concentration at time t+1.
[0191] Preferably, the pheromone concentrations of the initial information transmission paths are updated according to the following formula:
[0192]
[0193]
[0194]
[0195] Among them, τ ij (t+1) is the pheromone concentration at time t+1, ρ is the pheromone concentration volatility coefficient, 0≤ρ≤1; τ ij represents the pheromone concentration at time t, Δτ ij is the pheromone concentration increment, Δτ at the initial time ij =0; Q is the total pheromone concentration, is the pheromone concentration increment on the initial optimal information transmission path; L m is the straight-line distance from the starting point to the end point, L max is the initial optimal information transmission path.
[0196] Preferably, the step of using a dynamic window method to test the turning point of the initial optimal information transmission path to obtain a final information transmission path includes:
[0197] The turning point of the initial optimal information transmission path is tested according to a preset evaluation function:
[0198]
[0199] Among them, v and ω represent the linear velocity and angular velocity of signal transmission respectively, angle(v,ω) is the direction angle evaluation function; vel(v,ω) is the velocity evaluation function; σ is the smoothing coefficient, γ and They are the weighting coefficients of the direction angle evaluation function and the speed evaluation function respectively.
[0200] Preferably, the direction angle evaluation function is:
[0201]
[0202] The speed evaluation function is:
[0203]
[0204] Among them, V m+1 V is the propagation speed of the signal when it reaches the m+1th turning point. m is the propagation speed of the mth turning point.
[0205] It is worth noting that the working process of each module in the information transmission path planning device 10 of the wireless sensor network described in the embodiment of the present invention can refer to the working process of the information transmission path planning method of the wireless sensor network described in the above embodiment, which will not be repeated here.
[0206] An information transmission path planning device 10 for a wireless sensor network provided in an embodiment of the present invention constructs a grid map of the signal transmission path according to the starting point and end point of the signal transmission in the wireless sensor network; based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a two-way search strategy is used to search the grid map for a path to obtain an initial optimal information transmission path; the linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path are constrained, and the turning points of the initial optimal information transmission path are checked using a dynamic window method to obtain a final information transmission path. It can be seen that the embodiment of the present invention can improve the signal's ability to avoid unknown obstacles during transmission by combining the ant algorithm and the dynamic window method to plan the information transmission path in the wireless network.
[0207] The above is a preferred embodiment of the present invention. It should be pointed out that a person skilled in the art can make several improvements and modifications without departing from the principle of the present invention. These improvements and modifications are also considered to be within the scope of protection of the present invention.
Claims
1. A method for information transmission path planning in a wireless sensor network, characterized in that: include: According to the starting point and end point of signal transmission in the wireless sensor network, a grid map of the signal transmission path is constructed; Based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a bidirectional search strategy is used to search the path on the grid map to obtain an initial optimal information transmission path; Constraining the linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path, and using a dynamic window method to test the turning point of the initial optimal information transmission path to obtain a final information transmission path; The information transmission path planning method of the wireless sensor network also includes: Obtaining a first turning point of the final information transmission path; Determining a theoretical value of a starting transmission heading angle of the final information transmission path according to the starting point and the first turning point; Obtaining an actual value of a starting transmission heading angle of the final information transmission path; Based on the comparison result of the actual value of the starting transmission heading angle and the theoretical value of the starting transmission heading angle, a final optimal information transmission path is obtained; The theoretical value of the starting transmission heading angle of the final information transmission path is determined according to the following formula: d=((X1-X s ) 2 +(Y1-Y s ) 2 ) 1 / 2 θ=arcsin(c) Among them, θ is the theoretical value of the starting transmission heading angle of the final information transmission path, (X s ,Y s ) is the starting point coordinate of signal transmission, (X1, Y1) is the first turning point coordinate of the final information transmission path; Based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a bidirectional search strategy is used to search the path of the grid map to obtain an initial optimal information transmission path, including: determining an initial pheromone concentration released by ants during a path search on the grid map; Two groups of ants determine the next node based on a preset heuristic function and a preset probability selection formula; When two groups of ants meet, they obtain several initial information transmission paths; updating the pheromone concentrations of the initial information transmission paths; Based on the distances and the number of turning points of the initial information transmission paths, selecting an initial optimal information transmission path; The two groups of ants determine the next node according to a preset heuristic function and a preset probability selection formula, including: Using the preset heuristic function, determine whether the expectation degree between any two adjacent nodes is greater than a preset threshold, and if so, determine the next node using the preset probability selection formula; The determining of the initial pheromone concentration released by the ants during the path search on the grid map comprises: The initial pheromone concentration released by the ants during the path search on the grid map is determined according to the following formula: Among them, k is the starting point of signal transmission in the wireless sensor network (x s ,y s ) and the end point (x e ,y e ), L is the straight line between the starting point and the end point of the signal transmission in the wireless sensor network, d is the distance from node i to the straight line L, q is the original pheromone concentration when the original pheromone concentration is uniformly distributed, q i is the initial pheromone concentration of node i.
2. The information transmission path planning method of a wireless sensor network according to claim 1, characterized in that: The preset heuristic function is: Where A is the magnification, d ijE It is the sum of the Euclidean distance from node i to the next node j and the Euclidean distance from the next node j to the end point E; The preset probability selection formula is: in, n ij is the heuristic function, n x is the total expected degree of all nodes transferred from the original grid to the next grid, τ ij (t+1) is the pheromone concentration at time t+1.
3. The information transmission path planning method of a wireless sensor network according to claim 1, characterized in that: The pheromone concentrations of the initial information transmission paths are updated according to the following formula: Among them, τ ij (t+1) is the pheromone concentration at time t+1, ρ is the pheromone concentration volatility coefficient, 0≤ρ≤1; τ ij represents the pheromone concentration at time t, Δτ ij is the pheromone concentration increment, at the initial time Δτ ij =0; Q is the total pheromone concentration, is the pheromone concentration increment on the initial optimal information transmission path; L m is the straight-line distance from the starting point to the end point, L max is the initial optimal information transmission path.
4. The information transmission path planning method for a wireless sensor network according to claim 1, characterized in that: The method of using the dynamic window method to test the turning point of the initial optimal information transmission path to obtain the final information transmission path includes: The turning point of the initial optimal information transmission path is tested according to a preset evaluation function: Among them, v and ω represent the linear velocity and angular velocity of signal transmission respectively, angle(v,ω) is the direction angle evaluation function; vel(v,ω) is the velocity evaluation function; σ is the smoothing coefficient, γ and They are the weighting coefficients of the direction angle evaluation function and the speed evaluation function respectively.
5. The information transmission path planning method for a wireless sensor network as claimed in claim 4, characterized in that: The direction angle evaluation function is: The speed evaluation function is: Among them, V m+1 V is the propagation speed of the signal when it reaches the m+1th turning point. m is the propagation speed of the mth turning point.
6. An information transmission path planning device for a wireless sensor network, characterized in that: include: A grid map construction module is used to construct a grid map of the signal transmission path according to the starting point and end point of the signal transmission in the wireless sensor network; An initial optimal information transmission path acquisition module is used to perform path search on the grid map based on the distance and the number of turning points of the information transmission path by using an ant algorithm based on a bidirectional search strategy to obtain an initial optimal information transmission path; A final information transmission path acquisition module is used to constrain the linear velocity and angular velocity of the signal transmitted along the initial optimal information transmission path, and to test the turning point of the initial optimal information transmission path using a dynamic window method to obtain a final information transmission path; The information transmission path planning device of the wireless sensor network also includes: A first turning point acquisition module, used to acquire the first turning point of the final information transmission path; A starting transmission heading angle theoretical value calculation module, used to determine the starting transmission heading angle theoretical value of the final information transmission path according to the starting point and the first turning point; A starting transmission heading angle actual value acquisition module, used to acquire the starting transmission heading angle actual value of the final information transmission path; A final optimal information transmission path acquisition module, used for obtaining a final optimal information transmission path based on a comparison result of the actual value of the starting transmission heading angle and the theoretical value of the starting transmission heading angle; The step of determining a theoretical value of a starting transmission heading angle of the final information transmission path according to the starting point and the first turning point includes: The theoretical value of the starting transmission heading angle of the final information transmission path is determined according to the following formula: d=((X1-X s ) 2 +(Y1-Y s ) 2 ) 1 / 2 θ=arcsin(c) Among them, θ is the theoretical value of the starting transmission heading angle of the final information transmission path, (X s ,Y s ) is the starting point coordinate of signal transmission, (X1, Y1) is the first turning point coordinate of the final information transmission path; Based on the distance and the number of turning points of the information transmission path, an ant algorithm based on a bidirectional search strategy is used to search the path of the grid map to obtain an initial optimal information transmission path, including: determining an initial pheromone concentration released by ants during a path search on the grid map; Two groups of ants determine the next node based on a preset heuristic function and a preset probability selection formula; When two groups of ants meet, they obtain several initial information transmission paths; updating the pheromone concentrations of the initial information transmission paths; Based on the distances and the number of turning points of the initial information transmission paths, selecting an initial optimal information transmission path; The two groups of ants determine the next node according to a preset heuristic function and a preset probability selection formula, including: Using the preset heuristic function, determine whether the expectation degree between any two adjacent nodes is greater than a preset threshold, and if so, determine the next node using the preset probability selection formula; The determining of the initial pheromone concentration released by the ants during the path search on the grid map comprises: The initial pheromone concentration released by the ants during the path search on the grid map is determined according to the following formula: Among them, k is the starting point of signal transmission in the wireless sensor network (x s ,y s ) and the end point (x e ,y e ), L is the straight line between the starting point and the end point of the signal transmission in the wireless sensor network, d is the distance from node i to DC L, q is the original pheromone concentration when the original pheromone concentration is uniformly distributed, q i is the initial pheromone concentration of node i.
Citation Information
Patent Citations
Mobile robot route planning method with ant colony algorithm
CN109945881A
Mobile robot path planning method based on hybrid algorithm
CN112650242A
Mobile robot path planning method based on smoothing factor improved ant colony algorithm
CN113703450A
Forklift path planning method and system based on improved ant colony algorithm
CN113985888A
