KMCD-IME (Keeping the Maximum Communication Distance and Initial Mutual Exclusion among Router Nodes) Topology Control Algorithm for Effective Routing in ZigBee Networks

Saeyoung AHN  Sunshin AN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E93-A   No.10   pp.1744-1747
Publication Date: 2010/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E93.A.1744
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Multi-dimensional Mobile Information Networks)
Category: Topology Control
topology control algorithm,  LQI,  ZigBee,  Cskip,  effective routing,  

Full Text: PDF(411.8KB)>>
Buy this Article

In a ZigBee network, a finite address space is allocated to every potential parent device and a device may disallow a join request once this address space is exhausted. When a new node (child) requests to a coordinator (parent) to join a ZigBee network, the coordinator checks its address space. If it has sufficient address space, the coordinator accepts the new node as its child in the ZigBee network. If the new node has router capability (JoinAsRouter), it becomes a router in the ZigBee network. However, this association procedure makes ZigBee networks inefficient for routing, because the coordinator checks only the maximum and current numbers of child nodes. In the worst case, the network will be arranged so that the router nodes are crowded in the network. Therefore, we propose the KMCD-IME (Keeping the Maximum Communication Distance and Initial Mutual Exclusion among router nodes) algorithm with two additional conditions when a new node joins the ZigBee network. The first condition maintains the maximum communication distance between the new node and the would-be parent node. The second condition is the Initial Mutual Exclusion among router nodes. The router nodes are evenly spread across the network by KMCD-IME and an effective routing topology is formed. Therefore, the KMCD-IME algorithm extends the lifetime of the ZigBee network.