Sciweavers

18 search results - page 2 / 4
» Link Lifetimes and Randomized Neighbor Selection in DHTs
Sort
View
ADHOC
2011
12 years 12 months ago
Evaluation and design of beaconing in mobile wireless networks
One of the intrinsic problems of mobility in wireless networks is the discovery of mobile nodes. A widely used solution for this problem is to use different variations of beacons, ...
Abbas Nayebi, Gunnar Karlsson, Hamid Sarbazi-Azad
COMCOM
2006
147views more  COMCOM 2006»
13 years 4 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
CIKM
2008
Springer
13 years 6 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
AINA
2007
IEEE
13 years 11 months ago
A Distributed and Dynamic Data Gathering Protocol for Sensor Networks
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
Hüseyin Özgür Tan, Ibrahim Korpeogl...
WWW
2010
ACM
13 years 5 months ago
Randomization tests for distinguishing social influence and homophily effects
Relational autocorrelation is ubiquitous in relational domains. This observed correlation between class labels of linked instances in a network (e.g., two friends are more likely ...
Timothy La Fond, Jennifer Neville