Integer and combinatorial optimization
Integer and combinatorial optimization
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Practical network coding in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the queueing behavior of inter-flow asynchronous network coding
Computer Communications
Coding- and interference-aware routing protocol in wireless networks
Computer Communications
| Hi-index | 0.00 |
This paper considers the interplay between rate adaptation and inter-session network coding gains in wireless mesh or ad hoc networks. Inter-session network coding opportunities at relay nodes depend on packets being overheard by surrounding nodes - the more packets nodes overhear, the more opportunities relays have to combine packets, resulting in a potential increase in network throughput. Thus, by adapting its transmission rate, a node can increase the range over which its packets are overheard, enabling additional opportunities for coding and increased overall throughput. This paper considers inter-session coding, restricted to a single relay (bottleneck) node, or star network topology. Even for such simple topologies the optimal joint rate adaptation and network coding policy is known to be NP-hard. Optimal rate vector selection is a combinatorial optimization problem, which is NP-hard, and finding optimal coding scheme turns out to be a clique partitioning problem which is also NP-hard. So, we provide heuristics to find a sub-optimal rate vector and coding scheme. Additionally, we provide a linear programming formulation for network coding when only pairwise intersession coding is allowed. We evaluate the averaged throughput in two different scenarios, in which relays have different access opportunities, giving some intuition on the impact of rate adaptation in lightly and heavily loaded systems. The gains of joint rate adaptation and network coding are marginal when the relay has a higher access opportunity than other nodes, or when the MAC operates ideally it ranges from 9% to 19% as compared to a network without network coding and 4% over a network using regular network coding. While, when the relay has equal access opportunity as other source nodes, which is more typical of todays MAC protocols under heavy loads, the gain ranges from 40% to 62% as compared to the standard relaying case and is upto around 20% as compared to a network with regular pairwise network coding. This can further be increased to a gain of 40% to 120% by replacing pairwise coding with sub-optimal general network coding scheme.