2014
DOI: 10.1155/2014/950683
|View full text |Cite
|
Sign up to set email alerts
|

Consensus Achievement of Decentralized Sensors Using Adapted Particle Swarm Optimization Algorithm

Abstract: This paper explores the possibility of enhancing consensus achievement of decentralized sensors by establishing cooperative behavior between sensor agents. To these ends, a novel particle swarm optimization framework to achieve robust consensus of decentralized sensors is devised to distribute sensing information via local fusing with neighbors rather than through centralized control; the new framework showed a 16.5 percent improvement in consensus achievement as compared to the classic majority rule method. N… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 26 publications
0
5
0
Order By: Relevance
“…13,19 To obtain optimal solutions of sensor placement, many researchers have to turn to the heuristic algorithms, such as genetic algorithm, 20,21 simulated annealing, 22 monkey algorithm, 23 ant colony algorithm, 24 and particle swarm optimization. 25 However, these studies do not emphasize critical area coverage problems of sensor placement for indoor positioning.…”
Section: Related Workmentioning
confidence: 99%
“…13,19 To obtain optimal solutions of sensor placement, many researchers have to turn to the heuristic algorithms, such as genetic algorithm, 20,21 simulated annealing, 22 monkey algorithm, 23 ant colony algorithm, 24 and particle swarm optimization. 25 However, these studies do not emphasize critical area coverage problems of sensor placement for indoor positioning.…”
Section: Related Workmentioning
confidence: 99%
“…Regardless of location, a significant issue in autonomous swarms is decentralized coordination and control. Approaches to this problem include probabilistic density control of autonomous swarms [10], controllers for shape generation [11], sensor consensus achievement through particle swarm optimization [12], and non-homogeneous robotic swarm navigation [13]. Probabilistic density control of autonomous swarms has been achieved using Markov chain based approach using a decentralized density computation [10].…”
Section: B Related Workmentioning
confidence: 99%
“…Decentralized controller methods enable swarms to create two dimensional shapes without requiring inter-agent communication [11]. Consensus algorithm for distributed sensors through data fusion of neighboring nodes that outperformed classic algorithms by 16.5% with little to no delay [12]. Finally, a leader-follower method for swarm navigation using only local data has been tested with physical drones [13].…”
Section: B Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…This research involved in many modern heuristic algorithms such as genetic algorithm (GA) [5,6], simulated annealing (SA) [7], monkey algorithm (MA) [8], ant colony algorithm (ACO) [9] and differential evolution (DE). Kim established a novel particle swarm optimization framework to achieve robust consensus of decentralized sensors with neighbors rather than through centralized control [10]. An algorithm based on ladder diffusion and ACO is proposed to solve the power consumption and transmission routing problems in wireless sensor networks [9].…”
Section: Introductionmentioning
confidence: 99%