Journal of South China University of Technology (Natural Science Edition) ›› 2016, Vol. 44 ›› Issue (1): 139-144.doi: 10.3969/j.issn.1000-565X.2016.01.020

• Computer Science & Technology • Previous Articles    

Event Detection Scheme Based on Max-Flow /Min-Cut Algorithm

ZHANG Rui-hua1 CHENG He-you2 LIANG  Yu1   

  1. 1.School of Computer Science and Technology,Shandong University,Jinan 250101,Shandong,China; 2.Shandong Light Industry Collective Economy Science and Technology Information Institute,Jinan 250014,Shandong,China
  • Received:2015-07-10 Revised:2015-09-17 Online:2016-01-25 Published:2015-12-09
  • Contact: 张瑞华( 1969-) ，女，博士，副教授，主要从事无线传感器网络研究． E-mail:zhangruihua1994@139.com
  • About author:张瑞华( 1969-) ，女，博士，副教授，主要从事无线传感器网络研究．
  • Supported by:
    Supported by the National Natural Science Foundation of China( 61202015) and the National High-tech R&D Program of China( 863 Program) ( 2013AA013202)

PDF

199

Abstract: In this paper,the max-flow /min-cut algorithm is applied to the event detection in wireless sensor networks,and an event detection algorithm ( G-Cut) is proposed for boundary-abrupt events.In the algorithm,firstly,the sensing data of adjacent nodes are transformed into weight values,and thus a flow network is formed.Then,the event boundary is obtained by using the max-flow /min-cut algorithm to cut the flow network.Finally,the event area is determined according to the direction implied in upload information.Simulation results on wildfire events show that the proposed algorithm achieves a high accuracy of event detection with a small computation amount of nodes,and for multi-event regions,it can guarantee the detection accuracy without increasing the computation amount and traffic of nodes.

Key words: wireless sensor networks, max-flow /min-cut algorithm, event detection, Boykov new algorithm, multievent region