2011
DOI: 10.1007/978-3-642-23641-9_7
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic Path Selection in Mobile Wireless Sensor Networks for Stochastic Events Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…In i+1 round, the higher probability could be given to the links of good performance [6], thus, the selected probability of links of worse performance would be decreased. Compared with ESLA, BSLA improves convergence-speed by adjusting selected probability of links in time; BLSA can get more ideal estimated value in the case of small samples [4]. Thus Section 3 will design two algorithms based on Bayesian estimation.…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…In i+1 round, the higher probability could be given to the links of good performance [6], thus, the selected probability of links of worse performance would be decreased. Compared with ESLA, BSLA improves convergence-speed by adjusting selected probability of links in time; BLSA can get more ideal estimated value in the case of small samples [4]. Thus Section 3 will design two algorithms based on Bayesian estimation.…”
Section: Preliminariesmentioning
confidence: 99%
“…Therefore according to the actual performance of WSN, estimating the quality of links and selecting the high-quality link will become an important basic research [3]. The empirical-algorithm has widely been used to select the network links, but the empirical-algorithm needs lots of data packages as testing samples [4]. Then this algorithm would consume more energy of nodes, while the nodes of WSN are battery-powered, and the energy is limited.…”
Section: Introductionmentioning
confidence: 99%
“…After i round, BLSA uses the new samples to modify the estimated value of the link quality. In i+1 round, the better link will be given higher selected probability, and the selected probability of poor link will become smaller [6]. Compared with TLSA, BLSA can obtain more ideal estimated value in the case of small samples.…”
Section: Preliminariesmentioning
confidence: 99%
“…Theorem 1 Supposed that the parameter θ is a random variable, and it is regarded as the success rate (packet received rate) of a link [6]. We assume the prior distribution of θ is uniform distribution in (0, 1) defined in Eq.…”
Section: New Bayesian Algorithm Of Link Selection 1)new Bayesian Algo...mentioning
confidence: 99%