Mobility

An Optimal Algorithm for Relay Node Assignment in Cooperative Ad Hoc Networks

Free registration required

Executive Summary

Recently, cooperative communications, in the form of having each node equipped with a single antenna and exploit spatial diversity via some relay node's antenna, is shown to be a promising approach to increase data rates in wireless networks. Under this communication paradigm, the choice of a relay node (among a set of available relay nodes) is critical in the overall network performance. In this paper, the authors study the relay node assignment problem in a cooperative ad hoc network environment, where multiple source-destination pairs compete for the same pool of relay nodes in the network. The objective is to assign the available relay nodes to different source-destination pairs so as to maximize the minimum data rate among all pairs.

  • Format: PDF
  • Size: 543.9 KB