Sciweavers

338 search results - page 25 / 68
» Fast distributed random walks
Sort
View
ANSS
2005
IEEE
15 years 3 months ago
Perfect Simulations for Random Trip Mobility Models
The random trip model was recently proposed as a generic mobility model that contains many particular mobility models, including the widely-known random waypoint and random walks,...
Santashil PalChaudhuri, Jean-Yves Le Boudec, Milan...
DCOSS
2010
Springer
15 years 29 days ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
Konstantinos I. Tsianos, Michael G. Rabbat
COMPLEX
2009
Springer
15 years 4 months ago
Composing Music with Complex Networks
—In this paper we study the network structure in music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes an...
Xiaofan Liu, Chi Kong Tse, Michael Small
WONS
2005
IEEE
15 years 3 months ago
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
—Wireless ad hoc radio networks have gained a lot of attention in recent years. We consider geometric networks, where nodes are located in a euclidean plane. We assume that each ...
Alexander Kesselman, Dariusz R. Kowalski
JSS
2010
198views more  JSS 2010»
14 years 4 months ago
Accelerated collection of sensor data by mobility-enabled topology ranks
We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Mot...
Constantinos Marios Angelopoulos, Sotiris E. Nikol...