Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
—The IEEE 802.16 standard, or WiMAX, has emerged as one of the strongest contenders for broadband wireless access technology. In our previous work, we proposed a protocol using r...
— We consider the design of a sensor network for detecting an emitter who if present is known to be located in an interval but whose exact position is unknown. We seek to minimiz...