By Topic

Resilience to Degree-Dependent and Cascading Node Failures in Random Geometric Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhenning Kong ; Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA ; Yeh, E.M.

This paper studies the problem of resilience to node failures in large-scale networks modelled by random geometric graphs. Adopting a percolation-based viewpoint, the paper investigates the ability of the network to maintain global communication in the face of dependent node failures. Degree-dependent site percolation processes on random geometric graphs are examined, and the first known analytical conditions are obtained for the existence and non-existence, respectively, of a large connected component of operational network nodes after degree-dependent node failures. In electrical power networks or wireless communication and computing networks, cascading failure from power blackouts or virus epidemics may result from a small number of initial node failures triggering global failure events affecting the whole network. With the use of a simple but descriptive model, it is shown that the cascading failure problem is equivalent to a degree-dependent percolation process. The first analytical conditions are obtained for the occurrence and non-occurrence of cascading failures, respectively, in large-scale networks with geometric constraints.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 11 )