Localization in Wireless Sensor Networks Using Heuristic Optimization Techniques

Authors

  • Ewa Niewiadomska-Szynkiewicz
  • Michał Marks
  • Mariusz Kamola

DOI:

https://doi.org/10.26636/jtit.2011.4.1178

Keywords:

evolutionary strategy, genetic algorithm, localization, location systems, nonconvex optimization, simulated annealing, wireless sensor network

Abstract

Many applications of wireless sensor networks (WSN) require information about the geographic location of each sensor node. Devices that form WSN are expected to be remotely deployed in large numbers in a sensing field, and to self-organize to perform sensing and acting task. The goal of localization is to assign geographic coordinates to each device with unknown position in the deployment area. Recently, the popular strategy is to apply optimization algorithms to solve the localization problem. In this paper, we address issues associated with the application of heuristic techniques to accurate localization of nodes in a WSN system. We survey and discuss the location systems based on simulated annealing, genetic algorithms and evolutionary strategies. Finally, we describe and evaluate our methods that combine trilateration and heuristic optimization.

Downloads

Download data is not yet available.

Downloads

Published

2011-12-30

Issue

Section

ARTICLES FROM THIS ISSUE

How to Cite

[1]
E. Niewiadomska-Szynkiewicz, M. Marks, and M. Kamola, “Localization in Wireless Sensor Networks Using Heuristic Optimization Techniques”, JTIT, vol. 46, no. 4, pp. 55–64, Dec. 2011, doi: 10.26636/jtit.2011.4.1178.

Most read articles by the same author(s)

1 2 3 > >>