Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Power Allocation Game in a Four Node Relay Network: An Upper Bound on the Worst-Case Equilibrium Efficiency
 

Summary: A Power Allocation Game in a Four Node Relay Network:
An Upper Bound on the Worst-Case Equilibrium Efficiency
Ninoslav Marina
, G¨urdal Arslan
and Aleksandar Kavci´c
Department of Electrical Engineering
University of Hawai`i at M¯anoa
2540 Dole Street, Honolulu, HI 96822
Abstract
We introduce a power allocation game in a four node
relay network which consists of two source and two desti-
nation nodes. The sources employ a time sharing protocol
such that in each discrete time instance one of the sources
communicates with its destination while the other source
aids this communication by acting as a relay. Each source
uses some portion of its limited power for its own transmis-
sion and uses the remaining portion to aid the other source.
The noncooperative solution, which is the Nash equilibrium
of the game where each source tries to maximize its own
rate, dictates each source to use all of its power for its own

  

Source: Arslan, Gürdal - Department of Electrical Engineering, University of Hawai'i at Manoa

 

Collections: Engineering