首页> 外文会议>IEEE Conference on Computer Communications >Robust Scheduling for Wireless Charger Networks
【24h】

Robust Scheduling for Wireless Charger Networks

机译:无线充电器网络的强大调度

获取原文

摘要

In this paper, we deal with the problem of Robust schedUling for wireLess charger nEtworks (RULE), i.e., given a number of rechargeable devices, each of which may drift within a certain range, and a number of directional chargers with fixed positions and adjustable orientations distributed on a 2D plane, determining the orientations of the wireless chargers to maximize the overall expected charging utility while taking the charging power jittering into consideration. To address the problem, we first model the charging power as a random variable, and apply area discretization technique to divide the charging area into several subareas to approximate the charging power as the same random variable in each subarea and bound the approximation error. Then, we discretize the orientations of chargers to deal with the unlimited searching space of orientations with performance bound. Finally, by proving the submodularity of the problem after the above transformations, we propose an algorithm that achieves (1/2-ε)-approximation ratio. We conduct both simulation and field experiments, and the results show that our algorithm can perform better than other comparison algorithms by 103.25% on average.
机译:在本文中,我们处理无线充电器网络(规则)的强大调度问题,即,给定多个可再充电装置,每个可充电装置可以在一定范围内漂移,以及多个具有固定位置和可调节的定向充电器。分布在2D平面上的方向,确定无线充电器的方向,以最大化整体预期充电实用程序,同时考虑到充电功率抖动。为了解决问题,我们首先将充电功率模拟为随机变量,并应用区域离散化技术将充电区域划分为几个子区域,以将充电功率近似于每个子地图中的相同随机变量并绑定近似误差。然后,我们将充电器的方向离散化,以处理具有性能绑定的无限搜索空间。最后,通过证明在上述转化后问题的潜水性,我们提出了一种实现(1/2-ε) - 千克估计比的算法。我们进行模拟和现场实验,结果表明,我们的算法可以平均比其他比较算法更好地执行103.25%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号