Auction-based power allocation for many-to-one cooperative wireless networks

In this paper, a distributed efficient power allocation game-theoretic framework in wireless ad-hoc networks is proposed where multiple source nodes communicate with a single destination node via a relay node. The power allocation among the source nodes is formulated as an alternative ascending-clock auction (A-ACA) and achieved using a distributed algorithm that converges in a finite number of clocks and is proven to enforce truthful power demands at every clock and maximize the social welfare. Analytical and numerical results are presented to verify the efficient power allocation, truth-telling and social welfare maximization properties of the proposed A-ACA. It is concluded that the proposed A-ACA lends itself to practical implementation in wireless ad-hoc networks.