2021
DOI: 10.1155/2021/5590951
|View full text |Cite
|
Sign up to set email alerts
|

Minimization of Energy Consumption for Routing in High‐Density Wireless Sensor Networks Based on Adaptive Elite Ant Colony Optimization

Abstract: High-density wireless sensor networks (HDWSNs) are usually deployed randomly, and each node of the network collects data from complex environments. Because the energy of sensor nodes is powered by batteries, it is basically impossible to replace batteries or charge in the complex surroundings. In this paper, a QoS routing energy consumption model is designed, and an improved adaptive elite ant colony optimization (AEACO) is proposed to reduce HDWSN routing energy consumption. This algorithm uses the adaptive o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 31 publications
(44 reference statements)
0
12
0
Order By: Relevance
“…There are both black grids representing obstacles and white grids representing free walking in the grid, which makes the robot operating environment from complex to simple, and the path planning problem is relatively simple. Therefore, for the grid method, the most important thing is to determine the size of the divided grid, which will directly affect the operation of the algorithm and the final planning effect [19] (2) Geometric method uses geometric features (such as points, lines, and surfaces) to represent objects in the scene; abstracts the environmental information collected by the sensors carried by the robot into common geometric features, such as vertices, lines, curves, and corners; and then describes and records them with coordinates [20] (3) The expression of topological graph method is more abstract. It uses graphs to represent the spatial relationship between objects in the environment, and the nodes of the graph represent the feature points in the environment [21].…”
Section: Environmental Modelingmentioning
confidence: 99%
“…There are both black grids representing obstacles and white grids representing free walking in the grid, which makes the robot operating environment from complex to simple, and the path planning problem is relatively simple. Therefore, for the grid method, the most important thing is to determine the size of the divided grid, which will directly affect the operation of the algorithm and the final planning effect [19] (2) Geometric method uses geometric features (such as points, lines, and surfaces) to represent objects in the scene; abstracts the environmental information collected by the sensors carried by the robot into common geometric features, such as vertices, lines, curves, and corners; and then describes and records them with coordinates [20] (3) The expression of topological graph method is more abstract. It uses graphs to represent the spatial relationship between objects in the environment, and the nodes of the graph represent the feature points in the environment [21].…”
Section: Environmental Modelingmentioning
confidence: 99%
“…Engineering construction personnel can even complete their work in a few hours. Customers can flexibly configure the system according to their personal needs to adapt to their own lifestyle; intelligent household system has a very extensive application [17,18].…”
Section: Related Workmentioning
confidence: 99%
“…Considering that binary coding cannot directly reflect the individual structure, and the binary length is long, accounting for large memory, the positioning algorithm in this article is code type genetic algorithm, because of the real number encoding, easy operation, and transformation (4) Genetic positioning operator design genetic operator mainly includes selection, crossing, and variation operations. The selection operation adopts the 3 Wireless Communications and Mobile Computing adaptive gambling selection method; the crossadopted multipoint intersection, that is, the X-axis parameters and the Y-axis parameters, corresponds to cross; the variation operation selects the discrete single-point variant mode (5) Genetic positioning algorithm termination determination when the number of iterations reaches a predetermined number, or when the maturity of the group satisfies certain conditions, the iteration is stopped [16][17][18]…”
Section: ) Constraint Conditions For Positioning Optimization Modelsmentioning
confidence: 99%