首页> 外文期刊>Nature reviews Drug discovery >Optimized Neighbor Discovery for Opportunistic Networks of Energy Constrained IoT Devices
【24h】

Optimized Neighbor Discovery for Opportunistic Networks of Energy Constrained IoT Devices

机译:优化的邻居发现能源受限IOT设备的机会主义网络

获取原文
获取原文并翻译 | 示例
           

摘要

A careful planning of sleeping activities is essential for guaranteeing long operational time to energy constrained IoT devices, given the extremely low energy consumption required during the sleeping mode. Neighbor discovery instead requires nodes to continuously listen to the radio channel to detect potential and unpredictable messages coming from the arrival of new nodes. These two contrasting needs raise a fundamental question: Should a node be active and listen to the channel or sleep and save energy? Hardware manufacturers introduced dedicated low-power circuitry to allow an energy efficient fast duty cycle (Wake-on Radio) or designed to wake up the main processor when special packets are received (Wake-up Radio). In this work, we propose a novel analytic model optimizing the number of discovered peers for a given energy budget. Our theoretical study demonstrates the existence of an optimum duty cycle in a wide range of operating environments. We designed an adaptive algorithm that dynamically tracks the optimum even in non-stationary conditions, only using local device estimations, therefore allowing nodes to optimize their own duty cycle. Nodes globally converge to a system-wide optimum of a minimal network discovery energy cost.
机译:考虑到在睡眠模式期间所需的极低能耗,仔细规划睡眠活动对于保证能量受限的物联网设备的长期运行是必不可少的。邻居发现改用节点以连续地侦听无线电通道,以检测来自新节点到达的潜在和不可预测的消息。这两个对比需要提出一个基本问题:如果节点是否有效并收听频道或睡眠并节省能量?硬件制造商推出了专用的低功耗电路,以允许节能快速占空比(唤醒无线电)或旨在在收到特殊数据包时唤醒主处理器(唤醒无线电)。在这项工作中,我们提出了一种新颖的分析模型,优化了给定的能量预算的发现同行的数量。我们的理论研究表明,在广泛的操作环境中存在最佳占空比。我们设计了一种自适应算法,即使在非静止条件下,仅使用本地设备估计而动态地跟踪最佳算法,因此允许节点优化自己的占空比。全球节点收敛到最小网络发现能源成本的系统范围内最佳。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号