Localized Bridging Centrality

Chapter
Part of the Springer Optimization and Its Applications book series (SOIA, volume 58)

Abstract

Centrality is a concept often used in social network analysis (SNA) to study different properties of networks that are modeled as graphs. Bridging nodes are strategically important nodes in a network graph that are located in between highly-connected regions. We developed a new centrality metric called Localized Bridging Centrality (LBC) to allow a user to identify and rank bridging nodes. LBC is a distributed variant of the Bridging Centrality (BC) metric and both these metrics are used to identify and rank bridging nodes. LBC is capable of identifying bridging nodes with an accuracy comparable to that of the BC metric for most networks, but is an order of magnitude less computationally expensive. As the name suggests, we use only local information from surrounding nodes to compute the LBC metric. Thus, our LBC metric is more suitable for distributed or parallel computation than the BC metric. We applied our LBC metric on several examples, including a real wireless mesh network. Our results indicate that the LBC metric is as powerful as the BC metric at identifying bridging nodes. We recently designed a new SNA metric that is also suitable for use in wireless mesh networks: the Localized Load-aware Bridging Centrality (LLBC) metric. The LLBC metric improves upon LBC by detecting critical bridging nodes while taking into account the actual traffic flows present in a communications network. We developed the SNA Plugin (SNAP) for the Optimized Link State Routing (OLSR) protocol to study the potential use of LBC and LLBC in improving multicast communications and our initial results are promising. In this chapter we present an introduction to SNA centrality metrics with a focus on our contributed metrics: LBC and LLBC. We also present some initial results from applying our metrics in real and emulated wireless mesh networks.

Keywords

Transportation Expense Stein 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

Acknowledgements

We thank Charles Tao at BAE Systems for his help in developing our OLSR plugin. We thank our families for their love, support, and patience. This research program was supported by a gift from Intel Corporation, by Award number 2000-DT-CX-K001 from the U.S. Department of Homeland Security, by Grant number 2005-DD-BX-1091 from the Bureau of Justice Assistance, and by Contract number N00014-10-C-098 from the Office of Naval Research (ONR). Points of view in this document are those of the authors, and do not necessarily represent or reflect the views of any of the sponsors, the US Government or any of its agencies.

References

  1. 1.
    Begnum, K., Burgess, M.: Principle Components and Importance Ranking of Distributed Anomalies. Machine Learning 58(2), 217–230 (2005)MATHCrossRefGoogle Scholar
  2. 2.
    Bonacich, P.: Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2(1), 113–120 (1972)CrossRefGoogle Scholar
  3. 3.
    Bonacich, P.: Power and Centrality: A Family of Measures. The American Journal of Sociology 92(5), 1170–1182 (1987)CrossRefGoogle Scholar
  4. 4.
    Bonacich, P., Lloyd, P.: Eigenvector-like measures of centrality for asymmetric relations. Social Networks 23(3), 191–201 (2001)CrossRefGoogle Scholar
  5. 5.
    Borgatti, S., Everett, M., Freeman, L.: UCINET for Windows: Software for Social Network Analysis. Harvard: Analytic Technologies (2002)Google Scholar
  6. 6.
    Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25(2), 163–177 (2001)MATHCrossRefGoogle Scholar
  7. 7.
    Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)CrossRefGoogle Scholar
  8. 8.
    CenGen Inc.: Extendable Mobile Ad-hoc Network Emulator. http://labs.cengen.com/emane/Google Scholar
  9. 9.
    Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol (OLSR). RFC 3626 (Experimental) (2003). URL http://www.ietf.org/rfc/rfc3626.txt
  10. 10.
    Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, second edn. Cambridge, Mass.: MIT Press (2001)Google Scholar
  11. 11.
    Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 32–40. ACM Press, Montreal, Quebec, Canada (2007). DOI 10.1145/1288107.1288113Google Scholar
  12. 12.
    Everett, M., Borgatti, S.: Ego network betweenness. Social Networks 27(1), 31–38 (2005)CrossRefGoogle Scholar
  13. 13.
    Freeman, L.: A Set of Measures of Centrality Based on Betweenness. Sociometry 40(1), 35–41 (1977)CrossRefGoogle Scholar
  14. 14.
    Gao, W., Li, Q., Zhao, B., Cao, G.: Multicasting in delay tolerant networks: a social network perspective. In: Proceedings of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing(MobiHoc), pp. 299–308 (2009)Google Scholar
  15. 15.
    Hwang, W., Cho, Y., Zhang, A., Ramanathan, M.: Bridging Centrality: Identifying Bridging Nodes in Scale-free Networks. Tech. Rep. 2006-05, Department of Computer Science and Engineering, University at Buffalo (2006)Google Scholar
  16. 16.
    Jacquet, P., Muhlethaler, P., Clausen, T., Laouiti, A., Qayyum, A., Viennot, L.: Optimized link state routing protocol for ad hoc networks. In: Proceedings of the IEEE International Multi Topic Conference on Technology for the 21st Century (INMIC), pp. 62–68 (2001). DOI 10.1109/INMIC.2001.995315Google Scholar
  17. 17.
    Marsden, P.: Egocentric and sociocentric measures of network centrality. Social Networks 24(4), 407–422 (2002)CrossRefGoogle Scholar
  18. 18.
    Nanda, S.: Mesh-mon: A monitoring and management system for wireless mesh networks. Ph.D. thesis, Dartmouth College, Hanover, NH (2008)Google Scholar
  19. 19.
    Nanda, S., Kotz, D.: Localized bridging centrality for distributed network analysis. In: Proceedings of the 17th International Conference on Computer Communications and Networks (ICCCN), pp. 1–6 (2008)Google Scholar
  20. 20.
    Nanda, S., Kotz, D.: Mesh-Mon: A multi-radio mesh monitoring and management system. Computer Communications 31(8), 1588–1601 (2008)CrossRefGoogle Scholar
  21. 21.
    Nanda, S., Kotz, D.: Social Network Analysis Plugin (SNAP) for Wireless Mesh Networks. In: Proceedings of the 11th IEEE Wireless Communications and Networking Conference (WCNC) (2011)Google Scholar
  22. 22.
    Naval Research Laboratory: Multi-Generator (MGEN). http://cs.itd.nrl.navy.mil/work/mgen/Google Scholar
  23. 23.
    Naval Research Laboratory: NACK-Oriented Reliable Multicast (NORM). http://cs.itd.nrl.navy.mil/work/norm/Google Scholar
  24. 24.
    Tarjan, R.: Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing 1, 146 (1972)MathSciNetMATHCrossRefGoogle Scholar
  25. 25.
    Tønnesen, A.: Implementing and extending the Optimized Link State Routing protocol. Master’s thesis, Master’s thesis, University of Oslo, Norway (2004)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.BAE SystemsBurlingtonUSA
  2. 2.Dartmouth CollegeHanoverUSA

Personalised recommendations