A Matching-Theoretic Approach to Distributed SWIPT in Ad-Hoc Wireless Networks

Abstract

This paper studies the problem of stable node matching for distributed simultaneous wireless information and power transfer in multi-user amplify-and-forward (AF) ad-hoc wireless networks. Particularly, each source node aims to be paired with another node that acts an AF relay to forward its signal to the destination, such that the achievable rate is improved, in return for some payment. In turn, a matching-theoretic solution based on the one-to-one Stable Marriage Matching game is considered, and a distributed polynomial-time complexity algorithm is proposed to pair each source node with its best potential relaying node based on the power-splitting ratios. Simulation results are presented to validate the proposed matching algorithm, and show that it yields sum-utility and sum-payment that are comparable to those of centralized schemes, with the added merits of low-complexity, and network stability.