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 among 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 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).
Highlights
The design and analysis of wireless cooperative transmission protocols have gained significant recent attention to improve diversity over lossy and fading channels
We present the results and observations of our simulation experiments to determine how our proposed cooperative protocols based on Network coding (NC) reduce the probability that all N1+ N2+, ∙∙∙ + NM are not successfully decoded, Pe+ at D node,with no extra transmitted packets compared to the benchmark protocol, where q, and p are the probability of packet loss in the channels between one user and another, and between the users and D respectively
Our aim is to find how NC helps improving probability of error (PER) with no extra transmitted packets compared to benchmark protocol, beside to the benefits to compare all protocols with each others to understand their behaviour, taking into consideration the saving in transmitted packets (2M or 3M) and in the need for Automatic Repeat Requests (ARQ), which justifies the saving in data rate
Summary
The design and analysis of wireless cooperative transmission protocols have gained significant recent attention to improve diversity over lossy and fading channels. In [4], a cooperative network coding (NC) system for a sensor cluster is proposed to save significant amount of the transmission power, by decreasing the Automatic Repeat Requests (ARQ) for a small number of users over the physical layer over AWGN, unlike this work where NC is proposed for a large number of users over erasure channel. In [10], a comprehensive performance analysis of node cooperation is shown over the physical layer which shows that NC is a practical system with encouraging performance and it gives the capacity theoretical limits for some NC protocols
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
