首页> 外文会议>IEEE International Conference on Information Science and Technology >Improved neighbor table-based tree routing strategies in ZigBee wireless networks
【24h】

Improved neighbor table-based tree routing strategies in ZigBee wireless networks

机译:ZigBee无线网络中的基于邻邻表的树路由策略

获取原文

摘要

ZigBee tree routing is widely applied to low-cost, low-power and low-rate communication fields because it operates without route discovery overhead. However, there exist hop redundancy and traffic concentration due to the limitation of tree topology. This paper proposes two tree routing strategies, i.e., enhanced neighbor tree routing (ENTR) and neighbor hierarchical tree routing (NHTR), by taking into account neighbor relationships among tree nodes. To be specific, ENTR gets the shortcut by establishing the 2-hop neighbor table and the virtual destination neighbor group; while NHTR focuses on the path efficiency of ZigBee tree routing by inserting the initial exploration mechanism and extending the neighbor information in the neighbor table. The simulation results suggest that both ENTR and NHTR can effectively reduce the number of routing hops and achieve smaller end-to-end delay during routing.
机译:ZigBee树路由广泛应用于低成本,低功耗和低速通信领域,因为它在没有路由发现开销的情况下运行。但是,由于树拓扑的限制,存在跳跃冗余和流量集中。本文提出了两种树路由策略,即增强型邻居树路由(entrents)和邻居分层树路由(NHTR),通过参与树节点之间的邻居关系。具体而言,RENT通过建立2跳邻居表和虚拟目的地邻居组来获取快捷方式;当NHTR通过插入初始探索机制并在邻居表中扩展邻居信息来侧重于ZigBee树路由的路径效率。仿真结果表明,entr和nhtr都可以有效地减少路由跳数并在路由期间实现更小的端到端延迟。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号