1783 search results - page 212 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
155
click to vote
TOCS
2008
15 years 6 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...
177
click to vote
ICPP
2000
IEEE
15 years 10 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...
185
click to vote
ICPP
2008
IEEE
16 years 25 days 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...
191
click to vote
ISORC
2007
IEEE
16 years 20 days ago
2007
IEEE
Due to the special characteristics (limited battery power, limited computing capability, low bandwidth, need to collect sensor data from multiple fixed-location source nodes to a...
150
click to vote
CISS
2008
IEEE
16 years 26 days ago
2008
IEEE
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...