We consider a randomized algorithm for assigning neighbours to vertices joining a dynamic distributed network. The algorithm acts to maintain connectivity, low diameter and constant vertex degree. This is effected as follows: On joining each vertex donates a fixed number of tokens to the network. The tokens contain the address of the donor vertex. Tokens make independent random walks in the network. A token can be used by any vertex it is visiting to establish a connection to the donor vertex. This allows joining vertices to be allocated a random set of neighbours although the overall membership of the network is unknown. The network we obtain in this way is robust under adversarial deletion of vertices and edges and actively reconnects itself. For example, an edge cut which leaves components of size at least $t^(c+2)/2c$ the network reconnects immediately (whp) on replacing lost edges from the token pool, where $t$ is the size of the network and $c$ is a constant of the protocol.