Improved Combinatorial Algorithms for Wireless Information Flow

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 2 figures, presented at Allerton 2010

Scientific paper

The work of Avestimehr et al. '07 has recently proposed a deterministic model for wireless networks and characterized the unicast capacity C of such networks as the minimum rank of the adjacency matrices describing all possible source-destination cuts. Amaudruz & Fragouli first proposed a polynomial-time algorithm for finding the unicast capacity of a linear deterministic wireless network in their 2009 paper. In this work, we improve upon Amaudruz & Fragouli's work and further reduce the computational complexity of the algorithm by fully exploring the useful combinatorial features intrinsic in the problem. Our improvement applies generally with any size of finite fields associated with the channel model. Comparing with other algorithms on solving the same problem, our improved algorithm is very competitive in terms of complexity.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Improved Combinatorial Algorithms for Wireless Information Flow 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 Improved Combinatorial Algorithms for Wireless Information Flow, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Combinatorial Algorithms for Wireless Information Flow will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-508908

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.