Maximum Multiflow in Wireless Network Coding

Details Maximum Multiflow in Wireless Network Coding Maximum Multiflow in Wireless Network Coding

2012-02-14

arxiv.org/abs/1202.2963v1

Computer Science

Information Theory

5 pages, 3 figures, submitted to ISIT 2012

Scientific paper

In a multihop wireless network, wireless interference is crucial to the maximum multiflow (MMF) problem, which studies the maximum throughput between multiple pairs of sources and sinks. In this paper, we observe that network coding could help to decrease the impacts of wireless interference, and propose a framework to study the MMF problem for multihop wireless networks with network coding. Firstly, a network model is set up to describe the new conflict relations modified by network coding. Then, we formulate a linear programming problem to compute the maximum throughput and show its superiority over one in networks without coding. Finally, the MMF problem in wireless network coding is shown to be NP-hard and a polynomial approximation algorithm is proposed.

Affiliated with

Also associated with

No associations

Rating

Maximum Multiflow in Wireless Network Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum Multiflow in Wireless Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum Multiflow in Wireless Network Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-88804