Sensor allocation problems on the real line

DOI10.1017/JPR.2016.33MaRDI QIDQ2836224zbMATH OpenOpenAlexFDO

Authors Gennady Shaikhet, Evangelos Kranakis

Publication date 9 December 2016

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/60a8cfc7c60d895ccce5628d9a836133d6989540

zbMATH Keywords

potential outflowqueueing theoryreflected random walksensor allocationSkorokhod mapweak convergence

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• Displacing random sensors to avoid interference
• Optimal one-dimensional coverage by unreliable sensors
• Maximum interference of random sensors on a line
• On the displacement for covering a unit interval with randomly placed sensors
• On the number and arrangement of sensors for the multiple covering of bounded plane domains

Cited in

(6)

• On the moment absolute deviation of order statistics from uniform distribution
• On the displacement for covering a unit interval with randomly placed sensors
• On binomial and Poisson sums arising from the displacement of randomly placed sensors
• Displacing random sensors to avoid interference
• Optimal one-dimensional coverage by unreliable sensors
• Maximum interference of random sensors on a line

This page was built for publication: Sensor allocation problems on the real line

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836224)