首页> 外文期刊>Internet of Things Journal, IEEE >Energy-Efficient Sleep Scheduling in WBANs: From the Perspective of Minimum Dominating Set
【24h】

Energy-Efficient Sleep Scheduling in WBANs: From the Perspective of Minimum Dominating Set

机译:WBAN中的节能睡眠调度:从最小支配集的角度

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

摘要

Wireless body area networks (WBANs) that offer various medical applications have received considerable attention in recent years. Due to limited energy of sensors, duty-cycling technique is employed to prolong the network lifetime. However, it results in long delivery delay and suffers from reliability issues. In this paper, we introduce an efficient and reliable sleep scheduling scheme from the perspective of constructing m-fold dominating set (DS), where m is the number of links from a node outside DS to those in DS. The key idea is to activate partial nodes at each frame to form a DS which can guarantee the network reliability such that the other nodes can fall asleep to save energy. Technically, we formulate the sleep scheduling in a WBAN as a problem of constructing minimum weighted m-fold DS, which is proven NP-hard. We first design an H(m + delta)-approximation algorithm, namely global approximation algorithm, by globally picking the optimal node based on a polymatroid function, where H(center dot) is the Harmonic number and delta is the maximum node degree. Then, we propose a simplified 1 + ln (m delta)-approximation algorithm, referred to as local approximation algorithm, to reduce computational complexity and execution rounds. We further conduct extensive simulations to confirm the superiority of our proposed algorithms.
机译:近年来,提供​​各种医疗应用的无线人体局域网(WBAN)受到了相当大的关注。由于传感器的能量有限,因此采用占空比技术来延长网络寿命。然而,这导致长的交付延迟并且遭受可靠性问题。在本文中,我们从构造m倍控制集(DS)的角度介绍了一种高效且可靠的睡眠调度方案,其中m是从DS外部节点到DS中的节点的链接数。关键思想是在每个帧上激活部分节点以形成DS,该DS可以保证网络的可靠性,以便其他节点可以入睡以节省能量。从技术上讲,我们将WBAN中的睡眠调度公式化为构造最小加权m倍DS的问题,事实证明这是NP难的。我们首先通过基于多类拟函数来全局选择最优节点,设计一个H(m + delta)近似算法,即全局近似算法,其中H(中心点)是调和数,delta是最大节点度。然后,我们提出一种简化的1 + ln(m delta)逼近算法,称为局部逼近算法,以降低计算复杂度和执行周期。我们进一步进行了广泛的仿真,以确认我们提出的算法的优越性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号