RE-ATTEMPT: A New Energy-Efficient Routing Protocol for Wireless Body Area Sensor Networks

Abstract

Modern health care system is one of the most popular Wireless Body Area Sensor Network (WBASN) applications and a hot area of research subject to present work. In this paper, we present Reliability Enhanced-Adaptive Threshold based Thermal-unaware Energy-efficient Multi-hop ProTocol (RE-ATTEMPT) for WBASNs. The proposed routing protocol uses fixed deployment of wireless sensors (nodes) such that these are placed according to energy levels. Moreover, we use direct communication for the delivery of emergency data and multihop communication for the delivery of normal data. RE-ATTEMPT selects route with minimum hop count to deliver data which downplays the delay factor. Furthermore, we conduct a comprehensive analysis supported by MATLAB simulations to provide an estimation of path loss, and problem formulation with its solution via linear programming model for network lifetime maximization is also provided. In simulations, we analyze our protocol in terms of network lifetime, packet drops, and throughput. Results show better performance for the proposed protocol as compared to the existing one.

1. Introduction

WBASN is a particular type of Wireless Sensor Network (WSN), normally concerned with human body. A small set of wireless sensors (nodes) are used to gather real time data and forward it to sink directly or indirectly through relay nodes. Each node is provided with radio transceiver, processor, and battery source [1]. Sink is supplied with extensive battery power; however, nodes are shared with limited resources. Most commonly used application of WBASNs is the modern health care system which enables patient to be monitored, diagnosed, and prescribed remotely. In health care domain, WBASNs are used to monitor patients suffering from diabetes, temperature, blood pressure, heart attack, and many more.

Route selection between any two nodes starts with the selection of neighbours based on some sort of information which is shared among the adjacent neighbours and then all around the network. This whole scenario depends on the capability of nodes and major objectives associated with these are battery lifetime extension along with recharging as seldom as possible. Routing protocols are prominently involved in sustaining the lifetime of nodes. A specific route with minimum energy cost needs to be selected for data transmission; in subject to this many routing protocols are proposed and many more needs to be proposed.

In this paper, we present a new routing protocol for WBASNs; RE-ATTEMPT. The protocol operation of the proposed protocol is completed in four phases. Firstly, nodes broadcast HELLO messages to update their routing tables. Secondly, for data transmission a priority based route is selected. Thirdly, sink assigns time slots to nodes for data transmission. Finally, communication within the allocated time slots to complete the process.

The rest of the paper is organized as follows: in Section 2 related work is provided, Section 3 deals with motivation, Section 4 contains brief explanation of our proposed protocol, and Sections 5 and 6 contain energy consumption and path loss analyses. Section 7 enlists linear programming based mathematical modeling and Section 8 is provided with the performance evaluation comparison of the proposed technique with the widely used existing ones. Conclusion along with future work is given in Section 9.

2. Related Work

Authors in [2] use single-hop communication to send data from nodes to sink. This technique is effective to overcome delay; however, distant nodes are penalized in terms of energy consumption. In [3] authors use multihop communication between nodes and sink. However, increased delay and more energy consumption of nodes nearer to sink are the major points of concern.

Authors in [4] propose Wireless Autonomous Spanning Tree Protocol (WASP) in which message is broadcasted to inform parent nodes with the data of child nodes. This strategy is used to accomplish low delay and high network reliability. However, power is not balanced uniformly.

Environment Adaptive Routing (EAR) protocol, proposed by authors in [5], uses both single-hop and multihop communication between nodes and sink. However, multihop communication is not suitable for emergency data because it results in delayed data delivery.

Authors in [6] use priority based tree algorithm for WBASNs. They use dedicated channels for emergency data and when emergency data is successfully delivered, normal data is put forward for transmission. However, dedicated channels cause frequent loss of available resources.

Authors in [7] propose Energy-Balanced Rate Assignment and Routing Protocol (EBRAR) in which data is intelligently transmitted through adaptive route selection based on residual energy. Adaptive resource allocation guarantees uniform load on the nodes which results in network lifetime extension.

Authors in [8] present a survey paper on routing protocols for WBASNs, specifically modern health care systems. They categorize routing protocols into cluster based, cross layer based, quality of service aware, thermal aware, and delay tolerant. Moreover, advantages and issues associated with each category are briefly discussed.

Authors in [9] conduct a comprehensive study on existing research in the field of WBASNs. They review WBASN standards and protocols engaging cross layer protocol stack. Moreover, the research highlights the challenges in health care monitoring.

Authors in [10] propose a cross layer protocol, Cascading Information Retrieval by Controlling Access with Distributed Slot Assignment (CICADA), for WBASNs. By using a distributed approach, the proposed protocol sets up a network tree which guarantees collision-free channel access and also helps in routing data to the sink. By using control as well as data subcycles, CICADA achieves energy efficiency with low delays. However, this protocol does not support traffic from sink to nodes.

In [11], the authors compare the performance of three existing quality link metrics in Static Wireless Multihop Networks (SWMhNs): Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML). A novel contribution of this work is the proposition of a new quality link metric, Inverse ETX (InvETX). These metrics also achieve delay minimization like RE-ATTEMPT. On the other hand, authors in [12] highlight some interesting challenges in WBASNs. To be socially acceptable, the nodes must be noninvasive. The size of BASN is relatively smaller than conventional WSN, implying smaller batteries, thus leading to energy constraint. Moreover, placement as well as packaging of nodes is also among the essential design considerations due to neither prominent nor uncomfortable requirement of WBASNs.

Authors in [13] propose a multihop protocol in WBASNs which is robust against frequent network changes due to changes in posture and variation in the quality of wireless links. Moreover, this protocol uses an adaptive transmit power mechanism for nodes and thus improves energy efficiency. However, all the sensed data is forwarded with equal probability, which is problematic whenever different quality of service data is taken into consideration.

3. Motivation

The basic aim to design a routing protocol is uniform distribution of load, such that energy consumption at every round is even and network lifetime is increased. Single-hop communication causes increased load on distant nodes and multihop communication drains the battery power of nearer nodes quickly. Thus, authors in [14] propose Adaptive Threshold based Thermal-aware Energy Efficient Multihop proTocol (ATTEMPT) in which nodes are placed according to data rates. However, deficiencies of ATTEMPT are as follows. (i)

There is no alternative route selection in case of dead nodes.

(ii)

Nonuniform load on the nodes causes unbalanced energy consumption which in turn causes shrinkage in network lifetime as well as stability period.

(iii)

Nodes of different data rates are equipped with unbalanced energy which results in quick energy depletion of high data rate nodes as compared to the ones with lower data rate. Unnecessary relaying of data causes the nodes to die at a faster rate.

(iv)

Placement of nodes is not according to energy levels.

(v)

For in-body nodes hot spot detection is very important; however, on-body sensor is not capable of acting like a hot spot due to inadequate energy source. So, surplus energy is consumed for the detection of hot spot which is not required.

Thus, we propose a routing protocol which overcomes the aforementioned deficiencies.

4. Proposed Protocol

In our proposed protocol, sink is placed at the centre of human body. A path with minimum number of hops (multi-hop communication) is selected for normal data delivery whereas direct communication is preferred for emergency data. Deficiencies mentioned in previous section are set in the following order: (1) nodes are placed according to energy levels, (2) to communicate effectively, alternative routes are selected in case of dead nodes, (3) initial energy is distributed in such a way that nodes acting as relays for data transmission to sink are equipped with more energy and these relay nodes are decreased in number, and (4) hot spot detection is disabled to save extraenergy consumption in doing so. Thus, relay nodes can easily forward received data to sink due to higher energy levels. Additionally, we analyze the newly proposed RE-ATTEMPT protocol in terms of path loss as well. In order to have a fair comparison between the proposed protocol and the existing one; we choose, for RE-ATTEMPT, the number of nodes as well as their locations the same as that of ATTEMPT protocol. More importantly, increase in the network size (more human bodies) does not affect the performance of RE-ATTEMPT protocol. Because the network topology is simply replicated for each human body (acting as a subunit), the algorithm is independently implemented on each subunit, having own sink and nodes (Figure 2). Detailed description about the phases involved in the operation of our proposed protocol is in the following subsections.

4.1. Initialization Phase

In this phase, three tasks are performed; each node is informed with its neighbours, position of sink, and all the possible routes to sink. Nodes update their routing table through the exchange of HELLO messages. This is made possible, when each node broadcasts HELLO messages as shown in Figure 1, containing information about neighbours in the form of hop count from sink.

Figure 1

HELLO message format.

Figure 2

WBASN topology.

4.2. Routing Phase

In this phase, a priority based route for data transmission to sink is selected from the set of available routes. The highest priority is set for nodes having emergency data; that is, these send data directly to sink and in case of normal data, route with minimum number of hops to sink is selected. In Figure 2 route selection is as follows.

(i)

Nodes 1, 2, 3, and 4 communicate directly with sink whether their data is emergency or normal.

(ii)

Nodes 7 and 8 send emergency data directly to sink and normal data to 5 and 6, respectively; however before doing so these check whether the receiving nodes are alive or not. If they are dead, then nodes 7 and 8 communicate directly with sink.

(iii)

Nodes 5 and 6 aggregate their own data with received data and forward compressed data to sink.

In direct communication, delay is much shorter as compared to multihop communication. Furthermore, emergency data should be transmitted as soon as possible in comparison to normal data. That is why we choose direct communication for emergency data and multihop communication for normal data delivery. Moreover, normal data's transmission delay is minimized by selecting route with a minimum number of hops. In Figure 3, flow diagram of the routing phase is shown.

Figure 3

Flow diagram: routing phase.

4.3. Scheduling Phase

Routing phase is followed by scheduling phase as shown in Figure 4. Sink allocates Time Division Multiple Access (TDMA) slots to nodes, thereby enabling nodes to share the same frequency band on the basis of different time slots. For emergency data, guaranteed time slots are assigned to nodes in Contention Free Period (CFP) of the Medium Access Control (MAC) superframe structure, thereby ensuring rapid data delivery in case of emergency. On the other hand, Contention Access Period (CAP) is adopted for normal data; time slots are assigned to each node in quick succession one after the other.

Figure 4

Scheduling phase.

4.4. Data Transmission Phase

Once sink allocates time slots to nodes, these communicate within their allocated time slots to overcome collision. After this, sink receives data and waits for some time to aggregate it.

Soon after the data transmission, next round is started where the phases are repeated in the same manner. This process continues till the energy resources of each node are completely depleted.

5. Energy Consumption Analysis

The amount of energy consumed depends on the mode of communication used: single hop or multi hop. For single-hop communication, we calculate the consumed energy as

\begin{matrix} E_{S -HOP} = E_{t x}, \end{matrix}

(1)

where

E_{t x}

is the transmission energy, calculated as

\begin{matrix} E_{t x} = b \times (E_{elec} + ϵ_{amp}) \times d^{2}, \end{matrix}

(2)

where

E_{elec}

is the electronic circuitry energy consumed for processing data and

ϵ_{amp}

is energy for transmit amplifier up to distance d and packet size b.

Now, we calculate energy consumption due to multihop communication as

\begin{matrix} E_{M -HOP} = n \times b \times (E_{t x}) + (n - 1) \times b \times (E_{r x} + E_{d a}), \end{matrix}

(3)

where n is number of hops,

E_{r x}

is the reception energy, and

E_{d a}

is the energy consumed for data aggregation purpose. Moreover, we assume that

E_{t x} = E_{r x}

. In [15, 16], some WBASN sensor nodes with their data rates, bandwidth, and power are discussed as depicted in Table 1.

Table 1

Comparison of different wearable sensors.

Sensor nodes	Data type	Power consumption	QoS	Privacy	Accuracy	Band-width
ECG	288 kbps	Low	Yes	High	12 bits	100–1000 Hz
EMG	300 kbps	Low	Yes	High	16 bits	0–10,000 Hz
EEG	43.2 kbps	Low	Yes	High	12 bits	0-1 Hz
Blood pressure	16 bps	High	Yes	High	8 bits	0–150 Hz
Temperature	120 bps	Low	Yes	Extremely low	8 bits	0-1 Hz

6. Path Loss Analysis

By nature human body is partially conductive, and various substances having varied thickness, characteristics of impedance, and dielectric constants are embodied there. Subject to the operating frequency band, high losses may occur in response to the communication protocol adopted for nodes. At present, many standards are in use for communication in WBASNs. However, most frequently used among these are IEEE 802.15.1 (Bluetooth), MICS, ZigBee, and IEEE 802.15.6 (UWB) [17]. When devices communicate, losses between them cause degradation in the performance of monitoring system. The available Industrial Scientific and Medical (ISM) radio bands for on body nodes are listed in Table 2 [18].

Table 2

Available ISM bands for on-body nodes.

MHz	13.5	50	400	600	900
GHz	2.4	3.1	10.6

Path loss includes all the consequences linked with distance and interaction of the propagating wave with physical objects in the environment between transmitter and receiver. Thus, path loss is attenuation in power level at the receiving end, mainly due to distance. In subject to WBASNs, path loss depends on distance and frequency. In [19] path loss model (in dB) as a function of distance between transmitter and receiver is worked out as

\begin{matrix} PL = P L_{o} + 10 n \log_{10} (\frac{d}{d_{o}}) + σ_{s}, \end{matrix}

(4)

where

$P L_{o}$ is path loss at reference distance $d_{o}$ ,

n is path loss exponent (for space its value is 2 and for human body its value varies from 4 to 7),

d is distance between transmitter and receiver,

$σ_{s}$ is standard deviation.

In WBASNs path loss occurs due to many reasons such as reflection, refraction, diffraction, and free space loss. $P L_{o}$ of (4) is given by

\begin{matrix} P L_{o} = 10 \log_{10} {(\frac{4 π d}{λ})}^{2} \end{matrix}

(5)

\begin{matrix} P L_{o} = 10 \log_{10} {(\frac{4 π d f}{c})}^{2}, \end{matrix}

(6)

where, f is frequency of the propagating wave, λ is wavelength of the propagating wave, and c is the speed of light.

We use operating frequency of $2.4 GHz$ ISM band for which Crossbow MICAz motes are commercially available. Figure 5 is clear justification of the fact that path loss increases by increasing operating frequency or communication distance between transmitter and receiver or both. Moreover, Figure 5 agrees with (4), (5), and (6).

Figure 5

Path loss (dB).

7. Problem Formulation and Modeling

We consider n nodes $1,2, 3, \dots, n$ and sink as $n + 1 th$ node affixed at positions shown in Figure 2 and Table 3. These locations are known to each of the nodes due to the HELLO messages broadcast during initialization phase. Each node generates some information as it monitors its vicinity as shown in Figures 6 and 1.

Table 3

Nodes deployment.

Node number	x coordinate (cm)	y coordinate (cm)
1	20	110
2	60	120
3	10	80
4	70	80
5	30	50
6	50	60
7	30	10
8	50	30

Figure 6

Network flow tree.

Problem Statement. We define the lifetime of the network to be the duration in terms of rounds until all nodes cease transmissions. The main objective is to maximize the network lifetime within the given constraints.

Solution. Consider network lifetime R rounds and let $P_{i, j}$ be the total number of packets that node i transmits to node j (a sensor or sink) during round r. Since any valid round must respect the energy constraint of nodes, thereby each round is the collection of trees T rooted at sink and spanning over the nodes (as shown in Figure 6) such that the main objective to schedule $\sum_{i} ‍ r_{i}$ is formulated via linear programming as follows:

\begin{matrix} Objective: \max R = \sum_{i} ‍ r_{i} \end{matrix}

(7)

such that

\begin{matrix} C_{1} : \sum_{i, j} ‍ P_{i, j} \cdot E_{i, j}^{t x} + \sum_{j, i} ‍ P_{j, i} \cdot E_{j, i}^{r x} \leq E_{i} \forall i \in n, \end{matrix}

(7a)

\begin{matrix} C_{2} : \min \sum_{i} ‍ T x_{i}^{r e} \forall i \in n, \end{matrix}

(7b)

\begin{matrix} C_{3} : \min \sum_{i} ‍ L_{i}^{u n} \forall i \in n, \end{matrix}

(7c)

\begin{matrix} C_{4} : \min \sum_{i} ‍ d_{i, j}^{n + 1} \forall i, j \in n, \end{matrix}

(7d)

\begin{matrix} C_{5} : \sum_{i, j} ‍ Υ_{i, j} + \sum_{i} ‍ Γ_{i} \cdot t_{r} \leq \sum_{j, i} ‍ Υ_{j, i} \forall i, j \in n, \end{matrix}

(7e)

\begin{matrix} C_{6} : 0 \leq Υ_{i, j} \leq P_{i, j} \forall i, j \in n, \end{matrix}

(7f)

\begin{matrix} C_{7} : \sum_{i} ‍ Υ_{i, n + 1} = T \forall i \in n . \end{matrix}

(7g)

The objective function in (7) is to maximize the network lifetime $R = \sum_{i} ‍ r_{i}$ , where r denotes a single round. Constraint in ( 7 a ) is the energy constraint which guarantees that the available energy of node $E_{i}$ is respected by the link capacities $\sum_{i, j} ‍ P_{i, j} \cdot E_{i, j}^{t x} + \sum_{j, i} ‍ P_{j, i} \cdot E_{j, i}^{r x}$ . Constraint in ( 7 b ) says that minimization of packet retransmissions $\sum_{i} ‍ T x_{i}^{r e}$ results in the prolongation of network lifetime. Constraint ( 7 c ) highlights the positive impact of minimizing the unnecessary relaying of data $\sum_{i} ‍ L_{i}^{u n}$ on the network lifetime. Similarly, constraint ( 7 d ) signifies the direct relation of communication distance with the network lifetime. For data generation rate Γ and flow variable Υ over the link $(i, j)$ constraint ( 7 e ) agrees with the principle of flow conservation; incoming flow along with the generated data should not exceed the outgoing flow; otherwise, data packet loss or retransmission would lead to more energy consumption as per constraint ( 7 b ) . Equation ( 7 f ) ensures the capacity constraint on the links/edges of the flow network, alternatively $\sum_{i, j} ‍ Υ_{i, j} = \sum_{i, j} ‍ Υ_{j, i}$ . Equation ( 7 g ) means that capacity constraint on the links/edges of the flow network is respected.

8. Performance Evaluation

We evaluate the performance of our proposed RE-ATTEMPT protocol with the help of MATLAB simulations, in which it is compared with ATTEMPT protocol. We assume 80 cm × 160 cm network area, where on body nodes are deployed at fixed positions as shown in Table 3 and sink is placed at (40 cm, 90 cm). Initially, nodes 5 and 6 are equipped with 0.525 J and rest of the nodes with 0.3 J of energy. With the assumption of collision-free channel, the radio parameters used in simulation are shown in Table 4. We execute our protocol 5 times; average results with discussions are provided in this section.

Table 4

Radio parameters.

Parameter	Value
$E_{elec} = E_{t x} = E_{r x}$	50 nJ/bit
$E_{da}$	5 nJ/bit/signal
$ϵ_{amp}$	10 pJ/bit/m²
b	4000 bits

The time from the establishment of the network till the death of first node is known as stability period. Here time is presented in terms of rounds and one round is the time duration in which the protocol operation is performed once. Similarly, the number of rounds from start of the network till the death of all nodes is termed as network lifetime. Figure 7 shows that on average RE-ATTEMPT consumes 7.46% less amount of energy as compared to ATTEMPT. Figure 8 shows that RE-ATTEMPT takes more rounds in terms of stability period and network lifetime as compared to ATTEMPT. In ATTEMPT first node death occurs at round number 691 while for RE-ATTEMPT it is round number 1479. Network lifetime of ATTEMPT is 1450 rounds and that for RE-ATTEMPT is 1577 rounds. Moreover, ATTEMPT shows nonuniform distribution of energy in comparison to RE-ATTEMPT as depicted from Figure 8. Reasons for all of the abovementioned characteristics are as follows: (i) relay nodes consume more energy than nonrelay nodes and in ATTEMPT protocol these nodes are provided with initial energy less than the required amount, (ii) unnecessary multihopping of data is avoided in RE-ATTEMPT, (iii) alternative route selection in case of dead node, and (iv) hot spot detection is disabled in RE-ATTEMPT. Moreover, we compare the attributes of existing routing protocols with our proposed RE-ATTEMPT as shown in Table 5.

Table 5

Comparison of RE-ATTEMPT protocol with existing protocols.

Algorithms	Network type	Communication mode	Thermal-aware	Energy-efficient	Emergency support
FPSS [3]	Homogeneous	Multihop	Yes	Yes	Yes
TARA [20]	Homogeneous	Multihop	Yes	No	No
OBSFR [21]	Homogeneous	Single hop	No	No	No
EAR [5]	Heterogeneous	Multihop	No	Yes	No
WASP [4]	Homogeneous	Multihop	No	No	No
Tree [6]	Homogeneous	Multihop	No	No	Yes
DMQOS [22]	Homogeneous	Multihop	No	No	No
ATTEMPT	Heterogeneous	Single hop/Multihop	Yes	Yes	Yes
RE-ATTEMPT	Heterogeneous	Single hop/Multihop	No	Yes	Yes

Figure 7

Average energy consumption per round.

Figure 8

Average rate of dead nodes.

Throughput is the number of successfully received packets at the receiver end, and for its calculation packet drops are taken into consideration. We use random uniformed model [23] for packet drop calculation. The status of a given link might be good or bad, in case of good status packet is successfully received and it is dropped for bad status. We suppose the probability of link to be in good status as 0.7. Figure 9 depicts that more packets are sent to sink by our protocol as compared to its counterpart protocol. This is due to decreased multihopping and extended lifetime of our protocol. From Figure 10, it is clear that ATTEMPT results in more packet drops than RE-ATTEMPT. The reason behind this is proper scheduling of data in RE-ATTEMPT protocol, that is, emergency data transmission in CFP and normal data transmission in CAP. Moreover, multihopping increases the number of packets in transit which means more contention, thereby increasing the chances of collision or alternatively more packets being dropped. Finally, the number of received packets is shown in Figure 11; in RE-ATTEMPT more packets are received at sink as compared to ATTEMPT. This is obvious because proper scheduling makes RE-ATTEMPT more reliable in terms of successful packet delivery as compared to ATTEMPT protocol. Numerically, according to ATTEMPT the number of sent packets is 2902, and received packets are 2014 while that of RE-ATTEMPT is 9889 and 6930, respectively.

Figure 9

Average number of packets sent to sink (aggregated).

Figure 10

Average number of packets dropped (per round).

Figure 11

Average throughput (aggregated).

9. Conclusion and Future Work

In this paper, we proposed RE-ATTEMPT routing protocol for WBASNs in which the merits of single-hop and multihop routing are utilized, priority based route selection for the delivery of normal and emergency data. The first point of concern with multihop routing is delay, this issue is resolved by minimum hop count based route selection. The second point of concern with multihop routing is high energy consumption of relay nodes; this issue is resolved by minimizing the number of relay nodes and balancing them with reference to energy distribution. Moreover, time domain analysis of the proposed RE-ATTEMPT protocol in terms of path loss as well as problem formulation and its solution via linear programming based mathematical modeling is also provided. Improved results in terms of network lifetime and throughput of the proposed RE-ATTEMPT protocol as compared to the existing ATTEMPT protocol are due to the reasons highlighted in Sections 3, 4, and 8, respectively.

Our future directions are focused on cross layer design protocols in WBASNs. Initially, a joint, Medium Access Control (MAC) layer [24] and network layer, model development is under consideration.

Footnotes

Conflict of Interests

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

References

Hossain

M. A.

A survey on sensor-cloud: architecture, applications, and approaches

International Journal of Distributed Sensor Networks 2013 2013 18

917923

10.1155/2013/917923

Quwaider

Biswas

DTN routing in body sensor networks with dynamic postural partitioning

Ad Hoc Networks 2010 8 8 824 841

2-s2.0-77954034169

10.1016/j.adhoc.2010.03.002

Seo

S.-H.

Gopalan

S. A.

Chun

S.-M.

Seok

K.-J.

Nah

J.-W.

Park

J.-T.

An energy-efficient configuration management for multi-hop wireless body area networks

Proceedings of the 3rd IEEE International Conference on Broadband Network and Multimedia Technology (IC-BNMT ′10)

October 2010

1235 1239

2-s2.0-79951735934

10.1109/ICBNMT.2010.5705287

Braem

Latré

Moerman

Blondia

Demeester

The wireless autonomous spanning tree protocol for multihop wireless body area networks

Proceedings of the 3rd Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous ′06)

July 2006

IEEE

2-s2.0-51149121848

10.1109/MOBIQ.2006.340421

Kim

D. Y.

Kim

W. Y.

Cho

J. S.

Lee

Ear: an environment-adaptive routing algorithm for wbans

Proceedings of International Symposium on Medical Information and Communication Technology (ISMICT ′10)

2010

Annur

Wattanamongkhol

Nakpeerayuth

Wuttisittikulkij

Takada

J.-I.

Appliying the tree algorithm with prioritization for Body Area Networks

Proceedings of the 10th International Symposium on Autonomous Decentralized Systems (ISADS ′11)

March 2011

519 524

2-s2.0-79955745735

10.1109/ISADS.2011.74

Ababneh

Timmons

Morrison

Tracey

Energy-balanced rate assignment and routing protocol for body area networks

Proceedings of 26th International Conference on the Advanced Information Networking and Applications Workshops (WAINA ′12)

2012

IEEE

466 471

Ben Elhadj

Chaari

Kamoun

A survey of routing protocols in wireless body area networks for healthcare applications

International Journal of E-Health and Medical Communications 2012 3 2 118

Hughes

Wang

Chen

A review of protocol implementations and energy efficient cross-layer design for wireless body area networks

Sensors 2012 12 11 14730 14773

10.

Latre

Braem

Moerman

A low-delay protocol for multihop wireless body area networks

Proceedings of the 4th Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous ’07)

August 2007

1 8

11.

Javaid

BiBi

Javaid

Khan

Z. A.

Latif

Ishfaq

Investigating quality routing link metrics in Wireless Multi-hop Networks

Annals of Telecommunications 2013

12.

Hanson

M. A.

Powell

H. C.

Jr. Barth

A. T.

Ringgenberg

Calhoun

B. H.

Aylor

J. H.

Lach

Body area sensor networks: challenges and opportunities

Computer 2009 42 1 58 65

2-s2.0-59849115600

10.1109/MC.2009.5

13.

Nabi

Basten

Geilen

Blagojevic

Hendriks

A robust protocol stack for multi-hop wireless body area networks with transmit power adaptation

Proceedings of the 5th International Conference on Body Area Networks

2010

ACM

77 83

14.

Javaid

Abbas

Farid

M. S.

Khan

Z. A.

Alrajeh

M-attempt: a new energy-efficient routing protocol in wireless body area sensor networks

Proceedings of the 4th International Conference on Ambient Systems, Networks and Technologies

2013

224 231

15.

Ullah

Higgins

Braem

Latre

Blondia

Moerman

Saleem

Rahman

Kwak

K. S.

A comprehensive survey of wireless body area networks

Journal of Medical Systems 2012 36 3 1065 1094

2-s2.0-77955537164

10.1007/s10916-010-9571-3

16.

Latré

Braem

Moerman

Blondia

Demeester

A survey on wireless body area networks

Wireless Networks 2011 17 1 1 18

2-s2.0-79951723271

10.1007/s11276-010-0252-4

17.

Khan

Javaid

Khan

Z. A.

Jaffar

Rafiq

Bibi

Ubiquitous healthcare in wireless body area networks

Proceedings of the IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom ′12)

2012

IEEE

1960 1967

18.

Chen

Gonzalez

Vasilakos

Cao

Leung

V. C. M.

Body area networks: a survey

Mobile Networks and Applications 2011 16 2 171 193

2-s2.0-79956094375

10.1007/s11036-010-0260-8

19.

Reusens

Joseph

Vermeeren

Martens

On-body measurements and characterization of wireless communicationchannel 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

20.

Tang

Tummala

Gupta

S. K. S.

Schwiebert

TARA: thermal-aware routing algorithm for implanted sensor networks

Proceedings of the 1st IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS ′05)

July 2005

Springer

206 217

2-s2.0-26444490086

21.

Quwaider

Biswas

On-body packet routing algorithms for body sensor networks

Proceedings of the 1st International Conference on Networks and Communications (NetCoM ′09)

December 2009

171 177

2-s2.0-77949853819

10.1109/NetCoM.2009.54

22.

Razzaque

Hong

C. S.

Lee

Data-centric multiobjective QoS-aware routing protocol for body sensor networks

Sensors 2011 11 1 917 937

2-s2.0-79251607737

10.3390/s110100917

23.

Zhou

Cao

Chen

Lin

A solution to error and loss in wireless network transfer

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

December 2009

312 315

2-s2.0-77950909313

10.1109/WNIS.2009.103

24.

Javaid

Ahmad

Rahim

Khan

Z. A.

Ishfaq

Qasim

Adaptive medium access control protocol for wireless body area networks

International Journal of Distributed Sensor Networks 2014 2014 10

10.1155/2014/254397

254397