A Capacitated House Allocation Game for the Energy Efficient Relays Selection in 5G Multicast Context

摘要

The upcoming fifth generation (5G) wireless networks making use of higher-frequency spectrum bands suffer from serious propagation issues due to high path loss and beam directivity requirements. This promotes the device-to-device communications to boost the transmission reliability at the network edges, providing remarkable benefits in terms of the energy and spectrum efficiency, essential for a wide class of sensors networks and Internet-of-Things. More in general, applications where devices are usually constrained in computational and transmission range capabilities. In such a context, the selection of the proper number of devices arranged as a relay plays a crucial role. Towards this goal, this paper proposes an efficient relay selection scheme minimizing both the delivery transmission delay and the overall energy consumption, i.e., the overall number of relays to be used. By focusing on a multicast content delivery application scenario the problem of interest is formulated as a one-sided preferences matching game. In addition, the strategy designed takes into account specific information, named reputation coefficient, associated to each device jointly with link propagation conditions for allowing the selection of suitable relays for disseminating the content among the devices. The effectiveness of the proposed solution is underpinned by computer simulations, and the performance is evaluated in terms of power consumption, end-to-end delay, and number of selected relays. As confirmed by results, the proposed approach improves network performance compared to the greedy approach, the random algorithm, a scheme previously proposed in literature, and with two game theory-based strategies.