Network coding cooperation performance analysis in wireless network over a lossy channel, M users and a destination scenario

Tools

El-Hihi, Mohamed and Attar, Hani and Solyman, Ahmed and Stankovic, Lina (2016) Network coding cooperation performance analysis in wireless network over a lossy channel, M users and a destination scenario. Communications and Network, 8 (4). pp. 257-280. ISSN 1947-3826 (https://doi.org/10.4236/cn.2016.84023)

[thumbnail of El-Hihi-etal-CN2016-Network-coding-cooperation-performance-analysis-in-wireless]
Preview
 Text. Filename: El_Hihi_etal_CN2016_Network_coding_cooperation_performance_analysis_in_wireless.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (3MB)| Preview

Abstract

Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels; typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic amon g users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k < 2M unique linear equations, accounting for the fact that the remaining packets will be lost in the network and there are two transmission stages. Simulation results show the behaviour for two and three transmission stages. Our results show that applying NC protocols in two or three stages decreases the traffic significantly, beside the fact that the proposed protocols enable the system to retrieve the lost packets rather than asking for ARQ, resulting in improved data flow, and less power consumption. In fact, in some protocols the ARQ dropped from the rate 10-1 to 10-4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M − 1) to just M packets, resulting to 2 M packets instead 2 (M2 −  1) when three stages of transmission system are used instead of one stage (two cooperative stages).

ORCID iDs

El-Hihi, Mohamed, Attar, Hani, Solyman, Ahmed and Stankovic, Lina ORCID logoORCID: https://orcid.org/0000-0002-8112-1976;
CORE (COnnecting REpositories)