By Topic

A near optimal routing scheme for multi-hop relay networks based on Viterbi algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Qimin You ; Univ. of Sydney, Sydney, NSW, Australia ; Yonghui Li ; Rahman, M.S. ; Zhuo Chen

In a wireless multi-hop relay network, the optimal routing scheme with exhaustive path search entails high computational complexity and large storage requirement, and is impractical for a large number of hops. In this paper, we propose a suboptimal path selection scheme, based on amplify-and-forward (AF) protocol, that has outage performance close to the optimal routing scheme, but with much less complexity. The proposed scheme draws on the analogy between the node distribution of a commonly used relay network model and the trellis of a convolutional code, and applies the Viterbi algorithm in selecting a path to maximize the end-to-end signal-to-noise ratio (SNR). In specific, the relay network topology is first mapped to the trellis diagram of a convolutional code. In the trellis, the branch metric is defined as the inverse of the instantaneous SNR of the channel connecting two relays in two adjacent clusters. Consequently, the path metric is equal to the inverse of the equivalent SNR of the path. Then, the sliding window Viterbi algorithm is used to select a path from the source to the destination. Simulation results show that when the window size is five times the total encoder memory or more, the proposed routing scheme achieves near optimal outage performance. The proposed scheme has a polynomial complexity and low communication overhead. Therefore, it is very efficient for relay networks with a large number of hops.

Published in:

Communications (ICC), 2012 IEEE International Conference on

Date of Conference:

10-15 June 2012