Hostname: page-component-76fb5796d-9pm4c Total loading time: 0 Render date: 2024-04-28T18:31:43.479Z Has data issue: false hasContentIssue false
  • English
  • Français

BUGS ON A BUDGET: DISTRIBUTED SENSING WITH COST FOR REPORTING AND NONREPORTING

Published online by Cambridge University Press:  19 August 2010

Vladimir Pozdnyakov  and
J. Michael Steele
Vladimir Pozdnyakov
Affiliation:
Department of Statistics, University of Connecticut, Storrs, CT 06269-4120 E-mail: vladimir.pozdnyakov@uconn.edu
J. Michael Steele
Affiliation:
Department of Statistics, University of Pennsylvania, Philadelphia, PA 19104 E-mail: steele@wharton.upenn.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a simple model of sequential decisions made by a fusion agent that receives binary-passive reports from distributed sensors. The main result is an explicit formula for the probability of making a decision before a fixed budget is exhausted. These results depend on the relationship between a special ruin problem for a “lazy random walk” and a traditional biased walk.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 24 , Issue 4 , October 2010 , pp. 525 - 534
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Chong, C.-X. & Kumar, S.P. (2003). Sensor networks: Evolution, opportunities, and challenges. Proceedings of the IEEE 91, 1247–1256.CrossRefGoogle Scholar
2.Feller, W. (1968). An Introduction to probability theory and its applications, Vol. 1, 3rd ed. New York: Wiley.Google Scholar
3.Guerriero, M., Pozdnyakov, V., Glaz, J. & Willett, P. (2010). A repeated significance test with applications to sequential detection in sensor networks. IEEE Transactions on Signal Processing 58: 3426–3435.CrossRefGoogle Scholar
4.Lengyel, T. (to appear). Gambler's ruin & winning a series by m games. Annals of the Institute of Statistical Mathematics doi: 10.1007/s10463-008-0214-0.CrossRefGoogle Scholar