• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Distributed Computing Systems >Low Latency Broadcast Scheduling for Battery-Free Wireless Networks Without Predetermined Structures
【24h】

Low Latency Broadcast Scheduling for Battery-Free Wireless Networks Without Predetermined Structures

机译：没有预定结构的无电池无线网络的低延迟广播调度

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Broadcasting is a fundamental networking service where the source node tries to disseminate the message to the whole network. The problem of Minimum Latency Broadcast Scheduling (MLBS) which seeks a fast and collision-free broad-cast schedule has been well studied when nodes are energy-abundant. However, in battery-free wireless networks, node can only receive or transmit packets after it has harvested enough energy. In such networks, it is of great importance to exploit the harvested energy smartly to reduce broadcast latency. Un-fortunately, the existing works rely on predetermined structures may greatly increase the latency by choosing a node with large charging latency as the backbone node. In addition, they assume each node can only transmit once which may result in much waiting latency. To address the above issues, we investigate the MLBS problem in battery-free wireless networks without predetermined structures in this paper. Firstly, to make use of the harvested energy smartly, we intertwine the construction of broadcast tree and the computation of an energy-satisfied and collision-free schedule. Secondly, a Delayed Broadcasting technique is proposed for each node to tradeoff between the number of transmissions and its waiting latency. By considering residual energy and transmitting time, two latency and energy aware scheduling algorithms are proposed, in which the broadcast tree can be constructed adaptively according to nodes’ energy status. Finally, the theoretical analysis and simulation results verify that the proposed algorithms have high performance in terms of broadcast latency.
机译：广播是一个基本的网络服务，源节点试图将消息传播给整个网络。当节点是能量丰富的情况下，研究了寻求快速和无碰撞的广泛计划的最小延迟广播调度（MLB）的问题。然而，在无电池无线网络中，节点只能在收获足够的能量之后接收或传输数据包。在这些网络中，利用收获的能量巧妙地利用收获的能量来减少广播延迟非常重要。不幸的是，现有的作品依赖于预定结构可以通过选择具有大充电等待时间的节点来大大增加延迟作为骨干节点。另外，它们假设每个节点只能传输一次，这可能导致延迟太多。为了解决上述问题，我们在没有预定的结构中，我们在无电池无线网络中调查了MLBS问题。首先，为了巧妙地利用收获的能量，我们跨越广播树的建设以及提供能量满足和无碰撞时间表的计算。其次，为每个节点提出了一种延迟的广播技术在传输次数和其等待延迟之间进行折衷。通过考虑剩余能量和发射时间，提出了两个等待时间和能量意识的调度算法，其中广播树可以根据节点的能量状态自适应地构造。最后，理论分析和仿真结果验证所提出的算法在广播延迟方面具有高性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号