Sciweavers

1345 search results - page 254 / 269
» Data Exchange in Bauhaus
Sort
View
MOBIHOC
2004
ACM
14 years 6 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
SPAA
2009
ACM
14 years 3 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
EWSN
2010
Springer
14 years 3 months ago
Phoenix: An Epidemic Approach to Time Reconstruction
Abstract. Harsh deployment environments and uncertain run-time conditions create numerous challenges for postmortem time reconstruction methods. For example, motes often reboot and...
Jayant Gupchup, Douglas Carlson, Razvan Musaloiu-E...
INFOCOM
2009
IEEE
14 years 1 months ago
On the Market Power of Network Coding in P2P Content Distribution Systems
Abstract—Network coding is emerging as a promising alternative to traditional content distribution approaches in P2P networks. By allowing information mixture in peers, it simpli...
Xinyu Zhang, Baochun Li
IPPS
2009
IEEE
14 years 1 months ago
BarterCast: A practical approach to prevent lazy freeriding in P2P networks
A well-known problem in P2P systems is freeriding, where users do not share content if there is no incentive to do so. In this paper, we distinguish lazy freeriders that are merel...
Michel Meulpolder, Johan A. Pouwelse, Dick H. J. E...