Sciweavers

862 search results - page 122 / 173
» Random Information Spread in Networks
Sort
View
INFOCOM
2002
IEEE
15 years 4 months ago
Adaptive Load Sharing for Network Processors
—A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by ...
Lukas Kencl, Jean-Yves Le Boudec
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
15 years 9 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
ICDCS
2009
IEEE
15 years 9 months ago
CLIQUE: Role-Free Clustering with Q-Learning for Wireless Sensor Networks
Clustering and aggregation inherently increase wireless sensor network (WSN) lifetime by collecting information within a cluster at a cluster head, reducing the amount of data thr...
Anna Förster, Amy L. Murphy
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 3 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins
FLAIRS
2006
15 years 1 months ago
Agile Sensor Networks: Adaptive Coverage via Mobile Nodes
Advances in sensing and communication technology make sensor networks a convenient and cost effective tool for collecting data in hard to reach and hazardous areas Increasingly, s...
Swapna Ghanekar, Fatma Mili, Imad Elhajj