Mixed Cooperation MAC Protocol with Sleep Mechanism for Data Acquisition in Wireless Machine-to-Machine Networks

Abstract

By exploring the idle state of each sensor node, a mixed sleep-cooperative time division multiple access (TDMA) media access control (MAC) protocol (MS-CTDMA) is proposed for the wireless data gathering network in wireless machine-to-machine (M2M) networks. The basic idea is that in the idle state, each sensor node dynamically goes into sleep state or cooperative state to maximize the network lifetime. A single-hop network delay model of MS-CTDMA is established by the $M^{X} / G / 1$ N-policy queue with multiple exhaustive vacations, which provides a way to balance energy consumption in network and the delay of each node with the delay sensitive traffic constraint. Furthermore, based on some reasonable assumptions, the proposed MS-CTDMA analysis model can be extended to the whole M2M network. Consequently, we propose an optimal source node selection strategy from the perspective of the relay node during its idle time, regarding the traffic load, residual energy, and channel state. Numerical results reveal that with proper tradeoff between delays and energy conservations, MS-CTDMA can significantly prolong the network lifetime in Rayleigh fading channels compared to pure sleep scheme.

1. Introduction

Machine-to-Machine (M2M) technology is widely used to gather information, and the machines are small and low-power. Cooperative communications enhance the link quality of the wireless network in a distributed fashion. The peer terminals in wireless M2M networks can achieve the diversity gain via mutual cooperation realized by the prevalent cooperative relay protocols, such as amplify-and-forward (AF) and decode-and-forward (DF) in [1]. In fact, the source and the relay form the virtual antenna array which brings benefits of the spatial diversity. For data acquisition system in wireless networks, a node receives transmission signals sent by its neighbors due to the wireless broadcast nature. Reference [2] proposed iterative collaborative relay beamforming strategies based on AF to maximize the received signal-to-interference-and-noise ratio (SINR) in wireless M2M networks. Time division multiple address (TDMA) is adopted to guarantee the quality of service (QoS) of the traffic data. More important, TDMA system can save energy by permitting the nodes to work with sleep mode in wireless data acquisition network [3]. Recently, several cooperative retransmission media access control (MAC) protocols have been investigated for TDMA systems. In [4], a Cooperative TDMA (C-TDMA) protocol was proposed to improve the throughput of the wireless network. Reference [5] extended the previous work to the dynamic slot assignment scheme for TDMA systems.

However, cooperations introduce delay to the system. In order to investigate the delay character of the cooperative relay network, the researchers first established a delay model of the single source and single-relay cooperative automatic-repeat request (ARQ) protocols for failure transmission [6], in which the Poisson arrival model of frames is assumed to estimate the delay caused by the cooperative relay when error frame triggers the retransmission.

For the consideration of saving energy in wireless sensor networks, [7] demonstrated that the network lifetime of wireless sensor network is more important for data collection network. Reference [8] established the energy model of single-hop wireless sensor networks. The transceiver of each sensor node uses energy when sending, receiving, or listening, and the ratio energy consumption is about 1.5 : 1 : 1 [9, 10]. Energy efficiency and power allocation of cooperation transmission in wireless data gathering network were investigated in [11]. Reference [11] adopted the minimum energy consumption (MIE) policy and maximum residual energy (MARE) policy to allocate transmit power between the relay and the source node. Based on the control message of RTS-CTS, the proposed transmission scheme could decrease the signaling overhead. Reference [12] extended MARE policy to pricing strategy to maximize the network lifetime. The proposed energy pricing strategy could balance each node's energy consumption. Besides, [13] proposed the improved power allocation scheme based on communication distance for each group to maximize the lifetime of the whole sensor network. The priority queuing model combined with the vacation queuing model [14] is used to analyze the energy-aware MAC for differentiated services in wireless packet networks.

Only in sleep state, the energy consumption is very low. The microprocessor embedded in sensor node can go to the sleep state automatically when there is no task. So it is essential to introduce sleep mode to wireless sensor MAC protocol to save power [9]. Reference [15] adopted the vacation queue model, depicted extensively in [16], to study the sleep mode in the 802.16e system, which increased the energy efficiency and prolonged the lifetime of the wireless network.

However, it seems that the above cooperative transmission protocols cannot consider the incurred overhead extensively, which includes energy consumption of the relay node, additional delay of the relay traffic, and signaling for cooperating nodes selection [17]. Furthermore, if a terminal is in its idle state (here, we define, idle state is that the incoming buffer length of one node is less than the predefined threshold), it can become a relay node or sleep node according to its residual energy, traffic load, and received signal strength. When the node selects cooperative target during its idle state, many-to-one cooperative communication topology is established, and [18, 19] used game theory to analyze power allocation problem for this topology. When the node selects sleep scheme during its idle state, intuitively it saves power for itself, but if adopting random or independent sleep scheme, the network lifetime of sensor network cannot be maximized, because the network lifetime is attributed to the shortest duration time of the sensor node. Thus, in idle state we combined the sleep mode with the cooperative transmission, which is able to average energy cost over several sensor nodes. Both cooperative scheme and sleep scheme incur the transmit delay.

To deal with both energy and delay challenges, we propose a mixed cooperation MAC protocol with sleep mechanism (MS-CTDMA) for data acquisition system. And a queue model for MS-CTDMA protocol is given to measure the pros and cons of the proposed transmission. The contributions of this research are mainly at the following three points. (1)

MS-CTDMA protocol is introduced by fully utilizing the idle time of each node to save power. During idle state each node can select sleep scheme or cooperative transmission.

(2)

We establish a $M^{X} / G / 1$ N-policy vacation queue model for MS-CTDMA to carry out the performance analysis. The vacation time in $M^{X} / G / 1$ is equivalent to the idle time in MS-CTDMA.

(3)

Considering many-to-one cooperation communication topology, we give the optimal node selection strategy from the perspective of the relay naming source node selection, which is more efficient to average energy over the whole network.

The rest of the paper is organized as follows. Section 2 describes MS-CTDMA protocol elaborately. In Section 3, we establish the $M^{X} / G / 1$ N-policy multiple vacation queue model for MS-CTDMA. Section 4 derives the system performance extensively. The optimal source node selection strategy is also depicted in this section. Numerical results and discussions are given in Section 5. And finally Section 6 draws the conclusions and the future work.

2. System Model with MS-CTDMA Protocol

2.1. Network Model

The research in this paper considers the wireless data acquisition network with sensor nodes and a sink node. In this network, each node only transfers collected data to the sink node. We focus on single-hop wireless network which means that all nodes are within one-hop transmit range. Moreover, each node can obtain spatial diversity through 2-hop cooperative transmission. This wireless packet system adopts TDMA scheduling protocol. Each node has its own allocated time slot and only has the chance to access the channel in its time slot. All nodes are synchronized and the MAC frames have equal length. Without loss of generality, this study concentrates on single relay cooperative scheme which incurs less overhead. As depicted in Figure 1, this data acquisition system contains M sensor nodes and one sink node. Each node alternatively acts as source node during its busy state or as relay node within its idle state. A frame time is divided into two fields: a control time slot (CT) and a data time slot (DT). CT conveys the scheduling information for each node. DT contains the time slots reserved for data transmission. Each node coordinates the cooperative transmission mechanism through CT.

Figure 1

Typical data acquisition system and time slot assignment.

An Rayleigh fading channel [20] is considered between two nodes, and the reciprocal channel is symmetry. $h_{i, j}$ denotes the complex channel gain for communication link from node i to node j. This research supposes that each sensor has the independent additive white Gaussian noise (AWGN) with the identical power spectral density (PSD) $N_{0}$ . The instantaneous signal-to-noise ratio (SNR) of i to j can be expressed as [12]

\begin{matrix} γ_{i, j} = \frac{P_{i} {| h_{i, j} |}^{2}}{N_{0} W}, \end{matrix}

(1)

where

P_{i}

denotes the transmit power of node i and W is the transmit bandwidth. All sensor nodes are assumed to have the constant modulation and coding, so they have the same packet data transmit rate

I_{p}

. Without assistance from the relay node, the transmit power

P_{i}^{d}

of node i satisfies (2) to achieve the packet data transmit rate [11]:

\begin{matrix} P_{i}^{d} \geq \frac{1}{λ_{i, j}} (2^{I_{p} / W} - 1) . \end{matrix}

(2)

For presentation brevity,

λ_{i, j}

is defined as

λ_{i, j} = {| h_{i, j} |}^{2} / (N_{0} W)

2.2. MS-CTDMA MAC Protocol

To maximize the sensor network lifetime, which is defined as the network working time until one sensor node uses up its energy, we proposed MS-CTDMA protocol. Introducing sleep mechanism into sensor node's idle state can reach low network energy consumption, but it also prolongs average packet delay. And the cooperative transmission could average power consumption over sensor nodes to lengthen the network lifetime. For example, as shown in Figure 1, $d_{M - 1, D}$ is greater than $d_{1, D}$ and $d_{i, j}$ denotes the distance between node i and j. So node $M - 1$ drains up its energy faster than node 1 under the same traffic load. Through combining cooperative relay strategy with sleep mode, the source node gets benefit of lowering its transmit power with the help of the relay node. The key idea of our proposed protocol is to efficiently utilize each node's transmit power in its idle state by choosing to sleep or to cooperate, so as to maximize network lifetime.

Each node is in one of the following states: init state, busy state, setup state, closedown state, sleep state or cooperation state. The state transition diagram is depicted in Figure 2. A node is said to be in sleep state when it turns off the radio transreceiver to save its battery energy. In a sensor node's cooperation state, the idle node acts as the relay node to save the source node's energy consumption by cooperative transmission based on source node selection, not relay node selection.

Figure 2

State transition diagram of each sensor node.

Initially each node starts out with the initial state. In this state the sensor node completes initialization and waits for the packet arrival. If the sensor has data to transmit, it transfers to the busy state. During the busy state, this node acts as the source terminal S. S is listening to the cooperative relay request (CREQ) from other idle sensor nodes by signaling packet. Then S sends the negotiation (CNEG) message back to the request relay node. Once a request sensor node selects S as its cooperative target and replies to $S$ by cooperative acknowledgement (CACK), S and this relay node establish the cooperative relay link to help S to transmit. After all packets in data buffer have been sent out, the node changes back to the idle state, where it can be a relay node R or go into sleep mode according to the following steps. If it were a relay node, first, R enters the setup state to select the optimal S by broadcasting CREQ. If R successfully finds the source node from other nodes, it transfers to the cooperative state. Otherwise, R fails to find an appropriate S and turns off the radio to go into the sleep state. After sleep or cooperation, R reexamines the queue length. If there is not enough traffic coming and the data buffer size is less than N which denotes the predefined threshold, $R$ maintains the cooperative or sleep status. On the contrary, if R's data buffer size grows larger than N, it goes to the closedown state and releases the cooperative relay link or sleep mode. The node turns to be a source node to transmit its own data traffic until the next idle state is satisfied.

The criterion to choose optimal source node for R is vital for the mixed transmission strategy. The mixed strategy tries to give a tradeoff between the network lifetime and packet delay determined by considering the multiple important elements: the residual battery energy, the channel state information at the physical layer, the incoming traffic load at the MAC layer, and the packet delay for a different traffic type. During the same constant time interval, if the predefined threshold N is increasing, the number of entering setup state is decreasing. In other words, the overhead for sleep or cooperation is reducing. For the same reason, the long-sleep time $T_{s}$ or cooperative time $T_{c}$ leads to low overhead. But these energy saving behaviors also incur lengthy packet delay.

3. Vacation Queue Model for MS-CTDMA

The $M^{X} / G / 1$ vacation queue model with N-policy multiple exhaustive vacations is explored to analyze the performance of MS-CTDMA protocol in this section. The access mechanism of MS-CTDMA is coincident with the N-policy vacation queue model inherently. The idle state in MS-CTDMA can be modeled by the vacation state in $M^{X} / G / 1$ vacation queue model.

Here, we assume that the traffic data buffer size is unlimited, which is reasonable when analyzing the average performance of the MS-CTDMA systems. The incoming traffic of each terminal is assumed to be compound Poisson process. The batch arrival rate is λ, and the number of packet in each batch is denoted by stochastic variable X. Batch Markovian arrival process (BMAP) is suited to the bursty nature of packet traffic for wireless data acquisition scenario [21]. The data acquisition moment is triggered by outside environment changing which coincides with the model of Poisson arrival. At this moment, a new batch of sensor data with random packets is generated into the transmit buffer. In this paper, all sensor nodes are equal and have the same traffic load.

We give some general assumptions first. The packet length keeps constant, that is, $L_{d}$ for data packet and $L_{s}$ for signaling packet. The number of arrival packets obeys discrete random distribution which is determined by a different sensor type. The discrete probability density function is depicted by $p {X = x_{i}} = g_{i}$ , where $i = 1,2, \dots, E$ denotes random acquisition type. Over each transmission link, the physical layer adopts capacity-achieving code and adjusts the transmit power to assure the required bit error rate (BER) [11], so the retransmission mechanism is not considered in this paper. Thus the service time is only determined by the packet transmission time. $I_{i}$ denotes the packet transmission rate of the terminal i, $(i = 1,2, \dots, M)$ . Coding and modulation of the transmission keep constant without adaptation, so $I_{i}$ does not vary with channel state information. Without loss of generality, each sensor node has the same processing ability, that is, $I_{i} = I_{p}$ for each i. The corresponding data packets are served as customers on first-come-first-serve (FCFS) basis until the system becomes empty. $S_{i}$ , $(i = 1,2, \dots, M)$ denotes the service time of each terminal, also known as the transmission time in physical layer. Based on the above assumption, $S_{i}$ follows the deterministic distribution, and the mean of $S_{i}$ can be expressed as

\begin{matrix} E [S_{i}] = \frac{L_{d}}{I_{i}} . \end{matrix}

(3)

3.1. State Transition for MS-CTDMA Protocol

First, we illustrate the state transition for MS-CTDMA protocol. In proposed MS-CTDMA protocol with $M^{X} / G / 1$ N-policy vacation queue model, the setup time and closedown time are constant values, denoted by $T_{u}$ and $T_{d}$ , respectively, which is determined by the S's negotiation mechanism. Cooperative time $T_{c}$ is independent identical distributed (i.i.d) random variable with a general distribution function, denoted by $F_{c} (t)$ . Sleep time $T_{s}$ is also i.i.d random variable depicted by $F_{s} (t)$ . Figure 3 shows the state transitions for each node's operation cycle in the established model [22]. When the incoming traffic length of one node is larger than N, this node transfers from the init state to the busy state. And it services its own data traffic until the queue length is empty. When data length in the queue is less than N, according to MS-CTDMA protocol, it goes into the setup state to determine whether to sleep or to cooperate during its idle state or vacation state. After the vacation time, if the node's queue length is growing larger than N, the state transfers into closedown state and ends from vacation state.

Figure 3

The time distribution with the state transition.

The vacation time in $M^{X} / G / 1$ N-policy vacation queue model can be regarded as the cooperative time or sleep time, which is determined by optimal source selection strategy in MS-CTDMA. And in this research, the vacation time follows the deterministic cumulative distribution function $F_{v} (t)$ , which is

\begin{matrix} F_{v} (t) = {\begin{cases} 0, & t < T_{V E} \\ 1, & t \geq T_{V E} . \end{cases} \end{matrix}

(4)

F_{v} (t)

denotes its probability density function. The mean value of the vacation time is

E [T_{v}] = T_{V E}

, which is the integral time of the packet transmission time. The long

T_{V E}

leads to low overhead and vice versa. In this paper,

T_{c}

and

T_{s}

have identical probability distribution with

T_{v}

3.2. The Average Queue Length

We establish the embedded Markov chain to calculate the average queue length in this subsection. The queue length at the packet departure instants can be mapped into the state space of the embedded Markov chain. Let $D_{n}, n = 1,2, \dots$ denote the state space or the embedded Markov chain, where $n = 1,2, \dots$ is the packet departure instants. They satisfy

\begin{matrix} D_{n + 1} = {\begin{cases} D_{n} - 1 + A, & for D_{n} \geq N \\ D_{n} + A, & for D_{n} < N, \end{cases} \end{matrix}

(5)

where A denotes the arriving packets during the vacation time and is determined by batch traffic arrival rate λ. From [16] we know that the rmbedded Markov chain is positive recurrent when the utilization load

ρ < 1

. The queue length

D_{q}

in this

M^{X} / G / 1

vacation model can be decomposed into the sum of the two independent random variables:

\begin{matrix} D_{q} = D + D_{v}, \end{matrix}

(6)

where D is the mean queue length of an ordinary

M^{X} / G / 1

queue without vacations and

D_{v}

is the additional mean queue length due to the vacation effect.

3.3. The Mean Waiting Time

The mean packet queue waiting time $W_{q}$ of $M^{X} / G / 1$ multiple vacation models combined with N-policy is used to measure the quality of service (QoS) incurred by packet delay. According to tht Poisson arrivals (see time average (PASTA)) [16], the average queue waiting time of the embedded Markov chain is equal to steady state waiting time. From [23], we can get

\begin{matrix} W_{q} = (D_{q} + E [X_{R}]) E [S] + P (B) E [S_{R}] + P (I) \frac{E [N_{I_{R}}]}{λ E [X]}, \end{matrix}

(7)

where

P (B)

and

P (I)

indicate the probability of busy time and idle time of each sensor node. They can be expressed as

P (B) = ρ

and

P (I) = 1 - ρ

. From Little's theorem [16],

D_{q} = λ E [X] W_{q}

. So (7) can be formulated as follows:

\begin{matrix} W_{q} = \frac{E [S]}{1 - ρ} E [X_{R}] + \frac{ρ}{1 - ρ} E [S_{R}] + \frac{E [N_{I_{R}}]}{λ E [X]}, \end{matrix}

(8)

where

E [X_{R}]

denotes the former waiting packet in the same batch and

E [S_{R}]

is residual service time. From [23] we have

\begin{matrix} E [S_{R}] = \frac{1}{2} \frac{E [{S_{i}}^{2}]}{E [S_{i}]}, \end{matrix}

(9)

\begin{matrix} E [X_{R}] = \frac{1}{2} [\frac{E [X^{2}]}{E [X]} - 1] . \end{matrix}

(10)

For N-policy

M^{X} / G / 1

system with multiple vacations, the last component of (8) can be expressed as

\begin{matrix} \frac{E [N_{I_{R}}]}{λ E [X]} = E [V_{R}] + \frac{1}{λ E [X]} \frac{\sum_{n = 0}^{N - 1} n β_{n}}{\sum_{n = 0}^{N - 1} β_{n}}, \end{matrix}

(11)

where

E [N_{I_{R}}]

means the additional packets generated by sensor devices during the idle sate.

E [V_{R}]

is the expected duration of the residual vacation and can be expressed as

\begin{matrix} E [V_{R}] = \frac{E [V^{2}]}{2 E [V]} . \end{matrix}

(12)

Through (9)–(12), we could obtain the mean waiting time

W_{q}

from (8).

3.4. The Average Cooperative Probability

Each node selects its working scheme within its vacation time or idle state. So the probability of the event $P_{c}$ that each node takes action to sleep or cooperate for the sink node equals the ratio of the vacation time to one cycle total serving time, which is defined as the interval between two consecutive busy period ending instants, denoted by $T_{N N}$ . And the $N_{th}$ traffic frame accumulation period is defined by $T_{N}$ . The forward recurrence time of the vacation time is delegated by $T_{R}$ . The time that the relay node R processes the traffic queue is denoted by $T_{A}$ . The relationship among $T_{N N}$ , $T_{N}$ , $T_{R}$ , and $T_{A}$ is shown in Figure 3. Equation (13) can be derived from the embedded Markov analysis in Section 3.2 [16] as follows:

\begin{matrix} E [T_{N N}] = \frac{1}{1 - ρ} (\frac{N}{λ_{i}} + E (T_{R})) . \end{matrix}

(13)

Hence, the cooperative time

T_{VAC}

\begin{matrix} E [T_{VAC}] = \frac{N}{λ_{i}} + E (T_{R}) . \end{matrix}

(14)

From (13) and (14), we can get the cooperative relay probability

P_{c} = E [T_{VAC}] / E [T_{N N}] = 1 - ρ

4. Performance Metric and Optimal Source Selection Strategy

In this section, we first present the total energy consumption during one operation cycle. Then the delay sensitive problem is formulated. The analysis queue model of MS-CTDMA protocol can be extended to the whole network based on energy consumption target. The optimal source node selection strategy is depicted extensively when MS-CTDMA protocol is running on the one-hop network.

4.1. Total Energy Consumption

The energy consumption within one operation cycle $T_{N N}$ can be expressed as

\begin{matrix} E_{T_{N N}} = E_{T_{VAC}} + E_{T_{A}}, \end{matrix}

(15)

where

E_{T_{VAC}}

and

E_{T_{A}}

denote the energy consumption during vacation state and busy state, respectively.

T_{VAC}

and

T_{A}

are random variables, so it is necessary to calculate the expected value of total energy consumption

E [E_{T_{N N}}]

. During busy state, node i serves its traffic data with transmit power

P_{i S}

and the expected energy consumption

E [E_{T_{A}}] = P_{i S} E [T_{A}]

During the vacation time, node i goes into sleep or cooperation state. The transmit power is denoted by $P_{i R}$ , and the power value for receiving data from source node is equal to $P_{i R}$ , when $P_{i R} = 0$ node i selects the sleep mode. The setup state at the beginning of vacation and the closedown state at the end of the vacation also use energy. From (14), when traffic load λ is constant, $E [T_{VAC}]$ is attributed to predefined threshold N and the probability distribution of vacation time. Each operation cycle needs one setup stage and closedown stage. The expected vacation energy consumption can be depicted as

\begin{matrix} E [E_{T_{VAC}}] = \frac{E [T_{v}]}{E [T_{u} + T_{v} + T_{d}]} P_{i R} E [T_{VAC}] + E [T_{u} + T_{d}] P_{i R} . \end{matrix}

(16)

The last component is the energy overhead.

4.2. Delay Tolerant Constraint

In data collection scenarios, the traffic load is always low and nonrealtime. In other words, the collecting data needs to be sent to the sink node more reliably, while the time requirement is relatively relax. However, if the delay is longer than the deadline time $D_{T}$ , QoS of the traffic decreases rapidly, and the sink node is not able to process the usable data. Thus, mean waiting time must satisfy $W_{q} \geq D_{T}$ . From (16), prolonging $T_{v}$ and N can minimize the energy overhead, which also incurs longer average packet delay. We can formulate the problem as

\begin{array}{l} \min_{N, T_{v}} \frac{E [T_{VAC}]}{E [T_{B}]} E [T_{u} + T_{d}] P_{i R} \\ s . t . W_{q} \leq D_{T}, \end{array}

(17)

where

T_{B}

indicates the minimum vacation time. This optimization is a tradeoff between the additional delay for node i and decreasing energy overhead incurred by state transition. And this solution is independent with optimal source selection strategy during the vacation time.

4.3. Extend the Results to the Whole Network

M-node data collection system is an open network, each node has its independent BMAP traffic with the batch arrival rate $λ_{i}, i = 1, \dots, M$ . Particularly, in a single-hop TDMA system, each node transfers its traffic in its assigned time slot and receives other nodes' traffic during its idle state with the cooperative probability $P_{c} (i), i = 1, \dots, M$ . During the busy state, each node has the probability $P_{s} (i), i = 1, \dots M$ to be the source node with a relay. So, the network scenario satisfies the definition of the open Jackson network from [16].

According to the Jackson network, an M-node network can be divided into several single nodes to analyze the network performance. For simplicity of deduction, we assume that there are always multiple available relays between the source and the destination, and one source node only chooses one cooperative relay node. Based on the independent characteristic of each node, $P_{c}$ and $P_{s}$ can be derived as

\begin{matrix} P_{c} = P (I) (1 - P {(I)}^{(M - 1)}), \\ P_{s} = P (B) (1 - P {(B)}^{(M - 1)}) . \end{matrix}

(18)

4.4. Optimal Source Selection Strategy

In this paper, the cost function [12] is established to evaluate operation mode of each node. At ending instants of the busy period, each node determines whether to sleep or to be as a cooperative relay for one source node. When the node acts as a source node, it also has the opportunity to be selected as the cooperative target by a relay node. During $T_{VAC}$ , each node can choose to sleep to save battery energy or to be a relay node and find the optimal cooperative source node to minimize the cost. Therefore, within $T_{A}$ , each node may have the chance to be assisted by one node. The whole cost function can be formulated as

\begin{array}{l} C_{i} = P_{c} T_{VAC} (ω_{i} P_{i R} + ω_{k} P_{k S}) \\ + P_{s} T_{A} (ω_{i} P_{i S} + ω_{j} P_{j R}) + ω_{i} \frac{T_{B}}{T_{VAC}} E_{T S} . \end{array}

(19)

The first component denotes the cost value during $T_{VAC}$ , which is the stochastic random variable. $P_{k S}$ depicts the transmit power of source node k selected by relay node $i$ during its vacation or idle period. The second component is the cost within $T_{A}$ , which is equal to $T_{N N} - T_{VAC}$ . $P_{j R}$ represents the power allocation of relay node j, which selects the node $i$ as its source node. The last component indicates that setup and release energy consumption cost of each node. And $E_{T S} = E [T_{u} + T_{d}] P_{i R}$ . The expected value of $C_{i}$ is expressed as

\begin{array}{l} E [C_{i}] = E [T_{V A C}] (ω_{i} P_{i R} + ω_{k} P_{k S}) \\ + E [T_{A}] (ω_{i} P_{i S} + ω_{j} P_{j R}) \\ + ω_{i} \frac{E [T_{B}]}{E [T_{V A C}]} E_{T S} . \end{array}

(20)

Compared with (19), we incorporate $P_{c}$ and $P_{s}$ into the source node selection strategy. The first component and second component are determined by working strategy during vacation time and power allocation within one operation cycle. Minimization of the last component is discussed in Section 4.2. The optimal sleep or cooperation selection and power allocation are to minimize (20).

4.4.1. The Energy Cost Factor

The energy cost factor is critical for the optimal source node selection. In this paper, we take into account the residual battery energy, the initial battery energy, and the traffic load to calculate the cost factor as follows:

\begin{matrix} ω_{i} = ω_{0} {(\frac{E_{i, ini}}{E_{i, rem}})}^{l} {(\frac{ρ_{i}}{ρ_{B}})}^{m}, \end{matrix}

(21)

where

ω_{0}

denotes the initial cost factor of each node in the network, which reflects priority level of each node. The proportion of

E_{i, ini}

E_{i, rem}

indicates the cost factor of per unit energy for each node. The node with low proportion is likely to assist other nodes in its vacation or idle state.

ρ_{B}

is the basic traffic measurement, and the ratio of

ρ_{i}

ρ_{B}

implies the normalized traffic load for each node. The node with traffic load is reasonable to sleep in its idle state, since it has already consumed a lot of energy. l and m are exponent components of energy and traffic, respectively, to adjust the cost between residual energy and traffic load. For the sake of simplicity, l and m take value 1 or 2.

4.4.2. The Optimal Source Selection Strategy

According to (20), the cost value can be decomposed into three independent targets. Within $T_{VAC}$ , the optimal source node selection can be expressed as a linear programming problem:

\begin{array}{l} \min_{P_{i R}, P_{k S}, k} C_{i 1} = ω_{i} P_{i R} + ω_{k} P_{k S} \\ λ_{k, D} P_{k S} + λ_{i, D} P_{i R} \geq 2^{2 I_{p} / W} - 1 \\ s . t . P_{S, low} \leq P_{k S} \leq P_{\max} \\ 0 \leq P_{i R} \leq P_{\max} . \end{array}

(22)

The first constrained condition is depicted extensively in [24]. $P_{S, low}$ is determined by instantaneous SNR between nodes k and D denoted by $γ_{k, D}$ and between nodes k and i depicted by $γ_{k, i}$ . $P_{S, low}$ guarantees that the achieved rate of k to D is $I_{p}$ and that the transmit rate of k to i is $2 I_{p}$ . $P_{i R} = 0$ means that the node selects to sleep during its idle state. $P_{\max}$ is a constant value which is constrained by sensor device. So, it can be expressed as

\begin{matrix} P_{S, low} = \min {P_{S, low A}, P_{S, low B}} \\ P_{S, low A} = \frac{1}{λ_{k, D}} (2^{I_{p} / W} - 1) \\ P_{S, low B} = \frac{1}{λ_{k, i}} (2^{2 I_{p} / W} - 1) . \end{matrix}

(23)

Similarly, the problem that each node becomes the optimal target source assisted by other relay nodes can also be formulated as the following linear programming problem:

\begin{array}{l} \min_{P_{i S}, P_{j S}, j} C_{i 1} = ω_{i} P_{i S} + ω_{j} P_{j R} \\ λ_{k, D} P_{i S} + λ_{j, R} P_{i R} \geq 2^{2 I_{p} / W} - 1 \\ s . t . P_{S, low} \leq P_{i S} \leq P_{\max} \\ 0 \leq P_{j R} \leq P_{\max} . \end{array}

(24)

The energy consumption incurred by state transition is a minimized base on the precondition that the average packet delay must be satisfied. This optimal programming problem is discussed in Section 4.2.

4.4.3. Solutions to Optimal Power Allocation

The linear programming problem (22) can be solved by geometric methods effectively introduced by [12]. From (23), when $P_{S, low A} \leq P_{S, low B}$ , there is no need for node $i$ to assist node k, since the cost of i and k would both increase under the cooperation relay scheme. But other than that, i and k will always get benefit from the cooperation transmission, when $P_{i R} = 0$ , in other words, no power is allocated to i, and i goes to sleep state during its vacation time.

As shown in Figure 4, $Y 1$ , $Y 2$ , and $Y 3$ represent the constrained condition $λ_{k, D} P_{k S} + λ_{i, R} P_{i R} = 2^{2 I_{p} / W} - 1$ in the plane when $I_{p}$ is set to different values. According to constraint values of $P_{S, low}$ and $P_{m} a x$ , the valid power allocation region is the intersection of $A B E F$ and one of the upper half plans of $Y 1$ , $Y 2$ , or $Y 3$ . This optimal power allocation problem is convex optimization, so the optimal solutions are intersection point, such as A or C, which is determined by the slope of objective line and condition line. When $ω_{k} / ω_{i} \geq λ_{k, D} / λ_{i, R}$ , that is, $C 1$ , the left point A is the solution point. On the contrary, when $ω_{k} / ω_{i} < λ_{k, D} / λ_{i, R}$ , that is, $C 2$ , the right point F is the optimal point. The rectangle $A B E F$ is divided into three regions $A B C$ , $A C D F$ , and $D E F$ .

Figure 4

Geometric solutions for different regions.

The research in this paper focuses on sleep state, $P_{i R} = 0$ . So our study below is in region $D E F$ , where $I_{p}$ satisfies

\begin{matrix} 2^{2 I_{b} / W} - 1 > λ_{k, D} P_{S, low} \\ 2^{2 I_{b} / W} - 1 \leq λ_{k, D} P_{\max} . \end{matrix}

(25)

When $ω_{k} / ω_{i} \geq λ_{k, D} / λ_{i, R}$ , the solutions is

\begin{matrix} P_{k S}^{*} = P_{S, low} \\ P_{i R}^{*} = \frac{1}{λ_{i, R}} (2^{2 I_{p} / W} - 1 - λ_{k, D} P_{S, low}) . \end{matrix}

(26)

In this case, the cost of per unit energy for source node

k

is much greater than relay node

i

. The cooperation scheme is able to average power consumption over

i

and

k

, which maximizes the network operation time.

When $ω_{k} / ω_{i} < λ_{k, D} / λ_{i, R}$ , the solutions is

\begin{matrix} P_{k S}^{*} = \frac{1}{λ_{k, S}} (2^{2 I_{p} / W} - 1) \\ P_{i R}^{*} = 0 . \end{matrix}

(27)

In this case, node i selects going into sleep state to save power other than cooperative transmission. At the beginning of each vacation time of node i, (27) is solved. Likewise, the solutions for region,

A C D F

and

D E F

can be solved. Due to space limitation, we omit the detailed results.

4.4.4. The Implementation of Optimal Source Selection

The optimal relay selection is the usual way to perform cooperation. But in this paper, we implement the optimal source selection strategy within setup state during the vacation time. Once node i reaches setup state, it transmits CREQ control packet during CT. In the same frame time, when source node k receives CREQ signaling, it responses to node i a CNEG control packet containing the received signal strength indication (RSSI), traffic load, and residual battery energy. When node i gathers all the valid source candidates information, it makes decision whether to sleep or to cooperate during vacation time due to problem (22) and (24) solutions. Then, i sends the CACK packet data in the next frame time.

5. Numerical Results

In order to evaluate the performance of MS-CTDMA, we consider the scenario depicted in Figure 1. The sink node D is in the center of this region. In the research analytical evaluations, the signaling packet length $L_{c}$ is 32 bits and data packet length $L_{d}$ is 1000 bits. The received signal strength is lessening with proportion of square transmission distance. The fading is assumed to be constant in each vacation time. In addition, it is assumed that the average number of each batch is that $E [X] = 8$ . Other parameters are set as $N_{0} = 1 0^{- 14}$ W/Hz, $W = 1$ MHz, $I_{p} = 1$ Mbps, and $P_{\max} = 0.1$ W, respectively.

First, we explore the relationship between average packet delay and average energy consumption. Three different batch arrival rates are assigned to each node, and the node adopts the identical pure sleeping strategy. In this evaluation, the cooperative mechanism is not considered, because it does not affect vacation overhead.

Figure 5 shows a plot of the average packet delay and average energy consumption by varying the vacation time $T_{v}$ . We can save energy by increasing the vacation time or sleep time, but it also causes the packet delay. The longer $T_{v}$ leads to low energy overhead for state transition. This benefit is obvious, and the energy overhead of state transition is stable at the end. Thus, ultimate energy conservation is determined by the traffic load, and the appropriate value of $T_{v}$ is selected according to the system requirements. From Figure 5, the heavy traffic load can lead to less average energy consumption due to the reduced state transition number when serving the same number of packets. In this scenario, average waiting time is dominated by the vacation time.

Figure 5

The average energy consumption and average waiting time by changing vacation time.

Figure 6 shows several curves of the average energy consumption versus delays by varying the predefined threshold N. The increasing line demonstrates that the additional delay of each node introduced by N and the decreasing line demonstrates the average energy consumption of the same node. We clearly concluded that the tradeoff between average energy consumption and average delay can be adjusted by N. Compared to Figure 5, we discover that the average waiting time is insensitive to mean arrival time by changing $T_{v}$ , but low traffic load can lead to heavy delay by varying N. So it is reasonable to adjust $T_{v}$ to reach the delay and energy requirements.

Figure 6

The energy consumption and average waiting time by changing predefined N.

Figure 7 shows the network lifetime of senor network using sleep scheme and our MS-CTDMA protocol by changing the relay node traffic load, when the predefined N has two values. In this simulation, three nodes have the same channel condition to the destination D, such as distance and fading condition. But the traffic load of relay node is lower than the other nodes. From Figure 7, we see that MS-CTDMA protocol considers the impact of different traffic load, and the nodes which have longer idle state are responsible for assisting other heavy traffic nodes to maximize the network lifetime. When the network operates with pure sleep scheme, the network lifetime is up to the shortest lifetime node. But with MS-CTDMA protocol, the node with more idle time or less traffic load can lend its energy to other nodes.

Figure 7

Network lifetime by changing average arrival time.

Figure 8 shows the network lifetime of the senor network by changing distance to sink node. Here, we assume that three nodes have the same traffic load. The relay node is near to the sink node so the channel condition is different. In this condition, the performance of MS-CTDMA is also superior to the pure sleep mode. Comparing Figure 8 with Figure 7, we find that the impact of network lifetime with relay traffic load is more distinct than that with relay distance to sink node by the predefined threshold N.

Figure 8

Network lifetime by changing distance to sink node.

In Figure 9, we compare the network lifetime by changing traffic load and distance to sink node simultaneously. It is obvious that the maximization point is reached when the distance is nearest and the mean arrival time is smallest.

Figure 9

Network lifetime by changing average arrival time and distance.

6. Conclusion

In this paper, we propose a novel mixed cooperative TDMA MAC protocol with sleep mode, namely, MS-CTDMA, for wireless data acquisition networks. When traffic queue length of a terminal is less than the predefined threshold N, it actively devotes itself to be a cooperative relay for its single-hop neighbor or go to the sleep state. And the $M^{X} / G / 1$ N-policy vacation queue model is developed to analyze the delay performance of MS-CTDMA to obtain the best tradeoff between the energy consumption in network and the additional delay of the node. In addition, we find that the achievements of the proposed relaying model can be extended to the network under the Jackson network theorem's conditions. Then, an optimum source node selection strategy is given for the maximization of the network lifetime. The analysis and numerical results demonstrate that MS-CTDMA can improve the operation time of data collection significantly.

As a future work, we would like to investigate the multihop TDMA systems with multiple relays based on dynamic slot assignment scheme.

Footnotes

Conflict of Interests

The authors do not have any conflict of interests with the content of the paper.

Acknowledgments

This research is supported by the National Major Project no. 2011ZX03004-001-01 and National Natural Science Foundation of China no. 61201183 and no. 61132002.

References

Laneman

J. N.

Tse

D. N. C.

Wornell

G. W.

Cooperative diversity in wireless networks: efficient protocols and outage behavior

IEEE Transactions on Information Theory 2004 50 12 3062 3080

2-s2.0-5044252003

10.1109/TIT.2004.838089

Wang

Bai

Zhang

Guan

Chen

Collaborative relay beamforming strategies for multiple destinations with guaranteed QoS in wireless machine-to-machine networks

International Journal of Distributed Sensor Networks 2012 2012 10

525640

10.1155/2012/525640

Heinzelman

W. B.

Chandrakasan

A. P.

Balakrishnan

An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications 2002 1 4 660 670

2-s2.0-33646589837

10.1109/TWC.2002.804190

Yang

Yao

Y.-D.

Zheng

A TDMA-based MAC protocol with cooperative diversity

IEEE Communications Letters 2010 14 6 542 544

2-s2.0-77953222002

10.1109/LCOMM.2010.06.092451

Lee

J. K.

Noh

H. J.

Lim

Dynamic cooperative retransmission scheme for TDMA systems

IEEE Communications Letters 2012 16 12 2000 2003

10.1109/LCOMM.2012.101712.121854

Cerutti

Fumagalli

Gupta

Delay models of single-source single-relay cooperative ARQ protocols in slotted radio networks with poisson frame arrivals

IEEE/ACM Transactions on Networking 2008 16 2 371 382

2-s2.0-42549096034

10.1109/TNET.2007.900360

Huang

W.-J.

Peter Hong

Y.-W.

Jay Kuo

C.-C.

Lifetime maximization for amplify-and-forward cooperative networks

IEEE Transactions on Wireless Communications 2008 7 5 1800 1805

2-s2.0-47149116514

10.1109/TWC.2008.061075

Zhang

Chen

Energy-efficiency of cooperative communicationwith guaranteed E2E reliability in WSNs

International Journal of Distributed Sensor Networks 2013 2013 11

Gao

Blow

K. J.

Holding

D. J.

Marshall

Analysis of energy conservation in sensor networks

Wireless Networks 2005 11 6 787 794

2-s2.0-26644438609

10.1007/s11276-005-3531-8

10.

Savvides

Han

C.-C.

Strivastava

M. B.

Dynamic fine-grained localization in ad-hoc networks of sensors

Proceedings of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom '01)

July 2001

Rome, Italy

166 179

2-s2.0-0034775930

11.

Zhou

Cui

J.-H.

Cui

Energy-efficient cooperative communication based on power control and selective single-relay in wireless sensor networks

IEEE Transactions on Wireless Communications 2008 7 8 3066 3079

2-s2.0-50049103515

10.1109/TWC.2008.061097

12.

Feng

Zhuang

Relay selection and power allocation for cooperative network based on energy pricing

IEEE Communications Letters 2010 14 5 396 398

2-s2.0-77951933023

10.1109/LCOMM.2010.05.100168

13.

Liaw

J. J.

Chou

C. W.

Dai

C. Y.

The Lifetime Extension of Wireless Sensor Networks Using Adaptive Energy Allocation by Distance

International Journal of Distributed Sensor Networks 2013 2013 8

982573

10.1155/2013/982573

14.

Fallahi

Hossain

Distributed and energy-aware MAC for differentiated services wireless packet networks: a general queuing analytical framework

IEEE Transactions on Mobile Computing 2007 6 4 381 394

2-s2.0-33847729048

10.1109/TMC.2007.49

15.

Chu

Jung

B. H.

Sung

D. K.

Park

Modeling and analysis of an energy-efficient sleep-mode operation in IEEE 802.16e system

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

June 2009

16.

Tian

Zhang

Z. J.

Vacation Queue Models: Theory and Application 2005

New York, NY, USA

Springer

17.

Zhuang

Ismail

Cooperation in wireless communication networks

IEEE Wireless Communications 2012 19 2 10 20

2-s2.0-84860596912

10.1109/MWC.2012.6189408

18.

Baidas

M. W.

Mackenzie

A. B.

Auction-based power allocation for many-to-one cooperative wireless networks

Proceedings of the 7th International Wireless Communications and Mobile Computing Conference (IWCMC '11)

July 2011

1677 1682

2-s2.0-80052503341

10.1109/IWCMC.2011.5982787

19.

Yang

Fang

Xue

Game theory in cooperative communications

IEEE Wireless Communications 2012 19 2 44 49

2-s2.0-84860581858

10.1109/MWC.2012.6189412

20.

Proakis

J. G.

Salehi

Digital Communications 2007

New York, NY, USA

MCGraw-Hill

21.

Shu

Niu

Zheng

A vacation model with setup and close-down times for transmitter buffer of ARQ schemes

Proceedings of the 14th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '03)

September 2003

2054 2058

2-s2.0-79955571223

10.1109/PIMRC.2003.1259075

22.

Lee

H. W.

Lee

S. S.

Park

J. O.

Chae

K. C.

Analysis of the

M^{X} / G / 1

with N-policy and mutiple vacations

Journal of Applied Probability 1994 31 476 496

23.

Chae

K. C.

Lee

H. W.

M^{X} / G / 1

vacation models with N-policy: heuristic interpretation of the mean waiting time

Journal of the Operational Research Society 1995 46 2 258 264

2-s2.0-0029253439

24.

Wang

Cano

Giannakis

G. B.

Laneman

J. N.

High-performance cooperative demodulation with decode-and-forward relays

IEEE Transactions on Communications 2007 55 7 1427 1438

2-s2.0-34247619637

10.1109/TCOMM.2007.900631