Table of Contents Author Guidelines Submit a Manuscript
Journal of Probability and Statistics
Volume 2011, Article ID 350382, 21 pages
http://dx.doi.org/10.1155/2011/350382
Research Article

On the One Dimensional Poisson Random Geometric Graph

Institut Télécom, Télécom ParisTech, CNRS LTCI, 75634 Paris, France

Received 24 March 2011; Revised 20 July 2011; Accepted 22 July 2011

Academic Editor: Kelvin K. W. Yau

Copyright © 2011 L. Decreusefond and E. Ferraz. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. M. Kahn, R. H. Katz, and K. S. J. Pister, “Mobile networking for smart dust,” in Proceedings of the International Conference on Mobile Computing and Networking (MOBICOM '99), pp. 271–278, Seattle, Wash, USA, August 1999.
  2. F. L. Lewis, Wireless Sensor Networks, chapter 2, John Wiley, New York, NY, USA, 2004.
  3. G. J. Pottie and W. J. Kaiser, “Wireless integrated network sensors,” Communications of the ACM, vol. 43, no. 5, pp. 51–58, 2000. View at Publisher · View at Google Scholar
  4. C. Y. Chong and S. P. Kumar, “Sensor networks: evolution, opportunities, and challenges,” Proceedings of the IEEE, vol. 91, no. 8, pp. 1247–1256, 2003. View at Publisher · View at Google Scholar
  5. R. Ghrist and A. Muhammad, “Coverage and hole-detection in sensor networks via homology,” in Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN '05), pp. 254–260, April 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. V. de Silva and R. Ghrist, “Coordinate-free coverage in sensor networks with controlled boundaries via homology,” International Journal of Robotics Research, vol. 25, no. 12, pp. 1205–1222, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. A. F. Siegel and L. Holst, “Covering the circle with random arcs of random sizes,” Journal of Applied Probability, vol. 19, no. 2, pp. 373–381, 1982. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. L. Holst, “On multiple covering of a circle with random arcs,” Journal of Applied Probability, vol. 17, no. 1, pp. 284–290, 1980. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. S. Kumar, T. H. Lai, and A. Arora, “Barrier coverage with wireless sensors,” in Proceedings of the 11th Annual International Conference on Mobile Computing and Networking (MOBICOM '05), pp. 284–298, Cologne, Germany, September 2005. View at Publisher · View at Google Scholar
  10. P. Manohar, S. S. Ram, and D. Manjunath, “Path coverage by a sensor field: the nonhomogeneous case,” ACM Transactions on Sensor Networks, vol. 5, no. 2, pp. 17:1–17:26, 2009. View at Publisher · View at Google Scholar
  11. M. Kahle, “Random geometric complexes,” Discrete & Computational Geometry, vol. 45, no. 3, pp. 553–573, 2011. View at Publisher · View at Google Scholar
  12. M. Kahle and E. Meckes, “Limit theorems for Betti numbers of random simplicial complexes,” Probability. Preprint, http://arxiv.org/abs/1009.4130.
  13. S. Asmussen, Applied Probability and Queues, vol. 51 of Stochastic Modelling and Applied Probabilit, Springer, New York, NY, USA, 2nd edition, 2003. View at Zentralblatt MATH
  14. R. B. Cooper, Introduction to Queueing Theory, North-Holland, New York, NY, USA, 2nd edition, 1981.
  15. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Scienc, chapter 6.1, Addison-Wesley, Reading, Mass, USA, 2nd edition, 1994.
  16. D. C. Wood, “Technical report 15-92,” Tech. Rep., University of Kent computing Laboratory, University of Kent, Canterbury, UK, 1992. View at Google Scholar
  17. S. Roman, The Umbral Calculus, Pure and Applied Mathematics, Academic Press, New York, NY, USA, 1984.