By Topic

Genetic Algorithms and Simulated Annealing optimization methods in wireless sensor networks localization using artificial neural networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

Node localization in wireless sensor networks (WSNs) is important for applications such as military surveillance, environmental monitoring, robotics, and many others. The sensor motes used in this type of application present low-power and low-cost profile. Hence, they require methods that compute their positions using indirect information such as Received Signal Strength Indicator (RSSI). This work presents Genetic Algorithms and Simulated Annealing optimization methods applied (independently) in artificial neural networks (ANNs) aiming node localization in WSNs. The RSSI measurements were used as the ANNs inputs to localize the nodes. This receiver-based approach was tested using MATLAB and Probabilistic Wireless Network Simulator (Prowler) to collect the ANNs input data, under simulated static indoor network environment. Results using the best ANN structure found after optimization using GA had a root mean square error of 0.39 meter against the 0.61 meter reached through the SA algorithm.

Published in:

2012 IEEE 55th International Midwest Symposium on Circuits and Systems (MWSCAS)

Date of Conference:

5-8 Aug. 2012