Sciweavers

ESOA
2006
13 years 8 months ago
Greedy Cheating Liars and the Fools Who Believe Them
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...
Stefano Arteconi, David Hales, Özalp Babaoglu
DSN
2004
IEEE
13 years 8 months ago
Fault Tolerant Energy Aware Data Dissemination Protocol in Sensor Networks
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...
Gunjan Khanna, Saurabh Bagchi, Yu-Sung Wu
ALGOSENSORS
2006
Springer
13 years 8 months ago
Area Based Beaconless Reliable Broadcasting in Sensor Networks
: 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...
Francisco Javier Ovalle-Martínez, Amiya Nay...
ICDCS
2010
IEEE
13 years 9 months ago
Adam2: Reliable Distribution Estimation in Decentralised Environments
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 ...
EPEW
2007
Springer
13 years 9 months ago
An Efficient Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks
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...
INFOCOM
1990
IEEE
13 years 9 months ago
Fault Tolerance of a Class of Double-Loop Networks
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...
Jon M. Peha, Fouad A. Tobagi
SIGADA
1999
Springer
13 years 9 months ago
Redistribution in distributed Ada
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...
Scott James
IPPS
1999
IEEE
13 years 9 months ago
Fault-Tolerant Routing Algorithms for Hypercube Networks
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...
Keiichi Kaneko, Hideo Ito
ICALP
2001
Springer
13 years 9 months ago
Routing in Trees
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 ...
Pierre Fraigniaud, Cyril Gavoille
LCN
2002
IEEE
13 years 10 months ago
Multimedia QoS in Low-Cost Home Networks
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...