DocumentCode :
2664751
Title :
Simulated annealing based localization in wireless sensor network
Author :
Kannan, Anushiya A. ; Mao, Guoqiang ; Vucetic, Branka
Author_Institution :
Sch. of Electr. & Inf. Eng., Sydney Univ., NSW
fYear :
2005
fDate :
17-17 Nov. 2005
Lastpage :
514
Abstract :
In sensor networks, the information obtained from sensors are meaningless without the location information. In this paper, we propose a simulated annealing based localization (SAL) scheme for wireless sensor networks. Simulated annealing (SA) is used to estimate the approximate solution to combinatorial optimization problems. The SAL scheme can bring the convergence out of the local minima in a controlled fashion. Simulation results show that this scheme gives accurate and consistent location estimates of the nodes
Keywords :
combinatorial mathematics; simulated annealing; wireless sensor networks; combinatorial optimization problems; location information; simulated annealing based localization; wireless sensor network; Coordinate measuring machines; Cost function; Distance measurement; Fading; Intelligent networks; Interference; Optimization methods; Probability; Simulated annealing; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Local Computer Networks, 2005. 30th Anniversary. The IEEE Conference on
Conference_Location :
Sydney, NSW
ISSN :
0742-1303
Print_ISBN :
0-7695-2421-4
Type :
conf
DOI :
10.1109/LCN.2005.125
Filename :
1550912
Link To Document :
بازگشت