Tree-based data broadcast in IEEE 802.15.4 and ZigBee networks

被引:8
作者
Ding, Gang [1 ]
Sahinoglu, Zafer
Orlik, Philip
Zhang, Jinyun
Bhargava, Bharat
机构
[1] Purdue Univ, Sch Elect & Comp Engn, W Lafayette, IN 47907 USA
[2] Mitsubishi Elect Res Labs, Cambridge, MA 02139 USA
[3] Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA
关键词
broadcast; IEEE; 802.15.4; ZigBee; ad hoc network;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
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.
引用
收藏
页码:1561 / 1574
页数:14
相关论文
共 23 条
[1]
CAGALJ M, 2002, P 8 ACM INT C MOB CO
[2]
Selecting forwarding neighbors in wireless ad hoc networks [J].
Calinescu, G ;
Mandoiu, II ;
Wan, PJ ;
Zelikovsky, AZ .
MOBILE NETWORKS & APPLICATIONS, 2004, 9 (02) :101-111
[3]
CARTIGNY J, 2003, P INFOCOM
[4]
Chvatal V., 1979, Mathematics of Operations Research, V4, P233, DOI 10.1287/moor.4.3.233
[5]
DING G, 2005, P ANN IEEE COMM SOC
[6]
*IEEE, 1983, 802 IEEE 15 4
[7]
LI XY, 2005, HDB ALGORITHMS MOBIL
[8]
Flooding in wireless ad hoc networks [J].
Lim, H ;
Kim, C .
COMPUTER COMMUNICATIONS, 2001, 24 (3-4) :353-363
[9]
LOU W, 2005, HDB MOBILE COMPUTING
[10]
Lu G, 2004, P WORKSH EN EFF WIR