2149 search results - page 237 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
138
Voted
HYBRID
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Networked embedded systems are composed of a large number of components that interact with the physical world via a set of sensors and actuators, have their own computati...
209
click to vote
DCOSS
2011
Springer
14 years 1 months ago
2011
Springer
—Available algorithms for the distributed construction of connected dominating sets in mobile ad hoc networks are inapplicable or suffer from a high complexity. This is mainly du...
109
click to vote
TOCS
2008
15 years 1 months ago
2008
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
120
Voted
ICPP
2000
IEEE
15 years 6 months ago
2000
IEEE
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
125
Voted
ICPP
2008
IEEE
15 years 8 months ago
2008
IEEE
In large-scale, self-organized and distributed systems, such as peer-to-peer (P2P) overlays and wireless sensor networks (WSN), a small proportion of nodes are likely to be more c...