Layer-based ID assignment for sensor networks

Jung Hun Kang, Myong Soon Park

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

Abstract

A sensor network consists of a set of battery-powered nodes, which collaborate to perform, sensing tasks in a given environment. Globally unique ID allocation is usually not applicable in a sensor network due to the massive production of cheap sensor nodes, the limited bandwidth, and the size of the payload. However, globally unique IDs are still necessary for nodes to implement communications to save energy consumption. Already several solutions have been proposed for supporting globally unique ID assignment in sensor networks. However, they bring much communication overhead, and they are complex to implement. We present a layer-based algorithm to solve the unique ID assignment problem. This algorithm can start by building layer-based groups to assign IDs. This algorithm, leads to save energy consumption by reducing communication overhead due to these well-organized layer-based groups. The results demonstrate that a high percentage of nodes (more than 99%) are assigned globally unique IDs with 25% efficient energy consumption, than, the reactive ID assignment scheme.

Original languageEnglish
Title of host publicationFourth International Conference on Information Technology and Applications, ICITA 2007
Pages395-400
Number of pages6
Publication statusPublished - 2007 Dec 3
Event4th International Conference on Information Technology and Applications, ICITA 2007 - Harbin, China
Duration: 2007 Jan 152007 Jan 18

Other

Other4th International Conference on Information Technology and Applications, ICITA 2007
CountryChina
CityHarbin
Period07/1/1507/1/18

Fingerprint

Sensor networks
Energy utilization
Communication
Sensor nodes
Bandwidth

Keywords

  • Assignment
  • Layer
  • Sensor networks
  • Unique ID

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Kang, J. H., & Park, M. S. (2007). Layer-based ID assignment for sensor networks. In Fourth International Conference on Information Technology and Applications, ICITA 2007 (pp. 395-400)

Layer-based ID assignment for sensor networks. / Kang, Jung Hun; Park, Myong Soon.

Fourth International Conference on Information Technology and Applications, ICITA 2007. 2007. p. 395-400.

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

Kang, JH & Park, MS 2007, Layer-based ID assignment for sensor networks. in Fourth International Conference on Information Technology and Applications, ICITA 2007. pp. 395-400, 4th International Conference on Information Technology and Applications, ICITA 2007, Harbin, China, 07/1/15.
Kang JH, Park MS. Layer-based ID assignment for sensor networks. In Fourth International Conference on Information Technology and Applications, ICITA 2007. 2007. p. 395-400
Kang, Jung Hun ; Park, Myong Soon. / Layer-based ID assignment for sensor networks. Fourth International Conference on Information Technology and Applications, ICITA 2007. 2007. pp. 395-400
@inproceedings{f0d7ed884989483fb3c12775765699e2,
title = "Layer-based ID assignment for sensor networks",
abstract = "A sensor network consists of a set of battery-powered nodes, which collaborate to perform, sensing tasks in a given environment. Globally unique ID allocation is usually not applicable in a sensor network due to the massive production of cheap sensor nodes, the limited bandwidth, and the size of the payload. However, globally unique IDs are still necessary for nodes to implement communications to save energy consumption. Already several solutions have been proposed for supporting globally unique ID assignment in sensor networks. However, they bring much communication overhead, and they are complex to implement. We present a layer-based algorithm to solve the unique ID assignment problem. This algorithm can start by building layer-based groups to assign IDs. This algorithm, leads to save energy consumption by reducing communication overhead due to these well-organized layer-based groups. The results demonstrate that a high percentage of nodes (more than 99{\%}) are assigned globally unique IDs with 25{\%} efficient energy consumption, than, the reactive ID assignment scheme.",
keywords = "Assignment, Layer, Sensor networks, Unique ID",
author = "Kang, {Jung Hun} and Park, {Myong Soon}",
year = "2007",
month = "12",
day = "3",
language = "English",
isbn = "0980326702",
pages = "395--400",
booktitle = "Fourth International Conference on Information Technology and Applications, ICITA 2007",

}

TY - GEN

T1 - Layer-based ID assignment for sensor networks

AU - Kang, Jung Hun

AU - Park, Myong Soon

PY - 2007/12/3

Y1 - 2007/12/3

N2 - A sensor network consists of a set of battery-powered nodes, which collaborate to perform, sensing tasks in a given environment. Globally unique ID allocation is usually not applicable in a sensor network due to the massive production of cheap sensor nodes, the limited bandwidth, and the size of the payload. However, globally unique IDs are still necessary for nodes to implement communications to save energy consumption. Already several solutions have been proposed for supporting globally unique ID assignment in sensor networks. However, they bring much communication overhead, and they are complex to implement. We present a layer-based algorithm to solve the unique ID assignment problem. This algorithm can start by building layer-based groups to assign IDs. This algorithm, leads to save energy consumption by reducing communication overhead due to these well-organized layer-based groups. The results demonstrate that a high percentage of nodes (more than 99%) are assigned globally unique IDs with 25% efficient energy consumption, than, the reactive ID assignment scheme.

AB - A sensor network consists of a set of battery-powered nodes, which collaborate to perform, sensing tasks in a given environment. Globally unique ID allocation is usually not applicable in a sensor network due to the massive production of cheap sensor nodes, the limited bandwidth, and the size of the payload. However, globally unique IDs are still necessary for nodes to implement communications to save energy consumption. Already several solutions have been proposed for supporting globally unique ID assignment in sensor networks. However, they bring much communication overhead, and they are complex to implement. We present a layer-based algorithm to solve the unique ID assignment problem. This algorithm can start by building layer-based groups to assign IDs. This algorithm, leads to save energy consumption by reducing communication overhead due to these well-organized layer-based groups. The results demonstrate that a high percentage of nodes (more than 99%) are assigned globally unique IDs with 25% efficient energy consumption, than, the reactive ID assignment scheme.

KW - Assignment

KW - Layer

KW - Sensor networks

KW - Unique ID

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

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

M3 - Conference contribution

AN - SCOPUS:36448956455

SN - 0980326702

SN - 9780980326703

SP - 395

EP - 400

BT - Fourth International Conference on Information Technology and Applications, ICITA 2007

ER -