Advertisement

Weak Ties in Complex Wireless Communication Networks

  • Amanda Leonel
  • Carlos H. C. Ribeiro
  • Matthias R. Brust
Part of the Studies in Computational Intelligence book series (SCI, volume 424)

Abstract

Hundreds of millions of devices—from book-sized notebooks to tiny hand-held mobile phones—are equipped with wireless communication adapters that are able to form a network among themselves. The spontaneous creation of this kind of network and the unpredictable joining and leaving of devices bring forward new challenges on network and topology organization. Network Science has proven to deliver a fruitful methodology to investigate systems such as complex communication networks, and new insights and solutions can be gained by understanding and imitating the function and structure of social networks. Following this line, this paper initially focuses on the development of models that reveal characteristics found to be inherent to social networks. In particular, we consider the finding that social networks can contain a diversity of links: we create clusters of friends, connected by strong links and, additionally, there are links to acquaintances, the so-called weak ties which, despite the name, have been hypothesized as essential for finding jobs or disseminating rumors when strong ties fail. As such links seem to be highly important to deal with the requirements of a complex network such as our own social network, we argue that bringing these structures to the design principles of complex communication networks may result in an increase of efficiency and robustness, and we describe the implementation of two algorithms for wireless communication networks using only local neighborhood information and producing features of complex social networks (weak ties in particular). The results imply that local removing promotes the emergence of weak ties, which we found by using a recently proposed link clustering algorithm for identifying link communities.

Keywords

Link Community Spatial Network Unit Disk Graph Average Short Path Link Similarity 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahn, Yong-Yeol Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761–764 (2010)Google Scholar
  2. 2.
    Awerbuch, B.: Complexity of Network Synchronization. Journal of the ACM (JACM) 32(4), 804–823 (1985)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86(1-3), 165–177 (1991)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Granovetter, M.S.: The Strength of Weak Ties. American Journal of Sociology 78(6), 1360 (1973)CrossRefGoogle Scholar
  5. 5.
    Helmy, A.: Small worlds in wireless networks. IEEE Communications Letters 7(10), 490–492 (2003)CrossRefGoogle Scholar
  6. 6.
    Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: Mobile Networking for ”Small Dust”. In: Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking MobiCom 1999, pp. 271–278. ACM Press, New York (1999)CrossRefGoogle Scholar
  7. 7.
    Kumpula, J., Onnela, J.-P., Saramäki, J., Kertész, J., Kaski, K.: Model of Community Emergence in weighted Social Networks. Computer Physics Communications 180(4), 517–522 (2009)zbMATHCrossRefGoogle Scholar
  8. 8.
    Santi, P.: Topology Control in Wireless Ad Hoc and Sensor Networks. Wiley (2005)Google Scholar
  9. 9.
    Vega-Redondo, F., Chesher, A., Jackson, M.: Complex Social Networks, 1st edn. Cambridge University Press (2007)Google Scholar
  10. 10.
    Wattenhofer, R.: Sensor Networks: Distributed Algorithms Reloaded - Or Revolutions? In: 13th Colloquium on Structural Information and Communication Complexity, SIROCCO (2006)Google Scholar
  11. 11.
    Watts, D.J.: Small Worlds - The Dynamics of Networks between Order and Randomness. Princeton University Press (1999)Google Scholar
  12. 12.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440–442 (1998)CrossRefGoogle Scholar
  13. 13.
    Weiser, M.: The computer for the 21 st century. ACM SIGMOBILE Mobile Computing and Communications Review 3(3), 3–11 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Amanda Leonel
    • 1
  • Carlos H. C. Ribeiro
    • 1
  • Matthias R. Brust
    • 2
  1. 1.Computer Science DivisionTechnological Institute of AeronauticsSão José dos CamposBrazil
  2. 2.Department of Electrical Engineering and Computer ScienceUniversity of Central FloridaOrlandoUSA

Personalised recommendations