Reliable broadcast in ZigBee networks
2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005.
Due to scarce resources, such as transmission power, storage space and communication bandwidth, current broadcast approaches for general ad hoc networks can not be applied to IEEE 802.15.4 based ad hoc networks (e.g., ZigBee networks). This paper proposes a forward node selection algorithm that significantly reduces broadcast redundancy. The algorithm exploits the hierarchical address space in ZigBee networks. Only one-hop neighbor information is needed: a partial list of two-hop neighbors is
... -hop neighbors is derived at a node without exchanging messages between neighboring nodes. The complexity of the proposed algorithm is polynomial in terms of both computation time and memory space. The localized algorithm provides an optimal and feasible solution of selecting the minimum number of rebroadcast nodes in ZigBee networks, which is an NP-hard problem for general ad hoc networks. The proposed algorithm is extended to deal with packet loss during data transmission. A ZigBee rebroadcast algorithm is also proposed to further reduce the number of rebroadcast nodes and cover the whole network faster by assigning a non-random rebroadcast timer determined by the number of neighbors to be covered, distance and link quality. Simulations are conducted to evaluate the broadcast redundancy, coverage time, and coverage ratio. IEEE SECON This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Abstract-ZigBee is a new industrial standard for ad hoc networks based on IEEE 802.15.4. It is used for low data rate wireless networks and sensor networks. The data broadcast algorithms for ZigBee networks have been recently studied in , where the major task is to reduce the number of rebroadcast nodes. A broadcast algorithm should be robust, which can be achievable by introducing redundant transmissions to some extent. This issue will be studied by this paper. Results presented here extend the forward node selection algorithm in  for ZigBee networks. The tree neighbor information is exploited to make sure that every node is covered by at least one of its tree neighbors. A non-random rebroadcast timer is set according to the number of neighbors to be covered, distance and link quality to trigger rebroadcast times. The complexity of the proposed algorithm is polynomial in terms of both computation time and memory space. Simulations are conducted to evaluate the broadcast redundancy, coverage time, and coverage ratio, when the number of nodes varies and there is packet loss.