Task allocation based on node pair intimacy in wireless sensor networks

Guisong Yang, Zhao Zhang, Jiangtao Wang, Xingyu He

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


Resourced-constrained task allocation is a fundamental research problem in wireless sensor networks. While existing approaches mainly allocate the task to a single sensor node, this study proposes a novel algorithm, in which tasks are allocated to a pair of collaboratively working sensor nodes based on their intimacy. Specifically, the intimacy level of two nodes is modelled based on their link quality and preference degree. This basic idea is that each node pair should be allocated with a task whose task level (e.g. measured by the computing intensity) could match with the intimacy level of this node pair, so that each task can be executed collaboratively and efficiently. Considering that a node connecting with multiple nodes, it may be allocated with redundant tasks (tasks with the same task level), and these tasks need to be adjusted to avoid redundant task execution. Simulation results show that the proposed algorithm not only can improve the task allocation efficiency but also can balance the network energy consumption.

Original languageEnglish
Pages (from-to)1902-1909
Number of pages8
JournalIET Communications
Issue number12
Early online date21 May 2020
Publication statusPublished - 1 Jul 2020
Externally publishedYes

Bibliographical note

Free access


This work was supported in part by the National Natural Science Foundation of China under grant nos. 61802257 and 61602305; and by the Natural Science Foundation of Shanghai under grant nos. 18ZR1426000 and 19ZR1477600.

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Task allocation based on node pair intimacy in wireless sensor networks'. Together they form a unique fingerprint.

Cite this