Routing strategies in multihop cooperative networks

  • Authors:

  • Bo Gui;Lin Dai;Leonard J. Cimini

  • Affiliations:

  • Cisco Systems, Inc. and Department of Electrical and Computer Engineering, University of Delaware;Department of Electronic Engineering, City University of Hong Kong and Department of Electrical and Computer Engineering, University of Delaware;Department of Electrical and Computer Engineering, University of Delaware, Newark, DE

  • Venue:
  • IEEE Transactions on Wireless Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

The fading characteristics and broadcast nature of wireless channels are usually not fully considered in the design of routing protocols for wireless networks. In this paper, we combine routing and cooperative diversity, with the consideration of a realistic channel model. We focus on a multihop network with multiple relays at each hop, and three routing strategies are designed to achieve the full diversity gain provided by cooperation among the relays. In particular, an optimal routing strategy is proposed to minimize the end-to-end outage, which requires the channel information of all the links and serves as a performance bound. An ad-hoc routing strategy is then proposed based on a hop-by-hop relay selection, which can be easily implemented in a distributed way. As expected, ad-hoc routing performs worse than optimal routing, especially with a large number of hops. To achieve a good complexity-performance tradeoff, an N-hop routing strategy is further proposed, where a joint optimization is performed every N hops. Simulation results are provided which verify the outage analyses of the proposed routing strategies.