2012 IEEE Sensors Applications Symposium Proceedings 2012
DOI: 10.1109/sas.2012.6166290
|View full text |Cite
|
Sign up to set email alerts
|

Target classification in Wireless Sensor Network using Particle Swarm Optimization (PSO)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 16 publications
0
7
0
Order By: Relevance
“…In fact, these hit rates outperform the values obtained by using PSO algorithm [12]. However, the two-stage SVM prodedure [11] results are better but they did not work in a real scenario and their radar echo signals presented no interference due to the fact that it worked in a controlled environment without the presence of multiple targets (Table IV).…”
Section: Discussionmentioning
confidence: 86%
See 1 more Smart Citation
“…In fact, these hit rates outperform the values obtained by using PSO algorithm [12]. However, the two-stage SVM prodedure [11] results are better but they did not work in a real scenario and their radar echo signals presented no interference due to the fact that it worked in a controlled environment without the presence of multiple targets (Table IV).…”
Section: Discussionmentioning
confidence: 86%
“…Moreover, a two-stage support vector machine (SVM) classification method using Mel-Frequency Cepstrum coefficients is developed and proposed in [11]. Another alternative is proposed by Gharaibeh and Yaqot [12]. They presented a methodology based on Particle Swarm Optimization (PSO) that improved the computational speed for the nearest neighbor clustering technique.…”
Section: Related Workmentioning
confidence: 99%
“…(3) while ( < max ) (4) Update current location information of ; (5) Update the neighbour nodes set and the number of ; (6) Replay EDQ with current coverage rate of monitored area, and determine whether is a redundant node; 7if ( is a redundant node) (8) Set into sleeping mode; (9) else (10) if ( is sleeping) (11) Wake up ; (12) ⃗ ← 0; (13) for ( = 0; < ; ++) (14) Calculate the virtual repulsive force ⃗ on node Si from ; (15) ⃗ ← ⃗ + ⃗ ;…”
Section: Case Studymentioning
confidence: 99%
“…Move to the target position; Update ; (5) Receive target location information of all nodes within the communication range. We use node as an example; (6) Calculate the coverage rate of monitored region Ω after moving to target location; (7) Calculate the coverage impact factor of ; (8) Send the coverage impact factor to ; (9) sleep(Δ ); (10) end; Algorithm 2 do not present a fluctuating state during the execution of RBCT algorithm since the introduction of coverage impact factor. By RBCT algorithm, the coverage rates are raised to 50.3%, 65.2%, 76.3%, 86.1%, and 92.8% without changing the number of initial nodes.…”
Section: Case Studymentioning
confidence: 99%
“…Moreover, a two-stage support vector machine (SVM) classification method using Mel-Frequency Cepstrum coefficients is developed and proposed in [ 5 ]. Another alternative is proposed by Gharaibeh and Yaqot [ 6 ]. They presented a methodology based on Particle Swarm Optimization (PSO) that improved the computational speed for the nearest neighbor clustering technique.…”
Section: Introductionmentioning
confidence: 99%