Evolutionary algorithms based on "tags" can be adapted to induce cooperation in selfish environments such as peer-to-peer systems. In this approach, nodes periodically co...
In this paper we present a data dissemination protocol for efficiently distributing data through a sensor network in the face of node and link failures. Our work is motivated by t...
: We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Alg...
Abstract—To enable decentralised actions in very large distributed systems, it is often important to provide the nodes with global knowledge about the values of attributes across...
Jan Sacha, Jeff Napper, Corina Stratan, Guillaume ...
In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simpl...
Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mack...
This paper analyzes the fault tolerance of a class of double-loop networks referred to as forwardloop backward-hop FLBH, in which each node is connected via unidirectional links t...
In this paper we will demonstrate how Ada and its Distributed Annex may be used to relocate concurrent objects in a distributed data ow application. This relocation mechanism will...
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
This paper describes a new mechanism to garantee quality of service for multimedia streams in low-cost home networks. Quality of service is based on a token, of which the route in...
Hans Scholten, Pierre G. Jansen, Ferdy Hanssen, Pi...