142 search results - page 9 / 29 » Network failure detection and graph connectivity |
DCOSS
2010
Springer
13 years 11 months ago
2010
Springer
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
EJC
2008
13 years 8 months ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
TC
1998
13 years 8 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
WG
1998
Springer
14 years 20 days ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...