2391 search results - page 3 / 479 » The Complexity of Connectivity in Wireless Networks |
DCOSS
2011
Springer
12 years 5 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...
MOBIHOC
2002
ACM
14 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
QSHINE
2005
IEEE
13 years 11 months ago
2005
IEEE
Protocols designed to provide error-free communications over lossy links, at both data link and transport layers, commonly employ the idea of sliding windows, which is based on th...
MOBICOM
2006
ACM
13 years 11 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
IWCMC
2009
ACM
13 years 12 months ago
2009
ACM
