## Taiwanese Journal of Mathematics

### On Binomial and Poisson Sums Arising from the Displacement of Randomly Placed Sensors

#### Abstract

We re-visit the asymptotics of a binomial and a Poisson sum which arose as (average) displacement costs when moving randomly placed sensors to anchor positions. The first-order asymptotics of these sums were derived in several stages in a series of recent papers. In this paper, we give a unified approach based on the classical Laplace method with which one can also derive more terms in the asymptotic expansions. Moreover, in a special case, full asymptotic expansions can be given which even hold as identities. This will be proved by a combinatorial approach and systematic ways of computing all coefficients of these identities will be discussed as well.

#### Article information

Source
Taiwanese J. Math., Advance publication (2020), 30 pages.

Dates
First available in Project Euclid: 28 May 2020

https://projecteuclid.org/euclid.twjm/1590652820

Digital Object Identifier
doi:10.11650/tjm/200503

#### Citation

Fuchs, Michael; Kao, Louis; Wu, Wan-Zhen. On Binomial and Poisson Sums Arising from the Displacement of Randomly Placed Sensors. Taiwanese J. Math., advance publication, 28 May 2020. doi:10.11650/tjm/200503. https://projecteuclid.org/euclid.twjm/1590652820

#### References

• C. Canonne, A short note on Poisson tail bounds, Retrieved from the website: http://www.cs.columbia.edu/$\sim$ccanonne/.
• P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, Cambridge, 2009.
• R. Kapelko, On the energy efficient displacement of random sensors for interference and connectivity, arXiv:1611.06329.
• ––––, Analysis of the threshold for energy consumption in displacement of random sensors, arXiv:1808.00794.
• ––––, Asymptotic formula for sum of moment mean deviation for order statistics from uniform distribution, Discrete Math. Algorithms Appl. 11 (2019), no. 2, 1950015, 23 pp.
• R. Kapelko and E. Kranakis, On the displacement for covering a unit interval with randomly placed sensors, Inform. Process. Lett. 116 (2016), no. 11, 710–717.
• ––––, On the displacement for covering a $d$-dimensional cube with randomly placed sensors, Ad Hoc Networks 40 (2016), 37–45.
• E. Kranakis, On the event distance of poisson processes with applications to sensors, Discrete Appl. Math. 179 (2014), 152–162.
• E. Kranakis, D. Krizanc, O. Morales-Ponce, L. Narayanan, J. Opatrny and S. Shende, Expected sum and maximum of displacement of random sensors for coverage of a domain, Proceedings of the 25th annual ACM symposium on Parallelism in algorithms and architectures, (2013), 73–82.
• E. Kranakis and G. Shaikhet, Displacing random sensors to avoid interference, in: Computing and Combinatorics, 501–512, Lecture Notes in Comput. Sci., 8591, Springer, Cham, 2014.
• ––––, Sensor allocation problems on the real line, J. Appl. Probab. 53 (2016), no. 3, 667–687.
• M. Mitzenmacher and E. Upfal, Probability and Computing: Randomization and probabilistic techniques in algorithms and data analysis, Second edition, Cambridge Universy Press, Cambridge, 2017.