Simulated Annealing based Wireless Sensor Network Localization

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 lo...

• Type: Journal
• Year: 2006
• Where: JCP
• Authors: Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
• Keywords: Hoc Wireless Sensor, JCP 2006, Simulated Annealing, Wireless Sensor Networks