Optimal Capacity Relay Node Placement in a Multi-hop Network on a Line - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Optimal Capacity Relay Node Placement in a Multi-hop Network on a Line

(1) , (1) , (2) , (1)
1
2

Abstract

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a destination node. The achievable rate formulas that we utilize are for full-duplex radios at the relays and decodeand- forward relaying. For the single relay case, and individual power constraints at the source node and the relay node, we provide explicit formulas for the optimal relay location and the optimal power allocation to the source-relay channel, for the exponential and the power-law path-loss channel models. For the multiple relay case, we consider exponential path-loss and a total power constraint over the source and the relays, and derive an optimization problem, the solution of which provides the optimal relay locations. Numerical results suggest that at low attenuation the relays are mostly clustered close to the source in order to be able to cooperate among themselves, whereas at high attenuation they are uniformly placed and work as repeaters. We also prove that a constant rate independent of the attenuation in the network can be achieved by placing a large enough number of relay nodes uniformly between the source and the destination, under the exponential path-loss model with total power constraint.
Fichier principal
Vignette du fichier
p452-chattopadhyay.pdf (612.67 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

hal-00766295 , version 1 (18-12-2012)

Identifiers

  • HAL Id : hal-00766295 , version 1

Cite

Arpan Chattopadhyay, Abhishek Sinha, Marceau Coupechoux, Anurag Kumar. Optimal Capacity Relay Node Placement in a Multi-hop Network on a Line. WiOpt'12: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2012, Paderborn, Germany. pp.452-459. ⟨hal-00766295⟩
158 View
73 Download

Share

Gmail Facebook Twitter LinkedIn More