Proactive data delivery scheme with optimal path for dynamic sensor networks

Kwang I. Hwang, Tea Young Kim, Doo-Seop Eom

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

1 Citation (Scopus)

Abstract

In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages412-421
Number of pages10
Volume4611 LNCS
Publication statusPublished - 2007 Dec 1
Event4th International Conference on Ubiquitous Intelligence and Computing: Building Smart Worlds in Real and Cyber Spaces, UIC 2007 - Hong Kong, Hong Kong
Duration: 2007 Jul 112007 Jul 13

Publication series

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

Other

Other4th International Conference on Ubiquitous Intelligence and Computing: Building Smart Worlds in Real and Cyber Spaces, UIC 2007
CountryHong Kong
CityHong Kong
Period07/7/1107/7/13

Fingerprint

Humulus
Optimal Path
Dynamic Networks
Sensor networks
Sensor Networks
Reversal
Network protocols
Path
Mobility Management
End-to-end Delay
Tree Structure
Energy
Energy Efficient
Count
Vertex of a graph
Demonstrate

ASJC Scopus subject areas

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

Cite this

Hwang, K. I., Kim, T. Y., & Eom, D-S. (2007). Proactive data delivery scheme with optimal path for dynamic sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4611 LNCS, pp. 412-421). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4611 LNCS).

Proactive data delivery scheme with optimal path for dynamic sensor networks. / Hwang, Kwang I.; Kim, Tea Young; Eom, Doo-Seop.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4611 LNCS 2007. p. 412-421 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4611 LNCS).

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

Hwang, KI, Kim, TY & Eom, D-S 2007, Proactive data delivery scheme with optimal path for dynamic sensor networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4611 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4611 LNCS, pp. 412-421, 4th International Conference on Ubiquitous Intelligence and Computing: Building Smart Worlds in Real and Cyber Spaces, UIC 2007, Hong Kong, Hong Kong, 07/7/11.
Hwang KI, Kim TY, Eom D-S. Proactive data delivery scheme with optimal path for dynamic sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4611 LNCS. 2007. p. 412-421. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Hwang, Kwang I. ; Kim, Tea Young ; Eom, Doo-Seop. / Proactive data delivery scheme with optimal path for dynamic sensor networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4611 LNCS 2007. pp. 412-421 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{55bf317e77c54e5daedf3898b1b31a60,
title = "Proactive data delivery scheme with optimal path for dynamic sensor networks",
abstract = "In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.",
author = "Hwang, {Kwang I.} and Kim, {Tea Young} and Doo-Seop Eom",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540735489",
volume = "4611 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "412--421",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Proactive data delivery scheme with optimal path for dynamic sensor networks

AU - Hwang, Kwang I.

AU - Kim, Tea Young

AU - Eom, Doo-Seop

PY - 2007/12/1

Y1 - 2007/12/1

N2 - In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

AB - In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

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

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

M3 - Conference contribution

AN - SCOPUS:38049028579

SN - 9783540735489

VL - 4611 LNCS

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

SP - 412

EP - 421

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

ER -