DocumentCode :
1072445
Title :
Is rate adaptation beneficial for inter-session network coding?
Author :
Kim, Yuchul ; de Veciana, Gustavo
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX
Volume :
27
Issue :
5
fYear :
2009
fDate :
6/1/2009 12:00:00 AM
Firstpage :
635
Lastpage :
646
Abstract :
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 suboptimal 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 ne- twork coding. This can further be increased to a gain of 40% to 120% by replacing pairwise coding with sub-optimal general network coding scheme.
Keywords :
ad hoc networks; encoding; linear programming; NP-hard problem; ad hoc networks; combinatorial optimization problem; intersession network coding; linear programming formulation; optimal coding scheme; optimal joint rate adaptation; relay nodes; wireless mesh; Ad hoc networks; Linear programming; Media Access Protocol; Network coding; Network topology; Relays; Student members; Throughput; Vectors; Wireless networks; ad hoc network; clique partitioning; combinatorial optimization; mesh network; network coding; rate adaptation; relay;
fLanguage :
English
Journal_Title :
Selected Areas in Communications, IEEE Journal on
Publisher :
ieee
ISSN :
0733-8716
Type :
jour
DOI :
10.1109/JSAC.2009.090606
Filename :
5072351
Link To Document :
بازگشت