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

A Task Allocation Algorithm Based on Score Incentive Mechanism for Wireless Sensor Networks

Author

Listed:
  • Feng Wang
  • Guangjie Han
  • Jinfang Jiang
  • Wei Li
  • Lei Shu

Abstract

A wireless sensor network (WSN) consists of many resource constraint sensor nodes, which are always deployed in unattended environment. Therefore, the sensor nodes are vulnerable to failure and malicious attacks. The failed nodes have a heavily negative impact on WSNs’ real-time services. Therefore, we propose a task allocation algorithm based on score incentive mechanism (TASIM) for WSNs. In TASIM, the score is proposed to reward or punish sensor nodes’ task execution in cluster-based WSNs, where cluster heads are responsible for task allocation and scores’ calculation. Based on the task scores, cluster members can collaborate with each other to complete complex tasks. In addition, the uncompleted tasks on failed nodes can be timely migrated to other cluster members for further execution. Furthermore, the uncompleted tasks on death nodes can be reallocated by cluster heads. Simulation results demonstrate that TASIM is quite suitable for real-time task allocation. In addition, the performance of the TASIM is clearly better than that of conventional task allocation algorithms in terms of both network load balance and energy consumption.

Suggested Citation

  • Feng Wang & Guangjie Han & Jinfang Jiang & Wei Li & Lei Shu, 2015. "A Task Allocation Algorithm Based on Score Incentive Mechanism for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(8), pages 286589-2865, August.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:286589
    DOI: 10.1155/2015/286589
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/286589
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/286589?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:8:p:286589. 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.