Randomized algorithms
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Network coding: does the model need tuning?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fundamentals of wireless communication
Fundamentals of wireless communication
Information Theory and Network Coding
Information Theory and Network Coding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Capacity of wireless erasure networks
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Randomized network coding (RNC) has greatly reduced complexity of implementing network coding in large-scale, heterogeneous networks. Two tradeoffs are studied here that further reduce the overhead in applying RNC. The first examines how RNC performance varies with a node's randomizing capabilities. Specifically, a limited randomized network coding (LRNC) scheme - in which intermediate nodes perform randomized encoding based on only limited number of random coefficients - is proposed and its performance bounds are analyzed. L-RNC is applicable to networks in which nodes have either limited computation/storage capacity or have ambiguity about downstream edge connectivity (e.g., as in ad hoc sensor networks). A second tradeoff studied here examines the relationship between reliability and capacity gains of RNC, i.e., how the outage probability of RNC relates to the transmission rate at source node. This tradeoff reveals that significant reductions in outage probability are possible when the source deliberately transmit at (only slightly) below network capacity. It therefore provides an effective alternative to improve RNC feasibility when the size of finite field is fixed.