On network coding in wireless ad-hoc networks. (13th February 2007)

• Record Type: Journal Article
• Authors: Zhang, Jingyao; Fan, Pingyi
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 2:Number 3(2007)
• Page Start: 140
• Page End: 148
• Publication Date: 2007-02-13
• Subjects: network coding -- maximum-flow minimum-cut -- Ford-Fulkerson algorithm -- encoding nodes -- multicast networks -- ad-hoc networks -- wireless networks -- random graph -- network flow capacity; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

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.