Energy-efficient tree routing algorithm-based destination family group in ZigBee networks

Saeyoung Ahn, Doohyun Ko, Bumjin Kim, Sang Bin Lee, Sun-Shin An

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

3 Citations (Scopus)

Abstract

This paper solves the hierarchical tree routing's inefficiency problem by using a neighbor node table, defined by the Zigbee standard, the Zigbee tree architecture, and an address allocation mechanism. This method selects a relay node through hierarchical tree routing, but if it finds a neighbor node, one of the destination family group, which reduces the expense of routing; then, this method selects the neighbor node as a relay node, and so reduces the expense of routing to the destination node.

Original languageEnglish
Title of host publicationProceedings - 4th International Conference on Sensor Technologies and Applications, SENSORCOMM 2010
Pages1-6
Number of pages6
DOIs
Publication statusPublished - 2010 Oct 21
Event4th International Conference on Sensor Technologies and Applications, SENSORCOMM 2010 - Venice, Mestre, Italy
Duration: 2010 Jul 182010 Jul 25

Other

Other4th International Conference on Sensor Technologies and Applications, SENSORCOMM 2010
CountryItaly
CityVenice, Mestre
Period10/7/1810/7/25

    Fingerprint

Keywords

  • 802.15.4
  • Cskip
  • Efficient routing
  • Hierarchical tree routing
  • ZigBee

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Ahn, S., Ko, D., Kim, B., Lee, S. B., & An, S-S. (2010). Energy-efficient tree routing algorithm-based destination family group in ZigBee networks. In Proceedings - 4th International Conference on Sensor Technologies and Applications, SENSORCOMM 2010 (pp. 1-6). [5558040] https://doi.org/10.1109/SENSORCOMM.2010.8