The full text of this article:

On network coding in wireless ad-hoc networks
by Jingyao Zhang, Pingyi Fan
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 2, No. 3, 2007
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.

is only available to individual subscribers or to users at subscribing institutions.

Pay per view: If you are not a Subscriber and you just want to read the full contents of this article, please click here to purchase online access to the full-text of this article. Please allow 3 days + mailing time. Current price for article is Thirty Euros (€30)

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC) journal, that have been redirected here, please check if you have a registered username/password subscription with Inderscience. If that is the case, please Login:

If you are not yet a Subscriber to International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC) journal, you can subscribe by following a few simple and quick steps. A subscription will give you complete access to all articles in the current issue, as well as to all articles in the previous three years, where applicable. Click here to subscribe.

Should you experience further difficulties or have any enquiries, please email subs@inderscience.com