Sciweavers

5056 search results - page 445 / 1012
» Network Coding Theory
Sort
View
MOBIHOC
2008
ACM
16 years 4 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
153
Voted
SIGMETRICS
2006
ACM
102views Hardware» more  SIGMETRICS 2006»
15 years 10 months ago
On the way to a distributed systems calculus: an end-to-end network calculus with data scaling
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide e...
Markus Fidler, Jens B. Schmitt
CORR
2011
Springer
153views Education» more  CORR 2011»
14 years 12 months ago
Stability Analysis of Transportation Networks with Multiscale Driver Decisions
Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers’ route choices are influenced by information at multiple temporal and spat...
Giacomo Como, Ketan Savla, Daron Acemoglu, Munther...
136
Voted
RIVF
2007
15 years 6 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
WWW
2011
ACM
14 years 11 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya