3rd International ICST Workshop on Information Fusion and Dissemination in Wireless Sensor Networks

Research Article

Energy-efficient task allocation for data fusion in Wireless Sensor Networks

Download386 downloads
  • @INPROCEEDINGS{10.4108/ICST.MOBIQUITOUS2009.6877,
        author={Li Zhigang and Li Shining and Zhou Xingshe and Yang Zhiyi},
        title={Energy-efficient task allocation for data fusion in Wireless Sensor Networks},
        proceedings={3rd International ICST Workshop on Information Fusion and Dissemination in Wireless Sensor Networks},
        publisher={IEEE},
        proceedings_a={SENSORFUSIONS},
        year={2009},
        month={11},
        keywords={wireless sensor networks task graph task assignment 0-1 quadraticprogramming},
        doi={10.4108/ICST.MOBIQUITOUS2009.6877}
    }
    
  • Li Zhigang
    Li Shining
    Zhou Xingshe
    Yang Zhiyi
    Year: 2009
    Energy-efficient task allocation for data fusion in Wireless Sensor Networks
    SENSORFUSIONS
    IEEE
    DOI: 10.4108/ICST.MOBIQUITOUS2009.6877
Li Zhigang1,*, Li Shining1,*, Zhou Xingshe1,*, Yang Zhiyi1,*
  • 1: School of Computer, Northwestern Polytechnical University, Xi’an, China.
*Contact email: lizhigang@nwpu.edu.cn, dtlsn@yahoo.com.cn, zhouxs@nwpu.edu.cn, yangzy@nwpu.edu.cn

Abstract

Data fusion or In-network processing methods were often adopted in Wireless Sensor Networks (WSNs) to reduce data communication and prolong network lifetime, which made WSNs application can be described as a set of tasks (sensing, processing) and dependencies among them. Task assignment has become an important problem which needed to be resolved for different tasks assignment caused different energy consumption. Based on the task graph of WSNs, an energy-efficient task assignment framework was proposed. As application task can be decomposed into sensing subtasks and processing subtasks, we present the task assignment as sensing subtask assignment and processing subtask assignment. We formulate the processing subtask assignment as a 0-1 quadratic programming problem and evaluate it through experiments.