【24h】

Energy and terrain aware connectivity restoration in disjoint Mobile Sensor Networks

机译:不相交的移动传感器网络中的能量和地形感知连通性恢复

获取原文

摘要

In Mobile Sensor Networks (MSNs), connectivity of the sensor nodes with the sink node can be disrupted due to failure of some nodes which may result network partitioning. To address this problem, mobility of the nodes has been exploited in the previous works so that an autonomous recovery can be achieved. All of these works have assumed reachability of the nodes to the selected destinations via a direct path movement. However, in real-world applications, such assumption makes the schemes impractical in case of encountering obstacles or intolerable terrains based on the kinematics of the mobile nodes. Besides, even if direct path movement is successful, optimal energy efficiency cannot be attained by neglecting the elevation or friction of the terrain when determining the movement path of the nodes. Thus, in the recovery efforts, terrain type, elevation as well as the obstacles should be taken into account in order to guarantee the connectivity restoration while minimizing the recovery cost in terms of energy. In this paper, we re-design an existing connectivity restoration approach in disjoint MSNs to fit these requirements and evaluate the performance issues when realistic terrains are assumed. Rather than following a direct path, movement trajectory is determined based on a path planning algorithm which considers the risk and elevation of terrain sections to be visited while avoiding obstacles and highly elevated terrain sections. Experiments have revealed that the direct path movement fails for many topologies while the proposed approach guarantees a solution. Besides, the proposed approach significantly outperforms direct path movement without obstacles in terms of total energy consumption.
机译:在移动传感器网络(MSN)中,由于某些节点的故障可能会导致网络分区,从而中断传感器节点与宿节点的连接。为了解决这个问题,在先前的工作中已经利用了节点的移动性,从而可以实现自主恢复。所有这些工作都假设节点通过直接路径移动到达选定目的地的可达性。但是,在实际应用中,基于移动节点的运动学,这种假设使得该方案在遇到障碍物或无法忍受的地形的情况下不切实际。此外,即使直接路径移动成功,在确定节点的移动路径时,忽略地形的高程或摩擦也无法获得最佳的能源效率。因此,在恢复工作中,应考虑地形类型,高程以及障碍物,以确保连通性恢复,同时将能源方面的恢复成本降至最低。在本文中,我们重新设计了不相交的MSN中现有的连接恢复方法,以适应这些要求,并在假设实际地形时评估性能问题。而不是遵循直接路径,而是基于路径规划算法来确定运动轨迹,该算法考虑要访问的地形部分的风险和高程,同时避开障碍物和高度升高的地形部分。实验表明,对于许多拓扑而言,直接路径移动均失败,而所提出的方法可以保证解决方案。此外,在总能耗方面,所提出的方法明显优于无障碍的直接路径移动。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号