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

Ran Bi (), Jianzhong Li (), Hong Gao () and Yingshu Li ()
Additional contact information
Ran Bi: Harbin Institute of Technology
Jianzhong Li: Harbin Institute of Technology
Hong Gao: Harbin Institute of Technology
Yingshu Li: Harbin Institute of Technology

Journal of Combinatorial Optimization, 2016, vol. 32, issue 4, No 2, 985-1001

Abstract: Abstract 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 ]$$ Pr [ S ( t ) ≥ α ] is $$O\left( {\exp \left\{ { - n\ell \left( {\frac{\alpha }{{nsup}},\frac{{\mu (t)}}{{nsup}}} \right) } \right\} } \right) $$ O exp - n ℓ α n s u p , μ ( t ) n s u p , if $$\mu (t) \alpha $$ μ ( t ) > α , where $$\Pr [X]$$ Pr [ X ] is the probability of random event $$X,\, S(t)$$ X , S ( t ) is the sum of the monitored area at time $$t,\, n$$ t , n is the number of the sensor nodes, $$sup$$ s u p is the upper bound of sensed data, $$ \mu (t)$$ μ ( t ) is the expectation of $$S(t)$$ 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) $$ ℓ ( x 1 , x 2 ) = x 1 ln x 1 x 2 + ( 1 - x 1 ) ln 1 - x 1 1 - x 2 . 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 for a given precision requirement, where is the fractile of a standard normal distribution. Finally, the performance of the proposed algorithms is validated through experiments.

Keywords: Monitoring; Distributed algorithm; Sensor networks (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9837-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:4:d:10.1007_s10878-015-9837-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9837-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().