一种基于ZigBee树状路由协议的改进算法ATSPF  

An Improved Algorithm for Zigbee Tree Routing ATSPF

作　　者：周鑫[1] 林勇[1] 

机构地区：[1]重庆电子工程职业学院,重庆401331

出　　处：《科学技术与工程》2012年第32期8722-8725,8729,共5页Science Technology and Engineering

摘　　要：ZigBee现有的树状路由协议是根据节点间的父子关系创建路由并进行数据传输,这样容易产生较长的路径并加重父节点的处理任务。提出一种基于树状路由协议的改进算法ATSPF,将ZigBee网络地址转换为逻辑索引值列表,根据索引值计算出节点所有邻居到目的节点的跳数,选择跳数最少的邻居为下一跳来建立路由。仿真结果表明,ATSPF可以有效减少路由跳数、降低分组丢失率、减小节点间通信时延、降低协调器的能量消耗、延长网络生存时间。The current Zigbee tree routing protocol is based on the relationship between father and son nodes create routing and data transmission, which is easy to produce a longer path and aggravate the parent node processing tasks. An algorithm based on tree routing protocol named ATSPF is presented, which, translotes ZigBee network address to logical index value list, according to the index value calculats routing hops from all the neighbor node to the destination node, and choose the least number of hops neighbor as the next hop. The simulation results show that, ATSPF can effectively reduce routing hops, reduce the packet loss rate, reduce the inter-node communication delay, reduce the energy consumption of the coordinator, and prolong the survival time of the network.

关 键 词：树状路由协议 网络深度 逻辑索引值 路由跳数 

分 类 号：TN925.91[电子电信—通信与信息系统]