TY - JOUR
T1 - Energy-Efficient Sleep Scheduling in WBANs
T2 - From the Perspective of Minimum Dominating Set
AU - Zhang, Rongrong
AU - Nayak, Amiya
AU - Zhang, Shurong
AU - Yu, Jihong
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2019/8
Y1 - 2019/8
N2 - 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}\,\,\boldsymbol {+}\,\,\boldsymbol {\delta } )-approximation algorithm, namely global approximation algorithm, by globally picking the optimal node based on a polymatroid function, where {H}(\boldsymbol \cdot) is the Harmonic number and \boldsymbol \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.
AB - 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}\,\,\boldsymbol {+}\,\,\boldsymbol {\delta } )-approximation algorithm, namely global approximation algorithm, by globally picking the optimal node based on a polymatroid function, where {H}(\boldsymbol \cdot) is the Harmonic number and \boldsymbol \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.
KW - Dominating set (DS)
KW - sleep scheduling
KW - wireless body area networks (WBANs)
UR - http://www.scopus.com/inward/record.url?scp=85055690973&partnerID=8YFLogxK
U2 - 10.1109/JIOT.2018.2877762
DO - 10.1109/JIOT.2018.2877762
M3 - Article
AN - SCOPUS:85055690973
SN - 2327-4662
VL - 6
SP - 6237
EP - 6246
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 4
M1 - 8506392
ER -