In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Abstract— This paper presents i-AA1 , a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1 , learning consists of ...
— We present a novel distributed algorithm for constructing random overlay networks that are composed of d Hamilton cycles. The protocol is completely decentralized as no globall...
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...