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

Adaptive Chaotic Ant Colony Optimization for Energy Optimization in Smart Sensor Networks

Abstract: Smart sensor network has the characteristics of low cost, low power consumption, real time, strong adaptability, etc., and it has a wide range of application prospects in the agricultural field. However, the smart sensor node is limited by its own energy; it also faces many bottlenecks in agricultural applications. Therefore, balancing the energy consumption of nodes and extending the life of the network are important considerations in the design of efficient routing for smart sensor networks. Aiming at the pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…H a,a+1 is heuristic function information; D1 is the reciprocal of the distance from the current node to the next node; D2 is the reciprocal of the distance from the next node to the target point; i a , j a , k a is the current node coordinate; ði a+1 , j a+1 , k a+1 Þ is the coordinate of the next node; i G , j G , k G is the target point coordinate; N is the total number of nodes in the exploration area of the current node; N a+1 is the number of infeasible nodes in the exploration area of the current node; w 1 , w 2 , w 3 is the corresponding weight. By introducing the obstacle avoidance strategy and improving the heuristic information function, the global search ability of the algorithm can be effectively improved [18].…”
Section: Routementioning
confidence: 99%
“…H a,a+1 is heuristic function information; D1 is the reciprocal of the distance from the current node to the next node; D2 is the reciprocal of the distance from the next node to the target point; i a , j a , k a is the current node coordinate; ði a+1 , j a+1 , k a+1 Þ is the coordinate of the next node; i G , j G , k G is the target point coordinate; N is the total number of nodes in the exploration area of the current node; N a+1 is the number of infeasible nodes in the exploration area of the current node; w 1 , w 2 , w 3 is the corresponding weight. By introducing the obstacle avoidance strategy and improving the heuristic information function, the global search ability of the algorithm can be effectively improved [18].…”
Section: Routementioning
confidence: 99%
“…The MAC protocol used for the execution of the proposed system was IEEE 802.11. To evaluate the overall performance, the proposed TMERP was compared with the EEMR, 17 ACACO, 18 PSOFCA 19 and APSA 24 . The evaluation metrics used for the performance evaluation were the routing overhead, energy consumption, hop count, average reliability, average link connectivity, and maximum round of networks 31,32 .…”
Section: Simulation Results and Discussionmentioning
confidence: 99%
“…Jia et al 18 proposed adaptive chaotic ant colony optimisation (ACACO) to optimize energy in smart sensor networks. The proposed system is designed to balance the node's energy dissipation and maximize the network lifetime.…”
Section: Related Workmentioning
confidence: 99%
“…After considering the different arguments made to explain the phenomena, the shortcomings should not impede the use of ant colony optimization in agriculture, given that significant cost savings in machine optimization were achieved despite sub-optimal stagnation phase, exploitation, and exploration phases [16,19,140]. The positive outlook is further reinforced by the utility of the ant colony algorithm in energy optimization in smart sensor networks [148]. On the downside, the worldviews advanced by the researcher were not supported by market data in Europe, Asia, the Americas, Africa, and Oceania.…”
Section: Ant Colony Optimization Algorithm (Acoa)mentioning
confidence: 99%