Skip to main content
SpringerLink
Log in

A Fast Method for Network Topology Generating

  • Conference paper
Multiple Access Communications (MACOM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 8715))

Included in the following conference series:

Abstract

Authors provide a new method that can speedup simulation of wireless sensor networks or ad hoc networks. Performance improvement has been achieved by fast generating of pseudo-random UDG graphs with prescribed properties. Numerical results demonstrate that the proposed method achieves an essential computational cost reduction in comparison with the standard approach.

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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. Lu, G., Krishnamachari, B., Raghavendra, C.S.: An adaptive energy efficient and low-latency MAC for data gathering in wireless sensor networks. In: Proceedings of 18th International Parallel and Distributed Processing Symposium, April 26-30, p. 224 (2004)

    Google Scholar 

  2. Boukerche, A.: Algorithms and Protocols for Wireless Sensor Networks. John Wiley & Sons Inc. (2008)

    Google Scholar 

  3. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86(13), 165–177 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Wagner, D., Wattenhofer, R. (eds.): Algorithms for Sensor and Ad Hoc Networks. LNCS, vol. 4621. Springer, Heidelberg (2007)

    Google Scholar 

  5. Dong, D., Liao, X., Liu, Y., Li, X., Pang, Z.: Fine-Grained Location-Free Planarization in Wireless Sensor Networks. IEEE Transactions on Mobile Computing 12(5), 971–983 (2013)

    Article  Google Scholar 

  6. Camilo, T., Silva, J.S., Rodrigues, A., Boavida, F.: GENSEN: A topology generator for real wireless sensor networks deployment. In: Obermaisser, R., Nah, Y., Puschner, P., Rammig, F.J. (eds.) SEUS 2007. LNCS, vol. 4761, pp. 436–445. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Seo, J., Kim, M., Hur, I., Choi, W., Choo, H.: DRDT: Distributed and Reliable Data Transmission with Cooperative Nodes for LossyWireless Sensor Networks. Sensors 10(4), 2793–2811 (2010)

    Article  Google Scholar 

  8. Onat, F.A., Stojmenovic, I., Yanikomeroglu, H.: Generating random graphs for the simulation of wireless ad hoc, actuator, sensor, and internet networks. Pervasive and Mobile Computing 4, 597–615 (2008)

    Article  Google Scholar 

  9. Song, L.: Random graph models for wireless communication networks. PhD Thesis, https://qmro.qmul.ac.uk/jspui/handle/123456789/426

Download references

Author information

Authors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Prospect Akademika Lavrentjeva 6, 630090, Novosibirsk, Russia

    Vladimir Shakhov, Olga Sokolova & Anastasia Yurgenson

Authors
  1. Vladimir Shakhov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olga Sokolova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anastasia Yurgenson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Science, Computer and Electrical Engineering, Halmstad University, Kristian IV:s väg 3, 30118, Halmstad, Sweden

    Magnus Jonsson  & Alexey Vinel  & 

  2. Department of Information and Communication Technologies, Universitat Pompeu Fabra, Roc Boronat 138, 08018, Barcelona, Spain

    Boris Bellalta

  3. Department of Electronics and Communications Engineering, Tampere University of Technology, Korkeakoulunkatu 3, 33720, Tampere, Finland

    Evgeny Belyaev

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Shakhov, V., Sokolova, O., Yurgenson, A. (2014). A Fast Method for Network Topology Generating. In: Jonsson, M., Vinel, A., Bellalta, B., Belyaev, E. (eds) Multiple Access Communications. MACOM 2014. Lecture Notes in Computer Science, vol 8715. Springer, Cham. https://doi.org/10.1007/978-3-319-10262-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10262-7_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10261-0

  • Online ISBN: 978-3-319-10262-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation