Simulated annealing based wireless sensor network localization

Kannan, AA; Mao, G; Vucetic, B

Simulated annealing based wireless sensor network localization

Kannan, AA Mao, G

Vucetic, B

Permalink

Publication Type:: Journal Article
Citation:: Journal of Computers, 2006, 1 (2), pp. 15 - 22
Issue Date:: 2006-01-01

Closed Access

	Filename	Description	Size
	2013001685OK.pdf		467.69 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Kannan, AA	en_US
dc.contributor.author	Mao, G https://orcid.org/0000-0002-3598-4949	en_US
dc.contributor.author	Vucetic, B	en_US
dc.date.issued	2006-01-01	en_US
dc.identifier.citation	Journal of Computers, 2006, 1 (2), pp. 15 - 22	en_US
dc.identifier.issn	1796-203X	en_US
dc.identifier.uri	http://hdl.handle.net/10453/28289
dc.description.abstract	In this paper, we describe a novel localization algorithm for ad hoc wireless sensor networks. Accurate selforganization and localization capability is a highly desirable characteristic of wireless sensor networks. Many researchers have approached the localization problem from different perspectives. A major problem in wireless sensor network localization is the flip ambiguity, which introduces large errors in the location estimates. In this paper, we propose a two phase localization method based on the simulated annealing technique to address the issue. Simulated annealing is a technique for combinatorial optimization problems and unlike the gradient search method, it is robust against being trapped into local minima. In this paper we show that our simulated annealing based localization method can be used in ad hoc wireless sensor networks to estimate the location of nodes accurately. In the first phase of our algorithm, simulated annealing is used to obtain an accurate estimate of location. Then a second phase of optimization is performed only on those nodes that are likely to have flip ambiguity problem. Based on the neighborhood information of nodes, those nodes likely to have been affected by flip ambiguity are identified and moved to the correct position. The proposed scheme is tested using simulation on a sensor network of 200 nodes whose distance measurements are corrupted by Gaussian noise. Simulation results show that the proposed novel scheme gives accurate and consistent location estimates of the nodes, and mitigate errors due to flip ambiguity. The performance of the proposed algorithm is better than the performance of some well-known schemes such as DVhop method and convex optimization based semi-definite programming method. © 2006 ACADEMY PUBLISHER.	en_US
dc.relation.ispartof	Journal of Computers	en_US
dc.relation.isbasedon	10.4304/jcp.1.2.15-22	en_US
dc.title	Simulated annealing based wireless sensor network localization	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	1	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	08 Information and Computing Sciences	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
utslib.copyright.status	closed_access
pubs.issue	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	1	en_US

Abstract:

In this paper, we describe a novel localization algorithm for ad hoc wireless sensor networks. Accurate selforganization and localization capability is a highly desirable characteristic of wireless sensor networks. Many researchers have approached the localization problem from different perspectives. A major problem in wireless sensor network localization is the flip ambiguity, which introduces large errors in the location estimates. In this paper, we propose a two phase localization method based on the simulated annealing technique to address the issue. Simulated annealing is a technique for combinatorial optimization problems and unlike the gradient search method, it is robust against being trapped into local minima. In this paper we show that our simulated annealing based localization method can be used in ad hoc wireless sensor networks to estimate the location of nodes accurately. In the first phase of our algorithm, simulated annealing is used to obtain an accurate estimate of location. Then a second phase of optimization is performed only on those nodes that are likely to have flip ambiguity problem. Based on the neighborhood information of nodes, those nodes likely to have been affected by flip ambiguity are identified and moved to the correct position. The proposed scheme is tested using simulation on a sensor network of 200 nodes whose distance measurements are corrupted by Gaussian noise. Simulation results show that the proposed novel scheme gives accurate and consistent location estimates of the nodes, and mitigate errors due to flip ambiguity. The performance of the proposed algorithm is better than the performance of some well-known schemes such as DVhop method and convex optimization based semi-definite programming method. © 2006 ACADEMY PUBLISHER.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/28289