Journal of Applied Probability

Sensor allocation problems on the real line

Evangelos Kranakis and Gennady Shaikhet

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


A large number n of sensors (finite connected intervals) are placed randomly on the real line so that the distances between the consecutive midpoints are independent random variables with expectation inversely proportional to n. In this work we address two fundamental sensor allocation problems. The interference problem tries to reallocate the sensors from their initial positions to eliminate overlaps. The coverage problem, on the other hand, allows overlaps, but tries to eliminate uncovered spaces between the originally placed sensors. Both problems seek to minimize the total sensor movement while reaching their respective goals. Using tools from queueing theory, Skorokhod reflections, and weak convergence, we investigate asymptotic behaviour of optimal costs as n increases to ∞. The introduced methodology is then used to address a more complicated, modified coverage problem, in which the overlaps between any two sensors can not exceed a certain parameter.

Article information

J. Appl. Probab., Volume 53, Number 3 (2016), 667-687.

First available in Project Euclid: 13 October 2016

Permanent link to this document

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) [See also 90B30, 91D10, 91D35, 91E40]
Secondary: 68M20: Performance evaluation; queueing; scheduling [See also 60K25, 90Bxx]

Sensor allocation queueing theory potential outflow reflected random walk Skorokhod map weak convergence


Kranakis, Evangelos; Shaikhet, Gennady. Sensor allocation problems on the real line. J. Appl. Probab. 53 (2016), no. 3, 667--687.

Export citation


  • Atar, R., Mandelbaum, A. and Reiman, M. I. (2004). Scheduling a multiclass queue with many exponential servers: asymptotic optimality in heavy traffic. Ann. Appl. Prob. 14, 1084–1134.
  • Burkhart, M., von Rickenbach, P., Wattenhofer, R. and Zollinger, A. (2004). Does topology control reduce interference? In Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, ACM, New York, pp. 9–19.
  • Chen, H. and Yao, D. (2001). Fundamentals of Queueing Networks. Springer, New York.
  • Czyzowicz, J. \et (2009). On minimizing the maximum sensor movement for barrier coverage of a line segment. In Ad-Hoc, Mobile and Wireless Networks, Springer, Berlin, pp. 194–212.
  • Czyzowicz, J. \et (2010). On minimizing the sum of sensor movements for barrier coverage of a line segment. In Ad-Hoc, Mobile and Wireless Networks, Springer, Berlin, pp. 29–42.
  • Huang, C.-F. and Tseng, Y.-C. (2005). The coverage problem in a wireless sensor network. Mobile Networks Appl. 10, 519–528.
  • Jacod, J. and Shiryaev, A. N. (2003). Limit Theorems for Stochastic Processes, 2nd edn. Springer, Berlin.
  • Karatzas, I. and Shreve, S. E. (1991). Brownian Motion and Stochastic Calculus, 2nd edn. Springer, New York.
  • Kranakis, E. and Shaikhet, G. (2014). Displacing random sensors to avoid interference. In Computing and Combinatorics, Springer, Heidelberg, pp. 501–512.
  • Kranakis, E. \et (2013). Expected sum and maximum of displacement of random sensors for coverage of a domain. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Parallelism in Algorithms and Architectures, ACM, New York, pp. 73–82.
  • Kumar, S., Lai, T. H. and Arora, A. (2005). Barrier coverage with wireless sensors. In Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, ACM, New York, pp. 284–298.
  • Kuo, H.-H. (2006). Introduction to Stochastic Integration. Springer, New York.
  • Meyn, S. and Tweedie, R. L. (2009). Markov Chains and Stochastic Stability, 2nd edn. Cambridge University Press.
  • Moscibroda, T. and Wattenhofer, R. (2005). Minimizing interference in ad hoc and sensor networks. In Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing, ACM, New York, pp. 24–33.
  • Prabhu, N. U. (1998). Stochastic Storage Processes: Queues, Insurance Risk, Dams, and Data Communication (Appl. Math. (New York) 15), 2nd edn, Springer, New York.
  • Serfozo, R. (2009). Basics of Applied Stochastic Processes. Springer, Berlin.