2008 the 28th International Conference on Distributed Computing Systems Workshops 2008
DOI: 10.1109/icdcs.workshops.2008.82
|View full text |Cite
|
Sign up to set email alerts
|

A Relaxation Approach to Dynamic Sensor Selection in Large-Scale Wireless Networks

Abstract: Wireless sensor networks (WSNs)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
26
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 35 publications
(26 citation statements)
references
References 17 publications
0
26
0
Order By: Relevance
“…By applying the property (iii) in Lemma 3 to the trace term of h(k|i, j) in (18), we observe the performance constraints in (19) can be conservatively relaxed sincê (25) with, by defining x • y to be the Schur product of x and y, (26) and P 1,k and P 2,k such that…”
Section: Methodsmentioning
confidence: 99%
“…By applying the property (iii) in Lemma 3 to the trace term of h(k|i, j) in (18), we observe the performance constraints in (19) can be conservatively relaxed sincê (25) with, by defining x • y to be the Schur product of x and y, (26) and P 1,k and P 2,k such that…”
Section: Methodsmentioning
confidence: 99%
“…This problem can be non-trivial because the function of the next-step error covariance matrix can be non-convex. Authors in [25] propose to minimize the trace of the next step error covariance matrix to find the maximum of the function. They propose a relaxation approach that finds a computationally feasible sub-optimal solution.…”
Section: A Information-driven Techniquesmentioning
confidence: 99%
“…This is motivated by the following fact: if the means are estimated as sample means (the minimum variance unbiased estimate for Gaussian distributions), then the covariance of the estimate of the ith mean is equal to 1 N S i , where N is the number of iid samples used. Therefore, it is natural to assume that the confidence region for m i is given by (5), where the scaling constants k 0 and k 1 are proportional to the number of samples used.…”
Section: Distributionsmentioning
confidence: 99%
“…However, the MLD usesm 0 andm 1 . We want to assess the classifier performance wheñ m 0 ,m 1 drift inside the confidence regions defined by (5). To this end, we generate 3000 pairs of points (m 0 ,m 1 ) from the confidence region (5); for each of them we estimate probability of false alarm (P FA ).…”
Section: A Simulation Examplementioning
confidence: 99%