Sciweavers

552 search results - page 41 / 111
» Routing complexity of faulty networks
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 7 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler
FGCS
2007
89views more  FGCS 2007»
13 years 7 months ago
Federated grid clusters using service address routed optical networks
Clusters of computers have emerged as cost-effective parallel and/or distributed computing systems for computationally intensive tasks. Normally, clusters are composed of high per...
Isaac D. Scherson, Daniel S. Valencia, Enrique Cau...
DBISP2P
2004
Springer
111views Database» more  DBISP2P 2004»
14 years 1 months ago
Processing and Optimization of Complex Queries in Schema-Based P2P-Networks
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networ...
Hadhami Dhraief, Alfons Kemper, Wolfgang Nejdl, Ch...
IWCMC
2006
ACM
14 years 1 months ago
Low complexity virtual antenna arrays using cooperative relay selection
We study the diversity-multiplexing tradeoff in cooperative diversity systems involving multiple relays. We focus on low complexity architectures that do not require simultaneous...
Aggelos Bletsas, Ashish Khisti, Moe Z. Win
CLADE
2004
IEEE
13 years 11 months ago
An on Demand Path Marking and Capacity Reservation Method using Split Agent
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
Constandinos X. Mavromoustakis, Helen D. Karatza