Sciweavers

184 search results - page 17 / 37
» Communication in Networks with Random Dependent Faults
Sort
View
87
Voted
CCGRID
2010
IEEE
14 years 10 months ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
76
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
Impact of Mobility on the Performance of Relaying in Ad Hoc Networks
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...
OPODIS
2010
14 years 7 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
IPPS
2005
IEEE
15 years 3 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
UAI
2008
14 years 11 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash