78 search results - page 4 / 16 » A Randomized Algorithm for Gossiping in Radio Networks |
SIGMETRICS
2006
ACM
14 years 1 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
DIALM
2010
ACM
13 years 5 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
SIGMETRICS
2009
ACM
14 years 2 months ago
2009
ACM
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
ADHOCNOW
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...