47 search results - page 2 / 10 » Minimum Disc Cover Set Construction in Mobile Ad Hoc Network... |
MOBIHOC
2002
ACM
14 years 4 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
— The connected dominating set (CDS) has been extensively used for routing and broadcast in mobile ad hoc networks. While existing CDS protocols are successful in constructing CD...
TMC
2008
13 years 5 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 ...
MOBIQUITOUS
2007
IEEE
13 years 11 months ago
2007
IEEE
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
ICC
2009
IEEE
14 years 11 hour ago
2009
IEEE
—The connected dominating set (CDS) has been commonly used for routing and broadcast in mobile ad hoc networks (MANETs). Considering the applications of MANETs, it is generally p...