Sciweavers

1574 search results - page 181 / 315
» Efficient QoS Routing
Sort
View
QUESTA
2006
101views more  QUESTA 2006»
15 years 6 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
IJSNET
2006
106views more  IJSNET 2006»
15 years 6 months ago
Efficient anonymity schemes for clustered wireless sensor networks
: In this paper, we propose two simple and efficient schemes for establishing anonymity in Clustered Wireless Sensor Networks (CWSNs). The first scheme Simple Anonymity Scheme (SAS...
Satyajayant Misra, Guoliang Xue
CONEXT
2009
ACM
15 years 7 months ago
Scaling all-pairs overlay routing
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
David Sontag, Yang Zhang, Amar Phanishayee, David ...
TPDS
2010
126views more  TPDS 2010»
15 years 1 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
DCOSS
2010
Springer
15 years 9 months ago
Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks
Traditional deployments of wireless sensor networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, su...
Onur Soysal, Murat Demirbas