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

الملخص EN

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.