This Article 
 Bibliographic References 
 Add to: 
Tree-Based Data Broadcast in IEEE 802.15.4 and ZigBee Networks
November 2006 (vol. 5 no. 11)
pp. 1561-1574
This paper studies efficient and simple data broadcast in IEEE 802.15.4-based ad hoc networks (e.g., ZigBee). Since finding the minimum number of rebroadcast nodes in general ad hoc networks is NP-hard, current broadcast protocols either employ heuristic algorithms or assume extra knowledge such as position or two-hop neighbor table. However, the ZigBee network is characterized as low data rate and low cost. It cannot provide position or two-hop neighbor information, but it still requires an efficient broadcast algorithm that can reduce the number of rebroadcast nodes with limited computation complexity and storage space. To this end, this paper proposes self-pruning and forward node selection algorithms that exploit the hierarchical address space in ZigBee networks. Only one-hop neighbor information is needed; a partial list of two-hop neighbors is derived without exchanging messages between neighboring nodes. The ZigBee forward node selection algorithm finds the minimum rebroadcast nodes set with polynomial computation time and memory space. Using the proposed localized algorithms, it is proven that the entire network is covered. Simulations are conducted to evaluate the performance improvement in terms of the number of rebroadcast nodes, number of duplicated receivings, coverage time, and communication overhead.

[1] IEEE Standard 802, Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low Rate Wireless Personal Area Networks (WPANs), 2003.
[2] http:/, Aug. 2006.
[3] ZigBee Alliance, Network Specification, Version 1.0, Dec. 2004.
[4] G. Lu, B. Krishnamachari, and C. Raghavendra, “Performance Evaluation of the IEEE 802.15.4 MAC for Low-Rate Low-Power Wireless Networks,” Proc. Workshop Energy-Efficient Wireless Comm. and Networks, 2004.
[5] J. Zheng and M. Lee, “Will IEEE 802.15.4 Make Ubiquitous Networking a Reality?: A Discussion on a Potential Low Power, Low Bit Rate Standard,” IEEE Comm. Magazine, vol. 42, no. 6, pp.140-146, 2004.
[6] S. Ni, Y. Tsing, Y. Chen, and J. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Proc. Eighth ACM Int'l Conf. Mobile Computing and Networking (MobiCom), 1999.
[7] http:/, Aug. 2006.
[8] C.E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications, pp. 90-100, 1999.
[9] Y. Tseng, S. Ni, and E. Shih, “Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network,” IEEE Trans. Computers, vol. 52, no. 5, pp. 545-557, May 2003.
[10] B. Williams and T. Camp, “Comparison of Broadcasting Techniques for Mobile Ad Hoc Networks,” Proc. ACM Symp. Mobile AdHoc Networking and Computing (MobiHoc), pp. 194-205, 2002.
[11] B. Williams, D. Mehta, T. Camp, and W. Navidi, “Predictive Models to Rebroadcast in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 3, no. 3, pp. 295-303, July-Sept. 2004.
[12] H. Lim and C. Kim, “Flooding in Wireless Ad Hoc Networks,” Computer Comm. J., vol. 24, nos. 3-4, pp. 353-363, 2001.
[13] V. Chvatal, “A Greedy Heuristic for the Set-Covering Problem,” Math. Operation Research, vol. 4, no. 3, pp. 233-235, 1979.
[14] G. Calinescu, I. Mandoiu, P. Wan, and A. Zelikovsky, “Selecting Forwarding Neighbors in Wireless Ad Hoc Networks,” ACM Mobile Networks and Applications, vol. 9, pp. 101-111, 2004.
[15] W. Peng and X.C. Lu, “On the Reduction of Broadcast Redundancy in Mobile Ad Hoc Networks,” Proc. ACM Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 129-130, 2000.
[16] I. Stojmenovic, M. Seddigh, and J. Zunic, “Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 1, pp. 14-25, Jan. 2002.
[17] W. Peng and X.C. Lu, “AHBP: An Efficient Broadcast Protocol for Mobile Ad Hoc Networks,” J. Computer Science and Technology, vol. 16, no. 2, pp. 114-125, 2001.
[18] A. Qayyum, L. Viennot, and A. Laouiti, “Multipoint Relaying for Flooding Broadcast Message in Mobile Wireless Networks,” Proc. Hawaii Int'l Conf. System Sciences, 2002.
[19] W. Lou and J. Wu, “Localized Broadcasting in Mobile Ad Hoc Networks Using Neighbor Designation,” Handbook of Mobile Computing, CRC Press, 2005.
[20] I. Stojmenovic and J. Wu, “Broadcasting and Activity-Scheduling in Ad Hoc Networks,” Ad Hoc Networking, S. Basagni, M. Conti, S.Giordano, and I. Stojmenovic, eds., pp. 205-229, IEEE Press, 2004.
[21] X.Y. Li and I. Stojmenovic, “Broadcasting and Topology Control in Wireless Ad Hoc Networks,” Handbook of Algorithms for Mobile and Wireless Networking and Computing, A. Boukerche and I. Chlamtac, eds., CRC Press, 2005.
[22] M. Cagalj, J. Hubaux, and C. Enz, “Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues,” Proc. Eighth ACM Int'l Conf. Mobile Computing and Networking (MobiCom), 2002.
[23] J. Wieselthier, G. Nguyen, and A. Ephremides, “On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks,” Proc. INFOCOM, pp. 585-594, 2002.
[24] J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized Minimum-Energy Broadcasting in Ad-Hoc Networks,” Proc. INFOCOM, 2003.
[25] G. Ding, Z. Sahinoglu, B. Bhargava, P. Orlik, and J. Zhang, “Reliable Broadcast in ZigBee Networks,” Proc. Ann. IEEE Comm. Soc. Conf. Sensor, Mesh, and Ad Hoc Comm. and Networks, 2005.

Index Terms:
Broadcast, IEEE 802.15.4, ZigBee, ad hoc network.
Gang Ding, Zafer Sahinoglu, Philip Orlik, Jinyun Zhang, Bharat Bhargava, "Tree-Based Data Broadcast in IEEE 802.15.4 and ZigBee Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 11, pp. 1561-1574, Nov. 2006, doi:10.1109/TMC.2006.172
Usage of this product signifies your acceptance of the Terms of Use.