Lifetime Maximization for Amplify-and-Forward Cooperative Networks

Huang, Wan-Jen; Hong, Y.-W. Peter; Kuo, C.-C. Jay

doi:10.1109/wcnc.2007.155

Cited by 61 publications

(100 citation statements)

References 8 publications

Supporting

Mentioning

100

Contrasting

Order By: Relevance

“…To extend the network lifetime, the selection strategies based on the instantaneous CSI were used in [21] and [22]. With these strategies, the network lifetime can be extended considerably when compared to the power allocation that depends only on the channel conditions.…”

Section: Introductionmentioning

confidence: 99%

“…In particular, we focus on the repetition-based AF cooperation scheme in an environment with one source transmitting to the destination through multiple relays that form a distributed antenna array employing the repetition-based cooperation [23]. In [21] and [22], the received instantaneous SNR at the destination is assumed as a required QoS. However, SER is a more meaningful metric to be considered as QoS.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Power allocations in minimum-energy SER-constrained cooperative networks

2009

View full text Add to dashboard Cite

In this paper, we propose minimum power allocation strategies for repetition-based amplifyand-forward (AF) relaying, given a required symbol error rate (SER) at the destination. We consider the scenario where one source and multiple relays cooperate to transmit messages to the destination.We derive the optimal power allocation strategy for two-hop AF cooperative network that minimizes the total relay power subject to the SER requirement at the destination. Two outstanding features of the proposed schemes are that the power coefficients have a simple solution and are independent of knowledge of instantaneous channel state information (CSI). We further extend the SER constraint minimum power allocation to the case of multi-branch, multihop network, and derive the closedform solution for the power control coefficients. For the case of power-limited relays, we propose two iterative algorithms to find the power coefficients for the SER constraint minimum-energy cooperative networks. However, these power minimization strategy does not necessarily maximize the lifetime of battery-limited systems. Thus, we propose two other AF cooperative schemes which consider the residual battery energy, as well as the statistical CSI, for the purpose of lifetime maximization. Simulations show that the proposed minimum power allocation strategies could considerably save the total transmitted power compared to the equal transmit power scheme.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Power allocations in minimum-energy SER-constrained cooperative networks

2009

View full text Add to dashboard Cite

show abstract

“…Since the state space and the action space are finite, with a finite reward function, (26) can be expressed as…”

Section: Performance Criterion and Reward Function Let V (S)mentioning

confidence: 99%

Modeling of Multihop Wireless Sensor Networks with MAC, Queuing, and Cooperation

Lin

Weitnauer

2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

We present a Markovian decision process (MDP) framework for multihop wireless sensor networks (MHWSNs) to bound the network performance of both energy constrained (EC) networks and energy harvesting (EH) networks, both with and without relay cooperation. The model provides the fundamental performance limit that a MHWSN can theoretically achieve, under the general constraints from medium access control, routing, and energy harvesting. We observe that the analyses for EC and EH networks fall into two branches of MDP theory, which are finite-horizon process and infinite-horizon process, respectively. The performance metrics for EC and EH networks are different. For EC networks, an appropriate metric is the network lifetime; for EH networks, an appropriate metric is, for example, the network throughput. To efficiently solve the models with high dimension, for the EC networks, we propose a novel computational algorithm by taking advantage of the stochastic shortest path structure of the problem; for the EH networks, we propose a dual linear programming based algorithm by considering the sparsity of the transition matrix. Under the unified MDP framework, numerical results demonstrate the advantages of cooperation for the optimal performance, in both EC and EH networks.

show abstract

“…When the AF relays are equipped with data buffers, however, the traditional max-SNR or its variants (e.g. [10]- [12]) cannot be used. This is because now the source-to-relay and relay-to-destination links are selected separately and then the end-to-end SNR at the destination cannot be obtained instantaneously.…”

Section: Introductionmentioning

confidence: 99%