The Orphan Problem in ZigBee Wireless Networks

檔案

日期

2009-11-01

類型

期刊名稱

IEEE TRANSACTIONS ON MOBILE COMPUTING

卷期與頁次

第 8 卷第 11 期,頁 1573–1584

ISSN

1536-1233

語言

英文

摘要

ZigBee is a communication standard which is considered to be suitable for wireless sensor networks. In ZigBee, a device (with a permanent 64-bit MAC address) is said to join a network if it can successfully obtain a 16-bit network address from a parent device. Parent devices calculate addresses for their child devices by a distributed address assignment scheme. This assignment is easy to implement, but it restricts the number of children of a device and the depth of the network. We observe that the ZigBee address assignment policy is too conservative, thus usually making the utilization of the address pool poor. Those devices that cannot receive network addresses will be isolated from the network and become orphan nodes. In this paper, we show that the orphan problem can be divided into two subproblems: the bounded-degree-and-depth tree formation (BDDTF) problem and the end-device maximum matching (EDMM) problem. We then propose algorithms to relieve the orphan problem. Our simulation results show that the proposed schemes can effectively reduce the number of orphan devices compared to the ZigBee strategy.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Pan, M.-S., Tsai, C.-H., & Tseng, Y.-C. (2009). The Orphan Problem in ZigBee Wireless Networks. IEEE TRANSACTIONS ON MOBILE COMPUTING, 8(11), 1573–1584. https://doi.org/10.1109/TMC.2009.60

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/6461