Range-free localization algorithm using local expected hop length in wireless sensor network

Thida Zin Myint, Nandar Lynn, Tomoaki Ohtsuki

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

10 Citations (Scopus)

Abstract

Node location information plays a major role in wireless sensor network (WSN) location-aware applications. This paper analyzes the problem in estimation of expected hop length in multi-hop sensor network. Calculation of the traditional expected hop length is based on average node density over the network. Although the expected hop length benefits a good location accuracy in a uniformly distributed high node density case, the location accuracy degrades when we consider low node density in the network. In this paper, we study the drawback of the conventional expected hop length that deteriorates the location accuracy and we propose the local expected hop length LEHL based on local node density of each sensor node. The core idea of using LEHL is to improve location accuracy by considering the appropriate expected hop length for real network deployment. Simulation results show that our proposal outperforms the conventional localization algorithm using expected hop length (LAEP).

Original languageEnglish
Title of host publicationISCIT 2010 - 2010 10th International Symposium on Communications and Information Technologies
Pages356-361
Number of pages6
DOIs
Publication statusPublished - 2010
Event2010 10th International Symposium on Communications and Information Technologies, ISCIT 2010 - Tokyo, Japan
Duration: 2010 Oct 262010 Oct 29

Other

Other2010 10th International Symposium on Communications and Information Technologies, ISCIT 2010
CountryJapan
CityTokyo
Period10/10/2610/10/29

Fingerprint

Wireless sensor networks
Sensor nodes
Sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Myint, T. Z., Lynn, N., & Ohtsuki, T. (2010). Range-free localization algorithm using local expected hop length in wireless sensor network. In ISCIT 2010 - 2010 10th International Symposium on Communications and Information Technologies (pp. 356-361). [5664867] https://doi.org/10.1109/ISCIT.2010.5664867

Range-free localization algorithm using local expected hop length in wireless sensor network. / Myint, Thida Zin; Lynn, Nandar; Ohtsuki, Tomoaki.

ISCIT 2010 - 2010 10th International Symposium on Communications and Information Technologies. 2010. p. 356-361 5664867.

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

Myint, TZ, Lynn, N & Ohtsuki, T 2010, Range-free localization algorithm using local expected hop length in wireless sensor network. in ISCIT 2010 - 2010 10th International Symposium on Communications and Information Technologies., 5664867, pp. 356-361, 2010 10th International Symposium on Communications and Information Technologies, ISCIT 2010, Tokyo, Japan, 10/10/26. https://doi.org/10.1109/ISCIT.2010.5664867
Myint TZ, Lynn N, Ohtsuki T. Range-free localization algorithm using local expected hop length in wireless sensor network. In ISCIT 2010 - 2010 10th International Symposium on Communications and Information Technologies. 2010. p. 356-361. 5664867 https://doi.org/10.1109/ISCIT.2010.5664867
Myint, Thida Zin ; Lynn, Nandar ; Ohtsuki, Tomoaki. / Range-free localization algorithm using local expected hop length in wireless sensor network. ISCIT 2010 - 2010 10th International Symposium on Communications and Information Technologies. 2010. pp. 356-361
@inproceedings{179a3b16fa654a199aa5256a94637b56,
title = "Range-free localization algorithm using local expected hop length in wireless sensor network",
abstract = "Node location information plays a major role in wireless sensor network (WSN) location-aware applications. This paper analyzes the problem in estimation of expected hop length in multi-hop sensor network. Calculation of the traditional expected hop length is based on average node density over the network. Although the expected hop length benefits a good location accuracy in a uniformly distributed high node density case, the location accuracy degrades when we consider low node density in the network. In this paper, we study the drawback of the conventional expected hop length that deteriorates the location accuracy and we propose the local expected hop length LEHL based on local node density of each sensor node. The core idea of using LEHL is to improve location accuracy by considering the appropriate expected hop length for real network deployment. Simulation results show that our proposal outperforms the conventional localization algorithm using expected hop length (LAEP).",
author = "Myint, {Thida Zin} and Nandar Lynn and Tomoaki Ohtsuki",
year = "2010",
doi = "10.1109/ISCIT.2010.5664867",
language = "English",
isbn = "9781424470105",
pages = "356--361",
booktitle = "ISCIT 2010 - 2010 10th International Symposium on Communications and Information Technologies",

}

TY - GEN

T1 - Range-free localization algorithm using local expected hop length in wireless sensor network

AU - Myint, Thida Zin

AU - Lynn, Nandar

AU - Ohtsuki, Tomoaki

PY - 2010

Y1 - 2010

N2 - Node location information plays a major role in wireless sensor network (WSN) location-aware applications. This paper analyzes the problem in estimation of expected hop length in multi-hop sensor network. Calculation of the traditional expected hop length is based on average node density over the network. Although the expected hop length benefits a good location accuracy in a uniformly distributed high node density case, the location accuracy degrades when we consider low node density in the network. In this paper, we study the drawback of the conventional expected hop length that deteriorates the location accuracy and we propose the local expected hop length LEHL based on local node density of each sensor node. The core idea of using LEHL is to improve location accuracy by considering the appropriate expected hop length for real network deployment. Simulation results show that our proposal outperforms the conventional localization algorithm using expected hop length (LAEP).

AB - Node location information plays a major role in wireless sensor network (WSN) location-aware applications. This paper analyzes the problem in estimation of expected hop length in multi-hop sensor network. Calculation of the traditional expected hop length is based on average node density over the network. Although the expected hop length benefits a good location accuracy in a uniformly distributed high node density case, the location accuracy degrades when we consider low node density in the network. In this paper, we study the drawback of the conventional expected hop length that deteriorates the location accuracy and we propose the local expected hop length LEHL based on local node density of each sensor node. The core idea of using LEHL is to improve location accuracy by considering the appropriate expected hop length for real network deployment. Simulation results show that our proposal outperforms the conventional localization algorithm using expected hop length (LAEP).

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

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

U2 - 10.1109/ISCIT.2010.5664867

DO - 10.1109/ISCIT.2010.5664867

M3 - Conference contribution

AN - SCOPUS:78651249012

SN - 9781424470105

SP - 356

EP - 361

BT - ISCIT 2010 - 2010 10th International Symposium on Communications and Information Technologies

ER -