R-SPOFTR

Relieving single point of failure in Tree Routing to prolong sensor system lifetime

Cheng Han Lin, Ce-Kuen Shieh, Wen Shyang Hwang, Jun Jim Wang

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

Abstract

Tree routing (TR) is a well-known algorithm for static environment surveillance in ZigBee networks because there are no routing table or route discovery requirements. However, TR only uses parent-child link to relay packets. Parent-child relaying requires more hops and energy expenditure when both source and destination nodes are close but belonging to different tree branches. In addition, nodes close to the coordinator may relay more packets and lead to more congestion and higher energy consumption. This is termed the single point of failure (SPOF) problem. In this paper, we propose the Relieving SPOF Tree Routing (R-SPOFTR) algorithm to provide shortest routing and congestion avoidance. In the R-SPOFTR algorithm, the source can deliver packets to the destination directly from its neighbor nodes with the same tree depth without disturbing upstream nodes. The simulation results show that the R-SPOFTR algorithm is capable of reducing average hop count, shortening end-to-end delay, increasing throughput and prolonging lifetime of tree nodes.

Original languageEnglish
Title of host publicationICUFN 2015 - 7th International Conference on Ubiquitous and Future Networks
PublisherIEEE Computer Society
Pages283-288
Number of pages6
ISBN (Electronic)9781479989935
DOIs
Publication statusPublished - 2015 Aug 7
Event7th International Conference on Ubiquitous and Future Networks, ICUFN 2015 - Sapporo, Japan
Duration: 2015 Jul 72015 Jul 10

Publication series

NameInternational Conference on Ubiquitous and Future Networks, ICUFN
Volume2015-August
ISSN (Print)2165-8528
ISSN (Electronic)2165-8536

Other

Other7th International Conference on Ubiquitous and Future Networks, ICUFN 2015
CountryJapan
CitySapporo
Period15-07-0715-07-10

Fingerprint

Routing algorithms
Sensors
Zigbee
Energy utilization
Throughput

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture

Cite this

Lin, C. H., Shieh, C-K., Hwang, W. S., & Wang, J. J. (2015). R-SPOFTR: Relieving single point of failure in Tree Routing to prolong sensor system lifetime. In ICUFN 2015 - 7th International Conference on Ubiquitous and Future Networks (pp. 283-288). [7182551] (International Conference on Ubiquitous and Future Networks, ICUFN; Vol. 2015-August). IEEE Computer Society. https://doi.org/10.1109/ICUFN.2015.7182551
Lin, Cheng Han ; Shieh, Ce-Kuen ; Hwang, Wen Shyang ; Wang, Jun Jim. / R-SPOFTR : Relieving single point of failure in Tree Routing to prolong sensor system lifetime. ICUFN 2015 - 7th International Conference on Ubiquitous and Future Networks. IEEE Computer Society, 2015. pp. 283-288 (International Conference on Ubiquitous and Future Networks, ICUFN).
@inproceedings{18b654469d1b47d5b87838d338fe45c3,
title = "R-SPOFTR: Relieving single point of failure in Tree Routing to prolong sensor system lifetime",
abstract = "Tree routing (TR) is a well-known algorithm for static environment surveillance in ZigBee networks because there are no routing table or route discovery requirements. However, TR only uses parent-child link to relay packets. Parent-child relaying requires more hops and energy expenditure when both source and destination nodes are close but belonging to different tree branches. In addition, nodes close to the coordinator may relay more packets and lead to more congestion and higher energy consumption. This is termed the single point of failure (SPOF) problem. In this paper, we propose the Relieving SPOF Tree Routing (R-SPOFTR) algorithm to provide shortest routing and congestion avoidance. In the R-SPOFTR algorithm, the source can deliver packets to the destination directly from its neighbor nodes with the same tree depth without disturbing upstream nodes. The simulation results show that the R-SPOFTR algorithm is capable of reducing average hop count, shortening end-to-end delay, increasing throughput and prolonging lifetime of tree nodes.",
author = "Lin, {Cheng Han} and Ce-Kuen Shieh and Hwang, {Wen Shyang} and Wang, {Jun Jim}",
year = "2015",
month = "8",
day = "7",
doi = "10.1109/ICUFN.2015.7182551",
language = "English",
series = "International Conference on Ubiquitous and Future Networks, ICUFN",
publisher = "IEEE Computer Society",
pages = "283--288",
booktitle = "ICUFN 2015 - 7th International Conference on Ubiquitous and Future Networks",
address = "United States",

}

Lin, CH, Shieh, C-K, Hwang, WS & Wang, JJ 2015, R-SPOFTR: Relieving single point of failure in Tree Routing to prolong sensor system lifetime. in ICUFN 2015 - 7th International Conference on Ubiquitous and Future Networks., 7182551, International Conference on Ubiquitous and Future Networks, ICUFN, vol. 2015-August, IEEE Computer Society, pp. 283-288, 7th International Conference on Ubiquitous and Future Networks, ICUFN 2015, Sapporo, Japan, 15-07-07. https://doi.org/10.1109/ICUFN.2015.7182551

R-SPOFTR : Relieving single point of failure in Tree Routing to prolong sensor system lifetime. / Lin, Cheng Han; Shieh, Ce-Kuen; Hwang, Wen Shyang; Wang, Jun Jim.

ICUFN 2015 - 7th International Conference on Ubiquitous and Future Networks. IEEE Computer Society, 2015. p. 283-288 7182551 (International Conference on Ubiquitous and Future Networks, ICUFN; Vol. 2015-August).

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

TY - GEN

T1 - R-SPOFTR

T2 - Relieving single point of failure in Tree Routing to prolong sensor system lifetime

AU - Lin, Cheng Han

AU - Shieh, Ce-Kuen

AU - Hwang, Wen Shyang

AU - Wang, Jun Jim

PY - 2015/8/7

Y1 - 2015/8/7

N2 - Tree routing (TR) is a well-known algorithm for static environment surveillance in ZigBee networks because there are no routing table or route discovery requirements. However, TR only uses parent-child link to relay packets. Parent-child relaying requires more hops and energy expenditure when both source and destination nodes are close but belonging to different tree branches. In addition, nodes close to the coordinator may relay more packets and lead to more congestion and higher energy consumption. This is termed the single point of failure (SPOF) problem. In this paper, we propose the Relieving SPOF Tree Routing (R-SPOFTR) algorithm to provide shortest routing and congestion avoidance. In the R-SPOFTR algorithm, the source can deliver packets to the destination directly from its neighbor nodes with the same tree depth without disturbing upstream nodes. The simulation results show that the R-SPOFTR algorithm is capable of reducing average hop count, shortening end-to-end delay, increasing throughput and prolonging lifetime of tree nodes.

AB - Tree routing (TR) is a well-known algorithm for static environment surveillance in ZigBee networks because there are no routing table or route discovery requirements. However, TR only uses parent-child link to relay packets. Parent-child relaying requires more hops and energy expenditure when both source and destination nodes are close but belonging to different tree branches. In addition, nodes close to the coordinator may relay more packets and lead to more congestion and higher energy consumption. This is termed the single point of failure (SPOF) problem. In this paper, we propose the Relieving SPOF Tree Routing (R-SPOFTR) algorithm to provide shortest routing and congestion avoidance. In the R-SPOFTR algorithm, the source can deliver packets to the destination directly from its neighbor nodes with the same tree depth without disturbing upstream nodes. The simulation results show that the R-SPOFTR algorithm is capable of reducing average hop count, shortening end-to-end delay, increasing throughput and prolonging lifetime of tree nodes.

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

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

U2 - 10.1109/ICUFN.2015.7182551

DO - 10.1109/ICUFN.2015.7182551

M3 - Conference contribution

T3 - International Conference on Ubiquitous and Future Networks, ICUFN

SP - 283

EP - 288

BT - ICUFN 2015 - 7th International Conference on Ubiquitous and Future Networks

PB - IEEE Computer Society

ER -

Lin CH, Shieh C-K, Hwang WS, Wang JJ. R-SPOFTR: Relieving single point of failure in Tree Routing to prolong sensor system lifetime. In ICUFN 2015 - 7th International Conference on Ubiquitous and Future Networks. IEEE Computer Society. 2015. p. 283-288. 7182551. (International Conference on Ubiquitous and Future Networks, ICUFN). https://doi.org/10.1109/ICUFN.2015.7182551