Minimizing energy of scalable distributed least squares localization

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In recent years, Wireless Sensor Networks (WSN) have become a growing technology that has broad range of applications. One of the major areas of research in Sensor Networks is location estimation. Distributed Least Squares (DLS) algorithm is a good solution for fine grained localization. Here localization process is split into a complex precalculation and a simple postcalculation process. This paper presents a revised version of DLS, i.e. minimized energy Distributed Least Squares (meDLS) algorithm where each blind node collects position of neighbouring beacon nodes and directly sends it to the sink node for precalculation. The precaluated data is sent back to the blind node for postcalculation, where location of blind node is estimated. The proposed algorithm is simulated and compared with scalable DLS (sDLS) for computational and communicational cost.

Original languageEnglish
Title of host publicationEco-Friendly Computing and Communication Systems - International Conference, ICECCS 2012, Proceedings
Number of pages7
Publication statusPublished - 27-08-2012
EventInternational Conference on Eco-Friendly Computing and Communication Systems, ICECCS 2012 - Kochi, India
Duration: 09-08-201211-08-2012

Publication series

NameCommunications in Computer and Information Science
Volume305 CCIS
ISSN (Print)1865-0929


ConferenceInternational Conference on Eco-Friendly Computing and Communication Systems, ICECCS 2012

All Science Journal Classification (ASJC) codes

  • General Computer Science


Dive into the research topics of 'Minimizing energy of scalable distributed least squares localization'. Together they form a unique fingerprint.

Cite this