The Orphan Problem in ZigBee-based Wireless Sensor Networks

檔案

本條目沒有附加檔案。

日期

2007

期刊名稱

MSWIM'07: PROCEEDINGS OF THE TENTH ACM SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF WIRELESS AND MOBILE SYSTEMS

卷期與頁次

頁 95–98

ISBN

978-1-59593-851-0

語言

英文

摘要

ZigBee is a standard which is considered to be suitable for wireless sensor networks. In ZigBee, a device is said to join a network if it call obtain a network address from a parent device. 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 if one uses the random formation policy specified in ZigBee, the utilization of the address pool will be very low. Those devices that call not receive network addresses will be isolated from the network and become orphan nodes. In this paper, we model the orphan problem by two subproblems: the bounded-degree-and-depth tree formation (BDDTF) problem and the end-device maximum matching (EDMM) problem. We then present solutions to these problems. The results can be applied to network formation in ZigBee networks.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Pan, M.-S., & Tseng, Y.-C. (2007). The Orphan Problem in ZigBee-based Wireless Sensor Networks. MSWIM'07: PROCEEDINGS OF THE TENTH ACM SYMPOSIUM ON MODELING, ANALYSIS, AND SIMULATION OF WIRELESS AND MOBILE SYSTEMS, 95–98. https://ir.lib.nycu.edu.tw/handle/11536/6368

BibTeX RIS

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

分享

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