Results

**1 - 3**of**3**### Auction-Based Power Allocation for Many-to-One Cooperative Wireless Networks

"... Abstract—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 ascen ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—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. Index Terms—Amplify-and-forward (AF), auction, cooperation, many-to-one, network coding, power allocation

### 1Space-Time Network Coding with Optimal Node Selection for Amplify-and-Forward Cooperative Networks

"... Abstract—In a wireless network with multiple amplify-and-forward (AF) nodes, the many-to-many cooperative commu-nication is achieved through the novel concept of space-time network coding with optimal node selection (STNC-ONS). The communication under the STNC-ONS scheme is split into two phases: 1) ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract—In a wireless network with multiple amplify-and-forward (AF) nodes, the many-to-many cooperative commu-nication is achieved through the novel concept of space-time network coding with optimal node selection (STNC-ONS). The communication under the STNC-ONS scheme is split into two phases: 1) the broadcasting phase (BP) in which each node in its allocated time-slot broadcasts its data symbol to all the other nodes in the network, and 2) the cooperation phase (CP) in which the optimal node corresponding to each desired data symbol is selected for relaying it to the destination node in its own time-slot. The optimal node selection is based on the maximum harmonic mean value of the source, intermediate, and destination nodes’ scaled instantaneous channel gains. An approximate symbol-error-rate (SER) expression for M-ary phase shift keying (M-PSK) modulation is derived along with an upper bound SER approximation which is shown to be asymptotic at high signal-to-noise ratio. The derived analytical expressions verify that for a network of N nodes, a full diversity order of (N − 1) per node is achieved by the STNC-ONS scheme. It is concluded that the STNC-ONC scheme is a potential many-to-many cooperative communication scheme with applications spanning sensor and mobile wireless networks. Index Terms—Amplify-and-forward (AF), cooperation, har-monic mean, node selection, symbol-error-rate, wireless network coding I.

### RESEARCH Open Access

"... Many-to-many space-time network coding for amplify-and-forward cooperative networks: node selection and performance analysis ..."

Abstract
- Add to MetaCart

(Show Context)
Many-to-many space-time network coding for amplify-and-forward cooperative networks: node selection and performance analysis