Sciweavers

4451 search results - page 532 / 891
» On Random Ordering Constraints
Sort
View
ADHOC
2007
169views more  ADHOC 2007»
15 years 6 months ago
Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
Daniela Tulone
TPDS
2010
109views more  TPDS 2010»
15 years 5 months ago
Distributed Network Formation for n-Way Broadcast Applications
—In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n À 1 destinations as well as download their respecti...
Georgios Smaragdakis, Nikolaos Laoutaris, Pietro M...
GLOBECOM
2010
IEEE
15 years 4 months ago
Online Network Coding for Time-Division Duplexing
We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variabl...
Daniel Enrique Lucani, Muriel Médard, Milic...
ECCC
2011
204views ECommerce» more  ECCC 2011»
14 years 10 months ago
Dense locally testable codes cannot have constant rate and distance
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
Irit Dinur, Tali Kaufman
ICC
2008
IEEE
175views Communications» more  ICC 2008»
16 years 1 months ago
Routing in Cooperative Wireless Networks with Mutual-Information Accumulation
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are ...
Stark C. Draper, Lingjia Liu, Andreas F. Molisch, ...