The Orphan Problem in ZigBee Wireless Networks
- 21 March 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 8 (11), 1573-1584
- https://doi.org/10.1109/tmc.2009.60
Abstract
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.Keywords
This publication has 19 references indexed in Scilit:
- Energy-aware fault-tolerant clustering scheme for target tracking wireless sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- THE COVERAGE PROBLEM IN THREE-DIMENSIONAL WIRELESS SENSOR NETWORKSJournal of Interconnection Networks, 2007
- An address-light, integrated MAC and routing protocol for wireless sensor networksIEEE/ACM Transactions on Networking, 2006
- Energy-efficient communication protocol for wireless microsensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Approximating the Degree-Bounded Minimum Diameter Spanning Tree ProblemAlgorithmica, 2004
- Experimental Results for and Theoretical Analysis of a Self-Organizing Global Coordinate System for Ad Hoc Sensor NetworksTelecommunication Systems, 2004
- Role-based hierarchical self organization for wireless ad hoc sensor networksPublished by Association for Computing Machinery (ACM) ,2003
- Rumor routing algorthim for sensor networksPublished by Association for Computing Machinery (ACM) ,2002
- A matter of degreePublished by Association for Computing Machinery (ACM) ,2000
- Bounded degree spanning treesLecture Notes in Computer Science, 1997