Separating distributed source coding from network coding
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Adaptive network coding and scheduling for maximizing throughput in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Foundations and Trends® in Networking
On network coding in wireless ad-hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
A batched network coding scheme for wireless networks
Wireless Networks
The capacity of wireless ad hoc networks with multi-packet reception
IEEE Transactions on Communications
SER performance analysis for physical layer network coding over AWGN channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On the security performance of physical-layer network coding
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
| Hi-index | 754.84 |
We study the maximum flow possible between a single-source and multiple terminals in a weighted random graph (modeling a wired network) and a weighted random geometric graph (modeling an ad-hoc wireless network) using network coding. For the weighted random graph model, we show that the network coding capacity concentrates around the expected number of nearest neighbors of the source and the terminals. Specifically, for a network with a single source, l terminals, and n relay nodes such that the link capacities between any two nodes is independent and identically distributed (i.i.d.) ∼X, the maximum flow between the source and the terminals is approximately nE[X] with high probability. For the weighted random geometric graph model where two nodes are connected if they are within a certain distance of each other we show that with high probability the network coding capacity is greater than or equal to the expected number of nearest neighbors of the node with the least coverage area.