Skip to main content
Springer Nature Link
Log in

A New Small World Lattice

  • Conference paper
Advanced Computing, Networking and Security (ADCONS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7135))

  • 2922 Accesses

Abstract

This paper considers a scalable lattice that may be used to generate models of random small world networks. We describe its properties and investigate its robustness to random node failures. We also define group and reachability coefficients to characterize the properties of the network. Simulation results are presented that show that the new coefficients well describe a social network.

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

Access this chapter

Log in via an institution

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. Barabasi, A., Albert, R.: Emergence of Scaling in Random Networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  2. Caverlee, J., Liu, L., Webb, S.: The socialtrust framework for trusted social information management: Architecture and algorithms. Information Sciences 180(1), 95–112 (2010); Special Issue on Collective Intelligence (2010)

    Article  Google Scholar 

  3. Haythornthwaite, C.: Social network analysis: An approach and technique for the study of information exchange. Library & Information Science Research 18(4), 323–342 (1996)

    Article  Google Scholar 

  4. Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching, vol. 3. Addison Wesley Longman Publishing Co., Inc., Redwood City (1998)

    Google Scholar 

  5. Monclar, R., Tecla, A., Oliveira, J., de Souza, J.M.: Mek: Using spatial-temporal information to improve social networks and knowledge dissemination. Information Sciences 179(15), 2524–2537 (2009)

    Article  Google Scholar 

  6. Ni, Y., Xie, L., Liu, Z.-Q.: Minimizing the expected complete influence time of a social network. Information Sciences 180(13), 2514–2527 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Parakh, A., Kak, S.: A key distribution scheme for sensor networks using structured graphs. In: International Conference on Emerging Trends in Electronic and Photonic Devices Systems, ELECTRO 2009, pp. 10–13 (December 2009)

    Google Scholar 

  8. Parakh, A., Kak, S.: Efficient key management in sensor networks. In: 2010 IEEE GLOBECOM Workshops (GC Wkshps), pp. 1539–1544 (December 2010)

    Google Scholar 

  9. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)

    Article  Google Scholar 

  10. Varshney, L.: Local fidelity, constrained codes, and the meru prastara. IEEE Potentials 27(2), 27–32 (2008)

    Article  Google Scholar 

  11. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Science and Technology, University of Nebraska at Omaha, Omaha, NE, 68182, USA

    Abhishek Parakh

  2. Computer Science Department, Oklahoma State University, Stillwater, OK, 74078, USA

    Subhash Kak

Authors
  1. Abhishek Parakh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Subhash Kak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. N.I.T.K., National Institute of Technology Karnataka, Surathkal, 575 025, Mangalore, India

    P. Santhi Thilagam , Alwyn Roshan Pais  & K. Chandrasekaran ,  & 

  2. Indian Institute of Science, 560012, Bangalore, India

    N. Balakrishnan

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parakh, A., Kak, S. (2012). A New Small World Lattice. In: Thilagam, P.S., Pais, A.R., Chandrasekaran, K., Balakrishnan, N. (eds) Advanced Computing, Networking and Security. ADCONS 2011. Lecture Notes in Computer Science, vol 7135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29280-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29280-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29279-8

  • Online ISBN: 978-3-642-29280-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics