Optimizing Network-Coded Cooperative Communications via Joint Session Grouping and Relay Node Selection

Abstract

Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechanism to harness the benefits of NC-CC is to appropriately combine sessions into separate groups, and then have each group select the most beneficial relay node for NC-CC. In this paper we study this joint grouping and relay node selection problem for NC-CC. Due to NP-hardness of problem, we propose a distributed and online algorithm that offers near-optimal solution to this problem. The key idea in our algorithm is to have each neighboring relay node of a new session determine and offer its best local group; and then to have the source node of the new session select the best group among all offers. We show that our distributed algorithm has polynomial complexity. Using extensive numerical results, we show that our distributed algorithm adapts well to online network dynamics.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2011
Accession Number
ADA536095

Entities

People

  • Hanif D. Sherali
  • Sastry Kompella
  • Sushant Sharma
  • Yantian Hou
  • Yi Shi

Organizations

  • Virginia Tech

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Background Noise
  • Bandwidth
  • Cellular Networks
  • Channel State Information
  • Communication Channels
  • Computations
  • Computer Programming
  • Data Rate
  • Dynamics
  • Hardness
  • Military Research
  • Networks
  • Noise
  • Polynomials
  • Simulations
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Systems Analysis and Design