TY - GEN
T1 - On the coded packet relay network in the presence of Neighbors
T2 - 2014 1st IEEE International Conference on Communications, ICC 2014
AU - Khamfroush, Hana
AU - Pahlevani, Peyman
AU - Lucani, Daniel E.
AU - Hundeboll, Martin
AU - Fitzek, Frank H.P.
PY - 2014
Y1 - 2014
N2 - This paper studies the problem of optimal use of a relay for reducing the transmission time of data packets from a source to a destination using network coding. More importantly, we address an effect that is typically overlooked in previous studies: the presence of active transmitting nodes in the neighborhood of such devices, which is typical in wireless mesh networks. We show that in systems with a fair medium access control mechanism (MAC), the use of a relay in a crowded medium brings forth considerable and unforeseen improvements, including up to 3.5x gains in terms of throughput compared to using only the direct link in some of our examples, and a considerable extension of the operating region where using a relay is beneficial. The problem is formulated as a Markov Decision Process (MDP) and numerical results are provided comparing simple, close-to-optimal heuristics to the optimal scheme.
AB - This paper studies the problem of optimal use of a relay for reducing the transmission time of data packets from a source to a destination using network coding. More importantly, we address an effect that is typically overlooked in previous studies: the presence of active transmitting nodes in the neighborhood of such devices, which is typical in wireless mesh networks. We show that in systems with a fair medium access control mechanism (MAC), the use of a relay in a crowded medium brings forth considerable and unforeseen improvements, including up to 3.5x gains in terms of throughput compared to using only the direct link in some of our examples, and a considerable extension of the operating region where using a relay is beneficial. The problem is formulated as a Markov Decision Process (MDP) and numerical results are provided comparing simple, close-to-optimal heuristics to the optimal scheme.
UR - http://www.scopus.com/inward/record.url?scp=84907001184&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84907001184&partnerID=8YFLogxK
U2 - 10.1109/ICC.2014.6883605
DO - 10.1109/ICC.2014.6883605
M3 - Conference contribution
AN - SCOPUS:84907001184
SN - 9781479920037
T3 - 2014 IEEE International Conference on Communications, ICC 2014
SP - 1928
EP - 1933
BT - 2014 IEEE International Conference on Communications, ICC 2014
Y2 - 10 June 2014 through 14 June 2014
ER -