Nodes Scheduling for Approximate Event Detection in Wireless Sensor Networks
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In heterogeneous wireless sensor networks, a strong relation exists among different types of data being composed into an event. Energy consumption can be reduced by collecting partial data to approximately detect the event. A node scheduling problem for approximate event detection is proposed. The nodes in the network are organized into subsets that are activated successively. The lifetime of the network is maximized on the condition that the partial data collected can be formed as an approximation of the event. The node scheduling problem for approximate event detection is proved to be NP-complete. A greedy-based approximate algorithm is devised with 1/2 as the approximate ratio. The experimental results illustrate that the lifetime of the network can be prolonged effectively.

    Reference
    Related
    Cited by
Get Citation

高静,李建中.无线传感器网络中近似事件检测节点调度问题.软件学报,2014,25(s1):11-18

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 10,2014
  • Revised:August 26,2014
  • Adopted:
  • Online: November 25,2014
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063