Lifetime maximization via cooperative nodes and relay deployment in wireless networks

Himsoon, T.; Siriwongpairat, W. Pam; Han, Zhu; Liu, K.J.R.

doi:10.1109/jsac.2007.070207

Cited by 140 publications

(80 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In sensor networks, where the replacement of batteries is prohibitive, the problem of lifetime maximization has become increasingly important and has been extensively studied in this context (see, e.g., [19][20][21]). Most of the existing work in power allocation in relay networks do not consider the residual battery energy at each node.…”

Section: Introductionmentioning

confidence: 99%

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%

Power allocations in minimum-energy SER-constrained cooperative networks

2009

View full text Add to dashboard Cite

show abstract

“…Recently, there have been numerous network maintenance algorithms [2], [6]- [8]. In [2], the problem of provisioning additional energy on the existing sensors along with deploying additional relays in two-tier wireless sensor networks was considered.…”

Section: Related Workmentioning

confidence: 99%

“…It was shown that the problem of joint design of energy provisioning and relay node placement can be formulated as a mixed-integer nonlinear programming problem, which is NP-hard in general. A relay deployment algorithm that maximizes the minimum sensor lifetime by exploiting the cooperative diversity was proposed in [6]. In [8], a joint design of relay deployment and transmission power control was considered to maximize the network lifetime.…”

Section: Related Workmentioning

confidence: 99%

Connectivity-aware network maintenance and repair via relays deployment

Ibrahim

Seddik

Liu

2009

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-In this paper we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is defined as the time until the network becomes disconnected. The Fiedler value, which is the algebraic connectivity of a graph, is used as an indicator of the network health. The network maintenance problem is formulated as a semi-definite programming (SDP) optimization problem that can be solved efficiently in polynomial time. First, we propose a network maintenance algorithm that obtains the SDP-based locations for a given set of relays. Second we propose a routing algorithm, namely, Weighted Minimum Power Routing (WMPR) algorithm, that significantly increases the network lifetime due to the efficient utilization of the deployed relays. Third, we propose an adaptive network maintenance algorithm that relocates the deployed relays based on the network health indicator. Further, we study the effect of two different transmission scenarios, with and without interference, on the network maintenance algorithm. Finally, we consider the network repair problem, in which we find the minimum number of relays along with their SDPbased locations to reconnect a disconnected network. We propose an iterative network repair algorithm that utilizes the network maintenance algorithm.

show abstract

“…In [9], Savazzi and Spagnolini considered distributed power control for a single user multiple hop transmission. Himsoon et al in [10] investigated the relay selection and power management schemes for lifetime extension in wireless sensor networks. Annavajjala et al in [11] studied the optimal power control problem for different cooperative protocols under high Signal to Interference-plusnoise Ratio (SINR) approximation for a single user and multiple relays.…”

Section: Introductionmentioning

confidence: 99%

Auction-Based Resource Allocation for Cooperative Communications

Huang

Han

Chiang

et al. 2008

IEEE J. Select. Areas Commun.

252

196

View full text Add to dashboard Cite

Abstract-Distributed and efficient resource allocation is critical for fully realizing the benefits of cooperative communications in large scale communication networks. This paper proposes two auction mechanisms, the SNR auction and the power auction, that determine relay selection and relay power allocation in a distributed fashion. A single-relay network is considered first, and the existence and uniqueness of the Nash Equilibrium (i.e., the auction's outcome) are proved. It is shown that the power auction achieves the efficient allocation by maximizing the total rate increase, and the SNR auction is flexible in trading off fairness and efficiency. For both auctions, the distributed best response bid updates globally converge to the unique Nash Equilibrium in a completely asynchronous manner. The analysis is then generalized to networks with multiple relays, and the existence of the Nash Equilibrium is shown under appropriate conditions. Simulation results verify the effectiveness and robustness of the proposed algorithms.

show abstract

Lifetime maximization via cooperative nodes and relay deployment in wireless networks

Cited by 140 publications

References 27 publications

Power allocations in minimum-energy SER-constrained cooperative networks

Power allocations in minimum-energy SER-constrained cooperative networks

Connectivity-aware network maintenance and repair via relays deployment

Auction-Based Resource Allocation for Cooperative Communications

Contact Info

Product

Resources

About