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

Cooperative task allocation in heterogeneous wireless sensor networks

Author

Listed:
  • Xiang Yin
  • Weichao Dai
  • Bin Li
  • Liping Chang
  • Chunxiao Li

Abstract

In a wireless sensor network, sensor nodes are strictly energy and capacity constrained, which makes it necessary for them to collaboratively execute a complex task. Thus, task allocation becomes a fundamental and crucial issue in wireless sensor networks. Most previous studies developed centralized methods to solve this problem. In addition, a common assumption is that all the sensor nodes are homogeneous, which is unfavorable in many real applications. In this article, a distributed task allocation strategy which can handle the problem in a heterogeneous wireless sensor network is proposed. The task is propagated from nodes to nodes and each node matches its own capacity with the required capacities until all the demanded capacities of the task are obtained. Building on this, an enhanced task allocation strategy based on self-organization is developed. By utilizing previous assigning information, the nodes with proper capacities will be selected as candidate nodes, then the paths to these nodes will be optimized. In so doing, a new arriving task can be allocated directly and quickly. Simulation results show the feasibility of the proposed approach. Furthermore, the overall performance of the self-organization-based strategy is validated through a comparison with a particle swarm optimization–based centralized method and the fundamental method.

Suggested Citation

  • Xiang Yin & Weichao Dai & Bin Li & Liping Chang & Chunxiao Li, 2017. "Cooperative task allocation in heterogeneous wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 13(10), pages 15501477177, October.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:10:p:1550147717735747
    DOI: 10.1177/1550147717735747
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717735747
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717735747?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
    ---><---

    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:13:y:2017:i:10:p:1550147717735747. 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.