Literature Database Entry


Mohammad Moltafet, Atefeh Rezaei, Nader Mokari, Mohammad Reza Javan, Hamid Saeedi and Hossein Pishro Nik, "Joint Dynamic Pricing and Radio Resource Allocation Framework for IoT Services," arXiv, cs.IT, 1903.02928, March 2019.


In this paper, we study the problem of resource allocation as well as pricing in the context of Internet of things (IoT) networks. We provide a novel pricing model for IoT services where all the parties involved in the communication scenario as well as their revenue and cost are determined. We formulate the resource allocation in the considered model as a multi-objective optimization problem where in addition to the resource allocation variables, the price values are also optimization variables. To solve the proposed multi-objective optimization problem, we use the scalarization method which gives different Pareto optimal solutions. We solve the resulting problems using the alternating approach based on the successive convex approximation (SCA) method which converges to a local solution with few iterations. We also consider a conventional approach where each entity tries to maximize its own revenue independently. Simulation results indicate that by applying the proposed joint framework, we can increase the total revenue compared to the conventional case while providing an almost complete fairness among the players. This is while the conventional approach fails to provide such a fairness.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Mohammad Moltafet
Atefeh Rezaei
Nader Mokari
Mohammad Reza Javan
Hamid Saeedi
Hossein Pishro Nik

BibTeX reference

    author = {Moltafet, Mohammad and Rezaei, Atefeh and Mokari, Nader and Javan, Mohammad Reza and Saeedi, Hamid and Nik, Hossein Pishro},
    doi = {10.48550/arXiv.1903.02928},
    title = {{Joint Dynamic Pricing and Radio Resource Allocation Framework for IoT Services}},
    institution = {arXiv},
    month = {3},
    number = {1903.02928},
    type = {cs.IT},
    year = {2019},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-06-24