Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process

As an important part of the Internet of Things (IOT) and the special case of device-to-device (D2D) communication, wireless body area network (WBAN) gradually becomes the focus of attention. Since WBAN is a body-centered network, the energy of sensor nodes is strictly restrained since they are suppl...

Full description

Saved in:
Bibliographic Details
Main Authors: Yingqi Yin, Fengye Hu, Ling Cen, Yu Du, Lu Wang
Format: Article
Language:English
Published: Wiley 2015-01-01
Series:International Journal of Antennas and Propagation
Online Access:http://dx.doi.org/10.1155/2015/657854
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832545609530212352
author Yingqi Yin
Fengye Hu
Ling Cen
Yu Du
Lu Wang
author_facet Yingqi Yin
Fengye Hu
Ling Cen
Yu Du
Lu Wang
author_sort Yingqi Yin
collection DOAJ
description As an important part of the Internet of Things (IOT) and the special case of device-to-device (D2D) communication, wireless body area network (WBAN) gradually becomes the focus of attention. Since WBAN is a body-centered network, the energy of sensor nodes is strictly restrained since they are supplied by battery with limited power. In each data collection, only one sensor node is scheduled to transmit its measurements directly to the access point (AP) through the fading channel. We formulate the problem of dynamically choosing which sensor should communicate with the AP to maximize network lifetime under the constraint of fairness as a constrained markov decision process (CMDP). The optimal lifetime and optimal policy are obtained by Bellman equation in dynamic programming. The proposed algorithm defines the limiting performance in WBAN lifetime under different degrees of fairness constraints. Due to the defect of large implementation overhead in acquiring global channel state information (CSI), we put forward a distributed scheduling algorithm that adopts local CSI, which saves the network overhead and simplifies the algorithm. It was demonstrated via simulation that this scheduling algorithm can allocate time slot reasonably under different channel conditions to balance the performances of network lifetime and fairness.
format Article
id doaj-art-e316613a73b74001a5dfe1e16a6c8eb2
institution Kabale University
issn 1687-5869
1687-5877
language English
publishDate 2015-01-01
publisher Wiley
record_format Article
series International Journal of Antennas and Propagation
spelling doaj-art-e316613a73b74001a5dfe1e16a6c8eb22025-02-03T07:25:26ZengWileyInternational Journal of Antennas and Propagation1687-58691687-58772015-01-01201510.1155/2015/657854657854Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision ProcessYingqi Yin0Fengye Hu1Ling Cen2Yu Du3Lu Wang4College of Communication Engineering, Jilin University, Changchun 130022, ChinaCollege of Communication Engineering, Jilin University, Changchun 130022, ChinaInstitute for Infocomm Research, 138632, SingaporeCollege of Communication Engineering, Jilin University, Changchun 130022, ChinaCollege of Communication Engineering, Jilin University, Changchun 130022, ChinaAs an important part of the Internet of Things (IOT) and the special case of device-to-device (D2D) communication, wireless body area network (WBAN) gradually becomes the focus of attention. Since WBAN is a body-centered network, the energy of sensor nodes is strictly restrained since they are supplied by battery with limited power. In each data collection, only one sensor node is scheduled to transmit its measurements directly to the access point (AP) through the fading channel. We formulate the problem of dynamically choosing which sensor should communicate with the AP to maximize network lifetime under the constraint of fairness as a constrained markov decision process (CMDP). The optimal lifetime and optimal policy are obtained by Bellman equation in dynamic programming. The proposed algorithm defines the limiting performance in WBAN lifetime under different degrees of fairness constraints. Due to the defect of large implementation overhead in acquiring global channel state information (CSI), we put forward a distributed scheduling algorithm that adopts local CSI, which saves the network overhead and simplifies the algorithm. It was demonstrated via simulation that this scheduling algorithm can allocate time slot reasonably under different channel conditions to balance the performances of network lifetime and fairness.http://dx.doi.org/10.1155/2015/657854
spellingShingle Yingqi Yin
Fengye Hu
Ling Cen
Yu Du
Lu Wang
Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process
International Journal of Antennas and Propagation
title Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process
title_full Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process
title_fullStr Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process
title_full_unstemmed Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process
title_short Balancing Long Lifetime and Satisfying Fairness in WBAN Using a Constrained Markov Decision Process
title_sort balancing long lifetime and satisfying fairness in wban using a constrained markov decision process
url http://dx.doi.org/10.1155/2015/657854
work_keys_str_mv AT yingqiyin balancinglonglifetimeandsatisfyingfairnessinwbanusingaconstrainedmarkovdecisionprocess
AT fengyehu balancinglonglifetimeandsatisfyingfairnessinwbanusingaconstrainedmarkovdecisionprocess
AT lingcen balancinglonglifetimeandsatisfyingfairnessinwbanusingaconstrainedmarkovdecisionprocess
AT yudu balancinglonglifetimeandsatisfyingfairnessinwbanusingaconstrainedmarkovdecisionprocess
AT luwang balancinglonglifetimeandsatisfyingfairnessinwbanusingaconstrainedmarkovdecisionprocess