Sage Journals: Discover world-class research

Abstract

This paper introduces a hybrid and secure MAC protocol (PMAC) for WBAN. The PMAC protocol uses two contention access periods (CAPs) for accommodating normal and life-critical traffic and one contention-free period (CFP) for accommodating large amount of data packets. The priority-guaranteed CSMA/CA procedure is used in the CAP period, where different priorities are assigned to WBAN nodes by adjusting the backoff window size. In addition, a set of security keys is used to prevent illegal access to the network. Analytical expressions are derived to analyze the average delay, power consumption, throughput, and packet loss probability of the PMAC protocol. Results derived from these expressions are validated by computer simulations.

1. Introduction

Wireless body area networks (WBANs) are captivating significant attention from research and industrial communities. They provide unprecedented and limitless opportunities for medical and nonmedical applications [1, 2]. Medical applications employ implantable or wearable tiny devices in, on, or around the human body for continuous health monitoring such as predicting contingency abnormal condition and treatment of chronic diseases including diabetes and hypertension. Non-medical applications include interactive body computing, information exchange, social networking, monitoring forgotten things, entertainment, monitoring of athletes, education, or assessing soldier fatigue and battle readiness. Most of these applications require WBAN to stay operational for a longer period of time which necessitates power-efficient network operation. For example, a diabetic patient requires round-the-clock real-time glucose monitoring over a period of years to decades in order to avoid catastrophic consequences such as stroke or a heart attack that may result in death. This requires WBAN node to continuously monitor and report glucose level for timely action. Nodes of WBAN primarily rely on low power batteries that hinder their operation over longer period of time. Therefore, power-efficient network operation is extremely crucial for prolonging network lifetime.

Medium access control (MAC) protocols play a critical role in extending network lifetime by controlling the dominant sources of energy waste such as packet collisions, overhearing, idle listening, and control packet overhead. Most of the existing MAC protocols for WBAN are categorized into contention- and schedule-based MAC protocols. In contention-based MAC protocols, nodes compete for the channel to transmit the data; carrier sensor multiple access with collision avoidance (CSMA/CA) protocol is the best example of contention-based MAC protocols where the nodes contend for the channel using a random backoff period. These protocols are scalable and do not require establishing infrastructure. However, they are unable to handle emergency situations where multiple nodes (with the same priorities) are triggered to send life-critical data. Schedule-based MAC protocols divide the channel into multiple fixed or dynamic slots, which are used for data transmission. These protocols reduce idle listening and overhearing; however, they incur significant protocol overhead.

This paper proposes a hybrid and secure MAC protocol (PMAC) for WBAN. The PMAC protocol supports two contention access periods (CAPs) and one contention free period (CFP). In the CAPs, the operation is mainly based on a priority-guaranteed CSMA/CA procedure, where different WBAN nodes are assigned different priorities. These priorities are adjusted by tuning the contention window (CW) size. Depending on the application requirements, the CAPs may also employ the slotted-ALOHA protocol. The CFP is used to carry large amount of data packets to the coordinator. The PMAC protocol uses a set of security keys including master key (MK) and pairwise temporal key (PTK) in order to prevent adversaries from gaining resource allocation information and from corrupting the CFP slots. The performance of the PMAC protocol is analyzed using both analytical and simulation-based methods. The results are derived in terms of average delay, power consumption, throughput, packet loss probability, and number of corrupted CFP slots.

The rest of the paper is organized into the following sections. Section 2 presents the related work. Section 3 explains the basic operation of the PMAC protocol. Sections 4 and 5 present the analytical approximations and performance results. The final section concludes our work.

2. Related Work

Multiple research efforts are dedicated to the development of novel MAC protocols for WBANs. Some of these efforts analyzed existing technologies such as IEEE 802.15.4 [3], while others have proposed new techniques for power-efficient communication in WBANs. The authors of [4] investigated the suitability of IEEE 802.15.4 MAC protocol for WBANs; however, their analysis was confined to periodic and asymmetric traffic. In [5], the authors proposed a random access protocol that supports quality of service for multiuser mobile WBANs. This protocol addressed inter-WBAN interference and energy wastage problems caused by network mobility and provided support for latency and energy control. The authors of [6] proposed a reliable power-saving mechanism that strives to reduce collisions and idle listening. They also proposed a distributed queuing MAC protocol and evaluated its performance for different network loads [7, 8]. The performance of IEEE 802.15.6-based CSMA/CA procedure was investigated in [9] where the minimum delay and maximum throughput for different narrow band frequency bands were derived. The authors of [10, 11] developed an analytical model to evaluate the performance of contention-based WBANs. They developed a Markov chain to model backoff procedure of IEEE 802.15.6 under saturated and nonsaturated conditions. Their study also investigated the effectiveness of exclusive and random access phases. A similar study was conducted in [12] where the authors investigated the impact of different periods on the IEEE 802.15.6 superframe structure. They considered saturated and error prone channel and developed a Markov chain for analyzing different traffic loads on the IEEE 802.15.6 networks. In [13], the authors studied the integration of radio frequency identification (RFID) technology with WBANs and concluded that RFID-based wakeup methods can play a significant role in extending the network lifetime to years. A superframe-level time hopping scheme for WBAN with variable contention access period was presented in [14]. While maintaining the similar interference mitigation, the proposed scheme improved performance of WBAN in terms of energy dissipation, latency, and spectrum efficiency. The authors of [15] recently proposed an adaptive time division multiple access (TDMA) protocol based on periodic wake up schedules, which efficiently handles overhearing and idle listening problems in WBANs. Another study presented in [16] proposed a traffic-aware dynamic MAC protocol that dynamically adjusts wakeup intervals based on traffic status register bank. The dynamic wakeup intervals save extra power consumed by idle listening, overhearing, collisions, and unnecessary beacon transmission. A priority-based TDMA protocol is presented in [17], where the transmission schedules are based on priorities of data packets. This protocol dynamically adjusts the superframe structure according to the traffic load, thereby minimizing power consumption of the network.

3. PMAC Protocol

The following sections discuss the general description, priority-guaranteed resource allocation, and security support of PMAC protocol.

3.1. General Description

The PMAC protocol operates in a beacon-enabled mode, where beacons are transmitted at the end of each superframe. The superframe consists of a beacon, two contention access periods (CAP1 and CAP2), and one contention-free period (CFP) as given in Figure 1. The beacon is used for resource allocation information. It also carries security codes in order to allocate resources to legitimate users. The CAP1 considers a priority-guaranteed CSMA/CA procedure for data transmission. The operation of the priority-guaranteed CSMA/CA is partially based on IEEE 802.15.6 standard [18]. The CAP1 has an optional period for slotted-ALOHA protocol (this is not considered in our analysis). Depending on the application requirements, the slotted-ALOHA protocol may be used to send short data and command frames. For example, for low-traffic situations, the slotted-ALOHA may be used to allocate resources to nodes in the CFP period. The CFP period consists of multiple TDMA slots and is used for a large amount of data packets including streaming data. The CAP2 is an optional period which is used to finish the pending transmission of CAP1. This period is also used to inform the coordinator of incomplete transmission in the previous CFP slots. In addition, the PMAC considers a one-hop star topology network with uplink traffic only. The entire operation of the network is controlled by the WBAN coordinator.

Figure 1

PMAC superframe structure.

3.2. Priority-Guaranteed Resource Allocation

For resource allocation, the coordinator continuously broadcasts beacons to all nodes, and only active nodes are able to receive the beacons. The PMAC protocol allows low duty cycle nodes to remain in sleep mode in order to save their energy (consumed by beacon overhearing). The nodes which have no data to send or receive do not need to wakeup and receive the beacons. The nodes requiring the allocation of TDMA slots send a request to the coordinator in the CAP period. Upon receiving the request, the coordinator allocates TDMA slots in the CFP period of the following superframe. Figure 2 shows the beacon format of PMAC protocol. The details of each field are present in [18].

Figure 2

PMAC beacon frame format.

In the CAP period, the PMAC protocol employs the priority-guaranteed CSMA/CA procedure. The procedure of this protocol is based on IEEE 802.15.6 standard [18] where the node sets the backoff counter to a random integer that is uniformly distributed over $[1, CW]$ where $CW \in (C W_{\min}, C W_{\max})$ . Traditional CSMA/CA procedure initially sets its backoff counter to a random integer selected from a fixed-size $CW$ . Because WBAN may have different nodes with different priorities, the use of a fixed-size $CW$ is not a reliable approach, for example, electrocardiogram and blood pressure nodes may have high and low priorities, respectively. The priority-guaranteed CSMA/CA prioritizes all the nodes by assigning different $C W_{\min}$ and $C W_{\max}$ values to them as given in Table 1.

Table 1

CW bounds for priority-guaranteed CSMA/CA [18].

Priority class	$C W_{\min}$	$C W_{\max}$
0	16	64
1	16	32
2	8	32
3	8	16
4	4	16
5	4	8
6	2	8
7	1	4

Nodes having high priorities will have a small $CW$ and those having low priorities will have a large $CW$ . Once the backoff counter is selected, the node starts decrementing this counter for each idle CSMA slot. Once the backoff counter reaches zero, the node transmits the data. If the channel is busy due to a frame transmission, the node locks its backoff counter until the channel becomes idle. Unlike IEEE 802.15.6 CSMA/CA where the $CW$ is doubled for even number of failures, the CW in the priority-guaranteed CSMA/CA is doubled for each failure. Figure 3 shows the resource allocation of a priority-guaranteed CSMA/CA procedure.

Figure 3

A priority-guaranteed CSMA/CA procedure.

3.3. Security Support

Since WBANs are mostly used for health applications, attacks on these networks may create serious circumstances for their users. Each WBAN must be able to support strong security protocols in order to enable secure communication on the channel. In addition, these protocols must also be able to address other security issues such as data confidentially, data authentication, data freshness, data availability, and secure management. The security mechanism of the PMAC protocol is based on IEEE 802.15.6 standard [18]. The protocol supports three security levels: (1) unsecured communication level, where the data is transmitted in unsecured frames, (2) authentication level, where the data is transmitted in secured authentication with no encryption, and (3) authentication and encryption, where the data is transmitted in authenticated and encrypted frames. The PMAC protocol uses a master key (MK) for establishing a secure communication. The MK is preshared between the nodes and the coordinator. Once the pre-shared MK is activated during association, the nodes generate a pairwise temporal key (PTK) for a single session upon mutual agreement. The frames are then authenticated and encrypted using the AES-128 counter. The secure MK and PTK keys prevent adversaries from penetrating into the network and from manipulating different active and passive attacks including backoff manipulation and replay attacks.

4. Analytical Approximations of PMAC

Let $i = (0,1, 2, \dots, 7)$ represent the priority class of the nodes in the CAP period (CFP periods are not considered in the analysis) and let $n_{i}$ $(i = 0,1, \dots, N - 1)$ be the number of finite stations in the priority i class. Let $τ_{i}$ represent the probability that a node transmits in the priority i class. The probability $p_{i}$ that $n_{i}$ senses the channel busy in the backoff stage is given by [19]

\begin{matrix} p_{i} = 1 - [⋂_{x = 0}^{i - 1} ‍ {(1 - τ_{x})}^{n_{x}}] {(1 - τ_{i})}^{n_{i} - 1} [⋂_{x = i + 1}^{N - 1} ‍ {(1 - τ_{x})}^{n_{x}}] . \end{matrix}

(1)

The probability σ is that the channel is busy or there is an ongoing transmission during a slot time is given by

\begin{matrix} σ = 1 - [⋂_{x = 0}^{N - 1} ‍ {(1 - τ_{x})}^{n_{x}}] . \end{matrix}

(2)

The transmission probability $τ_{i}$ is given by the fraction of average number of attempts $E [A_{i}]$ for the priority class i to the average number of backoff $E [B_{i}]$ that a node needs to transmit the data successfully. According to [19], the expressions for $E [A_{i}]$ and $E [B_{i}]$ are given by

\begin{matrix} E [A_{i}] = \sum_{j = 0}^{M_{i}} ‍ [\frac{j p_{i}^{j} (1 - p_{i})}{1 - p^{M_{i} + 1}}] . \end{matrix}

(3)

The probability that the data is successfully transmitted after jth retry is $p_{i}^{j} (1 - p_{i}) / (1 - p^{M_{i}} + 1)$ , where $M_{i}$ is the retry limit of $n_{i}$ in the priority class i. The number of backoff slots in the jth retry is $\sum_{x = 0}^{j} ‍ (W_{i, x} - 1) / 2$ . The expression for $E [B_{i}]$ is given by

\begin{matrix} E [B_{i}] = [\sum_{j = 0}^{M_{i}} ‍ \frac{p_{i}^{j} (1 - p_{i})}{1 - p^{M_{i} + 1}}] [\sum_{x = 0}^{j} ‍ \frac{(W_{i, x} - 1)}{2}] . \end{matrix}

(4)

The probability $τ_{i} = E [A_{i}] / E [B_{i}]$ can be used to solve (1) and (2).

4.1. Average Delay

The average delay $E [D_{PMAC}]$ includes the delay of the packet when it arrives at the queue and the delay of the successful transmission. It is given by

\begin{matrix} E [D_{PMAC}] = E [B_{i}] δ + E [W_{i}] + T_{D} + 2 T_{T} + 2 T_{C}, \end{matrix}

(5)

where

T_{D}

T_{T}

T_{C}

, and δ represent the data packet transmission time, the turn around time, control packet transmission time, and empty slot time, respectively. The

E [W_{i}]

is the mean waiting time of the packets for priority class i. According to the nonpreemptive M/G/1 priority queuing system,

E [W_{i}]

is given by

\begin{matrix} E [W_{i}] = \frac{ρ E [R]}{[1 - \sum_{j = 0}^{i} ρ_{j}] [1 - \sum_{j = 0}^{i} ρ_{j}]}, \end{matrix}

(6)

where

ρ = [E [B_{i}] + T_{D} + 2 T_{T} + 2 T_{C}] / L

is the traffic intensity and

E [R]

is the residual service time. The variable L represents the average interarrival time of the packets.

4.2. Average Power Consumption

The average power consumption $E [P_{PMAC}]$ includes the power consumed during idle $P_{IDLE}$ , transmit $P_{TX}$ , and receive $P_{RX}$ states. The $E [P_{PMAC}]$ is given by

\begin{array}{l} \begin{array}{l} E [P_{P M A C}] \\ = \frac{[P_{IDLE} (L - E [D_{PMAC}]) + P_{TX} T_{D} + P_{RX} (T_{S} + 2 T_{T} + 2 T_{C})]}{[L + E [D_{PMAC}]]}, \end{array} \end{array}

(7)

where

T_{S}

is the time to switch from idle to transmit or receive states.

4.3. Throughput

The saturated throughput $S T_{i}$ is fraction of average transmission time in a slot for a priority class i to the total slot duration [20]. It is given by

\begin{matrix} S T_{i} = \frac{ψ_{i} E [P]}{[1 - σ] δ + ψ T_{b} + [σ - ψ] T_{COL}}, \end{matrix}

(8)

where

T_{b}

and

T_{COL}

represent the average time the channel is sensed busy due to a successful transmission and due to a collision, respectively [21]. In addition,

E [P]

is the average packet length. The

ψ_{i}

is the successful transmission probability occurred in a slot time for a priority class i and ψ is the successful transmission probability in a slot time. According to [19], the expressions for

ψ_{i}

and ψ are given by

\begin{matrix} ψ_{i} = n_{i} τ_{i} {(1 - τ_{i})}^{n_{i} - 1} [⋂_{x = 0}^{N - 1} ‍ {(1 - τ_{x})}^{n_{x}}], \\ ψ = (1 - σ) [\sum_{x = 0}^{N - 1} ‍ \frac{n_{x} τ_{x}}{1 - τ_{x}}] . \end{matrix}

(9)

For PMAC, the expressions for $T_{b}$ and $T_{COL}$ are

\begin{matrix} T_{b} = PHY + MAC + SIFS + DIFS + 2 p + T_{c} + T_{D}, \\ T_{COL} = PHY + MAC + DIFS + T_{D}, \end{matrix}

(10)

where

PHY

MAC

SIFS

DIFS

, and p represent the physical layer header, MAC layer header, short interframe spacing, distributed coordination function (DCF) interframe spacing, and propagation delay, respectively.

5. Performance Results

The basic operation of the PMAC protocol is simulated in an independent C++ simulator. The nodes generate uplink Poisson traffic in a star topology network. Initially, we consider two priority classes (class 0 and class 1) for performance analysis; however, the analysis is valid for all types of priority classes. The $C W_{\min}$ and $C W_{\max}$ for priority classes 0 are 16 and 64 and for priority class 1 are 16 and 32, respectively. The simulation parameters are listed in Table 2. We are interested in analyzing the PMAC protocol in terms of the following parameters.

Table 2

Simulation parameters (the symbol rate is calculated based on [18]).

CCA	$63 /$ Symbol rate	pSIFS	50 μs
$M_{0}$	4	$M_{1}$	7
CSMA slot length	CCA + 20 μs	MAC	56 bits
MAC footer	16 bits	Propagation delay p	1 μs
$P_{IDLE}$	5 μW	$P_{TX}$	27 mW
$P_{RX}$	1.8 mW	$T_{S}$	0.8 ms
$T_{T}$	0.4 ms	$T_{C}$	1.9 ms
$E [P]$	245 bytes	PHY	31 bits

(i) Average Delay. This is the average delay of a packet in the queuing, backoff, and transmit states for a priority class i.

(ii) Average Power Consumption. This is the average power consumed in the backoff, transmit, and receive states for a priority class i.

(iii) Throughput. This is the saturation throughput of WBAN.

(iv) Packet Loss Probability. The packet loss probability $P_{i, LOSS}$ is the probability of a packet when it fails at $M_{i} + 1$ attempts and is derived as $P_{i, LOSS} = p_{i}^{M_{i} + 1}$ .

(v) Number of Corrupted CFP Slots. This is the total number of CFP slots that are corrupted by an attacker. The attacker first listens to the beacon in the beginning of the superframe period and grabs knowledge about the slot boundaries of CFP period. Once the CFP slots are known, the attacker creates interference in these slots.

Figure 4 shows the average delay as a function of number of nodes in priority class 0 and class 1. Because class 0 has longer waiting and queuing delays, its average delay is comparatively more than that of class 1. In addition, when the number of nodes increases, the average delay increases; this is because of increase in packet loss and collision probabilities. In addition, the average power consumption for class 0 is more than that of class 1 for a few number of nodes as illustrated in Figure 5. However, when the number of nodes in a high priority class is increased (for a fixed $CW$ ), the power consumption will eventually increase and will be much higher than that of a low priority class. This figure also shows the average power consumption of IEEE 802.15.4 protocol, which is much higher than class 0 and class 1. This is due to the fact that all nodes in IEEE 802.15.4 network compete for the channel with the same priorities. The saturation throughput is shown in Figure 6, where class 0 has much higher throughput than that of class 1 and class 2. The latter two classes have small $CWs$ and therefore have high chances of collisions. Since class 0 has a low retry limit, it is unable to transmit all packet successfully and has a higher packet loss probability as illustrated in Figure 7. The trend in Figure 7, however, depends on the number of retry limit $M_{i}$ . Figure 8 shows different attacks on the CFP slots of the superframe, where the attacker corrupts the CFP slots by gaining the resource allocation information through beacons. It can be seen that proper authentication and encryption procedure is able to prevent most of the CFP attacks. This is due to the use of secure MK and PTK keys which do not allow adversaries to grab beacons and to penetrate the CFP slots.

Figure 4

Average delay of PMAC for priority class 0 and class 1.

Figure 5

Average power consumption of PMAC for priority class 0 and class 1.

Figure 6

Saturation throughput of PMAC for priority class 0, class 1, and class 2.

Figure 7

Packet loss probability $P_{i, LOSS}$ of PMAC for priority class 0 and class 1.

Figure 8

Number of corrupted CFP slots.

6. Conclusion

This paper introduced a hybrid and secure MAC protocol which prioritizes the nodes by using a priority-guaranteed CSMA/CA procedure in the CAP period. The priorities are adjusted according to the $CW$ . The PMAC protocol used CFP periods for large amount of data packets. Analytical approximations were derived to analyze the performance of CAP period in terms of average delay, power consumption, throughput, packet loss probability, and number of corrupted CFP slots. The analytical approximations were validated by computer simulations. In future, we will derive analytical approximations for the CFP period and will study its feasibility for multimedia WBANs.

Footnotes

Conflict of Interests

The authors declare that they have no conflict of interests.

Acknowledgment

This work was supported by the Research Center of College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia, through the Research Project no. RC121244.

References

Ullah

Higgins

Braem

Latre

Blondia

Moerman

Saleem

Rahman

Kwak

K. S.

A comprehensive survey of wireless body area networks: on PHY, MAC, and network layers solutions

Journal of Medical Systems 2012 36 3 1065 1094

2-s2.0-77955537164

10.1007/s10916-010-9571-3

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

IEEE 802. 15. 4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Wireless Personal Area Networks (WPANs) Used in or around a Body 2006

Piscataway, NJ, USA

IEEE

Timmons

N. F.

Scanlon

W. G.

Analysis of the performance of IEEE 802.15.4 for medical sensor body area networking

Proceedings of the 1st Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON '04)

October 2004

Santa Clara, Calif, USA

16 24

2-s2.0-20344397428

Cheng

Huang

C. C.

RACOON: a multiuser QoS design for mobile wireless body area networks

Journal of Medical Systems 2011 35 5 1277 1287

2-s2.0-84856232350

10.1007/s10916-011-9676-3

Otal

Alonso

Verikoukis

Highly reliable energy-saving mac for wireless body sensor networks in healthcare systems

IEEE Journal on Selected Areas in Communications 2009 27 4 553 565

2-s2.0-67349126471

10.1109/JSAC.2009.090516

Otal

Alonso

Verikoukis

Towards energy saving wireless body sensor networks in health care systems

Proceedings of the IEEE International Conference on Communications Workshops (ICC '10)

May 2010

1 5

2-s2.0-77954895578

10.1109/ICCW.2010.5503912

Otal

Alonso

Verikoukis

Design and analysis of an energy-saving distributed MAC mechanism for wireless body sensor networks

EURASIP Journal on Wireless Communications and Networking 2010 2010 13

2-s2.0-78249257777

10.1155/2010/571407

571407

Ullah

Chen

Kwak

Throughput and delay analysis of IEEE 802. 15. 6-based CSMA/CA protocol

Journal of Medical Systems 2012 36 6 3875 3891

10.

Rashwand

Mišić

Khazaei

IEEE 802.15.6 under saturation: some problems to be expected

Journal of Communications and Networks 2011 13 2 142 148

2-s2.0-79956291871

11.

Rashwand

Mišić

Performance evaluation of IEEE 802.15.6 under non-saturation condition

Proceedings of the 54th Annual IEEE Global Telecommunications Conference (GLOBECOM '11)

December 2011

Houston, Tex, USA

1 6

2-s2.0-84857223578

10.1109/GLOCOM.2011.6134262

12.

Rashwand

Mii

Effects of access phases lengths on performance of IEEE 802. 15. 6 CSMA/CA

Computer Networks 2012 56 12 2832 2846

13.

Ullah

Alamri

A secure RFID-based WBAN for healthcare applications

Journal Medical Systems 2013 37

9961

10.1007/s10916-013-9961-4

14.

Jian

Hanlen

L. W.

Wang

A. Y.

Xiaojing

Superframe-level time-hopping system with variable contention access period for wireless body area communications

Proceedings of the IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '11)

September 2011

Toronto, Canada

2178 2182

2-s2.0-84857565856

10.1109/PIMRC.2011.6139901

15.

Rahim

Javaid

Aslam

Qasim

Khan

Z. A.

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

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

2012

56 58

16.

Alam

M. M.

Berder

Menard

Sentieys

TAD-MAC: traffic-ware dynamic MAC protocol for wireless body area sensor networks

IEEE Journal on Emerging and Selected Topics in Circuits and Systems 2012 2 1 109 119

2-s2.0-84859908587

10.1109/JETCAS.2012.2187243

17.

Anjum

Alam

Razzaque

M. A.

Hassan

M. M.

Alamri

Traffic priority and load adaptive MAC protocol for QoS provisioning in body sensor networks

International Journal of Distributed Sensor Networks 2013 2013 9

205192

10.1155/2013/205192

18.

IEEE 802. 15. 6 Wireless Medium Access Control (MAC)and Physical Layer (PHY) Specifications for Wireless Personal Area Networks (WPANs) used in or around a body, 2012

19.

Xiao

Performance analysis of priority schemes for IEEE 802.11 and IEEE 802.1 le wireless LANs

IEEE Transactions on Wireless Communications 2005 4 4 1506 1515

2-s2.0-27744505499

10.1109/TWC.2005.850328

20.

Ullah

Chen

Alsalih

Performance analysis of contention access period of IEEE 802. 15. 3 MAC protocol

International Journal of Ad Hoc and Ubiquitous Computing 2013 13 3/4 158 166

21.

Bianchi

Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications 2000 18 3 535 547

2-s2.0-0033749075

10.1109/49.840210

A Hybrid and Secure Priority-Guaranteed MAC Protocol for Wireless Body Area Network

Abstract

1. Introduction

2. Related Work

3. PMAC Protocol

3.1. General Description

3.2. Priority-Guaranteed Resource Allocation

3.3. Security Support

4. Analytical Approximations of PMAC

4.1. Average Delay

4.2. Average Power Consumption

4.3. Throughput

5. Performance Results

6. Conclusion

Footnotes

Conflict of Interests

Acknowledgment

References