2808 search results - page 264 / 562 » Routing betweenness centrality |
190
click to vote
ICC
2008
IEEE
16 years 1 months ago
2008
IEEE
— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...
168
click to vote
HM
2007
Springer
16 years 25 days ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
170
click to vote
WIOPT
2006
IEEE
16 years 20 days ago
2006
IEEE
Abstract— The inherent nature of the physical setup and transmission mechanism in wireless ad hoc networks with random channel access, results in correlation between the link met...
189
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
166
click to vote
FPGA
1997
ACM
15 years 10 months ago
1997
ACM
This paper shows that the speed of FPGAs with large embedded memory arrays can be improved by adding direct programmable connections between the memories. Nets that connect to mul...