Reducing communication delay by finding sink location in low-duty-cycle wireless sensor networks

Yu Yuan Lin, Kuo-Feng Ssu, Hau Yu Chiang, Chun Hao Yang

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

Abstract

Low-duty-cycle mechanisms can reduce the energy consumption in wireless sensor networks. Many related researches have been made in recent years. In the low-duty-cycle environment, the latency of sending packets from a sink to each node is much longer than traditional WSNs because nodes stay asleep most of the time. In this paper, the Centralized Cluster-based Location Finding (CCLF) algorithm is proposed to reduce the high latency in low-duty-cycle WSNs by finding a suitable position for the sink. The algorithm mainly consisted of three steps: (1) Cluster construction, (2) The fast look-up table (FLU-table) construction, and (3) Sink location decision. The simulation results show that the performance of the CCLF algorithm approaches the performance of the optimal algorithm. Moreover, the CCLF algorithm requires less operation time compared with the optimal algorithm.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, PRDC 2013
PublisherIEEE Computer Society
Pages136-137
Number of pages2
ISBN (Print)9780769551302
DOIs
Publication statusPublished - 2013 Jan 1
Event19th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2013 - Vancouver, BC, Canada
Duration: 2013 Dec 22013 Dec 4

Publication series

NameProceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC
ISSN (Print)1541-0110

Other

Other19th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2013
CountryCanada
CityVancouver, BC
Period13-12-0213-12-04

Fingerprint

Wireless sensor networks
Communication
Energy utilization

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Hardware and Architecture
  • Software

Cite this

Lin, Y. Y., Ssu, K-F., Chiang, H. Y., & Yang, C. H. (2013). Reducing communication delay by finding sink location in low-duty-cycle wireless sensor networks. In Proceedings - 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, PRDC 2013 (pp. 136-137). [6820856] (Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC). IEEE Computer Society. https://doi.org/10.1109/PRDC.2013.30
Lin, Yu Yuan ; Ssu, Kuo-Feng ; Chiang, Hau Yu ; Yang, Chun Hao. / Reducing communication delay by finding sink location in low-duty-cycle wireless sensor networks. Proceedings - 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, PRDC 2013. IEEE Computer Society, 2013. pp. 136-137 (Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC).
@inproceedings{cd110ac3512e44b7b8f2aa4d08de36a6,
title = "Reducing communication delay by finding sink location in low-duty-cycle wireless sensor networks",
abstract = "Low-duty-cycle mechanisms can reduce the energy consumption in wireless sensor networks. Many related researches have been made in recent years. In the low-duty-cycle environment, the latency of sending packets from a sink to each node is much longer than traditional WSNs because nodes stay asleep most of the time. In this paper, the Centralized Cluster-based Location Finding (CCLF) algorithm is proposed to reduce the high latency in low-duty-cycle WSNs by finding a suitable position for the sink. The algorithm mainly consisted of three steps: (1) Cluster construction, (2) The fast look-up table (FLU-table) construction, and (3) Sink location decision. The simulation results show that the performance of the CCLF algorithm approaches the performance of the optimal algorithm. Moreover, the CCLF algorithm requires less operation time compared with the optimal algorithm.",
author = "Lin, {Yu Yuan} and Kuo-Feng Ssu and Chiang, {Hau Yu} and Yang, {Chun Hao}",
year = "2013",
month = "1",
day = "1",
doi = "10.1109/PRDC.2013.30",
language = "English",
isbn = "9780769551302",
series = "Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC",
publisher = "IEEE Computer Society",
pages = "136--137",
booktitle = "Proceedings - 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, PRDC 2013",
address = "United States",

}

Lin, YY, Ssu, K-F, Chiang, HY & Yang, CH 2013, Reducing communication delay by finding sink location in low-duty-cycle wireless sensor networks. in Proceedings - 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, PRDC 2013., 6820856, Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC, IEEE Computer Society, pp. 136-137, 19th IEEE Pacific Rim International Symposium on Dependable Computing, PRDC 2013, Vancouver, BC, Canada, 13-12-02. https://doi.org/10.1109/PRDC.2013.30

Reducing communication delay by finding sink location in low-duty-cycle wireless sensor networks. / Lin, Yu Yuan; Ssu, Kuo-Feng; Chiang, Hau Yu; Yang, Chun Hao.

Proceedings - 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, PRDC 2013. IEEE Computer Society, 2013. p. 136-137 6820856 (Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC).

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

TY - GEN

T1 - Reducing communication delay by finding sink location in low-duty-cycle wireless sensor networks

AU - Lin, Yu Yuan

AU - Ssu, Kuo-Feng

AU - Chiang, Hau Yu

AU - Yang, Chun Hao

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Low-duty-cycle mechanisms can reduce the energy consumption in wireless sensor networks. Many related researches have been made in recent years. In the low-duty-cycle environment, the latency of sending packets from a sink to each node is much longer than traditional WSNs because nodes stay asleep most of the time. In this paper, the Centralized Cluster-based Location Finding (CCLF) algorithm is proposed to reduce the high latency in low-duty-cycle WSNs by finding a suitable position for the sink. The algorithm mainly consisted of three steps: (1) Cluster construction, (2) The fast look-up table (FLU-table) construction, and (3) Sink location decision. The simulation results show that the performance of the CCLF algorithm approaches the performance of the optimal algorithm. Moreover, the CCLF algorithm requires less operation time compared with the optimal algorithm.

AB - Low-duty-cycle mechanisms can reduce the energy consumption in wireless sensor networks. Many related researches have been made in recent years. In the low-duty-cycle environment, the latency of sending packets from a sink to each node is much longer than traditional WSNs because nodes stay asleep most of the time. In this paper, the Centralized Cluster-based Location Finding (CCLF) algorithm is proposed to reduce the high latency in low-duty-cycle WSNs by finding a suitable position for the sink. The algorithm mainly consisted of three steps: (1) Cluster construction, (2) The fast look-up table (FLU-table) construction, and (3) Sink location decision. The simulation results show that the performance of the CCLF algorithm approaches the performance of the optimal algorithm. Moreover, the CCLF algorithm requires less operation time compared with the optimal algorithm.

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

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

U2 - 10.1109/PRDC.2013.30

DO - 10.1109/PRDC.2013.30

M3 - Conference contribution

SN - 9780769551302

T3 - Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC

SP - 136

EP - 137

BT - Proceedings - 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, PRDC 2013

PB - IEEE Computer Society

ER -

Lin YY, Ssu K-F, Chiang HY, Yang CH. Reducing communication delay by finding sink location in low-duty-cycle wireless sensor networks. In Proceedings - 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, PRDC 2013. IEEE Computer Society. 2013. p. 136-137. 6820856. (Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC). https://doi.org/10.1109/PRDC.2013.30