Relay selection in D2D communication with channel uncertainties: A stable matching approach

Abstract

The gains of D2D communication have been highlighted in literature although these gains may not be fully explored when only direct communication scenarios are considered. In situations where the nature of source — destination link may not allow direct communication, the introduction of a relay can enhance the communication. Introduction of relays between sender and receiver nodes can improve D2D communication when the link suffers impairment. In this work we model the relay selection problem as stable matching market having two separate sets viz. a set of D2D pairs and a set of idle users that are available as relays. In constructing the preference lists of each set we have chosen separate criteria for populating the preference lists of members of the relay sets and members of the D2D set so that the relays maximize their incentive in the process of offering to relay information for D2D pairs. Channel uncertainties are also introduced in the source — relay links and relays — destination links. Our stable matching based algorithm performs better than a random selection algorithm, best source — relay link and best relay — destination link based selection algorithms.