Sciweavers

185 search results - page 20 / 37
» On the Capacity of Non-Coherent Network Coding
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
On achieving optimal throughput with network coding
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...
Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau
SENSYS
2003
ACM
14 years 19 days ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
ISCC
2003
IEEE
14 years 20 days ago
Throughput Achievable with No Relaying in a Mobile Interference Network
— We consider a network of n sender/receiver pairs, placed randomly in a region of unit area. Network capacity, or maximum throughput, is defined as the highest rate that can be...
Elif Uysal-Biyikoglu, Abtin Keshavarzian
INFOCOM
2010
IEEE
13 years 5 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
CORR
2007
Springer
149views Education» more  CORR 2007»
13 years 7 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis