Skip to main content
SpringerLink
Log in

Model of a random geometric graph with attachment to the coverage area

  • Large Systems
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We propose a model of random geometric graph with vertices in ℝn and ℤn as an alternative to existing models of ad-hoc wireless networks. We provide estimates for some graph invariants in our model in ℝ1 and ℤn.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Newman, M.E.J., Networks: An Introduction, Oxford: Oxford Univ. Press, 2010.

    Book  MATH  Google Scholar 

  2. Raigorodskii, A.M., Models of Random Graphs and Their Applications, Tr. Mosk. Fiz.-Tekh. Inst., 2010, vol. 2, no. 4 (8), pp. 130–140.

    MathSciNet  Google Scholar 

  3. Barabási, A.-L. and Albert, R., Emergence of Scaling in Random Networks, Science, 1999, vol. 286, no. 5439, pp. 509–512.

    Article  MathSciNet  MATH  Google Scholar 

  4. Bollobás, B., Riordan, O., Spencer, J., and Tusnády, G., The Degree Sequence of a Scale-Free Random Graph Process, Random Structures Algorithms, 2001, vol. 18, no. 3, pp. 279–290.

    Article  MathSciNet  MATH  Google Scholar 

  5. Toh, C.-K., Ad Hoc Mobile Wireless Networks: Protocols and Systems, Upper Saddle River, NJ: Prentice Hall, 2001, 2nd ed.

    Google Scholar 

  6. Penrose, M., Random Geometric Graphs, Oxford: Oxford Univ. Press, 2003.

    Book  MATH  Google Scholar 

  7. Flaxman, A.D., Frieze, A.M., and Vera, J., A Geometric Preferential Attachment Model of Networks, Internet Math., 2006, vol. 3, no. 2, pp. 187–205.

    Article  MathSciNet  MATH  Google Scholar 

  8. Aiello, W., Bonato, A., Cooper, C., Janssen, J., and Pralat, P., A Spatial Web Graph Model with Local Influence Regions, Internet Math., 2008, no. 5, pp. 1–2.

    Article  MathSciNet  MATH  Google Scholar 

  9. Osserman, R., The Isoperimetric Inequality, Bull. Amer. Math. Soc., 1978, vol. 84, no. 6, pp. 1182–1238.

    Article  MathSciNet  MATH  Google Scholar 

  10. Jung, H., Ueber die kleinste Kugel, die eine räumliche Figur einschliesst, J. Reine Angew. Math., 1901, vol. 123, pp. 241–257.

    MathSciNet  MATH  Google Scholar 

  11. Das, B. and Bharghavan, V., Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets, in Proc. 1997 IEEE Int. Conf. on Communications (ICC’97): Towards the Knowledge Millennium, Montréal, Québec, Canada, June 8–12, 1997, vol. 1, pp. 376–380.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow Institute of Physics and Technology, State University, Moscow, Russia

    S. N. Khoroshenkikh & A. B. Dainiak

Authors
  1. S. N. Khoroshenkikh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. B. Dainiak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. N. Khoroshenkikh.

Additional information

Original Russian Text © S.N. Khoroshenkikh, A.B. Dainiak, 2017, published in Problemy Peredachi Informatsii, 2017, Vol. 53, No. 1, pp. 79–91.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khoroshenkikh, S.N., Dainiak, A.B. Model of a random geometric graph with attachment to the coverage area. Probl Inf Transm 53, 73–83 (2017). https://doi.org/10.1134/S0032946017010069

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946017010069

Search

Navigation