Analysis of the Dragonfly Algorithm for 2-D Range-Based Wireless Localization 


Vol. 42,  No. 9, pp. 1843-1849, Sep.  2017
10.7840/kics.2017.42.9.1843


PDF Full-Text
  Abstract

In this paper, we provide analysis of the swarming behaviors in Dragonfly Algorithm (DA) on account of being used for range-based wireless localization in 2-D scenario. DA is a metaheuristic algorithm based on the swarming behaviors of dragonfly. Wireless localization itself can be treated as optimization problem, which make DA applicable for it. This paper also covers several previous works related to application of bio-inspired metaheuristic algorithm in localization. The analysis for each swarming behavior is presented numerically and discussed. The results show that there are ways of improvement for DA when applied for wireless localization.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

P. T. Daely and S. Y. Shin, "Analysis of the Dragonfly Algorithm for 2-D Range-Based Wireless Localization," The Journal of Korean Institute of Communications and Information Sciences, vol. 42, no. 9, pp. 1843-1849, 2017. DOI: 10.7840/kics.2017.42.9.1843.

[ACM Style]

Philip Tobianto Daely and Soo Young Shin. 2017. Analysis of the Dragonfly Algorithm for 2-D Range-Based Wireless Localization. The Journal of Korean Institute of Communications and Information Sciences, 42, 9, (2017), 1843-1849. DOI: 10.7840/kics.2017.42.9.1843.

[KICS Style]

Philip Tobianto Daely and Soo Young Shin, "Analysis of the Dragonfly Algorithm for 2-D Range-Based Wireless Localization," The Journal of Korean Institute of Communications and Information Sciences, vol. 42, no. 9, pp. 1843-1849, 9. 2017. (https://doi.org/10.7840/kics.2017.42.9.1843)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880