821 search results - page 10 / 165 » Mobile Distributed Information Retrieval for Highly-Partitio... |
TMC
2008
13 years 7 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
CLUSTER
2011
IEEE
12 years 7 months ago
2011
IEEE
In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the wireless mobile ad‐hoc networks (MANET) consider...
RAID
1999
Springer
13 years 12 months ago
1999
Springer
Distributed intrusion detection systems are especially vulnerable to attacks because the components reside at a static location and are connected together into a hierarchical stru...
COOPIS
1998
IEEE
13 years 12 months ago
1998
IEEE
Recent advances in wireless technologies have made the mobile computing a reality. In order to provide services of good quality to mobile users and improve the system performance,...
ICWN
2004
13 years 9 months ago
2004
Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amoun...