Cooperative task allocation in heterogeneous wireless sensor networks

19Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Yin, X., Dai, W., Li, B., Chang, L., & Li, C. (2017). Cooperative task allocation in heterogeneous wireless sensor networks. International Journal of Distributed Sensor Networks, 13(10), 1–12. https://doi.org/10.1177/1550147717735747

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free