Skip to main content
SpringerLink
Log in

Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols

  • Conference paper
Book cover Mathematical Foundations of Computer Science 2011 (MFCS 2011)

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

Abstract

In the article we study important properties of random geometric graphs with randomly deleted edges which are natural models of wireless ad hoc networks with communication constraints. We concentrate on two problems which are most important in the context of theoretical studies on wireless ad hoc networks. The first is how to set parameters of the network (graph) to have it connected. The second is the problem of an effective message transmition i.e. the problem of construction of routing protocols in wireless networks. We provide a thorough mathematical analysis of connectivity property and a greedy routing protocol. The models we use are: an intersection of a random geometric graph with an Erdős–Rényi random graph and an intersection of a random geometric graph with a uniform random intersection graph. The obtained results are asymptotically tight up to a constant factor.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Blackburn, S.R., Gerke, S.: Connectivity of the uniform random intersection graph. Discrete Mathematics 309(16), 5130–5140 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bloznelis, M., Jaworski, J., Rybarczyk, K.: Component evolution in a secure wireless sensor network. Networks 53(1), 19–26 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bollobás, B.: Random Graphs. Academic Press, London (1985)

    MATH  Google Scholar 

  4. Bollobás, B.: The diameter of random graphs. IEEE Trans. Inform. Theory 36, 285–288 (1990)

    Article  MathSciNet  Google Scholar 

  5. Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless network. Wireless Networks 7(6), 609–616 (2001)

    Article  MATH  Google Scholar 

  6. Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: SP 2003: Proceedings of the 2003 IEEE Symposium on Security and Privacy, Washington, DC, USA, pp. 197–213. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  7. Chung, F., Lu, L.: The diameter of sparse random graphs. Adv. in Appl. Math. 26(4), 257–279 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Di Pietro, R., Mancini, L.V., Mei, A., Panconesi, A., Radhakrishnan, J.: Sensor networks that are provably resilient. In: Proc. 2nd IEEE Int Conf Security Privacy Emerging Areas Commun Networks (SecureComm 2006), Baltimore, MD (2006)

    Google Scholar 

  9. Diaz, J., Petit, J., Serna, M.: Faulty random geometric networks. Parallel Processing Letters 10(4), 343–357 (2000)

    Article  MathSciNet  Google Scholar 

  10. Erdős, P., Rényi, A.: On random graphs I. Publ. Math. Debrecen 6, 290–297 (1959)

    MathSciNet  Google Scholar 

  11. Erdős, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci. 5, 17–61 (1960)

    Google Scholar 

  12. Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: CCS 2002: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41–47. ACM Press, New York (2002)

    Chapter  Google Scholar 

  13. Godehardt, E., Jaworski, J.: Two models of random intersection graphs for classifcation. In: Studies in Classifcation, Data Analysis and Knowledge Organization, pp. 67–81. Springer, Heidelberg (2003)

    Google Scholar 

  14. Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity in Wireless Networks. In: Critical Power for Asymptotic Connectivity in Wireless Networks, pp. 547–566. Birkhauser, Basel (1998)

    Google Scholar 

  15. Hwang, J., Kim, Y.: Revisiting random key pre-distribution schemes for wireless sensor networks. In: SASN 2004: Proceedings of the 2nd ACM Workshop on Security of ad Hoc and Sensor Networks, pp. 43–52. ACM, New York (2004)

    Chapter  Google Scholar 

  16. Janson, S., Łuczak, T., Ruciński, A.: Random Graphs. Wiley, Chichester (2001)

    Google Scholar 

  17. Jaworski, J., Ren, M., Rybarczyk, K.: Random key predistribution for wireless sensor networks using deployment knowledge. Computing 85(1–2), 57–76 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Karoński, M., Scheinerman, E.R., Singer-Cohen, K.B.: On random intersection graphs: The subgraph problem. Combinatorics, Probability and Computing 8, 131–159 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  19. Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243–254 (2000)

    Google Scholar 

  20. Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proceedings of the 4th ACM International Symposium on Mobile ad Hoc Networking & Computing, pp. 267–278 (2003)

    Google Scholar 

  21. Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)

    Book  MATH  Google Scholar 

  22. Pettarin, A., Pietracaprina, A., Pucci, G.: On the expansion and diameter of bluetooth-like topologies. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 528–539. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  23. Rybarczyk, K.: Diameter, connectivity, and phase transition of the uniform random intersection graph. Discrete Mathematics (2011), doi:10.1016/j.disc.2011.05.029.

    Google Scholar 

  24. Singer-Cohen, K.B.: Random intersection graphs. PhD Thesis, Department of Mathematical Sciences, The Johns Hopkins University (1995)

    Google Scholar 

  25. Wan, P.-J., Yi, C.-W., Yao, F., Jia, X.: Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks. In: Proceedings of the 7th ACM International Symposium on Mobile ad Hoc Networking and Computing, MobiHoc 2006, pp. 25–36. ACM, New York (2006)

    Chapter  Google Scholar 

  26. Yi, C.-W., Wan, P.-J., Lin, K.-W., Huang, C.-H.: Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with unreliable nodes and links. Discrete Mathematics, Algorithms, and Applications 2(1), 107–124 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  27. Zamalloa, M.Z., Seada, K., Krishnamachari, B., Helmy, A.: Efficient geographic routing over lossy links in wireless sensor networks. ACM Transactions on Sensor Networks (TOSN) 4(3), 1–33 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Adam Mickiewicz University, Poznań, Poland

    K. Krzywdziński & K. Rybarczyk

Authors
  1. K. Krzywdziński
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Rybarczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Filip Murlak  & Piotr Sankowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Krzywdziński, K., Rybarczyk, K. (2011). Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols. In: Murlak, F., Sankowski, P. (eds) Mathematical Foundations of Computer Science 2011. MFCS 2011. Lecture Notes in Computer Science, vol 6907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22993-0_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22993-0_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22992-3

  • Online ISBN: 978-3-642-22993-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation