Multi-Attribute Auctions for Efficient Operation of Non-Cooperative Relaying Systems

TL;DR

The use of a multi-attribute auction in a communication system to bring about efficient relaying in a non-cooperative setting is studied to highlight the potential of multi-attribute auctions to enhance the efficiency of data transfer in non-cooperative settings.

Abstract

This paper studies the use of a multi-attribute auction in a communication system to bring about efficient relaying in a non-cooperative setting. We consider a system where a source seeks to offload data to an access point (AP) while balancing both the timeliness and energy-efficiency of the transmission. A deep fade in the communication channel (due to, e.g., a line-of-sight blockage) makes direct communication costly, and the source may alternatively rely on non-cooperative UEs to act as relays. We propose a multi-attribute auction to select a UE and to determine the duration and power of the transmission, with payments to the UE taking the form of energy sent via wireless power transfer (WPT). The quality of the channel from a UE to the AP constitutes private information, and bids consist of a transmission time and transmission power. We show that under a second-preferred-offer auction, truthful bidding by all candidate UEs forms a Nash Equilibrium. However, this auction is not incentive compatible, and we present a modified auction in which truthful bidding is in fact a dominant strategy. Extensive numerical experimentation illustrates the efficacy of our approach, which we compare to a cooperative baseline. We demonstrate that with as few as two candidates, our improved mechanism leads to as much as a 76% reduction in energy consumption, and that with as few as three candidates, the transmission time decreases by as much as 55\%. Further, we see that as the number of candidates increases, the performance of our mechanism approaches that of the cooperative baseline. Overall, our findings highlight the potential of multi-attribute auctions to enhance the efficiency of data transfer in non-cooperative settings.

Figures (3)

• Figure 1: Overview of the system under consideration. The source must transfer data to the AP while considering both timeliness and energy efficiency. Due to, e.g., a LOS blockage, quality of the source-to-AP channel is poor, and the source may try to incentivize other nearby UEs to act as relays through payments of WPT.
• Figure 2: Setting of numerical results presented in Section \ref{['sec:results']}. The source, labeled at $q_s$ must offload data to the AP, located at the origin, but a blockage, shown as a large black circle, creates a deep fade. The regions in grey indicate locations for which a link with the source or with the AP is non-LOS, and we therefore do not consider these as valid locations for candidates. Valid candidate placements regions are in white, and sample candidate locations, $q_i$ for $n=5$, are shown as small black circles.
• Figure 3: (a) Average transmission duration, $T$, as a function of the number of candidates, $n$. As the number of candidates increases, the transmission time decreases sharply, and greater values of delay power, $\lambda$, lead to shorter transmission times, too. (b) Average millijoules of transmission energy, in dB, as a function of the number of candidates $n$. As the number of candidates increases, the energy usage decreases, and smaller values of delay power, $\lambda$, result in greater energy efficiency. (c) Average net harvested energy by the candidate as a function of the number of candidates in the MSPOA. The harvested energy decreases as the number of candidates increases or as the delay power, $\lambda$, decreases.

Theorems & Definitions (12)

• Lemma 1
• proof
• Lemma 2
• proof
• Lemma 3
• proof
• Theorem 1
• proof
• Corollary 1
• proof