2058 search results - page 3 / 412 » On Network Coding Capacity - Matroidal Networks and Network ... |
WIOPT
2010
IEEE
13 years 3 months ago
2010
IEEE
—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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
MOBICOM
2005
ACM
13 years 11 months ago
2005
ACM
Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are chara...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The capacity region of a wireless network with n nodes is the set of all simultaneously achievable rates between all possible n2 node pairs. In this paper, we consider the questio...