...
首页> 外文期刊>International Journal on Computer Science and Engineering >NODE ADDRESSING SCHEMES FOR SCALABLE ROUTING IN HIERARCHICAL WSN
【24h】

NODE ADDRESSING SCHEMES FOR SCALABLE ROUTING IN HIERARCHICAL WSN

机译:分层WSN中可扩展路由的节点寻址方案

获取原文
   

获取外文期刊封面封底 >>

       

摘要

Wireless Sensor Network has a capacity of communication computation with node in a network. The sensor performs many significant tasks in a selective area. In this paper proposing the new idea to improve issues on node address Methodology that combine the structure of hierarchical tree with the flexibility of AODV algorithm. The AODV Routing algorithm was proposed for mesh network with extremely mobile node and is not suitable for hierarchical sensor network. Previously this two algorithm ZigBee and Cskip implement?s a hierarchical routing but not support fault tolerance and has limitation on network depth. The basic plan is to use hierarchical address structure, to develop the proposed scheme, and assigning address to new node in a network. At last simulation results shows the new scheme importantly and decreases the failure of network formation
机译:无线传感器网络具有与网络中的节点进行通信计算的能力。传感器在选择区域执行许多重要任务。本文提出了一种新的思想,以改进节点地址方法论中的问题,该方法将分层树的结构与AODV算法的灵活性相结合。 AODV路由算法是针对节点移动性极强的网状网络提出的,不适用于分层传感器网络。以前,这两个算法ZigBee和Cskip实现了分层路由,但不支持容错,并且对网络深度有限制。基本计划是使用分层地址结构,开发提出的方案,并将地址分配给网络中的新节点。最后的仿真结果显示了该新方案的重要性,并减少了网络形成的失败

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号