: A common technique hacker use is to route their traffic through a chain of stepping-stone hosts. It is generally agreed that there is no valid reason to use a long connection cha...
Wei Ding, Matthew J. Hausknecht, Shou-Hsuan Stephe...
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
A large number of overlay multicast protocols have been developed, almost all of which assume universal connectivity between end hosts. However, in reality, this assumption is not...