Next Article in Journal
A New PC and LabVIEW Package Based System for Electrochemical Investigations
Next Article in Special Issue
An Energy-Efficient and High-Quality Video Transmission Architecture in Wireless Video-Based Sensor Networks
Previous Article in Journal
Development and Demonstration of Measurement-Time Efficient Methods for Impedance Spectroscopy of Electrode and Sensor Arrays
Previous Article in Special Issue
LQER: A Link Quality Estimation based Routing for Wireless Sensor Networks
Sensors 2008, 8(3), 1797-1818; doi:10.3390/s8031797

Localization Algorithm Based on a Spring Model (LASM) for Large Scale Wireless Sensor Networks

1,* , 1,3
1, 2, 1,2 and 1,2
1 Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei, 230031, P. R. China 2 Department of Automation, University of Science and Technology of China, Hefei, 230027, P.R. China 3 Department of Electronic Engineering, The Chinese University of Hong Kong, Sha Tian, Hong Kong
* Author to whom correspondence should be addressed.
Received: 6 December 2007 / Accepted: 12 March 2008 / Published: 15 March 2008
View Full-Text   |   Download PDF [384 KB, uploaded 21 June 2014]   |   Browse Figures


A navigation method for a lunar rover based on large scale wireless sensornetworks is proposed. To obtain high navigation accuracy and large exploration area, highnode localization accuracy and large network scale are required. However, thecomputational and communication complexity and time consumption are greatly increasedwith the increase of the network scales. A localization algorithm based on a spring model(LASM) method is proposed to reduce the computational complexity, while maintainingthe localization accuracy in large scale sensor networks. The algorithm simulates thedynamics of physical spring system to estimate the positions of nodes. The sensor nodesare set as particles with masses and connected with neighbor nodes by virtual springs. Thevirtual springs will force the particles move to the original positions, the node positionscorrespondingly, from the randomly set positions. Therefore, a blind node position can bedetermined from the LASM algorithm by calculating the related forces with the neighbornodes. The computational and communication complexity are O(1) for each node, since thenumber of the neighbor nodes does not increase proportionally with the network scale size.Three patches are proposed to avoid local optimization, kick out bad nodes and deal withnode variation. Simulation results show that the computational and communicationcomplexity are almost constant despite of the increase of the network scale size. The time consumption has also been proven to remain almost constant since the calculation steps arealmost unrelated with the network scale size.
Keywords: Localization algorithm; spring model; large scale wireless sensor networks; robot navigation Localization algorithm; spring model; large scale wireless sensor networks; robot navigation
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

Chen, W.; Mei, T.; Meng, M.Q.-H.; Liang, H.; Liu, Y.; Li, Y.; Li, S. Localization Algorithm Based on a Spring Model (LASM) for Large Scale Wireless Sensor Networks. Sensors 2008, 8, 1797-1818.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert