A fair resource allocation algorithm for cooperative multicast aided content distribution
A fair resource allocation algorithm for cooperative multicast aided content distribution
Activating direct communications among mobile users (MUs) for sharing a content of common interest (CoCI) becomes an essential paradigm for realising the efficient content distribution in densely populated scenarios. Relying on the cooperative multicast among the MUs, a centralised fair resource allocation algorithm is proposed in this paper for improving the attainable content distribution delay. Apart from the physical wireless transmission, social aspects of MUs are also taken into account, where a MU only multicasts the CoCI to its social contacts. The content distribution process is further modelled by a discrete-time pure-birth-based Markov Chain (DT-PBMC). Relying on the DT-PBMC, we minimise the state-retention probability during each transmission frame in order to reduce the content distribution delay to its smallest possible. The classic branch-andbound algorithm is invoked for obtaining the optimal resource allocation scheme. The simulation results demonstrate that the proposed algorithm outperforms its existing counterparts, while our novel resource allocation scheme may simultaneously achieve better fairness and reduced content distribution delay.
1-6
Hu, Jie
84967196-e5da-49dc-8a0d-4e2507a5fcde
Zhao, Yizhe
56a3095b-72e9-4954-9c27-eeea9e6afb72
Yang, Kun
549bfa5f-6ddf-4eb7-a957-7e4902705121
Yang, Lie Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
10 January 2018
Hu, Jie
84967196-e5da-49dc-8a0d-4e2507a5fcde
Zhao, Yizhe
56a3095b-72e9-4954-9c27-eeea9e6afb72
Yang, Kun
549bfa5f-6ddf-4eb7-a957-7e4902705121
Yang, Lie Liang
ae425648-d9a3-4b7d-8abd-b3cfea375bc7
Hu, Jie, Zhao, Yizhe, Yang, Kun and Yang, Lie Liang
(2018)
A fair resource allocation algorithm for cooperative multicast aided content distribution.
In 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings.
vol. 2018-January,
IEEE.
.
(doi:10.1109/GLOCOM.2017.8255072).
Record type:
Conference or Workshop Item
(Paper)
Abstract
Activating direct communications among mobile users (MUs) for sharing a content of common interest (CoCI) becomes an essential paradigm for realising the efficient content distribution in densely populated scenarios. Relying on the cooperative multicast among the MUs, a centralised fair resource allocation algorithm is proposed in this paper for improving the attainable content distribution delay. Apart from the physical wireless transmission, social aspects of MUs are also taken into account, where a MU only multicasts the CoCI to its social contacts. The content distribution process is further modelled by a discrete-time pure-birth-based Markov Chain (DT-PBMC). Relying on the DT-PBMC, we minimise the state-retention probability during each transmission frame in order to reduce the content distribution delay to its smallest possible. The classic branch-andbound algorithm is invoked for obtaining the optimal resource allocation scheme. The simulation results demonstrate that the proposed algorithm outperforms its existing counterparts, while our novel resource allocation scheme may simultaneously achieve better fairness and reduced content distribution delay.
This record has no associated files available for download.
More information
Published date: 10 January 2018
Venue - Dates:
2017 IEEE Global Communications Conference, , Singapore, Singapore, 2017-12-04 - 2017-12-08
Identifiers
Local EPrints ID: 420855
URI: http://eprints.soton.ac.uk/id/eprint/420855
PURE UUID: 25db1b13-2306-496d-afd0-c15e3459217d
Catalogue record
Date deposited: 17 May 2018 16:30
Last modified: 16 Mar 2024 03:00
Export record
Altmetrics
Contributors
Author:
Jie Hu
Author:
Yizhe Zhao
Author:
Kun Yang
Author:
Lie Liang Yang
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics