142 search results - page 4 / 29 » Network failure detection and graph connectivity |
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—We propose a novel algorithm for detecting wormhole attacks in wireless multi-hop networks. The algorithm uses only connectivity information to look for forbidden substr...
IAJIT
2010
13 years 7 months ago
2010
: Leader election algorithms solve the instability problem in the network which is caused by leader failure .In this paper, we propose a new leader election algorithm in two dimens...
SIGMETRICS
2006
ACM
14 years 2 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
SASO
2008
IEEE
14 years 2 months ago
2008
IEEE
Many real–world networks show a scale–free degree distribution, a structure that is known to be very stable in case of random failures. Unfortunately, the very same structure ...
ICITS
2011
12 years 12 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...