469 search results - page 86 / 94 » Bounds on the Network Coding Capacity for Wireless Random Ne... |
PIMRC
2010
IEEE
13 years 5 months ago
2010
IEEE
This study addresses the general problem of efficient resource management in wireless networks with arbitrary timevarying topologies. Communication channels are assumed to generall...
SIGMETRICS
2010
ACM
14 years 5 days ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
ICNP
2002
IEEE
14 years 9 days ago
2002
IEEE
We present the hybrid activation multiple access (HAMA) protocol for ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only,...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
TWC
2011
13 years 2 months ago
2011
Abstract—In this paper we consider wireless cooperative multihop networks, where nodes that have decoded the message at the previous hop cooperate in the transmission toward the ...