首页> 外文会议>IEEE Annual Information Technology ,Electronics and Mobile Communication Conference >Path Planning for Maximizing Area Coverage of Mobile Nodes in Wireless Sensor Networks
【24h】

Path Planning for Maximizing Area Coverage of Mobile Nodes in Wireless Sensor Networks

机译:用于最大限度地覆盖无线传感器网络中移动节点区域覆盖的路径规划

获取原文

摘要

A sensor network consists of tiny, low-powered and multi-functional sensor devices, which can be used to detect and monitor various conditions in the neighborhood of the devices. Regions of the sensing area that are not within the sensing range of any sensor node constitute `coverage holes.' Collecting data from such areas is one of the primary uses of mobile nodes. The path taken by the mobile node(s) can have a significant impact on the performance of the network, regarding the achieved coverage of the sensing area. In this paper, we propose using guided mobility to allow mobile nodes to visit as many coverage holes as possible, within a given time frame. We present a new mixed integer linear program (MILP) formulation that calculates the optimal path to be taken by the mobile node, to maximize the combined total area covered the static and mobile nodes. Simulations with different network sizes and sensing and movement capabilities of the nodes are used to evaluate the proposed MILP.
机译:传感器网络由微小,低功耗和多功能传感器设备组成,可用于检测和监控设备附近的各种条件。不在任何传感器节点的传感范围内的传感区域的区域构成`覆盖孔。从这些区域收集数据是移动节点的主要用途之一。移动节点所采取的路径可以对网络的性能产生显着影响,关于感测区域的覆盖范围。在本文中,我们提出了使用引导移动性来允许移动节点在给定的时间帧内尽可能多地访问许多覆盖孔。我们介绍了一个新的混合整数线性程序(MILP)制定,计算移动节点所拍摄的最佳路径,以最大化组合的总面积覆盖静态和移动节点。使用不同网络尺寸和传感和节点的移动能力的模拟用于评估提议的MILP。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号