4 search results - page 1 / 1 » Faster Deterministic Gossiping in Directed Ad Hoc Radio Netw... |
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We study the gossiping problem in directed ad-hoc radio networks. Our main result is a deterministic algorithm that solves this problem in an n-node network in time O(n4/...
SAGA
2007
Springer
13 years 11 months ago
2007
Springer
The line-of-sight networks is a network model introduced recently by Frieze et al. (SODA’07). It considers scenarios of wireless networks in which the underlying environment has...
INFOCOM
2005
IEEE
13 years 10 months ago
2005
IEEE
We consider the problem of neighbor discovery in static wireless ad hoc networks with directional antennas. We propose several probabilistic algorithms in which nodes perform rand...
DC
2010
13 years 5 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...