Skip to main content

Displacing Random Sensors to Avoid Interference

  • Conference paper
Computing and Combinatorics (COCOON 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8591))

Included in the following conference series:

  • 1361 Accesses

Abstract

Consider sensors on a line. Assume that for a given parameter s > 0 two sensors’ signals interfere with each other during communication if their distance is ≤ s. We are allowed to move the sensors on the line, if needed, so as to avoid interference. We call total movement the sum of displacements that the sensors have to move so that the distance between any two sensors is > s. We study the following sensor displacement problem for avoiding interference. Assume that n sensors are thrown randomly and independently with the Poisson distribution having arrival rate λ = n in the interval [0, + ∞ ). What is the expected minimum total distance that the sensors have to move from their initial position to a new destination so that any two sensors are at a distance more than s apart? In this paper we study tradeoffs between the interference distance s and the expected minimum total movement, denoted by E(s). (Clearly, the higher the value of s the more the resulting displacement E(s).)

For the line. we prove the following results. 1) If \(s \leq \frac{1}{nt}\) then E(s) ≤ min { t 2/(t − 1)3 , (n − 1)/2t } , where t > 1. 2) For s ≥ 1/n + Ω(n − α) we show that E (s) ∈ Ω(n 2 − α) , 2 ≥ α ≥ 0, while for | s − 1/n | ∈ Θ( n − 3/2 ), we show that \(E(s) \in \Theta (\sqrt{n}) \). These results show a critical regime for the expected minimum total displacement E(s), for s in the interval [ 1/n − 1/n 3/2, 1/n + 1/n 3/2 ].

Similar results concerning the expcted optimal sum of displacements are obtained when the sensors are located on the plane and their coordinates are generated by two independent identical Poisson processes. In the critical regime for sensors on the plane, we show that E(s) ∈ Θ(n 3/4) provided that s is in the interval [ 1/n 1/2 − 1/n 3/4, 1/n 1/2 + 1/n 3/4 ].

Research supported in part by NSERC grants.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Buchin, K.: Minimizing the maximum interference is hard, arXiv:0802.2134 (February 2008)

    Google Scholar 

  2. Burkhart, M., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 9–19. ACM, New York (2004)

    Chapter  Google Scholar 

  3. Covo, S.: On probabilities associated with the minimum distance between events of a poisson process in a finite interval, and erratum/addendum to it. arXiv preprint arXiv:1007.0283 (2010)

    Google Scholar 

  4. Feller, W.: An Introduction to Probability Theory and its Applications, vol. 1. John Wiley, NY (1968)

    MATH  Google Scholar 

  5. Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Haight, F.A.: Handbook of the Poisson distribution. Wiley, New York (1967)

    MATH  Google Scholar 

  7. Halldórsson, M.M., Tokuyama, T.: Minimizing interference of a wireless ad-hoc network in a plane. Theoretical Computer Science 402(1), 29–42 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Jain, K., Padhye, J., Padmanabhan, V.N., Qiu, L.: Impact of Interference on Multi-Hop Wireless Network Performance. Wireless Networks 11(4), 471–487 (2005)

    Article  Google Scholar 

  9. Kingman, J.F.C.: Poisson processes, vol. 3. Oxford University Press (1992)

    Google Scholar 

  10. Kranakis, E., Krizanc, D., Morales-Ponce, O., Narayanan, L., Opatrny, J., Shende, S.: Expected sum and maximum of displacement of random sensors for coverage of a domain. In: Proceedings of the 25th SPAA, pp. 73–82. ACM (2013)

    Google Scholar 

  11. Kranakis, E., Krizanc, D., Morin, P., Narayanan, L., Stacho, L.: A tight bound on the maximum interference of random sensors in the highway model. arXiv preprint arXiv:1007.2120 (2010)

    Google Scholar 

  12. Moscibroda, T., Wattenhofer, R.: Minimizing interference in ad hoc and sensor networks. In: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing, pp. 24–33. ACM, New York (2005)

    Google Scholar 

  13. Penrose, M.: Random geometric graphs, vol. 5. Oxford University Press, Oxford (2003)

    Book  MATH  Google Scholar 

  14. Ross, S.: Introduction to probability models, 10th edn. Elsevier (2010)

    Google Scholar 

  15. Todinov, M.: Statistics of defects in one-dimensional components. Computational Materials Science 24(4), 430–442 (2002)

    Article  Google Scholar 

  16. Todinov, M.: Minimum failure-free operating intervals associated with random failures of non-repairable components. Computers & Industrial Engineering 45(3), 475–491 (2003)

    Article  Google Scholar 

  17. Todinov, M.: Reliability and risk models: Setting reliability requirements. Wiley (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kranakis, E., Shaikhet, G. (2014). Displacing Random Sensors to Avoid Interference. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds) Computing and Combinatorics. COCOON 2014. Lecture Notes in Computer Science, vol 8591. Springer, Cham. https://doi.org/10.1007/978-3-319-08783-2_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08783-2_43

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08782-5

  • Online ISBN: 978-3-319-08783-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics