Throughput and Energy Efficiency of Opportunistic Routing with Type-I HARQ in Linear Multihop Networks

Abstract

Opportunistic routing is a well-known technique that exploits the broadcast nature of wireless transmissions and path diversity to form the route in an adaptive manner based on current channel conditions. This paper studies the throughput advantages of opportunistic routing over conventional multihop routing for linear multihop wireless networks with type-I Hybrid Automatic Repeat reQuest (HARQ) and quasi-static Rayleigh fading channels. The end-to-end throughput of opportunistic routing is derived using Markov chain tools and accounting for fading statistics. Both fixed-rate and optimal-rate transmissions are considered. Moreover, an investigation of the throughput using standard information-theoretic performance metrics for asymptotic signal-to-noise ratio regimes is provided. Specifically, the multiplexing gain and energy efficiency (i.e., minimum energy per bit) of both opportunistic and multihop routing are analyzed. Numerical results are given to corroborate the analysis

Optimal Routing and Power Allocation for Wireless Networks with Imperfect Full-Duplex Nodes

“…Throughput in a linear network topology has been studied in [11,[23][24][25], but not for aspects of routing and power allocation with imperfect full-duplex nodes.…”

“…In a linear network all nodes are in the direct line joining the source and the destination with equal channel gains between each two consecutive nodes, as in [11,[23][24][25]. We assume that as N grows the nodes S and D remain fixed and all other nodes are rearranged between them to maintain channel gain equality.…”

Performance Analysis of an Opportunistic Relay Selection Protocol for Multi-Hop Networks

“…Early work on tandem queueing networks [2] relied on simplified channel and interference modeling and did not consider direct packet transmissions over the distance of multiple hops. Recent work on opportunistic routing includes [3]- [5]. Various aspects of line networks have been studied in [6]- [8], while [9] calculated the end-to-end throughput of dynamic relay selection in a random geometric setting.…”