Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
In this paper we propose a distributed algorithm for solving the positioning problem in ad-hoc wireless networks. The method is based on the capability of the nodes to measure the ...
—During the last years next generation networks (NGNs) have gained attention, as an increasing number of network operators moved toward triple-play services: telephony, Internet ...
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...