Skip to main content
SpringerLink
Log in

Localized Bridging Centrality

  • Chapter
  • First Online:
Handbook of Optimization in Complex Networks

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

  • 2539 Accesses

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.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Begnum, K., Burgess, M.: Principle Components and Importance Ranking of Distributed Anomalies. Machine Learning 58(2), 217–230 (2005)

    Article  MATH  Google Scholar 

  2. Bonacich, P.: Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2(1), 113–120 (1972)

    Article  Google Scholar 

  3. Bonacich, P.: Power and Centrality: A Family of Measures. The American Journal of Sociology 92(5), 1170–1182 (1987)

    Article  Google Scholar 

  4. Bonacich, P., Lloyd, P.: Eigenvector-like measures of centrality for asymmetric relations. Social Networks 23(3), 191–201 (2001)

    Article  Google Scholar 

  5. Borgatti, S., Everett, M., Freeman, L.: UCINET for Windows: Software for Social Network Analysis. Harvard: Analytic Technologies (2002)

    Google Scholar 

  6. Brandes, U.: A faster algorithm for betweenness centrality. Journal of Mathematical Sociology 25(2), 163–177 (2001)

    Article  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  8. CenGen Inc.: Extendable Mobile Ad-hoc Network Emulator. http://labs.cengen.com/emane/

    Google Scholar 

  9. Clausen, T., Jacquet, P.: Optimized Link State Routing Protocol (OLSR). RFC 3626 (Experimental) (2003). URL http://www.ietf.org/rfc/rfc3626.txt

  10. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, second edn. Cambridge, Mass.: MIT Press (2001)

    Google Scholar 

  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.1288113

    Google Scholar 

  12. Everett, M., Borgatti, S.: Ego network betweenness. Social Networks 27(1), 31–38 (2005)

    Article  Google Scholar 

  13. Freeman, L.: A Set of Measures of Centrality Based on Betweenness. Sociometry 40(1), 35–41 (1977)

    Article  Google Scholar 

  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. 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. 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.995315

    Google Scholar 

  17. Marsden, P.: Egocentric and sociocentric measures of network centrality. Social Networks 24(4), 407–422 (2002)

    Article  Google Scholar 

  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. 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. Nanda, S., Kotz, D.: Mesh-Mon: A multi-radio mesh monitoring and management system. Computer Communications 31(8), 1588–1601 (2008)

    Article  Google Scholar 

  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. Naval Research Laboratory: Multi-Generator (MGEN). http://cs.itd.nrl.navy.mil/work/mgen/

    Google Scholar 

  23. Naval Research Laboratory: NACK-Oriented Reliable Multicast (NORM). http://cs.itd.nrl.navy.mil/work/norm/

    Google Scholar 

  24. Tarjan, R.: Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing 1, 146 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  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 

Download references

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.

Author information

Authors and Affiliations

  1. BAE Systems, 6 New England Executive Park, Burlington, MA, 01821, USA

    Soumendra Nanda

  2. Dartmouth College, 6211 Hinman, Hanover, NH, 03755, USA

    David Kotz

Authors
  1. Soumendra Nanda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Kotz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soumendra Nanda .

Editor information

Editors and Affiliations

  1. Science and Engineering, Department of Computer and Information, University of Florida, Gainesville, 3260, Florida, USA

    My T. Thai

  2. Dept. Industrial & Systems, Engineering, University of Florida, Weil Hall 303, Gainesville, 32611-6595, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Nanda, S., Kotz, D. (2012). Localized Bridging Centrality. In: Thai, M., Pardalos, P. (eds) Handbook of Optimization in Complex Networks. Springer Optimization and Its Applications(), vol 58. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-0857-4_7

Download citation

Publish with us

Policies and ethics

Search

Navigation