Conjunction of Heuristic Algorithms with Multidimensional Scaling for Localization at Wireless Ad-Hoc Networks

ALTINÖZ Ö. T., AKBULUT A., Numanoglu T., Yenihayat G., Goken C., Yilmaz A. E.

25th Signal Processing and Communications Applications Conference (SIU), Antalya, Türkiye, 15 - 18 Mayıs 2017 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/siu.2017.7960544
  • Basıldığı Şehir: Antalya
  • Basıldığı Ülke: Türkiye
  • Anahtar Kelimeler: multidimensional scaling, simulated annealing algorithm, particle swarm optimization, genetic algorithm, localization
  • Ankara Üniversitesi Adresli: Evet

Özet

In wireless networks, the nodes are generally distributed in a field randomly. The topological information about the nodes is only supported from the distances between each node. This distance information may not be available due to the imperfect conditions among nodes. The positions of the distributed nodes on the field by using available distance data is called node localization problem. One of the methods which can be solved this problem is classical multidimensional algorithm (cMDS). In this study, cMDS is improved with the aid of heuristic algorithms. Three heuristic algorithms (simulated annealing, particle swarm optimization and genetic algorithm) are applied and results are compared with each other.