A Shannon-Theoretic Perspective on Fading Multihop Networks

Oyman, Özgür; Sandhu, Sumeet

doi:10.1109/ciss.2006.286526

Cited by 40 publications

(63 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4 that as SNR increases, the optimum number of hops in terms of maximizing the spectral efficiency decreases. We emphasize that even though this observation is made for a broadband OFDM system assuming frequency selective fading channels and channel state information available to transmitters for power allocation, it is consistent in a general sense with similar observations for a narrowband AWGN system [3], [4]. As the channel model varies, only the transition points, in terms of the particular SNR and rate values lying between different values for the optimal number of hops, seem to change.…”

Section: −Vsupporting

confidence: 50%

“…Under this constraint, the rate of a multihop route is limited by the minimum of the rates of intermediate hops, consistent with the information theoretic studies in [3], [4]. Constraint (4e) represents the transmit power constraint at a node, and constraint (4c) reflects the bandwidth constraint of subcarrier k. Finally, constraint (4d) reflects the practical constraint that each subcarrier is allocated to only one link.…”

Section: Uplink Problem Formulationmentioning

confidence: 70%

“…Furthermore, we impose a flow conservation constraint to reflect the fact that the rate of a multihop route is limited by the rate of the bottleneck link, i.e., the link that has the minimal rate among all intermediate hops [3], [4]. As we will see in the sequel, the problem of allocating power and subcarrier optimally becomes much more involved due to this constraint.…”

Section: Uplink Problem Formulationmentioning

confidence: 99%

See 2 more Smart Citations

Joint Power and Bandwidth Allocation in Multihop Wireless Networks

Chen

Laneman

2008

2008 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-This paper considers power and bandwidth allocation to maximize the end-to-end rate in a multihop wireless network. Assuming an orthogonal frequency division multiplexing (OFDM) system, we formulate an optimization problem for joint power and subcarrier allocation in a network with one destination and multiple sources and relays. We then focus on low-complexity algorithms for the special case of a multihop network with only one source. In particular, we develop an algorithm for a two-hop network based upon the observation that the optimal frequency allocation in a two-hop network has a two-band structure under certain conditions. For a network with more than two hops, we propose a greedy approach to subcarrier allocation. Simulation results suggest that the performance of the proposed algorithms closely follow the optimum performance. Moreover, our results suggest that more hops do not always improve the end-to-end spectral efficiency for frequency-selective fading channels.

show abstract

Section: −Vsupporting

confidence: 50%

Section: Uplink Problem Formulationmentioning

confidence: 70%

Section: Uplink Problem Formulationmentioning

confidence: 99%

See 1 more Smart Citation

Joint Power and Bandwidth Allocation in Multihop Wireless Networks

Chen

Laneman

2008

2008 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

show abstract

“…Furthermore, it can be a building block of more general two-dimensional networks. Therefore, there has been much research on such linear networks [11]- [14], [17].…”

Section: A System Modelmentioning

confidence: 99%

“…The authors in [13] showed that at low SNR, multihop with a large number of hops offers improved performance under the path-loss effect. In [14], a linear multihop relay network over a slow-fading channel was considered. An upper bound on the outage probability was derived.…”

Section: Introductionmentioning

confidence: 99%

Linear Multihop Amplify-and-Forward Relay Channels: Error Exponent and Optimal Number of Hops

Ngo

Larsson

2011

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-We compute the random coding error exponent for linear multihop amplify-and-forward (AF) relay channels. Instead of considering only the achievable rate or the error probability as a performance measure separately, the error exponent results can give us insight into the fundamental tradeoff between the information rate and communication reliability in these channels. This measure enables us to determine what codeword length that is required to achieve a given level of communication reliability at a rate below the channel capacity. We first derive a general formula for the random coding exponent of general multihop AF relay channels. Then we present a closedform expression of a tight upper bound on the random coding error exponent for the case of Rayleigh fading. From the exponent expression, the capacity of these channels is also deduced. The effect of the number of hops on the performance of linear multihop AF relay channels from the error exponent point of view is studied. As an application of the random coding error exponent analysis, we then find the optimal number of hops which maximizes the communication reliability (i.e., the random coding error exponent) for a given data rate. Numerical results verify our analysis, and show the tightness of the proposed bound.Index Terms-Amplify-and-forward multihop relaying, linear multihop relay channel, random coding error exponent.

show abstract

Joint spectrum-efficient routing and scheduling with successive interference cancellation in multihop wireless networks

et al. 2015

View full text Add to dashboard Cite

Spectrum-efficient routing has been subject to interest in the recent literature. The underlying scheduling scheme, however, assumes interference is harmful and concurrent neighboring transmissions are forbidden, and thus the Spectral Efficiency (SE) performance is restricted to some extent. In this paper, we propose a novel joint routing and scheduling scheme with Successive Interference Cancellation (SIC) to exploit interference in multihop wireless networks, such that the SE can be greatly improved. Specifically, we first devise an interesting transmission strategy that applies SIC to explore concurrent neighboring transmission opportunities on an arbitrary path. To maximize the SE benefit brought by concurrent neighboring transmissions, two low-complexity routing algorithms are then presented. Furthermore, based on theoretical analysis, closed-form expressions of approximate SE bound are derived and shown to be very accurate in terms of key network parameters. Numerous simulation results verify that significant SE gains can be obtained through SIC.

show abstract

A Shannon-Theoretic Perspective on Fading Multihop Networks

Cited by 40 publications

References 19 publications

Joint Power and Bandwidth Allocation in Multihop Wireless Networks

Joint Power and Bandwidth Allocation in Multihop Wireless Networks

Linear Multihop Amplify-and-Forward Relay Channels: Error Exponent and Optimal Number of Hops

Joint spectrum-efficient routing and scheduling with successive interference cancellation in multihop wireless networks

Contact Info

Product

Resources

About