Sciweavers

13214 search results - page 403 / 2643
» Pseudorandomness for network algorithms
Sort
View
EDBTW
2004
Springer
16 years 8 days ago
SPROUT: P2P Routing with Social Networks
In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links. We present a trust model t...
Sergio Marti, Prasanna Ganesan, Hector Garcia-Moli...
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 7 months ago
Adaptive Dynamics of Realistic Small-World Networks
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search, we conduct an experimental analysis of destination sampling, a dynamic algorithm...
Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Dev...
ACSAC
2002
IEEE
15 years 12 months ago
Networking in The Solar Trust Model: Determining Optimal Trust Paths in a Decentralized Trust Network
The Solar Trust Model provides a method by which the sender of a message can be authenticated, and the level of trust that can be placed in the sender of the message or the messag...
Michael Clifford
AINA
2005
IEEE
16 years 15 days ago
Optimal Energy-Efficient Routing for Wireless Sensor Networks
The network lifetime for wireless sensor network plays an important role to survivability. Thus, we indicate the importance of routing protocol to network lifetime, and model the ...
Chih-Wei Shiou, Frank Yeong-Sung Lin, Hsu-Chen Che...
INFOCOM
2003
IEEE
16 years 5 days ago
Physical Topology Discovery for Large Multi-Subnet Networks
— Knowledge of the up-to-date physical (i.e., layer-2) topology of an Ethernet network is crucial to a number of critical network management tasks, including reactive and proacti...
Yigal Bejerano, Yuri Breitbart, Minos N. Garofalak...