Adaptive Medium Access Control Protocol for Wireless Body Area Networks

Abstract

Wireless Body Area Networks (WBANs) are widely used for applications such as modern health-care systems, where wireless sensors (nodes) monitor the parameter(s) of interest. Nodes are provided with limited battery power and battery power is dependent on radio activity. MAC protocols play a key role in controlling the radio activity. Therefore, we present Adaptive Medium Access Control (A-MAC) protocol for WBANs supported by linear programming models for the minimization of energy consumption and maximization of dataflow. Our proposed protocol is adaptive in terms of guard band assignment technique and sleep/wakeup mechanism. We focus on specific application to monitor human body with the help of nodes which continuously scan body for updated information. If the current value is within normal range, nodes do not try to access channel. However, if the current value rises or falls beyond the permissible range, nodes switch on their transceiver to access channel. Moreover, A-MAC uses TDMA approach to access channel and well-defined synchronization scheme to avoid collisions. Furthermore, we conduct a comprehensive analysis supported by MATLAB simulations to provide estimation of delay spread. Simulation results justify that the proposed protocol performs better in terms of network lifetime and throughput as compared to the counterpart protocols.

1. Introduction

In modern day life, people want to get information about their body. A special purpose of Wireless Sensor Network (WSN) that enables remote monitoring is termed as WBAN. An important application of WBAN is to health care monitoring. This application enables the patient to be observed, diagnosed, and prescribed remotely. Hence, WBANs flourished as promising networks in the field of medical sciences as compared to traditional health care methods. On large scale, WBAN is classified into invasive and noninvasive networks [1].

Nodes scan the body to gather the required information and send this information to the respective station. Station is usually equipped with high power; however, nodes are provided with limited power source. In a typical WBAN/WSN, most of the power is consumed by transceiver. In these networks, a change in a single physiological parameter triggers many on-body nodes for data transmission at the same time. This traffic correlation in WBANs leads to high competition for medium access. As the nodes are supplied with limited battery power, so radio activity of transceiver to access channel becomes significant. As MAC layer controls the radio activity, therefore, it is obligatory to aim at an energy efficient MAC protocol. For this purpose, many MAC protocols are proposed; however, we only discuss some of these works in related work section.

Our proposed A-MAC protocol controls sleep and active mode in a well-organized manner. Nodes sense body regularly; however, they do not transmit regularly. Transmissions differ from application to application. For a specific one, these occur whenever data fluctuates from normal range. If the readings continue to be in normal range, nodes continue to be in idle mode. Moreover, guaranteed time slots for communication and adaptive guard band allocation further facilitate energy efficiency. Linear programming models for the minimization of energy consumption and maximization of dataflow along with delay spread analysis supported by MATLAB simulations enrich the level of design and understanding.

The rest of the paper is organized as follows: in Section 2 related work is provided, Section 3 contains motivation, Section 4 deals with a brief explanation of our proposed protocol, Sections 5, 6, and 7 contain energy consumption analysis, linear programming based network model, and delay spread, respectively, Section 8 is provided with the simulation results, conclusion along with future work is in Section 9, and finally references are given.

2. Related Work

The IEEE 802.11 and its further enhancements like IEEE 802.11 b/g/n are designed for medium range high speed wireless networks, like Wireless Local Area Networks (WLANs). It supports high data rate. However, IEEE 802.11 has high energy requirements and deprived bandwidth management, which makes it completely inappropriate for WBANs. IEEE 802.15.4 has been designed for Wireless Personal Area Networks (WPANs) with a range of 10 to 20 meters. This protocol can be used in healthcare and consumer electronics applications. However, it does not support devices heterogeneity and life-critical guaranteed transmission. Beacon enabled mode of IEEE 802.15.4 MAC does not efficiently work in long term monitoring applications due to beacon broadcast which results in overhead. The nonbeacon enabled mode of IEEE 802.15.4 MAC uses simple CSMA/CA which increases energy requirements for Clear Channel Assessment (CCA).

Omeni et al. in [2] present MAC protocol for single-hop WBANs which has important feature of wakeup/sleep mechanism along with wakeup fall-back time. Core process of this protocol is master-slave relation; when slave node attempts to communicate with master node and it fails, slave node goes to sleep mode. Moreover, central control mechanism avoids overhearing and continuous time slots avoid collision.

Timmons and Scanlon propose MedMAC in [3] which uses TDMA based approach. Guard band is introduced between two adjacent slots which helps to avoid overlapping, and it depends upon practical situations. Moreover, guaranteed time slots are used to overcome collisions.

Proposed S-MAC in [4] solves the problem of idle listening by assigning fixed duty cycles. Coordinator node assigns fixed time slots to nodes for wakeup. After wakeup period nodes go back to sleep mode and collisions are reduced by its synchronization mechanism.

The authors in [5] discuss H-MAC which works on synchronization mechanism. This protocol uses natural heart beats for the synchronization of nodes. So, nodes are independent in terms of extra energy needed for their synchronization. Dedicated time slot assignment is used to overcome collision.

Proposed McMAC in [6] deals with multi-constrained QoS in WBANs. This technique introduces a superframe structure that depends on the traffic of a node. A node is transmitted during a particular period of time, if the corresponding QoS is achievable; moreover it also presents a mechanism to handle emergency traffic.

Proposed AR-MAC in [7] uses a star topology with a central node and for channel access TDMA approach is used. It uses a novel scheme for synchronization, and central node uses dedicated time slots for communication. To avoid collision, an adaptive guard band approach is implemented.

The authors in [8] analyze two models of packet drop across the link. These are Random Uniformed model and Gilbert-Elliott model. Both models are briefly discussed and simulation results are provided.

3. Motivation

Main objectives to design MAC layer protocols for WBANs are high reliability and less energy consumption. In beacon enabled mode of IEEE 802.15.4, beacon packets are required for broadcast, which results in overhead. The nonbeacon enabled mode of IEEE 802.15.4 and needs extra energy for Clear Channel Assessment (CCA) operation. In protocols like S-MAC, MedMAC, and McMAC sleep schedules are periodically exchanged resulting in high synchronization overhead. Most of the earlier work based on the improvement of MAC protocols for WBANs is just like painting one side of the picture. Researchers seem to be focused on issues related to synchronization, collision avoidance, time slots assignment, guard band assignment, emergency data priority, and so forth. In [5] the authors present WBAN MAC requirements: energy efficiency, support of simultaneous operations, and Quality of Service (QoS). In [9], a comprehensive study on MAC protocols for WBANs is presented which focuses on energy minimization techniques like low power listening, schedule contention, and TDMA. However, the other side of the picture, that is, the number of transmissions, remains like a dark shadow. Let $E_{cycle}$ be the energy consumed by transceiver during one cycle:

\begin{matrix} E_{cycle} = E_{sleep} + E_{active}, \end{matrix}

(1)

where

E_{sleep}

is the energy consumed during sleep mode and

E_{active}

is the energy consumed during active mode. Transceiver consumes less energy in sleep mode as compared to active mode. Thus, we emphasize on an adaptive approach to minimizing

E_{active}

4. A-MAC

Our proposed protocol uses the available resources efficiently because it is based on specific application scenario which helps in reducing energy consumption. A-MAC uses TDMA technique, and Guaranteed Time Slot (GTS) is assigned to each node for communication.

We assume star topology (shown in Figure 1) for simplicity in implementation; individual nodes sense required information from body and send it to a Coordinator Node (CN). CN forwards received information to Monitoring Station (MS), directly or indirectly via an Access Point (AP). CN is endowed with larger battery and higher computational abilities. We assume a single transceiver within CN. Total time frame $T^{Frame}$ is divided into three parts: Contention-Free Period (CFP) for communication with nodes and Contention Access Period (CAP) to accommodate on-demand traffic and time $T^{MS}$ for transforming node's data to MS. The following subsections elaborate the proposed protocol in detail.

Figure 1

WBAN topology.

4.1. Adaptive Sleep and Wakeup Mechanism

Nodes sense human body to gather required information like temperature, blood pressure, pulse rate, and so forth. Nodes access channel only if the criterion of interest is satisfied; otherwise, nodes continue to be in idle mode. Criteria of interest vary from application to application. For example, let us consider the case of blood pressure; if the current blood pressure sensed is normal, node continues to be in idle mode. When the current sensed value drifts from its normal range, node switches to active mode, where it tries to access channel in order to transmit data to CN. In this way, nodes minimize the number of transmissions by an adaptive sleep and wakeup mechanism, ultimately saving a huge amount of energy.

4.2. Channel Selection

At the beginning, CN scans for free Radio Frequency (RF) channels. If busy, CN switches off the current RF channel and switches on another RF channel. The process continues till CN finds a free RF channel, and then it broadcasts the channel packet to nodes. Channel packets include information about the address of CN and channel information. Parallel to this process, nodes scan for free RF channel, and if busy, they wait for time $T^{CP}$ to listen for channel packet. If the channel packet is not received, node switches off the current RF channel and switches on th next channel. When node receives channel packet successfully, it sends an acknowledgment (ACK) packet to CN, as shown in Figure 2.

Figure 2

Channel selection.

4.3. Time Slots Assignment

The selection of free RF channel is followed by Time Slot Request (TSR) packet; transmitted by nodes to CN which includes information about the node's Time Slot (TS) for communication as well the data rate. In order to efficiently utilize the available resources, CN assigns TSs and guard band time ( $T^{GB}$ ) to nodes according to their traffic which is an adaptive approach. Assignment of variable TSs and $T^{GB}$ is followed by Time Slot Request Reply (TSRR) from CN to nodes. To avoid interference between two successive time slots $T^{GB}$ is inserted. We calculate $T^{GB}$ as follows:

\begin{matrix} T_{n, n + 1}^{GB} = \frac{G_{F}}{100} \times \frac{1}{2} (T S_{n} + T S_{n + 1}), \\ T_{1}^{GB} = \frac{G_{F} \times T S_{1}}{100}, \\ T_{n}^{GB} = \frac{G_{F} \times T S_{n}}{100}, \end{matrix}

(2)

where

G_{F}

is the guard band factor which depends upon the average drift value,

T_{1}^{GB}

is inserted before first time slot, and

T_{n}^{GB}

is placed before nth time slot. After the assignment of TSs, nodes switch into sleep mode; they switch to wakeup mode only when they have data to send within their allocated TSs. This mechanism provides, almost collision-free and reliable TSs with reduction in energy consumption.

T^{GB}

assignment is shown in Figure 3.

Figure 3

Time slots assignment with guard-band time.

4.4. Synchronization Mechanism

In order to communicate efficiently within the assigned TSs, CN needs synchronization with nodes. Within expected TS, CN listens for data packet. Upon the reception of data packet, CN compares expected reception time with current reception time. Let D be acceptable delay. Drift value $(DV)$ is calculated from current and expected reception time, which is used for synchronization in future. If the difference value is greater than D, then a piggy back mechanism is used; that is, $DV$ within SYNChronization ACKnowledgment (SYNC-ACK) packet is sent by CN for future synchronization. Else, simple ACK packet is sent by CN.

4.5. Packet Types

A-MAC deals with two types of packets: data packets and control packets. Data packet includes node's sensed data, and control packets are as follows. (1)

Channel Packet (CP): it includes CN's address and channel information.

(2)

Time Slot Request (TSR) packet: request information to CN for GTS is embedded in TSR packet.

(3)

Time Slot Request Reply (TSRR) packet: this packet includes CN's reply to node along with GTS information.

(4)

SYNChronization-ACKnowledgment (SYNC-ACK) packet: DV along with ACK of the last received data are coupled in SYNC-ACK packet.

(5)

Data Request (DR) packet: CN sends DR packet to node in order to meet on-demand traffic.

(6)

Acknowledgment (ACK) packet for the ACK of data packet.

5. Energy Consumption Analysis

Energy consumption model is based on the transceiver's activity, and we assume constant consumption of energy regarding sensing and processing units. To minimize energy consumption, sleep and wakeup mechanism play a vital role. Let $E_{c}$ be the total consumed energy in one cycle, $E_{s}$ is energy consumed in sleep mode, and $E_{a}$ is energy consumed in active mode. Then,

\begin{matrix} E_{c} = E_{s} + E_{a} . \end{matrix}

(3)

Total energy consumption for n the number of cycles is given by

\begin{matrix} E_{t} = \sum_{c = 1}^{n} ‍ E_{c} . \end{matrix}

(4)

Energy is a function of time and power, and power itself is a function of voltage and current. In sleep mode, nodes consume less energy as compared to active mode:

\begin{matrix} E_{s} = T_{s} \times I_{s} \times V, \\ T_{s} = T_{f} - T_{a}, \end{matrix}

(5)

where

T_{f}

is the total frame duration and

I_{s}

is the current drawn in sleep mode from voltage source V. Let

T_{a}

be active time duration for nodes. In

T_{a}

nodes consume switching energy

E_{sw}

, transmission energy

E_{tx}

, reception energy

E_{rx}

, and time-out energy

E_{to}

\begin{matrix} E_{a} = 2 \times E_{sw} + E_{tx} + E_{rx} + E_{to} . \end{matrix}

(6)

To switch between sleep and active modes, transceiver consumes energy $E_{sw}$ :

\begin{matrix} E_{sw} = T_{sw} \times I_{sw} \times V, \end{matrix}

(7)

where nodes draw

I_{sw}

current from voltage source during

T_{sw}

switching time duration.

Let l be length of packet (control or data), let $T_{b}$ be time needed for single byte transmission, and let $I_{tx}$ the amount of current drawn from V during transmission. Energy consumed during transmission is given by

\begin{matrix} E_{tx} = l \times T_{b} \times I_{tx} \times V . \end{matrix}

(8)

Similarly, energy consumed at the receiver end $E_{rx}$ is calculated as

\begin{matrix} E_{rx} = l \times T_{b} \times I_{rx} \times V . \end{matrix}

(9)

Time interval, after the transmission of an ACK packet and before its reception, is called time-out period ( $T_{to}$ ). Energy consumed during $T_{to}$ is termed as time-out energy ( $E_{to}$ ):

\begin{matrix} E_{to} = T_{to} \times I_{to} \times V, \end{matrix}

(10)

where

I_{to}

is the current drawn from voltage source V during

T_{to}

6. Problem Formulation and Modeling via Linear Programming

We consider a WBAN scenario where nodes collect data from the body and send the collected information to the sink directly or indirectly via an access point. So, WBAN consists of two types of nodes: monitoring nodes and sink node which collects the information at receiving end. In WBAN model, the position of nodes and sink is predetermined according to the application. Let S be the set of nodes, where $S = [i, j, \dots, n]$ and the sink node is k. Each node establishes a link with its neighbouring access point or sink if located in its communication range $Z_{c}$ . According to the topology representation, the following are connectivity parameters:

\begin{matrix} A_{(i, j)} = {\begin{cases} 1, & if node i establishes a link with access point j, \\ 0, & otherwise, \end{cases} \\ B_{(i, k)} = {\begin{cases} 1, & if node i establishes a link with sink k, \\ 0, & otherwise, \end{cases} \end{matrix}

(11)

where

i \in S

. The link between any node and sink depends upon the closeness and distance between nodes and sink.

We use the propagation radio model used in [10]. The path loss coefficient between i and j (or i and k) is denoted by $η_{(i, j)}$ (or $η_{(i, k)}$ ), and its value is equal to $3.38$ for human body for Line of Sight (LOS) and $5.9$ for Non-Line-of-Sight (NLOS). To calculate energy consumption of nodes, we assume transmission energy, reception energy, and amplification energy in case if node is not in the transmission range and we want to send critical data through this node. The sensing and processing energy are assumed to be negligible with respect to transmission and reception energy. Radio dissipation energy (transmission and reception) while turning on the circuitry is denoted by ${ETX}_{(elec)}$ and ${ERX}_{(elec)}$ . $ϵ_{amp}$ is the radio amplification factor and $D_{(i, j)}$ is the distance between i and j. $y_{(i, j)}$ is coverage parameter. If $y_{(i, j)} = 1$ , then i is in coverage range of j.

6.1. Energy Consumption Minimization

The main problem is to maximize the network lifetime. To maximize network lifetime, energy consumption of all the nodes needs to be balanced. Nodes equipped with less residual energy should decrease their energy consumption.

We consider WBAN model as a directed graph $G = (S, E)$ , where $| S | = n$ is and E is a set of links (directed graphs). $(i, j) \in A$ represents an arc between two nodes within minimum or maximum transmission range. $i \in V$ represents the number of nods equipped with initial energy $E_{0}$ . The goal of the proposed topology model is to efficiently transmit the sensed data to the destination by consuming minimum energy:

\begin{array}{l} Min [(\sum_{i \in S, k \in N} ‍ d_{(i, k)} y_{i, k} ({ETX}_{elec} + ϵ_{amp} D_{i, k} η_{i, j}) \\ + \sum_{i \in S, k \in N} ‍ (d_{i, k}) y_{i, k} {ERX}_{(elec)}) \\ + (\sum_{i \in S, k \in N} ‍ f_{i, j}^{k} (ET X_{elec} + ϵ_{amp} D_{i, k} η_{i, k}) + ER X_{elec}) \\ + (\sum_{i \in S, k \in N} ‍ f_{j, k}^{t} (ET X_{elec} + ϵ_{amp} D_{j, k} η_{j, k}) + ER X_{elec})] \end{array}

(12)

s.t.

\begin{matrix} \sum_{i \in S} ‍ y_{(i, j)} = 1, \forall (i, j) \in A, \end{matrix}

(13a)

\begin{matrix} \sum_{i \in S} ‍ y_{(i, j)} = 0, otherwise, \end{matrix}

(13b)

\begin{matrix} \sum_{i \in S} ‍ d_{(i, k)}, y_{(i, k)} + \sum_{i \in S} ‍ (f_{(i, j)} - f_{(j, i)}) - f_{(i, k)}^{t} = 0, \forall i, j \in S, \end{matrix}

(13c)

\begin{matrix} f_{i, j}^{k} \leq \sum_{i \in S} ‍ d_{(i, j)} X_{(i, j)}, \forall i, j \in S, \end{matrix}

(13d)

\begin{matrix} \sum_{i \in S} ‍ d_{(i, k)}, y_{(i, k)} + \sum_{i \in S} ‍ f_{(i, j)}^{k}, \leq ν_{t}, \forall i, j \in N . \end{matrix}

(13e)

The objective function (12) denotes the total energy consumption of the sensor network. First term shows the energy consumed by the nodes during transmission

(\sum_{i \in S, k \in N} ‍ d_{(i, k)} y_{(i, k)} (ET X_{elec} + E_{amp} D_{(i, k)} η_{(i, j)})

. The second term

\sum_{i \in S, k \in N} ‍ (d_{i, k}) y_{i, k} {ERX}_{(i, j)})

of the objective function (12) represents the total energy consumed by nodes to receive the transmitted data. The term

[\sum_{i \in S, k \in N} ‍ f_{i, j}^{k} (ET X_{elec} + E_{amp} D_{i, k} η_{i, k}) + ER X_{elec}] + [\sum_{i \in S, k \in N} ‍ f_{j, k}^{t} (ET X_{elec} + E_{amp} D_{j, k} η_{j, k}) + ER X_{elec}]

comes under consideration if and only if data is relayed through relay node (s); that is, it indicates the total energy consumed by relay nodes to transmit data from source nodes to sink (in case of A-MAC the value of this term is zero; however, we will adress this in future). Finally the total energy consumed by sink to receive the transmitted data is

\sum_{i \in S, k \in N} ‍ f_{j, k}^{t}, ER X_{elec}

Constraints (13a) and (13b) indicate the full coverage. Constraint (13c) provides the flow balance of traffic from node i to sink. The term $\sum_{i \in S} ‍ d_{(i, k)}, y_{(i, k)}$ describes the data generated by the nodes routed towards the sink k, and the term $\sum_{i \in S} ‍ (f_{(i, j)} - f_{(j, i)}) - f_{(i, k)}^{t} = 0$ shows the total flow balance of total traffic from nodes towards the sink. If the link between the communicating parties is established, then constraint (13d) defines that the total flow of traffic is always less than the data generated by nodes because the protocol operation of A-MAC does not allow nodes to transmit normal data while sensing. Constraint (13e) describes that the total traffic generated by the nodes does not exceed the total capacity $ν_{t}$ of the link.

6.2. Maximum Flow Problem

Consider V is a set of vertices and E is a set of edges between two nodes, where S is a set of nodes. Each node has a capacity $ν_{t}$ . The goal here is to maximize the total flow of traffic from source to destination. The max flow problem is given as follows:

\begin{matrix} Max \sum_{(i, k)} ‍ f_{(i, k)} \end{matrix}

(14)

s.t.

\begin{matrix} \sum_{(i, k) \in E} ‍ f_{i, k} \geq \sum_{(k, i) \in E} ‍ f_{k, i}, \forall i \in S, \end{matrix}

(15a)

\begin{matrix} 0 \leq f_{i, k} \leq ν_{(i, k)}, \forall (i, k) \in E, \end{matrix}

(15b)

\begin{matrix} y_{(i, k)} = 1, \end{matrix}

(15c)

\begin{matrix} y_{(i, k)} = [0,1], \end{matrix}

(15d)

\begin{matrix} E_{i} (rem) \geq E_{(\min)}, \forall i \in S \end{matrix}

(15e)

\begin{matrix} D_{(i, k)} \leq D_{(min-trans)}, \forall i \in S \end{matrix}

(15f)

\begin{matrix} \sum_{i \in S} ‍ {Col}_{(i, k)} = 0, \forall i \in S \end{matrix}

(15g)

\begin{matrix} \sum_{i \in S} ‍ {Pd}_{(i, k)} = 0, \forall i \in S . \end{matrix}

(15h)

The objective function (14) defines the total flow of traffic from sender to receiver. Constraint (15a) shows the flow conservation of traffic from node i to sink k. The total traffic from node i to sink

k \geq

the total traffic from sink k to node i meaning that the uplink data traffic is more than that of downlink. Constraint (15b) describes that the net flow is always less than the total capacity of the link. Constraints (15c) and (15d) describe about the existence of the link between i and k. Constraint (15e) describes that a node only transmits data when it has sufficient energy greater than the minimum energy required for transmission. Constraints (15f) describe the minimum distance required for data transmission. Finally, constraints (15g) and (15h) state that the total flow is maximum when packet drops

Pd

and collisions

Col

from all nodes to sink are zero because the packet is then retransmitted.

7. Delay Spread Analysis

To develop some general guidelines for wireless systems, different multipath channels are compared and due to variation in path lengths the impulse response of a wireless channel looks like a series of pulses. Time domain analysis from the measured frequency domain transfer function $S_{21} (f)$ via Inverse Fast Fourier Transform ( $FFT / IFFT$ ) results in impulse response $h (t) = s_{21} (t)$ . Practically, distinguishable pulses that depend on time domain resolution of the communication system are very large in number and most of the energy is received via a direct path with multipath components after some time. Thus, delay spread is a measure of the multipath richness of a communication channel or the arrival time difference between the earliest multipath component and the latest multipath component of the received signal [11].

For evaluation purpose, mostly we focus on a class of channels rather than a single impulse response. Delay spread is generally quantified by different metrics like maximum delay spread $τ_{\max}$ , rms delay spread $τ_{rms}$ , and so forth. $τ_{\max}$ is probably the most important single measure for the delay time extent of a multipath radio channel. Since the $s_{21} (t)$ and the $S_{21} (f)$ of a channel are related by the ( $IFFT$ ), it is intuitively understandable that the transfer function magnitude shows more fades per bandwidth, by increasing the length of impulse response. (1)

Maximum excess delay $τ_{\max}$ defines the temporal extent of the multipat; that is above a particular threshold the received signal can be neglected which is known as $τ_{\max}$ .

(2)

Propagation delay relative to that of the shortest path and characterized by the first central moment is called mean excess delay $τ_{0}$ .

(3)

Mostly, root mean square $rms$ value of the delay spread $τ_{rms}$ is used instead of $τ_{\max}$ .

$τ_{0}$ acts as a linear function of antenna separation and is mathematically modelled as in [12] as follows:

\begin{matrix} τ_{0} (d) = A d + B, \end{matrix}

(16)

where d is the distance between transmitter and receiver in

cm

and A and B are the model parameters in

[ns / cm]

and

[ns]

, respectively. Figure 4 shows the fitted

τ_{0}

model for our proposed protocol based on the measurements, using Gaussian fit model.

Figure 4

Mean excess delay spread.

$Rms$ delay spread is given as a piecewise function whose first part is modelled by an exponential fit and second by a logarithmic fit, with a break point $d_{bp}$ given below:

\begin{matrix} τ_{rms} (d) = {\begin{cases} C (e^{D d} - 1), & for d \leq d_{bp}, \\ E + F \ln (\frac{d}{d_{bp}}), & for d > d_{bp}, \end{cases} \end{matrix}

(17)

where C, D, E, and F are the model parameters in

[ns]

[1 / cm]

[ns]

, and

[ns]

, respectively. Figure 5 shows the fitted

τ_{rms}

model for our proposed A-MAC based on the measurements. The parameter values [10] used in fit models for simulation are provided in Table 1.

Table 1

Parameter values of the models for $τ_{0}$ and $τ_{rms}$ .

Model	Parameter	Arm	Leg	Back	Torso
$τ_{0} (d) = A d + B$	A	0.35	0.41	0.72	0.76
$τ_{0} (d) = A d + B$	B	−1.1	−1.8	−1.9	−2.7
$τ_{rms} (d) = C (e^{D d} - 1)$	C	1.41	0.67	1.88	0.58
$τ_{rms} (d) = C (e^{D d} - 1)$	D	0.09	0.15	0.15	0.23
$τ_{rms} (d) = E + F \cdot \ln (\frac{d}{d_{bp}})$	E	9.97	6.40	13.01	12.23
	F	5.88	16.72	3.03	6.13
	$d_{bp}$	22.3	16.2	14	13.2

Figure 5

rms delay spread.

8. Simulation Results

This section provides a brief description related to MATLAB simulations of the proposed A-MAC protocol as well as IEEE 802.15.4 and AR-MAC. We consider star network of 10 nodes, where a single node is implanted on the body of each patient. As our approach is application specific, we consider a specific application here, that is, Blood Pressure (BP). Different ranges for BP are provided in Figure 6. We use energy model from the data sheet of Crossbow MICAz as shown in Table 2. For this purpose, we execute our protocol 5 times and calculate its mean value with possible deviation from mean value in terms of upper and lower bounds. The interval or range of values within upper and lower bounds is the confidence interval. For our simulation, there is 90% probability that the outcomes of interest lie within the error bars. We use Random Uniformed model for packets drop calculation.

Table 2

Simulation parameters.

Parameter	Value
$T^{Frame}$	1 second
V	3 volts
$I_{s}$	1 micro-A
$I_{idle}$	20.0 mA
$I_{tx}$	17.4 mA
$I_{rx}$	19.7 mA

Figure 6

Blood pressure range.

From Figure 7 it is clear that A-MAC performs better than IEEE 802.15.4 and AR-MAC. In CSMA/CA operation of IEEE 802.15.4, with an increase in average packet error rate probability, the number of back-offs increases. With every additional back-off, extra energy is consumed to perform clear channel assessment operation leading to more energy being consumed. AR-MAC uses adaptive guard band and adaptive TS allocation, to decrease the number of collisions which results in relatively less energy consumed. A-MAC further minimizes energy consumptions by minimizing the number of channel access tries, adaptive guard band allocation, and GTSs for communication. When the current value of blood pressure is within normal range (systolic BP = 90–120 mmHg and diastolic BP = 60–80 mmHg), transceiver associated with each node is off and nodes do not try to access channel.

Figure 7

Energy consumption analysis for 1000 cycles.

For lifetime and throughput analysis, we assume that each node is initially provided with $0.5$ J of energy. A-MAC shows extension in the network lifetime as compared to the given counterpart protocols, as can be seen from Figure 8. In IEEE 802.15.4 and AR-MAC, nodes sense data from human body and transmit it to CN periodically, whether the data is normal or not. Irrespective of the data weight, IEEE 802.15.4 assigns the same guard band to each node, whereas AR-MAC assigns guard band according to the weight of data. In our proposed scheme, nodes sense data regularly but these do not try channel access on a regular basis. Attempt to access channel only occurs when data fluctuates from its normal range. Moreover, the assignment of guard bands is according to the weight of data and GTSs are assigned to nodes for data communication to overcome packet collision and overhearing. In short, adaptive approach with extended sleep time mechanism in A-MAC results in network lifetime extension.

Figure 8

Network lifetime.

IEEE 802.15.4 uses CSMS/CA approach, in which if after the maximum number of back-offs the channel is still busy, packet is discarded, whereas AR-MAC uses TDMA approach, that is, guaranteed time slots assignment to nodes. Moreover, the minimum number of transmissions in A-MAC should result in lower number of packets sent to CN. However, witnessing A-MAC's curve in Figure 9 really grabs the attention. A-MAC sends more packets to CN than IEEE 802.15.4 and the same number of packet as AR-MAC. Why this kind of behaviour occurs? Let us justify this behaviour by taking cycle number 26 under consideration. Packets sent to CN at cycle number 26 are A-MAC 234, IEEE 802.15.4 250, and AR-MAC 250. At this cycle, A-MAC shows the minimum number of packets sent which is justification of its minimized number of transmissions. In IEEE 802.15.4, after cycle number 26, no more packets are sent to CN because after this particular cycle all nodes are dead. Similarly, in AR-MAC packet sending ends after cycle number 34. At cycle number 34, AR-MAC's sent packets to CN are more than that of A-MAC. However, in A-MAC packet sending continues till cycle number 41. These additional cycles compensate for the lower number of packets sent to CN.

Figure 9

The average number of packets sent to CN (aggregated).

In real scenarios, the total number of packets sent is not equal to the total number of packets received. Packets are always dropped. For our simulations to be more realistic, we choose two states of link reliability, that is, good (having 70% probability) and bad (having 30% probability). If the link status is good, packet is received successfully, else it is dropped. According to Figure 10 packets dropped order is IEEE 802.15.4 > AR-MAC > A-MAC. Reasons are as follows: CSMA/CA and fixed guard band assignment in IEEE 802.15.4 means high contention leading to more packets being dropped, adaptive guard band assignment in AR-MAC means relatively low contention leading to less number of packets being dropped, and adaptive guard band assignment as well as minimizing the number of transmissions means minimizing the contention for channel access thereby further decreasing the number of packets being dropped. Figure 11 shows the network throughput, that is, the number of packets received at CN. In this regard, A-MAC's performance is superior to the other two protocols due to well-defined synchronization mechanism as well as the reasons stated for packet drops.

Figure 10

The average number of packets dropped (per round).

Figure 11

The average number of packets received at CN (aggregated).

9. Conclusion and Future Work

Nodes keep updating their readings and on the arrival of fresh information they access the channel. In order to access channel, nodes switch on their transceiver which consumes energy. Our approach does not allow nodes to access channel after every fresh reading. Furthermore, GTSs for communication, adaptive guard band allocation, and well-defined synchronization mechanism are used to overcome collision and overhearing. A linear programming approach is adopted to maximize data flow and minimize energy consumption. Time domain analysis of the proposed protocol in terms of delay spread is also conducted. From simulation results, we conclude that all of the mentioned features throughout the paper enable A-MAC to outperform the counterpart protocols.

Our future directions will focus on working on joint physical and MAC model as well as the effect of temperature on link quality [13].

Footnotes

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

Alam

M. M.

Berder

Menard

Sentieys

Latency-energy optimized mac protocol for body sensor networks

Proceedings of the 9th International Conference on Wearable and Implantable Body Sensor Networks (BSN '12)

2012

67 72

Omeni

Wong

A. C. W.

Burdett

A. J.

Toumazou

Energy efficient medium access protocol for wireless medical body area sensor networks

IEEE Transactions on Biomedical Circuits and Systems 2008 2 4 251 259

2-s2.0-57049142061

10.1109/TBCAS.2008.2003431

Timmons

N. F.

Scanlon

W. G.

An adaptive energy efficient MAC protocol for the medical body area network

Proceedings of the 1st International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace and Electronic Systems Technology, Wireless (VITAE '09)

May 2009

587 593

2-s2.0-70350765144

10.1109/WIRELESSVITAE.2009.5172512

Heidemann

Estrin

A flexible and reliable radio communication stack on motes

2002 ISI-TR-565

USC Information Sciences Institute

Ullah

Shen

Riazul Islam

S. M.

Khan

Saleem

Kwak

K. S.

A study of MAC protocols for WBANs

Sensors 2009 10 1 128 145

2-s2.0-77953677508

10.3390/s100100128

H.-S. W.

Walrand

McMAC: a parallel rendezvous multi-channel MAC protocol

Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '07)

March 2007

334 339

2-s2.0-36348993641

10.1109/WCNC.2007.67

Rahim

Javaid

Aslam

Qasim

Khan

Adaptive-reliable medium access control protocol for wireless body area networks

Proceedings of the 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON '12)

2012

56 58

Zhou

Cao

Chen

Lin

A solution to error and loss in wireless network transfer

Proceedings of the International Conference on Wireless Networks and Information Systems (WNIS '09)

December 2009

312 315

2-s2.0-77950909313

10.1109/WNIS.2009.103

Hayat

Javaid

Khan

Z. A.

Shareef

Mahmood

Bouk

S. H.

Energy efficient mac protocols

Proceedings of the IEEE 14th International Conference on High Performance Computing and Communication and IEEE 9th International Conference on Embedded Software and Systems (HPCCICESS '12)

2012

1185 1192

10.

Reusens

Joseph

Latré

Braem

Vermeeren

Tanghe

Martens

Moerman

Blondia

Characterization of on-body communication channel and energy efficient topology design for wireless body area networks

IEEE Transactions on Information Technology in Biomedicine 2009 13 6 933 945

2-s2.0-70449586845

10.1109/TITB.2009.2033054

11.

2013, http://en.wikipedia.org/wiki/Delayspread/

12.

Reusens

Joseph

Vermeeren

Martens

On-body measurements and characterization of wireless communication channel for arm and torso of human

Proceedings of the 4th international workshop on wearable and implantable body sensor networks (BSN '07)

2007

Springer

264 269

13.

Tahir

Javaid

Iqbal

Khan

Alrajeh

On adaptive energy-efficient transmission in wsns

International Journal of Distributed Sensor Networks 2013 2013 10

923714

10.1155/2013/923714