Approximation algorithms for profit maximisation in multicast D2D networks
by Jagadeesha R. Bhat; Jang-Ping Sheu; Wing-Kai Hon; Cian-You Yang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 36, No. 1, 2021

Abstract: As the demand for mobile data services increases, telecom companies need to develop wise strategies to retain existing customers. For instance, in a multicast scenario, satisfying individual user's quality of service (QoS), data demand at varying rates, etc. are complicated tasks. Earlier works on device-to-device (D2D) multicast have majorly discussed the cases of throughput maximisation without considering the individual user's data request rates. In this paper, we propose two algorithms to maximise the telecom operator's profit collected from the users in a two-hop D2D multicast network, when users have different channel qualities and data request rates while receiving multicast data through a single transmission session. First, we model our multicast scheme for the proposed scenario as a budgeted maximum coverage problem. Later, we propose two approximation algorithms that guarantee approximation ratios of 1−1/ √e and 1 − 1 / e, respectively, where e denotes the base of the natural logarithm. Numerical results show that the proposed algorithms perform better than the other candidate algorithms and nearly approximates the optimal solution.

Online publication date: Fri, 12-Feb-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com