Sciweavers

862 search results - page 92 / 173
» Random Information Spread in Networks
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
WICON
2008
15 years 1 months ago
Optimal stochastic routing in low duty-cycled wireless sensor networks
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Dongsook Kim, Mingyan Liu
AC
2003
Springer
15 years 5 months ago
The Importance of Aggregation
Abstract—The dynamics of the survival of recruiting fish are analyzed as evolving random processes of aggregation and mortality. The analyses draw on recent advances in the phys...
Robbert van Renesse
INFOCOM
2010
IEEE
14 years 10 months ago
Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks
—Generating a secret key between two parties by extracting the shared randomness in the wireless fading channel is an emerging area of research. Previous works focus mainly on si...
Kai Zeng, Daniel Wu, An Chan, Prasant Mohapatra
MOBIHOC
2006
ACM
15 years 11 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao