Minimizing energy of scalable distributed least squares localization

Diana Olivia, M. Ramakrishna, S. Divya

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

Abstract

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
Pages77-83
Number of pages7
DOIs
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

Conference

ConferenceInternational Conference on Eco-Friendly Computing and Communication Systems, ICECCS 2012
CountryIndia
CityKochi
Period09-08-1211-08-12

Fingerprint

Sensor networks
Wireless sensor networks
Costs

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Olivia, D., Ramakrishna, M., & Divya, S. (2012). Minimizing energy of scalable distributed least squares localization. In Eco-Friendly Computing and Communication Systems - International Conference, ICECCS 2012, Proceedings (pp. 77-83). (Communications in Computer and Information Science; Vol. 305 CCIS). https://doi.org/10.1007/978-3-642-32112-2_10
Olivia, Diana ; Ramakrishna, M. ; Divya, S. / Minimizing energy of scalable distributed least squares localization. Eco-Friendly Computing and Communication Systems - International Conference, ICECCS 2012, Proceedings. 2012. pp. 77-83 (Communications in Computer and Information Science).
@inproceedings{97a8b9c2757446f6b6fb79ca7a3e9a3f,
title = "Minimizing energy of scalable distributed least squares localization",
abstract = "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.",
author = "Diana Olivia and M. Ramakrishna and S. Divya",
year = "2012",
month = "8",
day = "27",
doi = "10.1007/978-3-642-32112-2_10",
language = "English",
isbn = "9783642321115",
series = "Communications in Computer and Information Science",
pages = "77--83",
booktitle = "Eco-Friendly Computing and Communication Systems - International Conference, ICECCS 2012, Proceedings",

}

Olivia, D, Ramakrishna, M & Divya, S 2012, Minimizing energy of scalable distributed least squares localization. in Eco-Friendly Computing and Communication Systems - International Conference, ICECCS 2012, Proceedings. Communications in Computer and Information Science, vol. 305 CCIS, pp. 77-83, International Conference on Eco-Friendly Computing and Communication Systems, ICECCS 2012, Kochi, India, 09-08-12. https://doi.org/10.1007/978-3-642-32112-2_10

Minimizing energy of scalable distributed least squares localization. / Olivia, Diana; Ramakrishna, M.; Divya, S.

Eco-Friendly Computing and Communication Systems - International Conference, ICECCS 2012, Proceedings. 2012. p. 77-83 (Communications in Computer and Information Science; Vol. 305 CCIS).

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

TY - GEN

T1 - Minimizing energy of scalable distributed least squares localization

AU - Olivia, Diana

AU - Ramakrishna, M.

AU - Divya, S.

PY - 2012/8/27

Y1 - 2012/8/27

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

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

UR - http://www.scopus.com/inward/record.url?scp=84865209168&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865209168&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-32112-2_10

DO - 10.1007/978-3-642-32112-2_10

M3 - Conference contribution

SN - 9783642321115

T3 - Communications in Computer and Information Science

SP - 77

EP - 83

BT - Eco-Friendly Computing and Communication Systems - International Conference, ICECCS 2012, Proceedings

ER -

Olivia D, Ramakrishna M, Divya S. Minimizing energy of scalable distributed least squares localization. In Eco-Friendly Computing and Communication Systems - International Conference, ICECCS 2012, Proceedings. 2012. p. 77-83. (Communications in Computer and Information Science). https://doi.org/10.1007/978-3-642-32112-2_10