2808 search results - page 139 / 562 » Routing betweenness centrality |
165
click to vote
MSWIM
2004
ACM
15 years 12 months ago
2004
ACM
Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorre...
168
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
217
click to vote
LCN
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract-- The emergence of nomadic applications have recently generated much interest in wireless network infrastructures that support real-time communications. In this paper, we ...
181
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
181
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...