593 search results - page 53 / 119 » Optimal Distributed Multicast Routing using Network Coding |
129
Voted
STOC
2004
ACM
15 years 7 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
137
click to vote
ICWN
2008
15 years 3 months ago
2008
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
136
Voted
MOBIHOC
2007
ACM
16 years 2 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
112
click to vote
ICC
2009
IEEE
15 years 5 days ago
2009
IEEE
We propose a comprehensive theoretical framework to evaluate reliability and energy consumption of distributed source coding (DSC) in wireless sensor networks (WSNs) applications. ...
124
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract—This paper formulates and studies a general distributed field reconstruction problem using a dense network of noisy one-bit randomized scalar quantizers in the presence...