1017 search results - page 103 / 204 » Throughput-centric routing algorithm design |
TMC
2008
13 years 10 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 ...
MOBIHOC
2005
ACM
14 years 9 months ago
2005
ACM
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
TON
2008
13 years 10 months ago
2008
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
TON
2010
13 years 8 months ago
2010
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
STOC
2001
ACM
14 years 10 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...