Network criticality in vehicular networks

  • Authors:
  • Ali Tizghadam;Weiwei Li;Alberto Leon-Garcia

  • Affiliations:
  • University of Toronto;University of Toronto;University of Toronto

  • Venue:
  • ACM SIGMETRICS Performance Evaluation Review
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Network criticality (resistance distance) is a graph-theoretic metric that quantifies network robustness, and that was originally designed to capture the effect of environmental changes in core communication networks. This paper establishes a relationship between information centrality and network criticality and provides a justification for using the average network criticality of a node to quantify the nodes relative importance in a graph.This results provides a basis for designing robust clustering algorithms for vehicular networks.