首页> 外文会议>2016 International Computer Symposium >Rescuing Algorithm for Link-List Wireless Network with Wormhole Mechanism
【24h】

Rescuing Algorithm for Link-List Wireless Network with Wormhole Mechanism

机译:虫洞机制的链表无线网络抢救算法

获取原文
获取原文并翻译 | 示例

摘要

Due to the concept of smart city being gradually prevailed in recent years, the wireless routing algorithm for Low-Rate Wireless Personal Area Networks is an important research for data collecting network, which is used for managing and collecting sensing data in the city. Chiu and Chen proposed an adaptive link-list routing algorithm with wormhole mechanism. The algorithm is a low collision wireless protocol, which is suitable for data collection systems such as intelligent street lighting, smart meters and smart appliances. In the algorithm some unstable status may be occurred due to the environmental interference and the inappropriate design of the protocol. In this paper, we proposed a rescuing algorithm for link-list wireless network with wormhole mechanism to overcome some problems in the link-list network, such as the node losing problem, the path-optimized construction problem and the acknowledge packet confliction problem. We use the network simulation-3 to verify the efficacy of the rescuing algorithm. The results prove that the recuing algorithm can solve the routing problem of the link-list network and help the link-list network to transfer the data quickly. The results show that the link-list network with the rescuing algorithm can build a stable and rapid data collecting network system.
机译:由于近年来智能城市的概念逐渐普及,低速率无线个人局域网的无线路由算法是数据收集网络的一项重要研究,用于管理和收集城市中的传感数据。 Chiu和Chen提出了一种具有虫洞机制的自适应链路列表路由算法。该算法是一种低冲突无线协议,适用于数据收集系统,例如智能路灯,智能电表和智能电器。在该算法中,由于环境干扰和协议设计不当,可能会出现一些不稳定状态。本文提出了一种具有虫洞机制的链表无线网络抢救算法,以克服链表网络中的节点丢失,路径优化构造问题和确认报文冲突等问题。我们使用网络仿真3来验证救援算法的有效性。结果证明,该算法可以解决链表网络的路由问题,并有助于链表网络快速传输数据。结果表明,采用抢救算法的链表网络可以构建稳定,快速的数据收集网络系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号