On network coding in wireless ad-hoc networks

Authors:
Jingyao Zhang;Pingyi Fan
Affiliations:
Department of Electronic Engineering, Tsinghua University, Beijing, China.;Department of Electronic Engineering, Tsinghua University, Beijing, China
Venue:
International Journal of Ad Hoc and Ubiquitous Computing
Year:
2007

Citing 8
Cited 0

Topological Characteristics of Random Multihop Wireless Networks

ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
The encoding complexity of network coding

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Maximum flow and network capacity of network coding for ad-hoc networks

IEEE Transactions on Wireless Communications
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
On the capacity of network coding for random networks

IEEE Transactions on Information Theory
Information flow decomposition for network coding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network coding has been shown to be an effective way to achieve the maximum flow capacity of network. In this work, we will study this technique on wireless Ad-Hoc networks. To reduce the cost and complexity, we propose a modified Ford-Fulkerson algorithm to obtain the maximum flow and encoding nodes in a network. We also find a Conflict Phenomenon in undirected networks that cannot be solved by network coding. Furthermore, we will show that the maximum flow value from a source to a destination is approximately Poisson distributed, and the number of encoding nodes is close to geometric distribution.