Journal of Combinatorial Optimization

, Volume 32, Issue 4, pp 985–1001 | Cite as

\((\alpha , \tau )\)-Monitoring for event detection in wireless sensor networks

  • Ran BiEmail author
  • Jianzhong Li
  • Hong Gao
  • Yingshu Li


Detecting abnormal events is one of the fundamental issues in wireless sensor networks (WSNs). In this paper, we investigate \((\alpha ,\tau )\)-monitoring in WSNs. For a given monitored threshold \(\alpha \), we prove that (i) the tight upper bound of \(\Pr [{S(t)} \ge \alpha ]\) is \(O\left( {\exp \left\{ { - n\ell \left( {\frac{\alpha }{{nsup}},\frac{{\mu (t)}}{{nsup}}} \right) } \right\} } \right) \), if \(\mu (t) < \alpha \); and (ii) the tight upper bound of \(\Pr [{S(t)} \le \alpha ]\) is \(O\left( {\exp \left\{ { - n\ell \left( {\frac{\alpha }{{nsup}},\frac{{\mu (t)}}{{nsup}}} \right) } \right\} } \right) \), if \(\mu (t) > \alpha \), where \(\Pr [X]\) is the probability of random event \(X,\, S(t)\) is the sum of the monitored area at time \(t,\, n\) is the number of the sensor nodes, \(sup\) is the upper bound of sensed data, \( \mu (t)\) is the expectation of \(S(t)\), and \(\ell ({x_1},{x_2}) = {x_1}\ln \left( {\frac{{{x_1}}}{{{x_2}}}} \right) + (1 - {x_1})\ln \left( {\frac{{1 - {x_1}}}{{1 - {x_2}}}} \right) \). An instant \((\alpha ,\tau )\)-monitoring scheme is then developed based on the upper bound. Moreover, approximate continuous \((\alpha , \tau )\)-monitoring is investigated. We prove that the probability of false negative alarm is \(\delta \), if the sample size is Open image in new window for a given precision requirement, where Open image in new window is the Open image in new window fractile of a standard normal distribution. Finally, the performance of the proposed algorithms is validated through experiments.


Monitoring Distributed algorithm Sensor networks 



This work is supported in part by the National Grand Fundamental Research 973 Program of China under Grant 2012CB316200, the Key Program of the National Natural Science Foundation of China under Grant 61033015, and 60933001, the Major Program of National Natural Science Foundation of China under Grant 61190115.


  1. Chen G, Cui S (2013) Relay node placement in two-tiered wireless sensor networks with base stations. J Comb Optim 26(3):499–508MathSciNetCrossRefzbMATHGoogle Scholar
  2. Li M, Liu Q, Wang J, Zhao Y (2012) Dispatching design for storage-centric wireless sensor networks. J Comb Optim 24(4):485–507MathSciNetCrossRefzbMATHGoogle Scholar
  3. Li J, Cheng S, Gao H, Cai Z (2014) Approximate physical world reconstruction algorithms in sensor networks. TPDSGoogle Scholar
  4. Cheng S, Cai Z, Li J, Fang X (2015) Drawing dominant dataset from big sensory data in wireless sensor networks. In :The 34th Annual IEEE International Conference on Computer Communications (INFOCOM 2015). IEEEGoogle Scholar
  5. Cheng X, Thaeler A, Chen D (2004) Tps: a time-based positioning scheme for outdoor wireless sensor networks. In: The 23rd Annual IEEE International Conference on Computer Communications (INFOCOM 2004). IEEEGoogle Scholar
  6. Cai Z, Goebel R, Lin G (2011) Size-constrained tree partitioning: approximating the multicast k-tree routing problem. Theor Comput Sci 412(3):240–245MathSciNetCrossRefzbMATHGoogle Scholar
  7. Boukerche A, Cheng X, Linus J (2003) Energy-aware data-centric routing in microsensor networks. In: Proceedings of the 6th ACM international workshop on modeling analysis and simulation of wireless and mobile systems, pp 42–49Google Scholar
  8. Cheng S, Cai Z (2014) Curve query processing in wireless sensor networks. IEEE Trans Veh Technol 99:1–11Google Scholar
  9. Huang Z, Wang L, Yi K (2011) Sampling based algorithms for quantile computation in sensor networks. In: Proceedings of the 2011 International Conference on Management of data, ACM, pp 745–756Google Scholar
  10. Sukun K, Shamim P, Culler D (2007) Health monitoring of civil infrastructures using wireless sensor networks. In: Proceedings of the 6th Information Processing in Sensor Networks (IPSN 2007), IEEE, pp 254–263Google Scholar
  11. Cai Z, Lin G, Xue G (2015) Improved approximation algorithms for the capacitated multicast routing problem. In: The 21st International Computing and Combinatorics Conference (COCOON 2015), pp 136–145Google Scholar
  12. Ding M, Chen D, Xing K, Cheng X (2005) Localized fault-tolerant event boundary detection in sensor networks. In: The 24th Annual IEEE International Conference on Computer Communications (INFOCOM 2005). IEEEGoogle Scholar
  13. Guo L, Li Y, Caz Z (2014) Minimum-latency aggregation scheduling in wireless sensor network. J Comb Optim 10:1–32Google Scholar
  14. Cai Z, Chen Z, Lin L (2009) A 3.4713-approximation algorithm for the capacitated multicast tree routing problem. Theor Comput Sci 410(52):5415–5424MathSciNetCrossRefzbMATHGoogle Scholar
  15. Sharfman I, Keren D (2007) A geometric approach to monitoring threshold functions over distributed data streams. ACM Trans Database Syst 32(4):23CrossRefGoogle Scholar
  16. Meng S, Wang T, Liu L (2010) Monitoring continuous state violation in datacenters: Exploring the time dimension. In: IEEE 26th International Conference on Data Engineering (ICDE), IEEE, pp 968–979Google Scholar
  17. Cormode G, Muthukrishnan S, Yi K (2011) Algorithms for distributed functional monitoring. ACM Trans Algorithm 7(2):21MathSciNetCrossRefzbMATHGoogle Scholar
  18. Cao Z, Sutton C, Diao Y (2011) Distributed inference and query processing for rfid tracking and monitoring. Proc VLDB Endow 4(5):326–337CrossRefGoogle Scholar
  19. Tang M, Li F, Phillips J (2012) Efficient threshold monitoring for distributed probabilistic data. In: IEEE 28th International Conference on Data Engineering (ICDE), IEEE, pp 1120–1131Google Scholar
  20. Gaber M (2007) Data stream processing in sensor networks. In: Learning from data streams. Springer, Berlin, pp 41–48Google Scholar
  21. Gama J, Gaber M (2007) Learning from data streams: processing techniques in sensor networks. Springer, BerlinCrossRefzbMATHGoogle Scholar
  22. Dehnad K (1987) Density estimation for statistics and data analysis. Technometrics 29(4):495CrossRefGoogle Scholar
  23. Huang L, Garofalakis M, Joseph A (2007) Communication-efficient tracking of distributed cumulative triggers. In: 27th International Conference on Distributed Computing Systems, IEEE, pp 54–54Google Scholar
  24. Mitzenmacher M, Upfal E (2005) Probability and computing: randomized algorithms and probabilistic analysis. Cambridge University Press, CambridgeCrossRefzbMATHGoogle Scholar
  25. Kosaki H (1998) Arithmetic-geometric mean and related inequalities for operators. J Funct Anal 156(2):429–451MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyHarbin Institute of TechnologyHarbinChina
  2. 2.Department of Computer ScienceGeorgia State UniversityAtlantaUSA

Personalised recommendations