IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i6p264125.html
   My bibliography  Save this article

Resource Allocation Algorithm Based on Profit Maximization for Crowd Sensing

Author

Listed:
  • Kun Gao
  • Bin Wang
  • Xinwu Yu

Abstract

The key to realizing the crowd sensing network is to overcome the resource restrictions of energy, bandwidth, computing, and so on. First of all, due to the number of users and sensor availability will be dynamic change over time, crowd sensing system is difficult to accurately predict and allocate resource to accomplish a specific task. Secondly, there is a need to consider how to choose an effective subset from a large number of users with different sensing ability, so as to allocate the sensing devices in communication resources under the constraint conditions. This paper proposes a profit maximization algorithm for resource allocation component in crowd sensing environment. The proposed algorithm not only considers the current profit of crowd sensing service request but also considers the long-term expected profits, so as to ensure long-term maximum profit. The objective function is no longer to minimize the completion time but rather to achieve the target profit maximization. The experimental results show that the new algorithm is feasible and superior to the traditional algorithms.

Suggested Citation

  • Kun Gao & Bin Wang & Xinwu Yu, 2015. "Resource Allocation Algorithm Based on Profit Maximization for Crowd Sensing," International Journal of Distributed Sensor Networks, , vol. 11(6), pages 264125-2641, June.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:6:p:264125
    DOI: 10.1155/2015/264125
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/264125
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/264125?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:6:p:264125. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.