Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks

Hwang Kwang-il, Jeongsik In, Doo-Seop Eom

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

18 Citations (Scopus)

Abstract

Sink mobility creates new challenges for several sensor network applications. In mobile sink environments, each sink must propagate its current location continuously, through a sensor field, in order to keep all sensor nodes updated with the direction of data forwarding. This method consumes large amounts of energy. Although several protocols, such as DD, TTDD, and SEAD, have been proposed, in order to solve mobile sink problems, no existing approaches provide both a low delay and energy-efficient solution to this mobile sink problem. In this paper, a distributed dynamic shared tree for minimum energy data aggregation with low delay in highly mobile sink environments, is proposed. In the proposed protocol, the tree is shared with the other slave sinks. Through simulations it is shown that the DST is an extremely energy-efficient, robust protocol with relatively low delay, when compared to DD, TTDD, and SEAD.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages132-147
Number of pages16
Volume3868 LNCS
Publication statusPublished - 2006 Jul 7
Event3rd European Workshop on Wireless Sensor Networks, EWSN 2006 - Zurich, Switzerland
Duration: 2006 Feb 132006 Feb 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3868 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd European Workshop on Wireless Sensor Networks, EWSN 2006
CountrySwitzerland
CityZurich
Period06/2/1306/2/15

Fingerprint

Data Aggregation
Wireless Sensor Networks
Wireless sensor networks
Agglomeration
Slaves
Network protocols
Energy
Sensor nodes
Sensor networks
Energy Efficient
Sensors
Sensor
Efficient Solution
Sensor Networks
Vertex of a graph
Direction compound

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kwang-il, H., In, J., & Eom, D-S. (2006). Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3868 LNCS, pp. 132-147). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3868 LNCS).

Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks. / Kwang-il, Hwang; In, Jeongsik; Eom, Doo-Seop.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3868 LNCS 2006. p. 132-147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3868 LNCS).

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

Kwang-il, H, In, J & Eom, D-S 2006, Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3868 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3868 LNCS, pp. 132-147, 3rd European Workshop on Wireless Sensor Networks, EWSN 2006, Zurich, Switzerland, 06/2/13.
Kwang-il H, In J, Eom D-S. Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3868 LNCS. 2006. p. 132-147. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Kwang-il, Hwang ; In, Jeongsik ; Eom, Doo-Seop. / Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3868 LNCS 2006. pp. 132-147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e6524c6c3f574ee89277dc90ec5ac649,
title = "Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks",
abstract = "Sink mobility creates new challenges for several sensor network applications. In mobile sink environments, each sink must propagate its current location continuously, through a sensor field, in order to keep all sensor nodes updated with the direction of data forwarding. This method consumes large amounts of energy. Although several protocols, such as DD, TTDD, and SEAD, have been proposed, in order to solve mobile sink problems, no existing approaches provide both a low delay and energy-efficient solution to this mobile sink problem. In this paper, a distributed dynamic shared tree for minimum energy data aggregation with low delay in highly mobile sink environments, is proposed. In the proposed protocol, the tree is shared with the other slave sinks. Through simulations it is shown that the DST is an extremely energy-efficient, robust protocol with relatively low delay, when compared to DD, TTDD, and SEAD.",
author = "Hwang Kwang-il and Jeongsik In and Doo-Seop Eom",
year = "2006",
month = "7",
day = "7",
language = "English",
isbn = "3540321586",
volume = "3868 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "132--147",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Distributed dynamic shared tree for minimum energy data aggregation of multiple mobile sinks in wireless sensor networks

AU - Kwang-il, Hwang

AU - In, Jeongsik

AU - Eom, Doo-Seop

PY - 2006/7/7

Y1 - 2006/7/7

N2 - Sink mobility creates new challenges for several sensor network applications. In mobile sink environments, each sink must propagate its current location continuously, through a sensor field, in order to keep all sensor nodes updated with the direction of data forwarding. This method consumes large amounts of energy. Although several protocols, such as DD, TTDD, and SEAD, have been proposed, in order to solve mobile sink problems, no existing approaches provide both a low delay and energy-efficient solution to this mobile sink problem. In this paper, a distributed dynamic shared tree for minimum energy data aggregation with low delay in highly mobile sink environments, is proposed. In the proposed protocol, the tree is shared with the other slave sinks. Through simulations it is shown that the DST is an extremely energy-efficient, robust protocol with relatively low delay, when compared to DD, TTDD, and SEAD.

AB - Sink mobility creates new challenges for several sensor network applications. In mobile sink environments, each sink must propagate its current location continuously, through a sensor field, in order to keep all sensor nodes updated with the direction of data forwarding. This method consumes large amounts of energy. Although several protocols, such as DD, TTDD, and SEAD, have been proposed, in order to solve mobile sink problems, no existing approaches provide both a low delay and energy-efficient solution to this mobile sink problem. In this paper, a distributed dynamic shared tree for minimum energy data aggregation with low delay in highly mobile sink environments, is proposed. In the proposed protocol, the tree is shared with the other slave sinks. Through simulations it is shown that the DST is an extremely energy-efficient, robust protocol with relatively low delay, when compared to DD, TTDD, and SEAD.

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

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

M3 - Conference contribution

AN - SCOPUS:33745519056

SN - 3540321586

SN - 9783540321583

VL - 3868 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 132

EP - 147

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -