@article{doi:10.1002/dac.3411,
author = {Baidas, Mohammed W and Afghah, Masoud M and Afghah, Fatemeh},
title = {Distributed simultaneous wireless information and power transfer in multiuser amplify-and-forward ad hoc wireless networks},
journal = {International Journal of Communication Systems},
volume = {31},
number = {1},
pages = {e3411},
keywords = {amplify-and-forward, cooperation, matching theory, node pairing, sum-rate, wireless power transfer},
doi = {10.1002/dac.3411},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/dac.3411},
eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1002/dac.3411},
note = {e3411 dac.3411},
abstract = {Summary This paper studies the problem of stable node matching for distributed simultaneous wireless information and power transfer in multiuser amplify-and-forward ad hoc wireless networks. Particularly, each source node aims to be paired with another node that takes the role of an amplify-and-forward relay to forward its signal to the destination, such that the achievable rate is improved, in return of some payment made to the relaying node. Each relaying node splits its received signal from its respective source into two parts: one for information processing and the other for energy harvesting. In turn, a matching-theoretic solution based on the one-to-one stable marriage matching game is studied, 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, such that their utilities or payments are maximized while achieving network stability. For comparison purposes, an algorithm to enumerate all possible stable matchings is also devised to study the impact of different matchings on the source and relay utilities. Simulation results are presented to validate the proposed matching algorithm and illustrate that it yields sum-utility and sum-payment that are closely comparable to those of centralized power allocation and node pairing, with the added merits of low complexity, truth telling, and network stability.}
}