Sciweavers

469 search results - page 1 / 94
» Bounds on the Network Coding Capacity for Wireless Random Ne...
Sort
View
CORR
2007
Springer
137views Education» more  CORR 2007»
13 years 4 months ago
Bounds on the Network Coding Capacity for Wireless Random Networks
— Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic mode...
Salah A. Aly, Vishal Kapoor, Jie Meng, Andreas Kla...
WIOPT
2010
IEEE
13 years 2 months ago
On capacity achieving property of rotational coding for acyclic deterministic wireless networks
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
Mohammad A. (Amir) Khojastepour, Alireza Keshavarz...
MOBIHOC
2007
ACM
14 years 4 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
ICC
2009
IEEE
116views Communications» more  ICC 2009»
13 years 2 months ago
Network Coding Does Not Change the Multicast throughput Order of Wireless Ad Hoc Networks
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...
Shirish S. Karande, Zheng Wang, Hamid R. Sadjadpou...
MOBICOM
2003
ACM
13 years 9 months ago
Throughput capacity of random ad hoc networks with infrastructure support
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
Ulas C. Kozat, Leandros Tassiulas