Sciweavers

239 search results - page 36 / 48
» Random walks in a supply network
Sort
View
ICDCS
2006
IEEE
14 years 1 months ago
Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
Haiying Shen, Cheng-Zhong Xu
MOBIHOC
2001
ACM
14 years 7 months ago
Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices
This paper presents 7DS, a novel peer-to-peer data sharing system. 7DS is an architecture, a set of protocols and an implementation enabling the exchange of data among peers that ...
Maria Papadopouli, Henning Schulzrinne
INFOCOM
2005
IEEE
14 years 1 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
AAMAS
2007
Springer
13 years 7 months ago
Local strategy learning in networked multi-agent team formation
Abstract. Networked multi-agent systems are comprised of many autonomous yet interdependent agents situated in a virtual social network. Two examples of such systems are supply cha...
Blazej Bulka, Matthew E. Gaston, Marie desJardins
DCOSS
2011
Springer
12 years 7 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt