Abstract
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.
Highlights
The fifth generation (5G) cellular networks suffering from severe propagation issues massively promote the device-to-device (D2D) communication paradigm, i.e., direct connections between users, to improve the communications reliability at the network edges [1,2,3]
We present the system performance derived through computer simulations, applying the proposed matching game approach, a greedy algorithm based on the selection of the end devices (EDs) at minimum delay (MDG), the random one (RA)
The threshold is expressed in terms of link delay; every link which satisfies the quality condition is selected as a relay link; the connection graph Gd is updated in accordance with the degree of the nodes selected as relays; when any link has a quality greater than the fixed threshold, direct links are established until all the nodes are reached
Summary
The fifth generation (5G) cellular networks suffering from severe propagation issues massively promote the device-to-device (D2D) communication paradigm, i.e., direct connections between users, to improve the communications reliability at the network edges [1,2,3]. As widely proved in the literature [1,4,5], the introduction of the devices acting as a relay may significantly improve the network performance This emerging paradigm, known as indirect network connection mode, represents a killer feature of the upcoming 5G technology to counteract the negative effects of the channel propagation conditions at the network edges, by allowing D2D communications directly between devices if the line of sight (LOS) signals are not available in a reliable manner. The adopted matching process achieves the combinations of relays and destinations according to a reputation strategy and the propagation conditions of the links from source to relays and the links from relays to end-users with respect to the direct link (i.e., from source to end-users) This joint process minimizes the worst delivery delay and the number of the involved relays, by resorting to the capacitated house allocation matching problem.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
