首页> 外文会议>IEEE Global Communications Conference >Minimum hop and/or minimum distance robot movement with connectivity constraints in WSRNs
【24h】

Minimum hop and/or minimum distance robot movement with connectivity constraints in WSRNs

机译:WSRN中具有连接限制的最小跳跃和/或最小距离机器人运动

获取原文

摘要

Mobility within Wireless Sensor Networks (WSNs) has proven to be quite useful in prolonging the lifetime of these networks. This mobility requires intelligent control of the robots in order to efficiently complete tasks within the network. If the tasks required of the network need to send audio-video data back to the base station, then we need to maintain some connectivity with the base station in order to efficiently use the energy within the network. After mathematically formulating our problem, we propose three algorithms to solve these problems and run extensive simulations to test these algorithms. We were able to optimally solve the minimum hop problem and compare that to the heuristics for the minimum distance problems.
机译:事实证明,无线传感器网络(WSN)中的移动性对于延长这些网络的寿命非常有用。这种移动性需要对机器人进行智能控制,以便有效地完成网络中的任务。如果网络所需的任务需要将音频视频数据发送回基站,则我们需要与基站保持某种连通性,以便有效地利用网络中的能量。在数学上解决了我们的问题之后,我们提出了三种算法来解决这些问题,并进行广泛的仿真以测试这些算法。我们能够最佳地解决最小跳跃问题,并将其与最小距离问题的启发式方法进行比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号