Sciweavers

5056 search results - page 624 / 1012
» Network Coding Theory
Sort
View
CORR
2010
Springer
79views Education» more  CORR 2010»
15 years 6 months ago
A Multi-hop Multi-source Algebraic Watchdog
In our previous work (`An Algebraic Watchdog for Wireless Network Coding'), we proposed a new scheme in which nodes can detect malicious behaviors probabilistically, police th...
MinJi Kim, Muriel Médard, João Barro...
MOBICOM
2009
ACM
16 years 1 months ago
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has ...
Shuo Guo, Yu Gu, Bo Jiang, Tian He
IJBRA
2010
134views more  IJBRA 2010»
15 years 5 months ago
Deterministic graph-theoretic algorithm for detecting modules in biological interaction networks
—Accumulating evidence suggests that biological systems exhibit modular organization. Accurate identification of modularity is vital for understanding this organization. A recen...
Roger L. Chang, Feng Luo, Stuart Johnson, Richard ...
BROADNETS
2007
IEEE
16 years 1 months ago
Cross-layer optimization made practical
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...
Ajit Warrier, Long Le, Injong Rhee
SPAA
2006
ACM
16 years 23 days ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi